apps/rsa.c:218: 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:213:9: Call
211.           RSA_get0_key(rsa, &n, NULL, NULL);
212.           BIO_printf(out, "Modulus=");
213.           BN_print(out, n);
               ^
214.           BIO_printf(out, "\n");
215.       }

crypto/bn/bn_print.c:301:1: Parameter `a->top`
  299.   # endif
  300.   
  301. > int BN_print(BIO *bp, const BIGNUM *a)
  302.   {
  303.       int i, j, v, z = 0;

apps/rsa.c:218:17: Call
216.   
217.       if (check) {
218.           int r = RSA_check_key(rsa);
                       ^
219.   
220.           if (r == 1)

crypto/rsa/rsa_chk.c:14:1: Parameter `key->d->top`
  12.   #include "rsa_locl.h"
  13.   
  14. > int RSA_check_key(const RSA *key)
  15.   {
  16.       return RSA_check_key_ex(key, NULL);

crypto/rsa/rsa_chk.c:16:12: Call
  14.   int RSA_check_key(const RSA *key)
  15.   {
  16.       return RSA_check_key_ex(key, NULL);
                   ^
  17.   }
  18.   

crypto/rsa/rsa_chk.c:19:1: Parameter `key->d->top`
    17.   }
    18.   
    19. > int RSA_check_key_ex(const RSA *key, BN_GENCB *cb)
    20.   {
    21.       BIGNUM *i, *j, *k, *l, *m;

crypto/rsa/rsa_chk.c:114:14: Call
    112.               goto err;
    113.           }
    114.           if (!BN_mod(j, key->d, i, ctx)) {
                        ^
    115.               ret = -1;
    116.               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:1016:1: Parameter `*a->d`
          1014.   }
          1015.   
          1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          1017.   {
          1018.       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 `RSA_check_key` 
        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.           }
