crypto/bn/bn_prime.c:223: error: INTEGER_OVERFLOW_L2
  (0 - [0, max(1, `a->top`)]):unsigned64 by call to `witness`.
Showing all 41 steps of the trace


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));

crypto/bn/bn_prime.c:161:29: 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));

crypto/bn/bn_prime.c:165:10: Call
163.   
164.       /* Check odd and bigger than 1 */
165.       if (!BN_is_odd(a) || BN_cmp(a, BN_value_one()) <= 0)
                ^
166.           return 0;
167.   

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_prime.c:165:26: Call
163.   
164.       /* Check odd and bigger than 1 */
165.       if (!BN_is_odd(a) || BN_cmp(a, BN_value_one()) <= 0)
                                ^
166.           return 0;
167.   

crypto/bn/bn_lib.c:542:1: Parameter `a->top`
  540.   }
  541.   
  542. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  543.   {
  544.       int i;

crypto/bn/bn_prime.c:198:10: Call
196.   
197.       /* compute A1 := a - 1 */
198.       if (!BN_copy(A1, a) || !BN_sub_word(A1, 1))
                ^
199.           goto err;
200.       /* compute A3 := a - 3 */

crypto/bn/bn_lib.c:285:1: Parameter `b->top`
  283.   }
  284.   
  285. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  286.   {
  287.       bn_check_top(b);

crypto/bn/bn_prime.c:201:10: Call
199.           goto err;
200.       /* compute A3 := a - 3 */
201.       if (!BN_copy(A3, a) || !BN_sub_word(A3, 3))
                ^
202.           goto err;
203.   

crypto/bn/bn_lib.c:285:1: Parameter `b->top`
  283.   }
  284.   
  285. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  286.   {
  287.       bn_check_top(b);

crypto/bn/bn_prime.c:215:10: Call
213.       if (mont == NULL)
214.           goto err;
215.       if (!BN_MONT_CTX_set(mont, a, ctx))
                ^
216.           goto err;
217.   

crypto/bn/bn_mont.c:238:9: Call
  236.       BIGNUM *Ri, *R;
  237.   
  238.       if (BN_is_zero(mod))
                 ^
  239.           return 0;
  240.   

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;

crypto/bn/bn_prime.c:223:13: Call
221.               goto err;
222.   
223.           j = witness(check, a, A1, A1_odd, k, ctx, mont);
                   ^
224.           if (j == -1)
225.               goto err;

crypto/bn/bn_prime.c:245:1: Parameter `a->top`
  243.   }
  244.   
  245. > static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
  246.                      const BIGNUM *a1_odd, int k, BN_CTX *ctx,
  247.                      BN_MONT_CTX *mont)

crypto/bn/bn_prime.c:249:10: Call
  247.                      BN_MONT_CTX *mont)
  248.   {
  249.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                  ^
  250.           return -1;
  251.       if (BN_is_one(w))

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, a->top)]):unsigned64 by call to `witness` 
            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;
