crypto/rsa/rsa_chk.c:66: 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:60:9: Call
58.   
59.       /* q prime? */
60.       if (BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb) != 1) {
              ^
61.           ret = 0;
62.           RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_Q_NOT_PRIME);

crypto/bn/bn_prime.c:197:12: Call
  195.                      BN_GENCB *cb)
  196.   {
  197.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  198.   }
  199.   

crypto/bn/bn_prime.c:285:13: Call
    283.           /* now 1 <= check < A */
    284.   
    285.           j = witness(check, A, A1, A1_odd, k, ctx, mont);
                       ^
    286.           if (j == -1)
    287.               goto err;

crypto/bn/bn_prime.c:388:10: Call
      386.                      BN_MONT_CTX *mont)
      387.   {
      388.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                      ^
      389.           return -1;
      390.       if (BN_is_one(w))

crypto/bn/bn_exp.c:356:14: Call
        354.   
        355.       if (a->neg || BN_ucmp(a, m) >= 0) {
        356.           if (!BN_nnmod(val[0], a, m, ctx))
                            ^
        357.               goto err;
        358.           aa = val[0];

crypto/bn/bn_mod.c:20:11: Call
          18.        */
          19.   
          20.       if (!(BN_mod(r, m, d, ctx)))
                          ^
          21.           return 0;
          22.       if (!r->neg)

crypto/bn/bn_div.c:140:1: Parameter `*dv->d`
            138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
            139.    */
            140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
            141.              BN_CTX *ctx)
            142.   {

crypto/rsa/rsa_chk.c:66:10: Call
64.   
65.       /* n = p*q? */
66.       if (!BN_mul(i, key->p, key->q, ctx)) {
               ^
67.           ret = -1;
68.           goto err;

crypto/bn/bn_mul.c:829:1: Parameter `*r->d`
  827.   #endif                          /* BN_RECURSION */
  828.   
  829. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  830.   {
  831.       int ret = 0;

crypto/bn/bn_mul.c:908:21: Call
  906.                   if (bn_wexpand(t, k * 4) == NULL)
  907.                       goto err;
  908.                   if (bn_wexpand(rr, k * 4) == NULL)
                             ^
  909.                       goto err;
  910.                   bn_mul_part_recursive(rr->d, a->d, b->d,

crypto/bn/bn_lib.c:1016:1: Parameter `*a->d`
    1014.   }
    1015.   
    1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    1017.   {
    1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_mul.c:910:17: Call
  908.                   if (bn_wexpand(rr, k * 4) == NULL)
  909.                       goto err;
  910.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  911.                                         j, al - j, bl - j, t->d);
  912.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:480:1: Parameter `*t`
    478.    */
    479.   /* tnX may not be negative but less than n */
    480. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
    481.                              int tna, int tnb, BN_ULONG *t)
    482.   {

crypto/bn/bn_mul.c:543:9: Call
    541.       } else {
    542.           p = &(t[n2 * 2]);
    543.           bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
                   ^
    544.           bn_mul_recursive(r, a, b, n, 0, 0, p);
    545.           i = n / 2;

crypto/bn/bn_mul.c:333:1: Parameter `*a`
      331.    */
      332.   /* dnX may not be positive, but n2/2+dnX has to be */
      333. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      334.                         int dna, int dnb, BN_ULONG *t)
      335.   {

crypto/bn/bn_mul.c:359:9: Call
      357.       /* Else do normal multiply */
      358.       if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) {
      359.           bn_mul_normal(r, a, n2 + dna, b, n2 + dnb);
                     ^
      360.           if ((dna + dnb) < 0)
      361.               memset(&r[2 * n2 + dna + dnb], 0,

crypto/bn/bn_mul.c:983:1: <Length trace>
981.   }
982.   
983. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
984.   {
985.       BN_ULONG *rr;

crypto/bn/bn_mul.c:983:1: Parameter `*b`
        981.   }
        982.   
        983. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        984.   {
        985.       BN_ULONG *rr;

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