crypto/bn/bn_mont.c:70: error: BUFFER_OVERRUN_L3
  Offset: [32, +oo] Size: [0, 8388607] by call to `bn_mul_fixed_top`.
Showing all 14 steps of the trace


crypto/bn/bn_mont.c:61:11: Call
59.   
60.       BN_CTX_start(ctx);
61.       tmp = BN_CTX_get(ctx);
                ^
62.       if (tmp == NULL)
63.           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: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_mont.c:70:14: Call
68.               goto err;
69.       } else {
70.           if (!bn_mul_fixed_top(tmp, a, b, ctx))
                   ^
71.               goto err;
72.       }

crypto/bn/bn_mul.c:507:1: Parameter `a->top`
  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:524:5: Assignment
  522.       bn_check_top(r);
  523.   
  524.       al = a->top;
             ^
  525.       bl = b->top;
  526.   

crypto/bn/bn_mul.c:595:17: Call
  593.                   if (bn_wexpand(rr, k * 2) == NULL)
  594.                       goto err;
  595.                   bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
                         ^
  596.               }
  597.               rr->top = top;

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

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

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

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

crypto/bn/bn_mul.c:266:9: Array access: Offset: [32, +oo] Size: [0, 8388607] by call to `bn_mul_fixed_top` 
    264.   # endif                         /* BN_MUL_COMBA */
    265.       {
    266.           p = &(t[n2 * 2]);
                   ^
    267.           if (!zero)
    268.               bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
