crypto/bn/bn_gcd.c:347: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned64 by call to `BN_usub`.
Showing all 7 steps of the trace


crypto/bn/bn_gcd.c:300:11: Call
298.   				if (BN_is_odd(X))
299.   					{
300.   					if (!BN_uadd(X, X, n)) goto err;
                 ^
301.   					}
302.   				/* now X is even, so we can easily divide it by two */

crypto/bn/bn_add.c:132:8: Unknown value from: bn_add_words
  130.   	rp=r->d;
  131.   
  132.   	carry=bn_add_words(rp,ap,bp,min);
                ^
  133.   	rp+=min;
  134.   	ap+=min;

crypto/bn/bn_gcd.c:347:10: Call
345.   				/* NB: we could use BN_mod_add_quick(X, X, Y, n), but that
346.   				 * actually makes the algorithm slower */
347.   				if (!BN_usub(B, B, A)) goto err;
                ^
348.   				}
349.   			else

crypto/bn/bn_add.c:168:1: <LHS trace>
166.   
167.   /* unsigned subtraction of b from a, a must be larger than b. */
168. > int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
169.   	{
170.   	int max,min,dif;

crypto/bn/bn_add.c:168:1: Parameter `*a->d`
  166.   
  167.   /* unsigned subtraction of b from a, a must be larger than b. */
  168. > int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  169.   	{
  170.   	int max,min,dif;

crypto/bn/bn_add.c:231:4: Assignment
  229.   			{
  230.   			dif--;
  231.   			t1 = *(ap++);
            ^
  232.   			t2 = (t1-1)&BN_MASK2;
  233.   			*(rp++) = t2;

crypto/bn/bn_add.c:232:4: Binary operation: ([0, +oo] - 1):unsigned64 by call to `BN_usub` 
  230.   			dif--;
  231.   			t1 = *(ap++);
  232.   			t2 = (t1-1)&BN_MASK2;
            ^
  233.   			*(rp++) = t2;
  234.   			if (t1)
