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


crypto/bn/bn_recp.c:110:14: Call
108.   
109.       BN_CTX_start(ctx);
110.       if ((a = BN_CTX_get(ctx)) == NULL)
                    ^
111.           goto err;
112.       if (y != NULL) {

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_recp.c:117:18: Call
115.                   goto err;
116.           } else {
117.               if (!BN_mul(a, x, y, ctx))
                        ^
118.                   goto err;
119.           }

crypto/bn/bn_mul.c:882:1: Parameter `a->top`
  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:899:5: Assignment
  897.       bn_check_top(r);
  898.   
  899.       al = a->top;
             ^
  900.       bl = b->top;
  901.   

crypto/bn/bn_mul.c:971:17: Call
  969.                   if (bn_wexpand(rr, k * 2) == NULL)
  970.                       goto err;
  971.                   bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
                         ^
  972.               }
  973.               rr->top = top;

crypto/bn/bn_mul.c:386:1: <Offset trace>
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:386:1: Parameter `n2`
    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:386:1: <Length trace>
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:386:1: Parameter `*t`
    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:477:9: Array access: Offset: [32, +oo] Size: [0, 8388607] by call to `BN_mul` 
    475.   # endif                         /* BN_MUL_COMBA */
    476.       {
    477.           p = &(t[n2 * 2]);
                   ^
    478.           if (!zero)
    479.               bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
