test/bntest.c:1924: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 22 steps of the trace


test/bntest.c:1922:5: Call
1920.               || !TEST_ptr(r = BN_new()))
1921.           goto err;
1922.       BN_zero(zero);
            ^
1923.   
1924.       if (!TEST_true(BN_mod_exp(r, a, zero, BN_value_one(), NULL))

crypto/bn/bn_lib.c:395:1: Parameter `*a->d`
  393.   }
  394.   
  395. > int BN_set_word(BIGNUM *a, BN_ULONG w)
  396.   {
  397.       bn_check_top(a);

crypto/bn/bn_lib.c:398:9: Call
  396.   {
  397.       bn_check_top(a);
  398.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                 ^
  399.           return (0);
  400.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
    658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
    659.   
    660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
    661.   {
    662.       if (bits > (INT_MAX - BN_BITS2 + 1))

test/bntest.c:1924:10: Call
1922.       BN_zero(zero);
1923.   
1924.       if (!TEST_true(BN_mod_exp(r, a, zero, BN_value_one(), NULL))
                 ^
1925.               || !TEST_BN_eq_zero(r)
1926.               || !TEST_true(BN_mod_exp_mont(r, a, zero, BN_value_one(),

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

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:294:1: Parameter `*a->d`
    292.   }
    293.   
    294. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    295.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    296.   {

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

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

crypto/bn/bn_exp.c:751:17: Call
      749.           if (!BN_to_montgomery(&am, &am, mont, ctx))
      750.               goto err;
      751.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                             ^
      752.           goto err;
      753.   

crypto/bn/bn_lib.c:877:1: Parameter `*a->d`
        875.   }
        876.   
        877. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
        878.                        BN_CTX *ctx)
        879.   {

crypto/bn/bn_lib.c:880:12: Call
        878.                        BN_CTX *ctx)
        879.   {
        880.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                          ^
        881.   }
        882.   

crypto/bn/bn_mont.c:26:1: Parameter `*a->d`
          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.               goto err;
          55.       } else {
          56.           if (!BN_mul(tmp, a, b, ctx))
                             ^
          57.               goto err;
          58.       }

crypto/bn/bn_mul.c:495:1: Parameter `*a->d`
            493.   #endif                          /* BN_RECURSION */
            494.   
            495. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
            496.   {
            497.       int ret = 0;

crypto/bn/bn_mul.c:575:17: Call
            573.                   if (bn_wexpand(rr, k * 4) == NULL)
            574.                       goto err;
            575.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                                   ^
            576.                                         j, al - j, bl - j, t->d);
            577.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:320:1: Parameter `*a`
              318.    */
              319.   /* tnX may not be negative but less than n */
              320. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
              321.                              int tna, int tnb, BN_ULONG *t)
              322.   {

crypto/bn/bn_mul.c:328:9: Call
              326.   
              327.       if (n < 8) {
              328.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                             ^
              329.           return;
              330.       }

crypto/bn/bn_mul.c:650:1: <Length trace>
648.   }
649.   
650. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
651.   {
652.       BN_ULONG *rr;

crypto/bn/bn_mul.c:650:1: Parameter `*b`
                648.   }
                649.   
                650. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
                651.   {
                652.       BN_ULONG *rr;

crypto/bn/bn_mul.c:685:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_exp` 
                683.           if (--nb <= 0)
                684.               return;
                685.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                        ^
                686.           rr += 4;
                687.           r += 4;
