crypto/rsa/rsa_eay.c:847: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned64 by call to `BN_div`.
Showing all 8 steps of the trace


crypto/rsa/rsa_eay.c:846:8: Call
844.   		 * the verify will *always* be less than 'n' so we don't check
845.   		 * for absolute equality, just congruency. */
846.   		if (!BN_sub(vrfy, vrfy, I)) goto err;
              ^
847.   		if (!BN_mod(vrfy, vrfy, rsa->n, ctx)) goto err;
848.   		if (BN_is_negative(vrfy))

crypto/bn/bn_add.c:263:1: Parameter `a->top`
  261.   	}
  262.   
  263. > int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  264.   	{
  265.   	size_t max;

crypto/rsa/rsa_eay.c:847:8: Call
845.   		 * for absolute equality, just congruency. */
846.   		if (!BN_sub(vrfy, vrfy, I)) goto err;
847.   		if (!BN_mod(vrfy, vrfy, rsa->n, ctx)) goto err;
              ^
848.   		if (BN_is_negative(vrfy))
849.   			if (!BN_add(vrfy, vrfy, rsa->n)) goto err;

crypto/bn/bn_div.c:181:1: Parameter `num->top`
  179.   static int BN_div_no_branch(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num,
  180.           const BIGNUM *divisor, BN_CTX *ctx);
  181. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  182.   	   BN_CTX *ctx)
  183.   	{

crypto/bn/bn_div.c:218:6: Call
  216.   		}
  217.   
  218.   	if (BN_ucmp(num,divisor) < 0)
              ^
  219.   		{
  220.   		if (rm != NULL)

crypto/bn/bn_lib.c:656:1: <LHS trace>
654.   	}
655.   
656. > int BN_ucmp(const BIGNUM *a, const BIGNUM *b)
657.   	{
658.   	int i;

crypto/bn/bn_lib.c:656:1: Parameter `a->top`
    654.   	}
    655.   
    656. > int BN_ucmp(const BIGNUM *a, const BIGNUM *b)
    657.   	{
    658.   	int i;

crypto/bn/bn_lib.c:668:7: Binary operation: ([0, +oo] - 1):unsigned64 by call to `BN_div` 
    666.   	ap=a->d;
    667.   	bp=b->d;
    668.   	for (i=a->top-1; i>=0; i--)
                 ^
    669.   		{
    670.   		t1= ap[i];
