crypto/ec/ec_asn1.c:1015: error: INTEGER_OVERFLOW_L2
  ([0, 9223372036854775807] + 1):signed32 by call to `ec_asn1_pkparameters2group`.
Showing all 8 steps of the trace


crypto/ec/ec_asn1.c:1015:22: Call
1013.       if (priv_key->parameters) {
1014.           EC_GROUP_clear_free(ret->group);
1015.           ret->group = ec_asn1_pkparameters2group(priv_key->parameters);
                             ^
1016.       }
1017.   

crypto/ec/ec_asn1.c:912:1: Parameter `params->value.parameters->fieldID->p.char_two->m`
  910.   }
  911.   
  912. > EC_GROUP *ec_asn1_pkparameters2group(const ECPKPARAMETERS *params)
  913.   {
  914.       EC_GROUP *ret = NULL;

crypto/ec/ec_asn1.c:932:15: Call
  930.       } else if (params->type == 1) { /* the parameters are given by a
  931.                                        * ECPARAMETERS structure */
  932.           ret = ec_asn1_parameters2group(params->value.parameters);
                       ^
  933.           if (!ret) {
  934.               ECerr(EC_F_EC_ASN1_PKPARAMETERS2GROUP, ERR_R_EC_LIB);

crypto/ec/ec_asn1.c:678:1: Parameter `params->fieldID->p.char_two->m`
    676.   }
    677.   
    678. > static EC_GROUP *ec_asn1_parameters2group(const ECPARAMETERS *params)
    679.   {
    680.       int ok = 0, tmp;

crypto/ec/ec_asn1.c:757:18: Call
    755.               if (!BN_set_bit(p, (int)char_two->m))
    756.                   goto err;
    757.               if (!BN_set_bit(p, (int)tmp_long))
                            ^
    758.                   goto err;
    759.               if (!BN_set_bit(p, 0))

crypto/bn/bn_lib.c:669:1: <LHS trace>
667.   }
668.   
669. > int BN_set_bit(BIGNUM *a, int n)
670.   {
671.       int i, j, k;

crypto/bn/bn_lib.c:669:1: Parameter `a->top`
      667.   }
      668.   
      669. > int BN_set_bit(BIGNUM *a, int n)
      670.   {
      671.       int i, j, k;

crypto/bn/bn_lib.c:679:13: Binary operation: ([0, 9223372036854775807] + 1):signed32 by call to `ec_asn1_pkparameters2group` 
      677.       j = n % BN_BITS2;
      678.       if (a->top <= i) {
      679.           if (bn_wexpand(a, i + 1) == NULL)
                         ^
      680.               return (0);
      681.           for (k = a->top; k < i + 1; k++)
