crypto/rsa/rsa_chk.c:103: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mul`.
Showing all 19 steps of the trace


crypto/rsa/rsa_chk.c:94:9: Call
92.   
93.       /* q prime? */
94.       r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb);
              ^
95.       if (r != 1) {
96.           ret = r;

crypto/bn/bn_prime.c:296:12: Call
  294.                      BN_GENCB *cb)
  295.   {
  296.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  297.   }
  298.   

crypto/bn/bn_prime.c:380:13: Call
    378.           /* now 1 <= check < A */
    379.   
    380.           j = witness(check, A, A1, A1_odd, k, ctx, mont);
                       ^
    381.           if (j == -1)
    382.               goto err;

crypto/bn/bn_prime.c:475:10: Call
      473.                      BN_MONT_CTX *mont)
      474.   {
      475.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                      ^
      476.           return -1;
      477.       if (BN_is_one(w))

crypto/bn/bn_exp.c:456:14: Call
        454.   
        455.       if (a->neg || BN_ucmp(a, m) >= 0) {
        456.           if (!BN_nnmod(val[0], a, m, ctx))
                            ^
        457.               goto err;
        458.           aa = val[0];

crypto/bn/bn_mod.c:125:11: Call
          123.        */
          124.   
          125.       if (!(BN_mod(r, m, d, ctx)))
                           ^
          126.           return 0;
          127.       if (!r->neg)

crypto/bn/bn_div.c:188:1: Parameter `*dv->d`
            186.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
            187.    */
            188. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
            189.              BN_CTX *ctx)
            190.   {

crypto/rsa/rsa_chk.c:103:9: Call
101.   
102.       /* n = p*q? */
103.       r = BN_mul(i, key->p, key->q, ctx);
               ^
104.       if (!r) {
105.           ret = -1;

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

crypto/bn/bn_ctx.c:283:5: Call
    281.       }
    282.       /* OK, make sure the returned bignum is "zero" */
    283.       BN_zero(ret);
               ^
    284.       ctx->used++;
    285.       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_mul.c:963:17: Call
  961.                   if (bn_wexpand(rr, k * 4) == NULL)
  962.                       goto err;
  963.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  964.                                         j, al - j, bl - j, t->d);
  965.               } else {            /* al <= j || bl <= j */

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

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

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

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

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

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