test/bntest.c:1078: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_exp_mont_consttime`.
Showing all 16 steps of the trace


test/bntest.c:1075:5: Call
1073.       e = BN_new();
1074.   
1075.       BN_one(a);
            ^
1076.       BN_one(b);
1077.       BN_zero(c);

crypto/bn/bn_lib.c:463:1: Parameter `a->top`
  461.   }
  462.   
  463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
  464.   {
  465.       bn_check_top(a);

test/bntest.c:1078:9: Call
1076.       BN_one(b);
1077.       BN_zero(c);
1078.       if (BN_mod_exp_mont_consttime(d, a, b, c, ctx, NULL)) {
                ^
1079.           fprintf(stderr, "BN_mod_exp_mont_consttime with zero modulus "
1080.                   "succeeded\n");

crypto/bn/bn_exp.c:601:1: Parameter `a->top`
  599.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
  600.    */
  601. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
  602.                                 const BIGNUM *m, BN_CTX *ctx,
  603.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:754:14: Call
  752.       /* prepare a^1 in Montgomery domain */
  753.       if (a->neg || BN_ucmp(a, m) >= 0) {
  754.           if (!BN_mod(&am, a, m, ctx))
                      ^
  755.               goto err;
  756.           if (!BN_to_montgomery(&am, &am, mont, ctx))

crypto/bn/bn_div.c:140:1: Parameter `num->top`
    138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
    139.    */
    140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
    141.              BN_CTX *ctx)
    142.   {

crypto/bn/bn_div.c:210:11: Call
    208.       sdiv->neg = 0;
    209.       norm_shift += BN_BITS2;
    210.       if (!(BN_lshift(snum, num, norm_shift)))
                     ^
    211.           goto err;
    212.       snum->neg = 0;

crypto/bn/bn_shift.c:81:1: <Offset trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `n`
      79.   }
      80.   
      81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      82.   {
      83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:96:5: Assignment
      94.   
      95.       r->neg = a->neg;
      96.       nw = n / BN_BITS2;
                ^
      97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
      98.           return (0);

crypto/bn/bn_shift.c:81:1: <Length trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `*r->d`
      79.   }
      80.   
      81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      82.   {
      83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:9: Call
      95.       r->neg = a->neg;
      96.       nw = n / BN_BITS2;
      97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                     ^
      98.           return (0);
      99.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:1016:1: Parameter `*a->d`
        1014.   }
        1015.   
        1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        1017.   {
        1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:102:5: Assignment
      100.       rb = BN_BITS2 - lb;
      101.       f = a->d;
      102.       t = r->d;
                 ^
      103.       t[a->top + nw] = 0;
      104.       if (lb == 0)

crypto/bn/bn_shift.c:110:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_exp_mont_consttime` 
      108.           for (i = a->top - 1; i >= 0; i--) {
      109.               l = f[i];
      110.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                         ^
      111.               t[nw + i] = (l << lb) & BN_MASK2;
      112.           }
