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


crypto/bn/bn_gf2m.c:927:6: Call
925.   	unsigned int *arr=NULL, ret = 0;
926.   	if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
927.   	if (BN_GF2m_poly2arr(p, arr, max) > max)
            ^
928.   		{
929.   		BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD,BN_R_INVALID_LENGTH);

crypto/bn/bn_gf2m.c:943:1: Parameter `*p`
  941.    * number of coefficients that would be extracted if array was large enough.
  942.    */
  943. > int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max)
  944.   	{
  945.   	int i, j, k;

crypto/bn/bn_gf2m.c:932:8: Call
930.   		goto err;
931.   		}
932.   	ret = BN_GF2m_mod_solve_quad_arr(r, a, arr, ctx);
              ^
933.     err:
934.   	if (arr) OPENSSL_free(arr);

crypto/bn/bn_gf2m.c:843:1: <LHS trace>
841.    * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
842.    */
843. > int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const unsigned int p[], BN_CTX *ctx)
844.   	{
845.   	int ret = 0, i, count = 0;

crypto/bn/bn_gf2m.c:843:1: Parameter `*p`
  841.    * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
  842.    */
  843. > int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const unsigned int p[], BN_CTX *ctx)
  844.   	{
  845.   	int ret = 0, i, count = 0;

crypto/bn/bn_gf2m.c:854:7: Call
  852.   	if (w == NULL) goto err;
  853.   
  854.   	if (!BN_GF2m_mod_arr(a, a_, p)) goto err;
               ^
  855.   	
  856.   	if (BN_is_zero(a))

crypto/bn/bn_gf2m.c:313:1: Parameter `*p`
    311.   
    312.   /* Performs modular reduction of a and store result in r.  r could be a. */
    313. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[])
    314.   	{
    315.   	int j, k;

crypto/bn/bn_gf2m.c:866:15: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_solve_quad_arr` 
  864.   		/* compute half-trace of a */
  865.   		if (!BN_copy(z, a)) goto err;
  866.   		for (i = 1; i <= (p[0] - 1) / 2; i++)
                       ^
  867.   			{
  868.   			if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
