crypto/rsa/rsa_chk.c:103: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul`.
Showing all 23 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:882:1: Parameter `a->top`
  880.   #endif                          /* BN_RECURSION */
  881.   
  882. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  883.   {
  884.       int ret = 0;

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

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 `n`
    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 `*b`
      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:420:10: Call
      418.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      419.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
      420.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                      ^
      421.       zero = neg = 0;
      422.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:858:1: Parameter `cl`
        856.    */
        857.   
        858. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        859.   {
        860.       int n, i;

crypto/bn/bn_lib.c:875:12: Call
        873.           }
        874.       }
        875.       return bn_cmp_words(a, b, cl);
                          ^
        876.   }
        877.   

crypto/bn/bn_lib.c:831:1: <Offset trace>
829.   }
830.   
831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
832.   {
833.       int i;

crypto/bn/bn_lib.c:831:1: Parameter `n`
          829.   }
          830.   
          831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          832.   {
          833.       int i;

crypto/bn/bn_lib.c:840:10: Assignment
          838.       if (aa != bb)
          839.           return ((aa > bb) ? 1 : -1);
          840.       for (i = n - 2; i >= 0; i--) {
                          ^
          841.           aa = a[i];
          842.           bb = b[i];

crypto/bn/bn_lib.c:831:1: <Length trace>
829.   }
830.   
831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
832.   {
833.       int i;

crypto/bn/bn_lib.c:831:1: Parameter `*b`
          829.   }
          830.   
          831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          832.   {
          833.       int i;

crypto/bn/bn_lib.c:842:14: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul` 
          840.       for (i = n - 2; i >= 0; i--) {
          841.           aa = a[i];
          842.           bb = b[i];
                              ^
          843.           if (aa != bb)
          844.               return ((aa > bb) ? 1 : -1);
