apps/rsa.c:331: error: INTEGER_OVERFLOW_L1
  (0 - [1, +oo]):unsigned32 by call to `RSA_check_key`.
Showing all 23 steps of the trace


apps/rsa.c:275:11: Call
273.   				tmpformat = informat;
274.   					
275.   			pkey = load_pubkey(bio_err, infile, tmpformat, 1,
                 ^
276.   				passin, e, "Public Key");
277.   			}

apps/apps.c:969:3: Unknown value from: setvbuf
  967.   		{
  968.   #ifdef _IONBF
  969.   		setvbuf(stdin, NULL, _IONBF, 0);
           ^
  970.   #endif
  971.   		BIO_set_fp(key,stdin,BIO_NOCLOSE);

apps/rsa.c:286:3: Call
284.   		if (pkey != NULL)
285.   			rsa = EVP_PKEY_get1_RSA(pkey);
286.   		EVP_PKEY_free(pkey);
         ^
287.   	}
288.   

crypto/evp/p_lib.c:300:1: Parameter `**x->attributes->data`
  298.   	}
  299.   
  300. > void EVP_PKEY_free(EVP_PKEY *x)
  301.   	{
  302.   	int i;

apps/rsa.c:331:11: Call
329.   	if (check)
330.   		{
331.   		int r = RSA_check_key(rsa);
                 ^
332.   
333.   		if (r == 1)

crypto/rsa/rsa_chk.c:56:1: Parameter `*key->d->d`
  54.   
  55.   
  56. > int RSA_check_key(const RSA *key)
  57.   	{
  58.   	BIGNUM *i, *j, *k, *l, *m;

crypto/rsa/rsa_chk.c:122:6: Call
  120.   	if (!r) { ret = -1; goto err; }
  121.   
  122.   	r = BN_mod_mul(i, key->d, key->e, k, ctx);
              ^
  123.   	if (!r) { ret = -1; goto err; }
  124.   

crypto/bn/bn_mod.c:178:1: Parameter `*a->d`
    176.   
    177.   /* slow but works */
    178. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
    179.   	BN_CTX *ctx)
    180.   	{

crypto/bn/bn_mod.c:193:10: Call
    191.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
    192.   	else
    193.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }
                    ^
    194.   	if (!BN_nnmod(r,t,m,ctx)) goto err;
    195.   	bn_check_top(r);

crypto/bn/bn_mul.c:941:1: Parameter `*a->d`
      939.   #endif /* BN_RECURSION */
      940.   
      941. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
      942.   	{
      943.   	int ret=0;

crypto/bn/bn_mul.c:1030:5: Call
      1028.   				bn_wexpand(t,k*4);
      1029.   				bn_wexpand(rr,k*4);
      1030.   				bn_mul_part_recursive(rr->d,a->d,b->d,
                  ^
      1031.   					j,al-j,bl-j,t->d);
      1032.   				}

crypto/bn/bn_mul.c:548:1: Parameter `*a`
        546.   /* n+tn is the word length
        547.    * t needs to be n*4 is size, as does r */
        548. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
        549.   	     int tna, int tnb, BN_ULONG *t)
        550.   	{

crypto/bn/bn_mul.c:566:5: Call
        564.   
        565.   	/* r=(a[0]-a[1])*(b[1]-b[0]) */
        566.   	c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna);
                   ^
        567.   	c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n);
        568.   	zero=neg=0;

crypto/bn/bn_lib.c:822:1: Parameter `*b`
          820.      All lengths are the number of BN_ULONGs...  */
          821.   
          822. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b,
          823.   	int cl, int dl)
          824.   	{

crypto/bn/bn_mul.c:572:3: Call
        570.   		{
        571.   	case -4:
        572.   		bn_sub_part_words(t,      &(a[n]),a,      tna,tna-n); /* - */
                 ^
        573.   		bn_sub_part_words(&(t[n]),b,      &(b[n]),tnb,n-tnb); /* - */
        574.   		break;

crypto/bn/bn_mul.c:80:1: <LHS trace>
78.      assembler counterparts for the systems that use assembler files.  */
79.   
80. > BN_ULONG bn_sub_part_words(BN_ULONG *r,
81.   	const BN_ULONG *a, const BN_ULONG *b,
82.   	int cl, int dl)

crypto/bn/bn_mul.c:80:1: Parameter `*a`
          78.      assembler counterparts for the systems that use assembler files.  */
          79.   
          80. > BN_ULONG bn_sub_part_words(BN_ULONG *r,
          81.   	const BN_ULONG *a, const BN_ULONG *b,
          82.   	int cl, int dl)

crypto/bn/bn_mul.c:87:6: Call
          85.   
          86.   	assert(cl >= 0);
          87.   	c = bn_sub_words(r, a, b, cl);
                     ^
          88.   
          89.   	if (dl == 0)

crypto/bn/bn_asm.c:393:1: Parameter `*a`
            391.   #endif /* !BN_LLONG */
            392.   
            393. > BN_ULONG bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
            394.           {
            395.   	BN_ULONG t1,t2;

crypto/bn/bn_mul.c:135:4: Assignment
          133.   		while(c)
          134.   			{
          135.   			t = a[0];
                    ^
          136.   			r[0] = (t-c)&BN_MASK2;
          137.   			if (t != 0) c=0;

crypto/bn/bn_mul.c:137:16: <RHS trace>
135.   			t = a[0];
136.   			r[0] = (t-c)&BN_MASK2;
137.   			if (t != 0) c=0;
                      ^
138.   			if (--dl <= 0) break;
139.   

crypto/bn/bn_mul.c:137:16: Assignment
          135.   			t = a[0];
          136.   			r[0] = (t-c)&BN_MASK2;
          137.   			if (t != 0) c=0;
                                ^
          138.   			if (--dl <= 0) break;
          139.   

crypto/bn/bn_mul.c:136:4: Binary operation: (0 - [1, +oo]):unsigned32 by call to `RSA_check_key` 
          134.   			{
          135.   			t = a[0];
          136.   			r[0] = (t-c)&BN_MASK2;
                    ^
          137.   			if (t != 0) c=0;
          138.   			if (--dl <= 0) break;
