test/exptest.c:161: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp_mont`.
Showing all 23 steps of the trace


test/exptest.c:159:10: Call
157.       BN_rand(m, NUM_BITS + c, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ODD);
158.   
159.       if (!TEST_true(BN_mod(a, a, m, ctx))
                ^
160.           || !TEST_true(BN_mod(b, b, m, ctx))
161.           || !TEST_true(BN_mod_exp_mont(r_mont, a, b, m, ctx, NULL))

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

test/exptest.c:161:13: Call
159.       if (!TEST_true(BN_mod(a, a, m, ctx))
160.           || !TEST_true(BN_mod(b, b, m, ctx))
161.           || !TEST_true(BN_mod_exp_mont(r_mont, a, b, m, ctx, NULL))
                   ^
162.           || !TEST_true(BN_mod_exp_recp(r_recp, a, b, m, ctx))
163.           || !TEST_true(BN_mod_exp_simple(r_simple, a, b, m, ctx))

crypto/bn/bn_exp.c:296:1: Parameter `a->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:596:1: Parameter `a->top`
    594.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
    595.    */
    596. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    597.                                 const BIGNUM *m, BN_CTX *ctx,
    598.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:759:17: Call
    757.           if (!BN_to_montgomery(&am, &am, mont, ctx))
    758.               goto err;
    759.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                           ^
    760.           goto err;
    761.   

crypto/bn/bn_lib.c:871:1: Parameter `a->top`
      869.   }
      870.   
      871. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
      872.                        BN_CTX *ctx)
      873.   {

crypto/bn/bn_lib.c:874:12: Call
      872.                        BN_CTX *ctx)
      873.   {
      874.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                        ^
      875.   }
      876.   

crypto/bn/bn_mont.c:26:1: Parameter `b->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:56:14: Call
        54.       bn_check_top(tmp);
        55.       if (a == b) {
        56.           if (!BN_sqr(tmp, a, ctx))
                           ^
        57.               goto err;
        58.       } 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:74:17: Call
          72.                   if (bn_wexpand(tmp, max) == NULL)
          73.                       goto err;
          74.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                                ^
          75.               }
          76.           }

crypto/bn/bn_sqr.c:99:1: <Offset trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `n`
            97.   
            98.   /* tmp must have 2*n words */
            99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
            100.   {
            101.       int i, j, max;

crypto/bn/bn_sqr.c:110:5: Assignment
            108.       rp[0] = rp[max - 1] = 0;
            109.       rp++;
            110.       j = n;
                       ^
            111.   
            112.       if (--j > 0) {

crypto/bn/bn_sqr.c:112:9: Assignment
            110.       j = n;
            111.   
            112.       if (--j > 0) {
                           ^
            113.           ap++;
            114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:99:1: <Length trace>
97.   
98.   /* tmp must have 2*n words */
99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
100.   {
101.       int i, j, max;

crypto/bn/bn_sqr.c:99:1: Parameter `*r`
            97.   
            98.   /* tmp must have 2*n words */
            99. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
            100.   {
            101.       int i, j, max;

crypto/bn/bn_sqr.c:107:5: Assignment
            105.       max = n * 2;
            106.       ap = a;
            107.       rp = r;
                       ^
            108.       rp[0] = rp[max - 1] = 0;
            109.       rp++;

crypto/bn/bn_sqr.c:109:5: Assignment
            107.       rp = r;
            108.       rp[0] = rp[max - 1] = 0;
            109.       rp++;
                       ^
            110.       j = n;
            111.   

crypto/bn/bn_sqr.c:114:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp_mont` 
            112.       if (--j > 0) {
            113.           ap++;
            114.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                           ^
            115.           rp += 2;
            116.       }
