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


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

crypto/bn/bn_ctx.c:284:5: Call
  282.       }
  283.       /* OK, make sure the returned bignum is "zero" */
  284.       BN_zero(ret);
             ^
  285.       ctx->used++;
  286.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

crypto/bn/bn_recp.c:118:18: Call
116.                   goto err;
117.           } else {
118.               if (!BN_mul(a, x, y, ctx))
                        ^
119.                   goto err;
120.           }

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

crypto/bn/bn_mul.c:900:5: Assignment
  898.       bn_check_top(r);
  899.   
  900.       al = a->top;
             ^
  901.       bl = b->top;
  902.   

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

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

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

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

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

crypto/bn/bn_mul.c:478:9: Array access: Offset: [32, +oo] Size: [0, 8388607] by call to `BN_mul` 
    476.   # endif                         /* BN_MUL_COMBA */
    477.       {
    478.           p = &(t[n2 * 2]);
                   ^
    479.           if (!zero)
    480.               bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
