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


crypto/bn/bn_mod.c:190:14: Call
188.   
189.       BN_CTX_start(ctx);
190.       if ((t = BN_CTX_get(ctx)) == NULL)
                    ^
191.           goto err;
192.       if (a == b) {

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_mod.c:196:14: Call
194.               goto err;
195.       } else {
196.           if (!BN_mul(t, a, b, ctx))
                    ^
197.               goto err;
198.       }

crypto/bn/bn_mul.c:911:19: Call
  909.       BN_CTX_start(ctx);
  910.       if ((r == a) || (r == b)) {
  911.           if ((rr = BN_CTX_get(ctx)) == NULL)
                           ^
  912.               goto err;
  913.       } else

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

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

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

crypto/bn/bn_mul.c:387:1: Parameter `*a`
      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:413:9: Call
      411.       /* Else do normal multiply */
      412.       if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) {
      413.           bn_mul_normal(r, a, n2 + dna, b, n2 + dnb);
                     ^
      414.           if ((dna + dnb) < 0)
      415.               memset(&r[2 * n2 + dna + dnb], 0,

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

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

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