crypto/rsa/rsa_chk.c:66: 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: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:150:12: Call
  148.                      BN_GENCB *cb)
  149.   {
  150.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  151.   }
  152.   

crypto/bn/bn_prime.c:227:13: Call
    225.           /* now 1 <= check < a */
    226.   
    227.           j = witness(check, a, A1, A1_odd, k, ctx, mont);
                       ^
    228.           if (j == -1)
    229.               goto err;

crypto/bn/bn_prime.c:253:10: Call
      251.                      BN_MONT_CTX *mont)
      252.   {
      253.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                      ^
      254.           return -1;
      255.       if (BN_is_one(w))

crypto/bn/bn_exp.c:350:14: Call
        348.   
        349.       if (a->neg || BN_ucmp(a, m) >= 0) {
        350.           if (!BN_nnmod(val[0], a, m, ctx))
                            ^
        351.               goto err;
        352.           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:495:1: Parameter `a->top`
  493.   #endif                          /* BN_RECURSION */
  494.   
  495. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  496.   {
  497.       int ret = 0;

crypto/bn/bn_mul.c:512:5: Assignment
  510.       bn_check_top(r);
  511.   
  512.       al = a->top;
             ^
  513.       bl = b->top;
  514.   

crypto/bn/bn_mul.c:575:17: Call
  573.                   if (bn_wexpand(rr, k * 4) == NULL)
  574.                       goto err;
  575.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  576.                                         j, al - j, bl - j, t->d);
  577.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:320:1: Parameter `n`
    318.    */
    319.   /* tnX may not be negative but less than n */
    320. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
    321.                              int tna, int tnb, BN_ULONG *t)
    322.   {

crypto/bn/bn_mul.c:380:9: Call
    378.       } else {
    379.           p = &(t[n2 * 2]);
    380.           bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
                   ^
    381.           bn_mul_recursive(r, a, b, n, 0, 0, p);
    382.           i = n / 2;

crypto/bn/bn_mul.c:173:1: Parameter `*b`
      171.    */
      172.   /* dnX may not be positive, but n2/2+dnX has to be */
      173. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      174.                         int dna, int dnb, BN_ULONG *t)
      175.   {

crypto/bn/bn_mul.c:207:10: Call
      205.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      206.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
      207.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                      ^
      208.       zero = neg = 0;
      209.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:735:1: Parameter `cl`
        733.    */
        734.   
        735. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        736.   {
        737.       int n, i;

crypto/bn/bn_lib.c:752:12: Call
        750.           }
        751.       }
        752.       return bn_cmp_words(a, b, cl);
                          ^
        753.   }
        754.   

crypto/bn/bn_lib.c:708:1: <Offset trace>
706.   }
707.   
708. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
709.   {
710.       int i;

crypto/bn/bn_lib.c:708:1: Parameter `n`
          706.   }
          707.   
          708. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          709.   {
          710.       int i;

crypto/bn/bn_lib.c:717:10: Assignment
          715.       if (aa != bb)
          716.           return ((aa > bb) ? 1 : -1);
          717.       for (i = n - 2; i >= 0; i--) {
                          ^
          718.           aa = a[i];
          719.           bb = b[i];

crypto/bn/bn_lib.c:708:1: <Length trace>
706.   }
707.   
708. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
709.   {
710.       int i;

crypto/bn/bn_lib.c:708:1: Parameter `*b`
          706.   }
          707.   
          708. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          709.   {
          710.       int i;

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