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


crypto/rsa/rsa_ossl.c:587:1: Parameter `rsa->p->top`
585.   }
586.   
587. > static int rsa_ossl_mod_exp(BIGNUM *r0, const BIGNUM *I, RSA *rsa, BN_CTX *ctx)
588.   {
589.       BIGNUM *r1, *m1, *vrfy;

crypto/rsa/rsa_ossl.c:610:9: Call
608.               goto err;
609.           }
610.           BN_with_flags(p, rsa->p, BN_FLG_CONSTTIME);
               ^
611.           BN_with_flags(q, rsa->q, BN_FLG_CONSTTIME);
612.   

crypto/bn/bn_lib.c:949:1: Parameter `b->top`
  947.   }
  948.   
  949. > void BN_with_flags(BIGNUM *dest, const BIGNUM *b, int flags)
  950.   {
  951.       dest->d = b->d;

crypto/bn/bn_lib.c:952:5: Assignment
  950.   {
  951.       dest->d = b->d;
  952.       dest->top = b->top;
             ^
  953.       dest->dmax = b->dmax;
  954.       dest->neg = b->neg;

crypto/rsa/rsa_ossl.c:642:14: Call
640.           BN_with_flags(c, I, BN_FLG_CONSTTIME);
641.   
642.           if (!BN_mod(r1, c, rsa->q, ctx)) {
                    ^
643.               BN_free(c);
644.               goto err;

crypto/bn/bn_div.c:140:1: Parameter `num->top`
  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/bn/bn_div.c:210:11: Call
  208.       sdiv->neg = 0;
  209.       norm_shift += BN_BITS2;
  210.       if (!(BN_lshift(snum, num, norm_shift)))
                   ^
  211.           goto err;
  212.       snum->neg = 0;

crypto/bn/bn_shift.c:81:1: <Offset trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `n`
    79.   }
    80.   
    81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
    82.   {
    83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:96:5: Assignment
    94.   
    95.       r->neg = a->neg;
    96.       nw = n / BN_BITS2;
              ^
    97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
    98.           return (0);

crypto/bn/bn_shift.c:81:1: <Length trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `*r->d`
    79.   }
    80.   
    81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
    82.   {
    83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:9: Call
    95.       r->neg = a->neg;
    96.       nw = n / BN_BITS2;
    97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                   ^
    98.           return (0);
    99.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:1014:1: Parameter `*a->d`
      1012.   }
      1013.   
      1014. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1015.   {
      1016.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:102:5: Assignment
    100.       rb = BN_BITS2 - lb;
    101.       f = a->d;
    102.       t = r->d;
               ^
    103.       t[a->top + nw] = 0;
    104.       if (lb == 0)

crypto/bn/bn_shift.c:110:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_div` 
    108.           for (i = a->top - 1; i >= 0; i--) {
    109.               l = f[i];
    110.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                       ^
    111.               t[nw + i] = (l << lb) & BN_MASK2;
    112.           }
