# Failed

run_tests.TestSimulation_mosek_conif.test_table_diff (from run_tests.TestSimulation_mosek_conif-20200710213428)

### Error Message

unsupported operand type(s) for -: 'list' and 'list'

### Stacktrace

Traceback (most recent call last): File "/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/lib/python3.5/unittest/case.py", line 861, in assertAlmostEqual if round(abs(second-first), places) == 0: 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. SGP not convergent: Cost rose by 1.2% 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.077% on GP solve 8. 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. Solution check warning: Sum of nu^T * A did not vanish. Final solution let signomial constraints slacken by 7.6%. 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.035%. 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.026%. 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.0033% on GP solve 5. 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.00035% on GP solve 7. 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.05% 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.085% 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.038% 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. SGP not convergent: Cost rose by 1.3% 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 4%. 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.018% 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.054%. 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.27% 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.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.00043% 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.