{"schema":"csl.opt12-build/1","source_commit":"7b732a53716ce963af83095fd2aeca8a681b76c4","build_owner_sha256":"f0aefdb6e6ac9abc1750ddd06aea25b42ffb8e275873610eeb855a1ba74db865","compiler":"MSVC","compiler_version":"19.44.35215.0","generator":"Visual Studio 17 2022","architecture":"AMD64/x64","configured_flags":"/DWIN32 /D_WINDOWS /EHsc","release_flags":"/O2 /Ob2 /DNDEBUG","configuration":"Release","ndebug":true} {"schema":"csl.opt12-fixture/1","scenario":"tiny-overhead","fixture":{"rows":1,"columns":1,"source_objective":[-1],"changed_objective":[-1],"coefficient":[1],"variable_bounds":{"lower":0,"upper":null},"row_sense":"upper","source_rhs":1,"changed_rhs":0.5,"expected_objective":-0.5}} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"cold","pair":0,"order":0,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":595000,"model_load_seconds":3.6999999999999998e-05,"basis_transfer_seconds":0,"solve_seconds":0.0003836,"native_attempts":[{"model_load_seconds":3.6999999999999998e-05,"basis_transfer_seconds":0,"solve_seconds":0.0003836,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=3.6999999999999998e-05\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.0003836\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -9.9999805444e-01 Ph1: 1(1); Du: 1(0.999998) 0s\n 1 -5.0000000000e-01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"warm","pair":0,"order":1,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":56300,"model_load_seconds":4.0999999999999997e-06,"basis_transfer_seconds":1.1000000000000001e-06,"solve_seconds":3.29e-05,"native_attempts":[{"model_load_seconds":4.0999999999999997e-06,"basis_transfer_seconds":1.1000000000000001e-06,"solve_seconds":3.29e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=4.0999999999999997e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=1.1000000000000001e-06\nnative.solve_seconds=3.29e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"warm","pair":1,"order":0,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":47700,"model_load_seconds":3.8e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.7800000000000001e-05,"native_attempts":[{"model_load_seconds":3.8e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.7800000000000001e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=3.8e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=6.9999999999999997e-07\nnative.solve_seconds=2.7800000000000001e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"cold","pair":1,"order":1,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":189300,"model_load_seconds":6.7000000000000002e-06,"basis_transfer_seconds":0,"solve_seconds":9.7200000000000004e-05,"native_attempts":[{"model_load_seconds":6.7000000000000002e-06,"basis_transfer_seconds":0,"solve_seconds":9.7200000000000004e-05,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=6.7000000000000002e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=9.7200000000000004e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -9.9999805444e-01 Ph1: 1(1); Du: 1(0.999998) 0s\n 1 -5.0000000000e-01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"cold","pair":2,"order":0,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":176100,"model_load_seconds":6.7000000000000002e-06,"basis_transfer_seconds":0,"solve_seconds":8.6899999999999998e-05,"native_attempts":[{"model_load_seconds":6.7000000000000002e-06,"basis_transfer_seconds":0,"solve_seconds":8.6899999999999998e-05,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=6.7000000000000002e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=8.6899999999999998e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -9.9999805444e-01 Ph1: 1(1); Du: 1(0.999998) 0s\n 1 -5.0000000000e-01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"warm","pair":2,"order":1,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":46700,"model_load_seconds":3.7000000000000002e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.7100000000000001e-05,"native_attempts":[{"model_load_seconds":3.7000000000000002e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.7100000000000001e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=3.7000000000000002e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=6.9999999999999997e-07\nnative.solve_seconds=2.7100000000000001e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"warm","pair":3,"order":0,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":44300,"model_load_seconds":3.4999999999999999e-06,"basis_transfer_seconds":5.9999999999999997e-07,"solve_seconds":2.58e-05,"native_attempts":[{"model_load_seconds":3.4999999999999999e-06,"basis_transfer_seconds":5.9999999999999997e-07,"solve_seconds":2.58e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=3.4999999999999999e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=5.9999999999999997e-07\nnative.solve_seconds=2.58e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"cold","pair":3,"order":1,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":175200,"model_load_seconds":5.0000000000000004e-06,"basis_transfer_seconds":0,"solve_seconds":9.6899999999999997e-05,"native_attempts":[{"model_load_seconds":5.0000000000000004e-06,"basis_transfer_seconds":0,"solve_seconds":9.6899999999999997e-05,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=5.0000000000000004e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=9.6899999999999997e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -9.9999805444e-01 Ph1: 1(1); Du: 1(0.999998) 0s\n 1 -5.0000000000e-01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"cold","pair":4,"order":0,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":178800,"model_load_seconds":6.9999999999999999e-06,"basis_transfer_seconds":0,"solve_seconds":9.48e-05,"native_attempts":[{"model_load_seconds":6.9999999999999999e-06,"basis_transfer_seconds":0,"solve_seconds":9.48e-05,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=6.9999999999999999e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=9.48e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -9.9999805444e-01 Ph1: 1(1); Du: 1(0.999998) 0s\n 1 -5.0000000000e-01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"warm","pair":4,"order":1,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":47900,"model_load_seconds":3.8e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.8399999999999999e-05,"native_attempts":[{"model_load_seconds":3.8e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.8399999999999999e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=3.8e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=6.9999999999999997e-07\nnative.solve_seconds=2.8399999999999999e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"warm","pair":5,"order":0,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":46000,"model_load_seconds":3.4999999999999999e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.6400000000000001e-05,"native_attempts":[{"model_load_seconds":3.4999999999999999e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.6400000000000001e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=3.4999999999999999e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=6.9999999999999997e-07\nnative.solve_seconds=2.6400000000000001e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"cold","pair":5,"order":1,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":173300,"model_load_seconds":5.0000000000000004e-06,"basis_transfer_seconds":0,"solve_seconds":9.6700000000000006e-05,"native_attempts":[{"model_load_seconds":5.0000000000000004e-06,"basis_transfer_seconds":0,"solve_seconds":9.6700000000000006e-05,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=5.0000000000000004e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=9.6700000000000006e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -9.9999805444e-01 Ph1: 1(1); Du: 1(0.999998) 0s\n 1 -5.0000000000e-01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"cold","pair":6,"order":0,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":191300,"model_load_seconds":6.4999999999999996e-06,"basis_transfer_seconds":0,"solve_seconds":0.0001069,"native_attempts":[{"model_load_seconds":6.4999999999999996e-06,"basis_transfer_seconds":0,"solve_seconds":0.0001069,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=6.4999999999999996e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.0001069\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -9.9999805444e-01 Ph1: 1(1); Du: 1(0.999998) 0s\n 1 -5.0000000000e-01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"tiny-overhead","mode":"warm","pair":6,"order":1,"status":"verified","expected_objective":-0.5,"objective":-0.5,"wall_ns":45400,"model_load_seconds":3.9999999999999998e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.6599999999999999e-05,"native_attempts":[{"model_load_seconds":3.9999999999999998e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":2.6599999999999999e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=tiny-overhead-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=3.9999999999999998e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=6.9999999999999997e-07\nnative.solve_seconds=2.6599999999999999e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-0.5\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-0.5\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 1 cols; 1 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [5e-01, 5e-01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -5.0000000000e-01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-fixture/1","scenario":"small-reuse","fixture":{"rows":1,"columns":40,"source_objective":[-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1],"changed_objective":[-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1],"coefficient":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"variable_bounds":{"lower":0,"upper":null},"row_sense":"upper","source_rhs":20,"changed_rhs":19,"expected_objective":-19}} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"cold","pair":0,"order":0,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":208500,"model_load_seconds":1.4100000000000001e-05,"basis_transfer_seconds":0,"solve_seconds":0.0001154,"native_attempts":[{"model_load_seconds":1.4100000000000001e-05,"basis_transfer_seconds":0,"solve_seconds":0.0001154,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=1.4100000000000001e-05\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.0001154\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -3.9999935912e+01 Ph1: 1(40); Du: 40(39.9999) 0s\n 1 -1.9000000000e+01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"warm","pair":0,"order":1,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":69400,"model_load_seconds":8.4999999999999999e-06,"basis_transfer_seconds":7.9999999999999996e-07,"solve_seconds":3.96e-05,"native_attempts":[{"model_load_seconds":8.4999999999999999e-06,"basis_transfer_seconds":7.9999999999999996e-07,"solve_seconds":3.96e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=8.4999999999999999e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=7.9999999999999996e-07\nnative.solve_seconds=3.96e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"warm","pair":1,"order":0,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":65700,"model_load_seconds":7.9000000000000006e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":3.7499999999999997e-05,"native_attempts":[{"model_load_seconds":7.9000000000000006e-06,"basis_transfer_seconds":6.9999999999999997e-07,"solve_seconds":3.7499999999999997e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=7.9000000000000006e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=6.9999999999999997e-07\nnative.solve_seconds=3.7499999999999997e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"cold","pair":1,"order":1,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":201500,"model_load_seconds":8.1000000000000004e-06,"basis_transfer_seconds":0,"solve_seconds":0.00011629999999999999,"native_attempts":[{"model_load_seconds":8.1000000000000004e-06,"basis_transfer_seconds":0,"solve_seconds":0.00011629999999999999,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=8.1000000000000004e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.00011629999999999999\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -3.9999935912e+01 Ph1: 1(40); Du: 40(39.9999) 0s\n 1 -1.9000000000e+01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"cold","pair":2,"order":0,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":204400,"model_load_seconds":9.2e-06,"basis_transfer_seconds":0,"solve_seconds":0.00011239999999999999,"native_attempts":[{"model_load_seconds":9.2e-06,"basis_transfer_seconds":0,"solve_seconds":0.00011239999999999999,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=9.2e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.00011239999999999999\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -3.9999935912e+01 Ph1: 1(40); Du: 40(39.9999) 0s\n 1 -1.9000000000e+01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"warm","pair":2,"order":1,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":65000,"model_load_seconds":7.1999999999999997e-06,"basis_transfer_seconds":7.9999999999999996e-07,"solve_seconds":3.68e-05,"native_attempts":[{"model_load_seconds":7.1999999999999997e-06,"basis_transfer_seconds":7.9999999999999996e-07,"solve_seconds":3.68e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=7.1999999999999997e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=7.9999999999999996e-07\nnative.solve_seconds=3.68e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"warm","pair":3,"order":0,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":62300,"model_load_seconds":7.0999999999999998e-06,"basis_transfer_seconds":5.9999999999999997e-07,"solve_seconds":3.5800000000000003e-05,"native_attempts":[{"model_load_seconds":7.0999999999999998e-06,"basis_transfer_seconds":5.9999999999999997e-07,"solve_seconds":3.5800000000000003e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=7.0999999999999998e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=5.9999999999999997e-07\nnative.solve_seconds=3.5800000000000003e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"cold","pair":3,"order":1,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":217400,"model_load_seconds":8.3000000000000002e-06,"basis_transfer_seconds":0,"solve_seconds":0.00012290000000000001,"native_attempts":[{"model_load_seconds":8.3000000000000002e-06,"basis_transfer_seconds":0,"solve_seconds":0.00012290000000000001,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=8.3000000000000002e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.00012290000000000001\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -3.9999935912e+01 Ph1: 1(40); Du: 40(39.9999) 0s\n 1 -1.9000000000e+01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"cold","pair":4,"order":0,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":208900,"model_load_seconds":9.9000000000000001e-06,"basis_transfer_seconds":0,"solve_seconds":0.00011519999999999999,"native_attempts":[{"model_load_seconds":9.9000000000000001e-06,"basis_transfer_seconds":0,"solve_seconds":0.00011519999999999999,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=9.9000000000000001e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.00011519999999999999\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -3.9999935912e+01 Ph1: 1(40); Du: 40(39.9999) 0s\n 1 -1.9000000000e+01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"warm","pair":4,"order":1,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":63200,"model_load_seconds":7.9999999999999996e-06,"basis_transfer_seconds":7.9999999999999996e-07,"solve_seconds":3.5599999999999998e-05,"native_attempts":[{"model_load_seconds":7.9999999999999996e-06,"basis_transfer_seconds":7.9999999999999996e-07,"solve_seconds":3.5599999999999998e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=7.9999999999999996e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=7.9999999999999996e-07\nnative.solve_seconds=3.5599999999999998e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"warm","pair":5,"order":0,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":64400,"model_load_seconds":7.7000000000000008e-06,"basis_transfer_seconds":5.9999999999999997e-07,"solve_seconds":3.7200000000000003e-05,"native_attempts":[{"model_load_seconds":7.7000000000000008e-06,"basis_transfer_seconds":5.9999999999999997e-07,"solve_seconds":3.7200000000000003e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=7.7000000000000008e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=5.9999999999999997e-07\nnative.solve_seconds=3.7200000000000003e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"cold","pair":5,"order":1,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":197800,"model_load_seconds":9.9000000000000001e-06,"basis_transfer_seconds":0,"solve_seconds":0.0001108,"native_attempts":[{"model_load_seconds":9.9000000000000001e-06,"basis_transfer_seconds":0,"solve_seconds":0.0001108,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=9.9000000000000001e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.0001108\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -3.9999935912e+01 Ph1: 1(40); Du: 40(39.9999) 0s\n 1 -1.9000000000e+01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"cold","pair":6,"order":0,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":194100,"model_load_seconds":9.3000000000000007e-06,"basis_transfer_seconds":0,"solve_seconds":0.00010840000000000001,"native_attempts":[{"model_load_seconds":9.3000000000000007e-06,"basis_transfer_seconds":0,"solve_seconds":0.00010840000000000001,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=9.3000000000000007e-06\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.00010840000000000001\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -3.9999935912e+01 Ph1: 1(40); Du: 40(39.9999) 0s\n 1 -1.9000000000e+01 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"small-reuse","mode":"warm","pair":6,"order":1,"status":"verified","expected_objective":-19,"objective":-19,"wall_ns":64100,"model_load_seconds":6.9999999999999999e-06,"basis_transfer_seconds":7.9999999999999996e-07,"solve_seconds":3.6699999999999998e-05,"native_attempts":[{"model_load_seconds":6.9999999999999999e-06,"basis_transfer_seconds":7.9999999999999996e-07,"solve_seconds":3.6699999999999998e-05,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":0,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=small-reuse-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=6.9999999999999999e-06\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=7.9999999999999996e-07\nnative.solve_seconds=3.6699999999999998e-05\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-19\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=0\noriginal.objective=-19\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 40 cols; 40 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 1e+00]\n Bound [0e+00, 0e+00]\n RHS [2e+01, 2e+01]\nSolving LP without presolve, or with basis, or unconstrained\nModel status : Optimal\nObjective value : -1.9000000000e+01\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.00\n"} {"schema":"csl.opt12-fixture/1","scenario":"transfer-cost","fixture":{"rows":1,"columns":100000,"source_objective":{"all_columns":1,"column_0":-1},"changed_objective":{"all_columns":1,"column_99999":-2},"coefficient":{"all_columns":1},"variable_bounds":{"lower":0,"upper":null},"row_sense":"upper","source_rhs":50000,"changed_rhs":49999,"expected_objective":-99998,"objective_change":"column 0: -1 to 1; column 99999: 1 to -2"}} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"cold","pair":0,"order":0,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":39870900,"model_load_seconds":0.0057330000000000002,"basis_transfer_seconds":0,"solve_seconds":0.0276431,"native_attempts":[{"model_load_seconds":0.0057330000000000002,"basis_transfer_seconds":0,"solve_seconds":0.0276431,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0057330000000000002\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.0276431\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -1.9999970893e+00 Ph1: 1(1); Du: 1(2) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"warm","pair":0,"order":1,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":43328300,"model_load_seconds":0.0043426999999999997,"basis_transfer_seconds":4.85e-05,"solve_seconds":0.0328245,"native_attempts":[{"model_load_seconds":0.0043426999999999997,"basis_transfer_seconds":4.85e-05,"solve_seconds":0.0328245,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":1,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0043426999999999997\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=4.85e-05\nnative.solve_seconds=0.0328245\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -4.0137870857e+00 Ph1: 1(51516); Du: 51516(4.01379) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"warm","pair":1,"order":0,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":43457000,"model_load_seconds":0.0041609000000000004,"basis_transfer_seconds":4.85e-05,"solve_seconds":0.032969600000000002,"native_attempts":[{"model_load_seconds":0.0041609000000000004,"basis_transfer_seconds":4.85e-05,"solve_seconds":0.032969600000000002,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":1,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0041609000000000004\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=4.85e-05\nnative.solve_seconds=0.032969600000000002\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -4.0137870857e+00 Ph1: 1(51516); Du: 51516(4.01379) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"cold","pair":1,"order":1,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":48636400,"model_load_seconds":0.0062706999999999997,"basis_transfer_seconds":0,"solve_seconds":0.034963000000000001,"native_attempts":[{"model_load_seconds":0.0062706999999999997,"basis_transfer_seconds":0,"solve_seconds":0.034963000000000001,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0062706999999999997\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.034963000000000001\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -1.9999970893e+00 Ph1: 1(1); Du: 1(2) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"cold","pair":2,"order":0,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":42445800,"model_load_seconds":0.0065063999999999999,"basis_transfer_seconds":0,"solve_seconds":0.029618200000000001,"native_attempts":[{"model_load_seconds":0.0065063999999999999,"basis_transfer_seconds":0,"solve_seconds":0.029618200000000001,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0065063999999999999\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.029618200000000001\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -1.9999970893e+00 Ph1: 1(1); Du: 1(2) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"warm","pair":2,"order":1,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":46271600,"model_load_seconds":0.0047441000000000002,"basis_transfer_seconds":4.8999999999999998e-05,"solve_seconds":0.035245100000000001,"native_attempts":[{"model_load_seconds":0.0047441000000000002,"basis_transfer_seconds":4.8999999999999998e-05,"solve_seconds":0.035245100000000001,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":1,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0047441000000000002\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=4.8999999999999998e-05\nnative.solve_seconds=0.035245100000000001\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -4.0137870857e+00 Ph1: 1(51516); Du: 51516(4.01379) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.04\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"warm","pair":3,"order":0,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":43926600,"model_load_seconds":0.0050585999999999999,"basis_transfer_seconds":5.0899999999999997e-05,"solve_seconds":0.032677699999999997,"native_attempts":[{"model_load_seconds":0.0050585999999999999,"basis_transfer_seconds":5.0899999999999997e-05,"solve_seconds":0.032677699999999997,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":1,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0050585999999999999\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=5.0899999999999997e-05\nnative.solve_seconds=0.032677699999999997\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -4.0137870857e+00 Ph1: 1(51516); Du: 51516(4.01379) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"cold","pair":3,"order":1,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":40517500,"model_load_seconds":0.0056315999999999996,"basis_transfer_seconds":0,"solve_seconds":0.028481200000000002,"native_attempts":[{"model_load_seconds":0.0056315999999999996,"basis_transfer_seconds":0,"solve_seconds":0.028481200000000002,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0056315999999999996\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.028481200000000002\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -1.9999970893e+00 Ph1: 1(1); Du: 1(2) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"cold","pair":4,"order":0,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":40943600,"model_load_seconds":0.0055087000000000001,"basis_transfer_seconds":0,"solve_seconds":0.0293466,"native_attempts":[{"model_load_seconds":0.0055087000000000001,"basis_transfer_seconds":0,"solve_seconds":0.0293466,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0055087000000000001\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.0293466\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -1.9999970893e+00 Ph1: 1(1); Du: 1(2) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"warm","pair":4,"order":1,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":44470900,"model_load_seconds":0.0046848999999999997,"basis_transfer_seconds":4.8699999999999998e-05,"solve_seconds":0.033027500000000001,"native_attempts":[{"model_load_seconds":0.0046848999999999997,"basis_transfer_seconds":4.8699999999999998e-05,"solve_seconds":0.033027500000000001,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":1,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0046848999999999997\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=4.8699999999999998e-05\nnative.solve_seconds=0.033027500000000001\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -4.0137870857e+00 Ph1: 1(51516); Du: 51516(4.01379) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"warm","pair":5,"order":0,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":51253600,"model_load_seconds":0.0051878999999999996,"basis_transfer_seconds":4.8699999999999998e-05,"solve_seconds":0.039979099999999997,"native_attempts":[{"model_load_seconds":0.0051878999999999996,"basis_transfer_seconds":4.8699999999999998e-05,"solve_seconds":0.039979099999999997,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":1,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0051878999999999996\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=4.8699999999999998e-05\nnative.solve_seconds=0.039979099999999997\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -4.0137870857e+00 Ph1: 1(51516); Du: 51516(4.01379) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.04\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"cold","pair":5,"order":1,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":42244600,"model_load_seconds":0.0061406999999999998,"basis_transfer_seconds":0,"solve_seconds":0.029562399999999999,"native_attempts":[{"model_load_seconds":0.0061406999999999998,"basis_transfer_seconds":0,"solve_seconds":0.029562399999999999,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0061406999999999998\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.029562399999999999\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -1.9999970893e+00 Ph1: 1(1); Du: 1(2) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"cold","pair":6,"order":0,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":42740600,"model_load_seconds":0.0060042000000000003,"basis_transfer_seconds":0,"solve_seconds":0.030202699999999999,"native_attempts":[{"model_load_seconds":0.0060042000000000003,"basis_transfer_seconds":0,"solve_seconds":0.030202699999999999,"cache_state":"disabled","basis_accepted":false,"native_run":true}],"simplex_iterations":1,"cache_state":"disabled","basis_accepted":false,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0060042000000000003\nnative.load_status=0\nwarm_start.enabled=false\nwarm_start.cache_state=disabled\nnative.solve_seconds=0.030202699999999999\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\ncertificates=unavailable\nnative.log:\nRunning HiGHS 1.11.0 (git hash: n/a): Copyright (c) 2025 HiGHS under MIT licence terms\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -1.9999970893e+00 Ph1: 1(1); Du: 1(2) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"} {"schema":"csl.opt12-cost-trial/1","scenario":"transfer-cost","mode":"warm","pair":6,"order":1,"status":"verified","expected_objective":-99998,"objective":-99998,"wall_ns":40741500,"model_load_seconds":0.0049969999999999997,"basis_transfer_seconds":4.8300000000000002e-05,"solve_seconds":0.0296609,"native_attempts":[{"model_load_seconds":0.0049969999999999997,"basis_transfer_seconds":4.8300000000000002e-05,"solve_seconds":0.0296609,"cache_state":"compatible","basis_accepted":true,"native_run":true}],"simplex_iterations":1,"cache_state":"compatible","basis_accepted":true,"diagnostics":"adapter.version=1.1.0+highs.1.11.0\nnative.version=1.11.0\nnative.githash=n/a\nnative.archive_sha256=2b44b074cf41439325ce4d0bbdac2d51379f56faf17ba15320a410d3c1f07275\nnative.downstream.hvectorbase_sha256=f0f4f4f4a4b33088c3b30e63bbe5796c7c2fd498600a7e2acc8002bc4e7eace3\nprogram.problem=opt12-measure\nprogram.id=transfer-cost-changed\noptions.solver=simplex\noptions.presolve=off\noptions.parallel=off\noptions.threads=1\noptions.random_seed=0\noptions.allow_unbounded_or_infeasible=false\noptions.log_to_console=true\nlogging.destination=callback\noptions.absolute_tolerance=1e-08\nresidual.relative_tolerance=1e-08\noptions.small_matrix_value=1e-12\noptions.infinite_bound=inf\noptions.infinite_cost=inf\noptions.large_matrix_value=inf\noptions.iteration_limit=2147483647\noptions.time_limit=inf\nmodel.reused=false\nnative.load_seconds=0.0049969999999999997\nnative.load_status=0\nwarm_start.enabled=true\nwarm_start.cache_state=compatible\nwarm_start.install_status=0\nwarm_start.accepted=true\nwarm_start.setup_seconds=4.8300000000000002e-05\nnative.solve_seconds=0.0296609\nnative_run=true\nnative.call_status=0\nnative.call_status_name=OK\nnative.model_status=7\nnative.model_status_name=Optimal\nstop=none\nnative.info=available\nnative.objective=-99998\nnative.primal_infeasibility=0\nnative.dual_infeasibility=0\nnative.simplex_iterations=1\noriginal.objective=-99998\ncomplementarity=unavailable\nbasis=unavailable\ncertificate.extraction=not_requested\nwarm_start.next_cache=stored\ncertificates=unavailable\nnative.log:\nLP has 1 rows; 100000 cols; 100000 nonzeros\nCoefficient ranges:\n Matrix [1e+00, 1e+00]\n Cost [1e+00, 2e+00]\n Bound [0e+00, 0e+00]\n RHS [5e+04, 5e+04]\nSolving LP without presolve, or with basis, or unconstrained\nUsing EKK dual simplex solver - serial\n Iteration Objective Infeasibilities num(sum)\n 0 -4.0137870857e+00 Ph1: 1(51516); Du: 51516(4.01379) 0s\n 1 -9.9998000000e+04 Pr: 0(0) 0s\nModel status : Optimal\nSimplex iterations: 1\nObjective value : -9.9998000000e+04\nP-D objective error : 0.0000000000e+00\nHiGHS run time : 0.03\n"}