crypto/rsa/rsa_mp.c:84: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul`.
Showing all 14 steps of the trace


crypto/rsa/rsa_mp.c:58:1: Parameter `rsa->p->d`
56.   
57.   /* Refill products of primes */
58. > int rsa_multip_calc_product(RSA *rsa)
59.   {
60.       RSA_PRIME_INFO *pinfo;

crypto/rsa/rsa_mp.c:84:14: Call
82.                   goto err;
83.           }
84.           if (!BN_mul(pinfo->pp, p1, p2, ctx))
                   ^
85.               goto err;
86.           /* save previous one */

crypto/bn/bn_mul.c:497:1: Parameter `*a->d`
  495.   #endif                          /* BN_RECURSION */
  496.   
  497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  498.   {
  499.       int ret = 0;

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

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

crypto/bn/bn_mul.c:335:10: Call
    333.   
    334.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
    335.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
                    ^
    336.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
    337.       neg = 0;

crypto/bn/bn_lib.c:727:1: Parameter `cl`
      725.    */
      726.   
      727. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
      728.   {
      729.       int n, i;

crypto/bn/bn_lib.c:744:12: Call
      742.           }
      743.       }
      744.       return bn_cmp_words(a, b, cl);
                        ^
      745.   }
      746.   

crypto/bn/bn_lib.c:700:1: <Offset trace>
698.   }
699.   
700. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
701.   {
702.       int i;

crypto/bn/bn_lib.c:700:1: Parameter `n`
        698.   }
        699.   
        700. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
        701.   {
        702.       int i;

crypto/bn/bn_lib.c:709:10: Assignment
        707.       if (aa != bb)
        708.           return ((aa > bb) ? 1 : -1);
        709.       for (i = n - 2; i >= 0; i--) {
                        ^
        710.           aa = a[i];
        711.           bb = b[i];

crypto/bn/bn_lib.c:700:1: <Length trace>
698.   }
699.   
700. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
701.   {
702.       int i;

crypto/bn/bn_lib.c:700:1: Parameter `*b`
        698.   }
        699.   
        700. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
        701.   {
        702.       int i;

crypto/bn/bn_lib.c:711:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul` 
        709.       for (i = n - 2; i >= 0; i--) {
        710.           aa = a[i];
        711.           bb = b[i];
                            ^
        712.           if (aa != bb)
        713.               return ((aa > bb) ? 1 : -1);
