crypto/bn/bn_gf2m.c:895: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned64 by call to `BN_GF2m_mod_sqr_arr`.
Showing all 8 steps of the trace


crypto/bn/bn_gf2m.c:880:7: Call
878.   	if (w == NULL) goto err;
879.   
880.   	if (!BN_GF2m_mod_arr(a, a_, p)) goto err;
             ^
881.   	
882.   	if (BN_is_zero(a))

crypto/bn/bn_gf2m.c:261:1: Parameter `r->top`
  259.   
  260.   /* Performs modular reduction of a and store result in r.  r could be a. */
  261. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
  262.   	{
  263.   	int j, k;

crypto/bn/bn_gf2m.c:892:8: Call
890.   		{
891.   		/* compute half-trace of a */
892.   		if (!BN_copy(z, a)) goto err;
              ^
893.   		for (j = 1; j <= (p[0] - 1) / 2; j++)
894.   			{

crypto/bn/bn_lib.c:497:1: Parameter `a->dmax`
  495.   	}
  496.   
  497. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  498.   	{
  499.   	int i;

crypto/bn/bn_gf2m.c:895:9: Call
893.   		for (j = 1; j <= (p[0] - 1) / 2; j++)
894.   			{
895.   			if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
               ^
896.   			if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
897.   			if (!BN_GF2m_add(z, z, a)) goto err;

crypto/bn/bn_gf2m.c:461:1: <LHS trace>
459.   
460.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
461. > int	BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[], BN_CTX *ctx)
462.   	{
463.   	int i, ret = 0;

crypto/bn/bn_gf2m.c:461:1: Parameter `a->top`
  459.   
  460.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
  461. > int	BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[], BN_CTX *ctx)
  462.   	{
  463.   	int i, ret = 0;

crypto/bn/bn_gf2m.c:471:7: Binary operation: ([0, +oo] - 1):unsigned64 by call to `BN_GF2m_mod_sqr_arr` 
  469.   	if (!bn_wexpand(s, 2 * a->top)) goto err;
  470.   
  471.   	for (i = a->top - 1; i >= 0; i--)
               ^
  472.   		{
  473.   		s->d[2*i+1] = SQR1(a->d[i]);
