Failed
run_tests.TestSimulation_mosek_conif.test_table_diff (from run_tests.TestSimulation_mosek_conif-20200710213346)
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_RM_robust_Push/mosek/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 9% 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 9% 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 9% 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. Final solution let signomial constraints slacken by 1.5%. 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.024% 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.011% 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 0.045% 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 9% 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 9.4% 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.33% 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 9% 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 9% 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 9% 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 9% 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 9% 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. Final solution let signomial constraints slacken by 0.025%. 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 1% 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.0048%. 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.11% 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.025% 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 0.18% 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 9% 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 9.4% 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.33% 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 9% 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 9% 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.