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


crypto/bn/bn_mont.c:148:11: Call
146.   
147.       BN_CTX_start(ctx);
148.       tmp = BN_CTX_get(ctx);
                 ^
149.       if (tmp == NULL)
150.           goto err;

crypto/bn/bn_ctx.c:275:5: Call
  273.       }
  274.       /* OK, make sure the returned bignum is "zero" */
  275.       BN_zero(ret);
             ^
  276.       ctx->used++;
  277.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
    518.   }
    519.   
    520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    521.   {
    522.       bn_check_top(a);

crypto/bn/bn_lib.c:523:9: Call
    521.   {
    522.       bn_check_top(a);
    523.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    524.           return (0);
    525.       a->neg = 0;

crypto/bn/bn_lcl.h:777:1: Parameter `*a->d`
      775.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
      776.   
      777. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      778.   {
      779.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_mont.c:157:14: Call
155.               goto err;
156.       } else {
157.           if (!BN_mul(tmp, a, b, ctx))
                    ^
158.               goto err;
159.       }

crypto/bn/bn_mul.c:882:1: Parameter `*r->d`
  880.   #endif                          /* BN_RECURSION */
  881.   
  882. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  883.   {
  884.       int ret = 0;

crypto/bn/bn_mul.c:961:21: Call
  959.                   if (bn_wexpand(t, k * 4) == NULL)
  960.                       goto err;
  961.                   if (bn_wexpand(rr, k * 4) == NULL)
                             ^
  962.                       goto err;
  963.                   bn_mul_part_recursive(rr->d, a->d, b->d,

crypto/bn/bn_lib.c:1071:1: Parameter `*a->d`
    1069.   }
    1070.   
    1071. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    1072.   {
    1073.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_mul.c:963:17: Call
  961.                   if (bn_wexpand(rr, k * 4) == NULL)
  962.                       goto err;
  963.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  964.                                         j, al - j, bl - j, t->d);
  965.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:533:1: Parameter `*t`
    531.    */
    532.   /* tnX may not be negative but less than n */
    533. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
    534.                              int tna, int tnb, BN_ULONG *t)
    535.   {

crypto/bn/bn_mul.c:596:9: Call
    594.       } else {
    595.           p = &(t[n2 * 2]);
    596.           bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
                   ^
    597.           bn_mul_recursive(r, a, b, n, 0, 0, p);
    598.           i = n / 2;

crypto/bn/bn_mul.c:386:1: Parameter `*a`
      384.    */
      385.   /* dnX may not be positive, but n2/2+dnX has to be */
      386. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      387.                         int dna, int dnb, BN_ULONG *t)
      388.   {

crypto/bn/bn_mul.c:412:9: Call
      410.       /* Else do normal multiply */
      411.       if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) {
      412.           bn_mul_normal(r, a, n2 + dna, b, n2 + dnb);
                     ^
      413.           if ((dna + dnb) < 0)
      414.               memset(&r[2 * n2 + dna + dnb], 0,

crypto/bn/bn_mul.c:1036:1: <Length trace>
1034.   }
1035.   
1036. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
1037.   {
1038.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1036:1: Parameter `*b`
        1034.   }
        1035.   
        1036. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        1037.   {
        1038.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1071:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mul` 
        1069.           if (--nb <= 0)
        1070.               return;
        1071.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                 ^
        1072.           rr += 4;
        1073.           r += 4;
