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


crypto/ec/ec_asn1.c:931:18: Call
929.       }
930.   
931.       if ((group = EC_GROUP_new_from_ecpkparameters(params)) == NULL) {
                        ^
932.           ECerr(EC_F_D2I_ECPKPARAMETERS, EC_R_PKPARAMETERS2GROUP_FAILURE);
933.           ECPKPARAMETERS_free(params);

crypto/ec/ec_asn1.c:881:1: Parameter `params->value.parameters->fieldID->p.char_two->m`
  879.   }
  880.   
  881. > EC_GROUP *EC_GROUP_new_from_ecpkparameters(const ECPKPARAMETERS *params)
  882.   {
  883.       EC_GROUP *ret = NULL;

crypto/ec/ec_asn1.c:901:15: Call
  899.       } else if (params->type == 1) { /* the parameters are given by a
  900.                                        * ECPARAMETERS structure */
  901.           ret = EC_GROUP_new_from_ecparameters(params->value.parameters);
                       ^
  902.           if (!ret) {
  903.               ECerr(EC_F_EC_GROUP_NEW_FROM_ECPKPARAMETERS, ERR_R_EC_LIB);

crypto/ec/ec_asn1.c:647:1: Parameter `params->fieldID->p.char_two->m`
    645.   }
    646.   
    647. > EC_GROUP *EC_GROUP_new_from_ecparameters(const ECPARAMETERS *params)
    648.   {
    649.       int ok = 0, tmp;

crypto/ec/ec_asn1.c:726:18: Call
    724.               if (!BN_set_bit(p, (int)char_two->m))
    725.                   goto err;
    726.               if (!BN_set_bit(p, (int)tmp_long))
                            ^
    727.                   goto err;
    728.               if (!BN_set_bit(p, 0))

crypto/bn/bn_lib.c:747:1: <LHS trace>
745.   }
746.   
747. > int BN_set_bit(BIGNUM *a, int n)
748.   {
749.       int i, j, k;

crypto/bn/bn_lib.c:747:1: Parameter `a->top`
      745.   }
      746.   
      747. > int BN_set_bit(BIGNUM *a, int n)
      748.   {
      749.       int i, j, k;

crypto/bn/bn_lib.c:759:37: Binary operation: ([-oo, 9223372036854775807] + 1):signed32 by call to `EC_GROUP_new_from_ecpkparameters` 
      757.           if (bn_wexpand(a, i + 1) == NULL)
      758.               return (0);
      759.           for (k = a->top; k < i + 1; k++)
                                                 ^
      760.               a->d[k] = 0;
      761.           a->top = i + 1;
