apps/s_client.c:287: error: INTEGER_OVERFLOW_L2
  (0 - [0, max(1, `N->top`)]):unsigned64 by call to `BN_mod_exp`.
Showing all 37 steps of the trace


apps/s_client.c:274:1: Parameter `N->top`
272.   # define SRP_NUMBER_ITERATIONS_FOR_PRIME 64
273.   
274. > static int srp_Verify_N_and_g(const BIGNUM *N, const BIGNUM *g)
275.   {
276.       BN_CTX *bn_ctx = BN_CTX_new();

apps/s_client.c:280:53: Call
278.       BIGNUM *r = BN_new();
279.       int ret =
280.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
                                                           ^
281.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
282.           p != NULL && BN_rshift1(p, N) &&

crypto/bn/bn_lib.c:860:1: Parameter `a->top`
  858.   }
  859.   
  860. > int BN_is_odd(const BIGNUM *a)
  861.   {
  862.       return (a->top > 0) && (a->d[0] & 1);

apps/s_client.c:281:9: Call
279.       int ret =
280.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
281.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
               ^
282.           p != NULL && BN_rshift1(p, N) &&
283.           /* p = (N-1)/2 */

crypto/bn/bn_prime.c:145:1: Parameter `a->top`
  143.   }
  144.   
  145. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  146.                      BN_GENCB *cb)
  147.   {

crypto/bn/bn_prime.c:148:12: Call
  146.                      BN_GENCB *cb)
  147.   {
  148.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  149.   }
  150.   

crypto/bn/bn_prime.c:151:1: Parameter `a->top`
    149.   }
    150.   
    151. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    152.                               int do_trial_division, BN_GENCB *cb)
    153.   {

crypto/bn/bn_prime.c:161:9: Call
    159.   
    160.       /* Take care of the really small primes 2 & 3 */
    161.       if (BN_is_word(a, 2) || BN_is_word(a, 3))
                   ^
    162.           return 1;
    163.   

crypto/bn/bn_lib.c:855:1: Parameter `a->top`
      853.   }
      854.   
      855. > int BN_is_word(const BIGNUM *a, const BN_ULONG w)
      856.   {
      857.       return BN_abs_is_word(a, w) && (!w || !a->neg);

crypto/bn/bn_lib.c:857:12: Call
      855.   int BN_is_word(const BIGNUM *a, const BN_ULONG w)
      856.   {
      857.       return BN_abs_is_word(a, w) && (!w || !a->neg);
                        ^
      858.   }
      859.   

crypto/bn/bn_lib.c:840:1: Parameter `a->top`
        838.   }
        839.   
        840. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
        841.   {
        842.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

apps/s_client.c:282:22: Call
280.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
281.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
282.           p != NULL && BN_rshift1(p, N) &&
                            ^
283.           /* p = (N-1)/2 */
284.           BN_is_prime_ex(p, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&

crypto/bn/bn_shift.c:54:9: Call
  52.       bn_check_top(a);
  53.   
  54.       if (BN_is_zero(a)) {
                ^
  55.           BN_zero(r);
  56.           return 1;

crypto/bn/bn_lib.c:845:1: Parameter `a->top`
    843.   }
    844.   
    845. > int BN_is_zero(const BIGNUM *a)
    846.   {
    847.       return a->top == 0;

apps/s_client.c:287:9: Call
285.           r != NULL &&
286.           /* verify g^((N-1)/2) == -1 (mod N) */
287.           BN_mod_exp(r, g, p, N, bn_ctx) &&
               ^
288.           BN_add_word(r, 1) && BN_cmp(r, N) == 0;
289.   

crypto/bn/bn_exp.c:89:1: Parameter `m->top`
  87.   }
  88.   
  89. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  90.                  BN_CTX *ctx)
  91.   {

crypto/bn/bn_exp.c:134:9: Call
  132.   
  133.   #ifdef MONT_MUL_MOD
  134.       if (BN_is_odd(m)) {
                 ^
  135.   # ifdef MONT_EXP_WORD
  136.           if (a->top == 1 && !a->neg

crypto/bn/bn_lib.c:860:1: Parameter `a->top`
    858.   }
    859.   
    860. > int BN_is_odd(const BIGNUM *a)
    861.   {
    862.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_exp.c:144:19: Call
  142.           } else
  143.   # endif
  144.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  145.       } else
  146.   #endif

crypto/bn/bn_exp.c:296:1: Parameter `m->top`
    294.   }
    295.   
    296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    298.   {

crypto/bn/bn_exp.c:310:16: Call
    308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
    309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
    310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                          ^
    311.       }
    312.   

crypto/bn/bn_exp.c:745:14: Assignment
      743.           /* 2^(top*BN_BITS2) - m */
      744.           tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
      745.           for (i = 1; i < top; i++)
                          ^
      746.               tmp.d[i] = (~m->d[i]) & BN_MASK2;
      747.           tmp.top = top;

crypto/bn/bn_exp.c:1062:14: Call
      1060.           bits -= window0;
      1061.           wvalue = bn_get_bits(p, bits) & wmask;
      1062.           if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
                           ^
      1063.                                               window))
      1064.               goto err;

crypto/bn/bn_exp.c:520:1: Parameter `top`
        518.   }
        519.   
        520. > static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
        521.                                             unsigned char *buf, int idx,
        522.                                             int window)

crypto/bn/bn_exp.c:577:5: Assignment
        575.       }
        576.   
        577.       b->top = top;
                   ^
        578.       bn_correct_top(b);
        579.       return 1;

crypto/bn/bn_exp.c:578:5: Call
        576.   
        577.       b->top = top;
        578.       bn_correct_top(b);
                   ^
        579.       return 1;
        580.   }

crypto/bn/bn_lib.c:946:1: Parameter `a->top`
          944.   }
          945.   
          946. > void bn_correct_top(BIGNUM *a)
          947.   {
          948.       BN_ULONG *ftl;

crypto/bn/bn_exp.c:1075:22: Call
      1073.               /* Square the result window-size times */
      1074.               for (i = 0; i < window; i++)
      1075.                   if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
                                   ^
      1076.                       goto err;
      1077.   

crypto/bn/bn_mont.c:26:1: Parameter `a->top`
        24.   #endif
        25.   
        26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
        28.   {

crypto/bn/bn_mont.c:53:14: Call
        51.       bn_check_top(tmp);
        52.       if (a == b) {
        53.           if (!BN_sqr(tmp, a, ctx))
                           ^
        54.               goto err;
        55.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `a->top`
          15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
          16.    */
          17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
          18.   {
          19.       int max, al;

crypto/bn/bn_sqr.c:25:5: Assignment
          23.       bn_check_top(a);
          24.   
          25.       al = a->top;
                    ^
          26.       if (al <= 0) {
          27.           r->top = 0;

crypto/bn/bn_sqr.c:64:17: Call
          62.               int j, k;
          63.   
          64.               j = BN_num_bits_word((BN_ULONG)al);
                                ^
          65.               j = 1 << (j - 1);
          66.               k = j + j;

crypto/bn/bn_lib.c:89:1: <RHS trace>
87.   }
88.   
89. > int BN_num_bits_word(BN_ULONG l)
90.   {
91.       BN_ULONG x, mask;

crypto/bn/bn_lib.c:89:1: Parameter `l`
            87.   }
            88.   
            89. > int BN_num_bits_word(BN_ULONG l)
            90.   {
            91.       BN_ULONG x, mask;

crypto/bn/bn_lib.c:95:5: Assignment
            93.   
            94.   #if BN_BITS2 > 32
            95.       x = l >> 32;
                      ^
            96.       mask = (0 - x) & BN_MASK2;
            97.       mask = (0 - (mask >> (BN_BITS2 - 1)));

crypto/bn/bn_lib.c:96:5: Binary operation: (0 - [0, max(1, N->top)]):unsigned64 by call to `BN_mod_exp` 
            94.   #if BN_BITS2 > 32
            95.       x = l >> 32;
            96.       mask = (0 - x) & BN_MASK2;
                      ^
            97.       mask = (0 - (mask >> (BN_BITS2 - 1)));
            98.       bits += 32 & mask;
