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


crypto/bn/bn_gf2m.c:853:6: Call
851.   	unsigned int *arr=NULL, ret = 0;
852.   	if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
853.   	if (BN_GF2m_poly2arr(p, arr, max) > max)
            ^
854.   		{
855.   		BNerr(BN_F_BN_GF2M_MOD_EXP,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:858:8: Call
856.   		goto err;
857.   		}
858.   	ret = BN_GF2m_mod_sqrt_arr(r, a, arr, ctx);
              ^
859.   	bn_check_top(r);
860.     err:

crypto/bn/bn_gf2m.c:823:1: <LHS trace>
821.    * Uses exponentiation as in algorithm A.4.1 from IEEE P1363.
822.    */
823. > int	BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], BN_CTX *ctx)
824.   	{
825.   	int ret = 0;

crypto/bn/bn_gf2m.c:823:1: Parameter `*p`
  821.    * Uses exponentiation as in algorithm A.4.1 from IEEE P1363.
  822.    */
  823. > int	BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], BN_CTX *ctx)
  824.   	{
  825.   	int ret = 0;

crypto/bn/bn_gf2m.c:832:7: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_sqrt_arr` 
  830.   	
  831.   	if (!BN_zero(u)) goto err;
  832.   	if (!BN_set_bit(u, p[0] - 1)) goto err;
               ^
  833.   	ret = BN_GF2m_mod_exp_arr(r, a, u, p, ctx);
  834.   	bn_check_top(r);
