crypto/rsa/rsa_chk.c:63: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mul`.
Showing all 16 steps of the trace


crypto/rsa/rsa_chk.c:54:9: Call
52.   
53.       /* q prime? */
54.       r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb);
              ^
55.       if (r != 1) {
56.           ret = r;

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

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

crypto/bn/bn_prime.c:377:10: Call
      375.                      BN_MONT_CTX *mont)
      376.   {
      377.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                      ^
      378.           return -1;
      379.       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:63:9: Call
61.   
62.       /* n = p*q? */
63.       r = BN_mul(i, key->p, key->q, ctx);
              ^
64.       if (!r) {
65.           ret = -1;

crypto/bn/bn_mul.c:880:13: Assignment
  878.               if (bn_wexpand(rr, 16) == NULL)
  879.                   goto err;
  880.               rr->top = 16;
                     ^
  881.               bn_mul_comba8(rr->d, a->d, b->d);
  882.               goto end;

crypto/bn/bn_mul.c:973:5: Call
  971.    end:
  972.   #endif
  973.       bn_correct_top(rr);
             ^
  974.       if (r != rr)
  975.           BN_copy(r, rr);

crypto/bn/bn_lib.c:1019:1: <Offset trace>
1017.   }
1018.   
1019. > void bn_correct_top(BIGNUM *a)
1020.   {
1021.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1019:1: Parameter `a->top`
    1017.   }
    1018.   
    1019. > void bn_correct_top(BIGNUM *a)
    1020.   {
    1021.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1022:5: Assignment
    1020.   {
    1021.       BN_ULONG *ftl;
    1022.       int tmp_top = a->top;
                ^
    1023.   
    1024.       if (tmp_top > 0) {

crypto/bn/bn_lib.c:1019:1: <Length trace>
1017.   }
1018.   
1019. > void bn_correct_top(BIGNUM *a)
1020.   {
1021.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1019:1: Parameter `*a->d`
    1017.   }
    1018.   
    1019. > void bn_correct_top(BIGNUM *a)
    1020.   {
    1021.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1025:14: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mul` 
    1023.   
    1024.       if (tmp_top > 0) {
    1025.           for (ftl = &(a->d[tmp_top]); tmp_top > 0; tmp_top--) {
                         ^
    1026.               ftl--;
    1027.               if (*ftl != 0)
