crypto/bn/bn_mont.c:56: 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:47:11: Call
45.   
46.       BN_CTX_start(ctx);
47.       tmp = BN_CTX_get(ctx);
                ^
48.       if (tmp == NULL)
49.           goto err;

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_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 `*r->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:573:21: Call
  571.                   if (bn_wexpand(t, k * 4) == NULL)
  572.                       goto err;
  573.                   if (bn_wexpand(rr, k * 4) == NULL)
                             ^
  574.                       goto err;
  575.                   bn_mul_part_recursive(rr->d, a->d, b->d,

crypto/bn/bn_lib.c:946:1: Parameter `*a->d`
    944.   }
    945.   
    946. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    947.   {
    948.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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 `*t`
    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:380:9: Call
    378.       } else {
    379.           p = &(t[n2 * 2]);
    380.           bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
                   ^
    381.           bn_mul_recursive(r, a, b, n, 0, 0, p);
    382.           i = n / 2;

crypto/bn/bn_mul.c:173:1: Parameter `*a`
      171.    */
      172.   /* dnX may not be positive, but n2/2+dnX has to be */
      173. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      174.                         int dna, int dnb, BN_ULONG *t)
      175.   {

crypto/bn/bn_mul.c:199:9: Call
      197.       /* Else do normal multiply */
      198.       if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) {
      199.           bn_mul_normal(r, a, n2 + dna, b, n2 + dnb);
                     ^
      200.           if ((dna + dnb) < 0)
      201.               memset(&r[2 * n2 + dna + dnb], 0,

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_mul` 
        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;
