crypto/bn/bn_gf2m.c:959: 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:954:6: Call
952.   	unsigned int *arr=NULL, ret = 0;
953.   	if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
954.   	if (BN_GF2m_poly2arr(p, arr, max) > max)
            ^
955.   		{
956.   		BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD,BN_R_INVALID_LENGTH);

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

crypto/bn/bn_gf2m.c:959:8: Call
957.   		goto err;
958.   		}
959.   	ret = BN_GF2m_mod_solve_quad_arr(r, a, arr, ctx);
              ^
960.   	bn_check_top(r);
961.     err:

crypto/bn/bn_gf2m.c:868:1: <LHS trace>
866.    * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
867.    */
868. > int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const unsigned int p[], BN_CTX *ctx)
869.   	{
870.   	int ret = 0, count = 0;

crypto/bn/bn_gf2m.c:868:1: Parameter `*p`
  866.    * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
  867.    */
  868. > int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const unsigned int p[], BN_CTX *ctx)
  869.   	{
  870.   	int ret = 0, count = 0;

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:320:1: Parameter `*p`
    318.   
    319.   /* Performs modular reduction of a and store result in r.  r could be a. */
    320. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[])
    321.   	{
    322.   	int j, k;

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