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


crypto/bn/bn_gf2m.c:916:10: Call
914.   				{
915.   				if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
916.   				if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx)) goto err;
                ^
917.   				if (!BN_GF2m_mod_mul_arr(tmp, w2, a, p, ctx)) goto err;
918.   				if (!BN_GF2m_add(z, z, tmp)) goto err;

crypto/bn/bn_gf2m.c:461:1: Parameter `r->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:917:10: Call
915.   				if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
916.   				if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx)) goto err;
917.   				if (!BN_GF2m_mod_mul_arr(tmp, w2, a, p, ctx)) goto err;
                ^
918.   				if (!BN_GF2m_add(z, z, tmp)) goto err;
919.   				if (!BN_GF2m_add(w, w2, rho)) goto err;

crypto/bn/bn_gf2m.c:384:1: Parameter `a->top`
  382.    * the result in r.  r could be a or b; a could be b.
  383.    */
  384. > int	BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const int p[], BN_CTX *ctx)
  385.   	{
  386.   	int zlen, i, j, k, ret = 0;

crypto/bn/bn_gf2m.c:918:10: Call
916.   				if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx)) goto err;
917.   				if (!BN_GF2m_mod_mul_arr(tmp, w2, a, p, ctx)) goto err;
918.   				if (!BN_GF2m_add(z, z, tmp)) goto err;
                ^
919.   				if (!BN_GF2m_add(w, w2, rho)) goto err;
920.   				}

crypto/bn/bn_gf2m.c:224:1: Parameter `b->top`
  222.    * could be equal; r is the bitwise XOR of a and b.
  223.    */
  224. > int	BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  225.   	{
  226.   	int i;

crypto/bn/bn_gf2m.c:919:10: Call
917.   				if (!BN_GF2m_mod_mul_arr(tmp, w2, a, p, ctx)) goto err;
918.   				if (!BN_GF2m_add(z, z, tmp)) goto err;
919.   				if (!BN_GF2m_add(w, w2, rho)) goto err;
                ^
920.   				}
921.   			count++;

crypto/bn/bn_gf2m.c:224:1: Parameter `b->top`
  222.    * could be equal; r is the bitwise XOR of a and b.
  223.    */
  224. > int	BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  225.   	{
  226.   	int i;

crypto/bn/bn_gf2m.c:915:10: Call
913.   			for (j = 1; j <= p[0] - 1; j++)
914.   				{
915.   				if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
                ^
916.   				if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx)) goto err;
917.   				if (!BN_GF2m_mod_mul_arr(tmp, w2, a, p, ctx)) 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]);
