crypto/bn/bn_exp.c:1322: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_mul`.
Showing all 17 steps of the trace


crypto/bn/bn_exp.c:1307:9: Call
1305.   
1306.       BN_CTX_start(ctx);
1307.       d = BN_CTX_get(ctx);
                ^
1308.       val[0] = BN_CTX_get(ctx);
1309.       if (val[0] == NULL)

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       /* clear BN_FLG_CONSTTIME if leaked from previous frames */
  231.       ret->flags &= (~BN_FLG_CONSTTIME);

crypto/bn/bn_lib.c:359:1: Parameter `*a->d`
    357.   }
    358.   
    359. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    360.   {
    361.       bn_check_top(a);

crypto/bn/bn_lib.c:362:9: Call
    360.   {
    361.       bn_check_top(a);
    362.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    363.           return 0;
    364.       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:1322:14: Call
1320.       window = BN_window_bits_for_exponent_size(bits);
1321.       if (window > 1) {
1322.           if (!BN_mod_mul(d, val[0], val[0], m, ctx))
                     ^
1323.               goto err;           /* 2 */
1324.           j = 1 << (window - 1);

crypto/bn/bn_mod.c:193:1: Parameter `*b->d`
  191.   
  192.   /* slow but works */
  193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  194.                  BN_CTX *ctx)
  195.   {

crypto/bn/bn_mod.c:210:14: Call
  208.               goto err;
  209.       } else {
  210.           if (!BN_mul(t, a, b, ctx))
                      ^
  211.               goto err;
  212.       }

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

crypto/bn/bn_mul.c:499:15: Call
    497.   int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    498.   {
    499.       int ret = bn_mul_fixed_top(r, a, b, ctx);
                         ^
    500.   
    501.       bn_correct_top(r);

crypto/bn/bn_mul.c:507:1: Parameter `*b->d`
      505.   }
      506.   
      507. > int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
      508.   {
      509.       int ret = 0;

crypto/bn/bn_mul.c:587:17: Call
      585.                   if (bn_wexpand(rr, k * 4) == NULL)
      586.                       goto err;
      587.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                             ^
      588.                                         j, al - j, bl - j, t->d);
      589.               } else {            /* al <= j || bl <= j */

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

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

crypto/bn/bn_mul.c:622:1: <Length trace>
620.   }
621.   
622. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
623.   {
624.       BN_ULONG *rr;

crypto/bn/bn_mul.c:622:1: Parameter `*b`
          620.   }
          621.   
          622. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
          623.   {
          624.       BN_ULONG *rr;

crypto/bn/bn_mul.c:657:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_mul` 
          655.           if (--nb <= 0)
          656.               return;
          657.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                  ^
          658.           rr += 4;
          659.           r += 4;
