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


test/bntest.c:1910:5: Call
1908.               || !TEST_ptr(r = BN_new()))
1909.           goto err;
1910.       BN_zero(zero);
            ^
1911.   
1912.       if (!TEST_true(BN_mod_exp(r, a, zero, BN_value_one(), NULL))

crypto/bn/bn_lib.c:405:15: Assignment
  403.       a->neg = 0;
  404.       a->d[0] = w;
  405.       a->top = (w ? 1 : 0);
                       ^
  406.       bn_check_top(a);
  407.       return 1;

crypto/bn/bn_lib.c:405:5: Assignment
  403.       a->neg = 0;
  404.       a->d[0] = w;
  405.       a->top = (w ? 1 : 0);
             ^
  406.       bn_check_top(a);
  407.       return 1;

test/bntest.c:1912:10: Call
1910.       BN_zero(zero);
1911.   
1912.       if (!TEST_true(BN_mod_exp(r, a, zero, BN_value_one(), NULL))
                 ^
1913.               || !TEST_BN_eq_zero(r)
1914.               || !TEST_true(BN_mod_exp_mont(r, a, zero, BN_value_one(),

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

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

crypto/bn/bn_exp.c:291:1: Parameter `a->top`
    289.   }
    290.   
    291. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    292.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    293.   {

crypto/bn/bn_exp.c:303:16: Call
    301.   
    302.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
    303.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                          ^
    304.       }
    305.   

crypto/bn/bn_exp.c:591:1: Parameter `a->top`
      589.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
      590.    */
      591. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      592.                                 const BIGNUM *m, BN_CTX *ctx,
      593.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:744:14: Call
      742.       /* prepare a^1 in Montgomery domain */
      743.       if (a->neg || BN_ucmp(a, m) >= 0) {
      744.           if (!BN_mod(&am, a, m, ctx))
                          ^
      745.               goto err;
      746.           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:207:11: Call
        205.       sdiv->neg = 0;
        206.       norm_shift += BN_BITS2;
        207.       if (!(BN_lshift(snum, num, norm_shift)))
                         ^
        208.           goto err;
        209.       snum->neg = 0;

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

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

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

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

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

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

crypto/bn/bn_lib.c:951:1: Parameter `*a->d`
            949.   }
            950.   
            951. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
            952.   {
            953.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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

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