apps/rsa.c:311: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `RSA_check_key`.
Showing all 18 steps of the trace


apps/rsa.c:306:9: Call
304.       if (modulus) {
305.           BIO_printf(out, "Modulus=");
306.           BN_print(out, rsa->n);
               ^
307.           BIO_printf(out, "\n");
308.       }

crypto/bn/bn_print.c:340:1: Parameter `a->top`
  338.   # endif
  339.   
  340. > int BN_print(BIO *bp, const BIGNUM *a)
  341.   {
  342.       int i, j, v, z = 0;

apps/rsa.c:311:17: Call
309.   
310.       if (check) {
311.           int r = RSA_check_key(rsa);
                       ^
312.   
313.           if (r == 1)

crypto/rsa/rsa_chk.c:55:1: Parameter `key->d->top`
  53.   #include <openssl/rsa.h>
  54.   
  55. > int RSA_check_key(const RSA *key)
  56.   {
  57.       return RSA_check_key_ex(key, NULL);

crypto/rsa/rsa_chk.c:57:12: Call
  55.   int RSA_check_key(const RSA *key)
  56.   {
  57.       return RSA_check_key_ex(key, NULL);
                   ^
  58.   }
  59.   

crypto/rsa/rsa_chk.c:60:1: Parameter `key->d->top`
    58.   }
    59.   
    60. > int RSA_check_key_ex(const RSA *key, BN_GENCB *cb)
    61.   {
    62.       BIGNUM *i, *j, *k, *l, *m;

crypto/rsa/rsa_chk.c:164:13: Call
    162.           }
    163.   
    164.           r = BN_mod(j, key->d, i, ctx);
                       ^
    165.           if (!r) {
    166.               ret = -1;

crypto/bn/bn_div.c:189:1: Parameter `num->top`
      187.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
      188.    */
      189. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
      190.              BN_CTX *ctx)
      191.   {

crypto/bn/bn_div.c:259:11: Call
      257.       sdiv->neg = 0;
      258.       norm_shift += BN_BITS2;
      259.       if (!(BN_lshift(snum, num, norm_shift)))
                       ^
      260.           goto err;
      261.       snum->neg = 0;

crypto/bn/bn_shift.c:130:1: <Offset trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `n`
        128.   }
        129.   
        130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        131.   {
        132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:5: Assignment
        143.   
        144.       r->neg = a->neg;
        145.       nw = n / BN_BITS2;
                   ^
        146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
        147.           return (0);

crypto/bn/bn_shift.c:130:1: <Length trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
        128.   }
        129.   
        130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        131.   {
        132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
        144.       r->neg = a->neg;
        145.       nw = n / BN_BITS2;
        146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                       ^
        147.           return (0);
        148.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
          993.   }
          994.   
          995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          996.   {
          997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:151:5: Assignment
        149.       rb = BN_BITS2 - lb;
        150.       f = a->d;
        151.       t = r->d;
                   ^
        152.       t[a->top + nw] = 0;
        153.       if (lb == 0)

crypto/bn/bn_shift.c:159:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `RSA_check_key` 
        157.           for (i = a->top - 1; i >= 0; i--) {
        158.               l = f[i];
        159.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                           ^
        160.               t[nw + i] = (l << lb) & BN_MASK2;
        161.           }
