crypto/rsa/rsa_ossl.c:800: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mul`.
Showing all 12 steps of the trace


crypto/rsa/rsa_ossl.c:790:10: Call
788.       }
789.   
790.       if (!BN_sub(r0, r0, m1))
                ^
791.           goto err;
792.       /*

crypto/bn/bn_add.c:45:1: Parameter `*r->d`
  43.   
  44.   /* signed sub of b from a. */
  45. > int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  46.   {
  47.       int ret, r_neg, cmp_res;

crypto/bn/bn_add.c:59:19: Call
  57.           if (cmp_res > 0) {
  58.               r_neg = a->neg;
  59.               ret = BN_usub(r, a, b);
                          ^
  60.           } else if (cmp_res < 0) {
  61.               r_neg = !b->neg;

crypto/bn/bn_add.c:125:1: Parameter `*r->d`
    123.   
    124.   /* unsigned subtraction of b from a, a must be larger than b. */
    125. > int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
    126.   {
    127.       int max, min, dif;

crypto/rsa/rsa_ossl.c:800:10: Call
798.               goto err;
799.   
800.       if (!BN_mul(r1, r0, rsa->iqmp, ctx))
                ^
801.           goto err;
802.   

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 `*a`
    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:330:9: Call
    328.   
    329.       if (n < 8) {
    330.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                   ^
    331.           return;
    332.       }

crypto/bn/bn_mul.c:612:1: <Length trace>
610.   }
611.   
612. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
613.   {
614.       BN_ULONG *rr;

crypto/bn/bn_mul.c:612:1: Parameter `*b`
      610.   }
      611.   
      612. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
      613.   {
      614.       BN_ULONG *rr;

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