crypto/bn/bn_exp.c:1340: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_mod_mul`.
Showing all 15 steps of the trace


crypto/bn/bn_exp.c:1267:9: Call
1265.   
1266.       BN_CTX_start(ctx);
1267.       d = BN_CTX_get(ctx);
                ^
1268.       val[0] = BN_CTX_get(ctx);
1269.       if (!d || !val[0])

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       ctx->used++;
  231.       CTXDBG_RET(ctx, ret);

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

crypto/bn/bn_lib.c:396:9: Call
    394.   {
    395.       bn_check_top(a);
    396.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    397.           return (0);
    398.       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))

crypto/bn/bn_exp.c:1340:14: Call
1338.   
1339.           /* wvalue will be an odd number < 2^window */
1340.           if (!BN_mod_mul(r, r, val[wvalue >> 1], m, ctx))
                     ^
1341.               goto err;
1342.   

crypto/bn/bn_mod.c:73:1: Parameter `*b->d`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/bn/bn_mod.c:90:14: Call
  88.               goto err;
  89.       } else {
  90.           if (!BN_mul(t, a, b, ctx))
                     ^
  91.               goto err;
  92.       }

crypto/bn/bn_mul.c:495:1: Parameter `*b->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 `*b`
      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:671:40: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_mod_mul` 
        669.           return;
        670.       } else
        671.           rr[0] = bn_mul_words(r, a, na, b[0]);
                                                      ^
        672.   
        673.       for (;;) {
