Failed
run_tests.TestSimulation_mosek_cli.test_table_diff (from run_tests.TestSimulation_mosek_cli-20200714174842)
Failing for the past 1 build
(Since Failed
)
Error Message
unsupported operand type(s) for -: 'list' and 'list'
Stacktrace
Traceback (most recent call last): File "/Users/jenkins/workspace/CE_gplibrary_Push_research_models/mosek/robust/robust/testing/t_simulation.py", line 107, in test_table_diff self.assertAlmostEqual(open(origfilename, 'r').readlines(), open(filename, 'r').readlines()) File "/usr/local/opt/python/Frameworks/Python.framework/Versions/3.7/lib/python3.7/unittest/case.py", line 883, in assertAlmostEqual diff = abs(first - second) TypeError: unsupported operand type(s) for -: 'list' and 'list'
Standard Output
SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 3. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. Final solution let signomial constraints slacken by 0.058%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`. Final solution let signomial constraints slacken by 0.31%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`. SGP not convergent: Cost rose by 0.2% on GP solve 4. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. Final solution let signomial constraints slacken by 0.0093%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`. SGP not convergent: Cost rose by 0.023% on GP solve 3. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 0.07% on GP solve 3. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 0.0076% on GP solve 3. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8.1% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 0.46% on GP solve 4. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 0.00052% on GP solve 6. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. Final solution let signomial constraints slacken by 0.2%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`. SGP not convergent: Cost rose by 0.0058% on GP solve 6. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. Final solution let signomial constraints slacken by 0.71%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`. Final solution let signomial constraints slacken by 0.061%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`. Final solution let signomial constraints slacken by 0.037%. Calling .localsolve with a higher `pccp_penalty` (it was 200 this time) will reduce final slack if the model is solvable with less. If you think it might not be, check by solving with `use_pccp=False, x0=(this model's final solution)`. SGP not convergent: Cost rose by 0.067% on GP solve 3. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8.1% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 0.46% on GP solve 4. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities. SGP not convergent: Cost rose by 8% on GP solve 2. Details can be found in `m.program.results` or by solving at a higher verbosity. Note that convergence is not guaranteed for models with SignomialEqualities.