Package evaluation to test MultiObjectiveAlgorithms on Julia 1.14.0-DEV.1674 (5735163b34*) started at 2026-02-03T17:13:29.800 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 10.27s ################################################################################ # Installation # Installing MultiObjectiveAlgorithms... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [0327d340] + MultiObjectiveAlgorithms v1.8.2 Updating `~/.julia/environments/v1.14/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.3 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.1.0 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.3.2 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.4.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.49.0 [0327d340] + MultiObjectiveAlgorithms v1.8.2 [d8a4904e] + MutableArithmetics v1.6.7 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [276daf66] + SpecialFunctions v2.6.1 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.6.2 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.30+0 [05823500] + OpenLibm_jll v0.8.7+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 5.1s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 1357.1 ms ✓ SPRAL_jll 6242.0 ms ✓ MathOptIIS 7079.2 ms ✓ MultiObjectiveAlgorithms 11736.6 ms ✓ Polyhedra 1388.7 ms ✓ Ipopt_jll 31146.7 ms ✓ HiGHS 6763.9 ms ✓ MultiObjectiveAlgorithms → MultiObjectiveAlgorithmsPolyhedraExt 1269.7 ms ✓ Ipopt 45695.2 ms ✓ Ipopt → IpoptMathOptInterfaceExt 9 dependencies successfully precompiled in 114 seconds. 78 already precompiled. Precompilation completed after 133.41s ################################################################################ # Testing # Testing MultiObjectiveAlgorithms Status `/tmp/jl_wZ5enZ/Project.toml` [861a8166] Combinatorics v1.1.0 [87dc4568] HiGHS v1.20.1 [b6b21f68] Ipopt v1.14.0 [682c06a0] JSON v1.4.0 [b8f27783] MathOptInterface v1.49.0 [0327d340] MultiObjectiveAlgorithms v1.8.2 [67491407] Polyhedra v0.8.1 [de0858da] Printf v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_wZ5enZ/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.3 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.1.0 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.3.2 [14197337] GenericLinearAlgebra v0.3.19 [87dc4568] HiGHS v1.20.1 [b6b21f68] Ipopt v1.14.0 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.49.0 [0327d340] MultiObjectiveAlgorithms v1.8.2 [d8a4904e] MutableArithmetics v1.6.7 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [67491407] Polyhedra v0.8.1 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [276daf66] SpecialFunctions v2.6.1 [90137ffa] StaticArrays v1.9.16 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [ec057cc2] StructUtils v2.6.2 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [8fd58aa0] HiGHS_jll v1.12.0+0 [e33a78d0] Hwloc_jll v2.12.2+0 [9cc047cb] Ipopt_jll v300.1400.1901+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.200+0 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [319450e9] SPRAL_jll v2025.9.18+0 ⌅ [02c8fc9c] XML2_jll v2.13.9+0 [a65dc6b1] Xorg_libpciaccess_jll v0.18.1+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.18.0+0 [e37daf67] LibGit2_jll v1.9.2+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.12.2 [4536629a] OpenBLAS_jll v0.3.30+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.5+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.68.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 6.00641e+00 Time spent in subproblems: 4.91367e+00 (82%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 7.64313e+00 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 7.64326e+00 Time spent in subproblems: 7.36548e+00 (96%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 2.16159e-01 2 -5.77797e+01 -6.19322e+01 4.07227e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 1 Total solve time: 4.07330e-01 Time spent in subproblems: 3.93813e-01 (97%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Chalmet ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -5.77797e+01 -6.19322e+01 2.68876e-01 2 -5.77797e+01 -6.19322e+01 3.87338e-01 3 -6.88750e+01 -5.72500e+01 7.38656e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 1 Total solve time: 7.38771e-01 Time spent in subproblems: 7.37627e-01 (100%) Number of subproblems: 6 ---------------------------------------------- ------------------------------------------------------------------------ MultiObjectiveAlgorithms.jl ------------------------------------------------------------------------ Algorithm: Chalmet ------------------------------------------------------------------------ solve # Obj. 1 Obj. 2 Obj. 3 Obj. 4 Time ------------------------------------------------------------------------ Test Summary: | Pass Total Time Chalmet.jl | 43 43 2m06.4s ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit https://github.com/coin-or/Ipopt ****************************************************************************** ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.43071e-01 Time spent in subproblems: 1.10910e-02 (3%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 3.25271e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 3.25352e-01 Time spent in subproblems: 3.19233e-01 (98%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 1.92166e-01 2 5.77797e+01 6.19322e+01 3.37522e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 2 Total solve time: 3.37680e-01 Time spent in subproblems: 3.36828e-01 (100%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Dichotomy ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 6.88750e+01 5.72500e+01 3.23112e-01 2 5.77797e+01 6.19322e+01 4.65414e-01 3 6.80000e+01 5.90000e+01 6.45094e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 3 Total solve time: 6.45164e-01 Time spent in subproblems: 6.44383e-01 (100%) Number of subproblems: 4 ---------------------------------------------- Test Summary: | Pass Total Time Dichotomy.jl | 126 126 1m34.2s Test Summary: | Pass Total Time DominguezRios.jl | 1171 1171 10m28.7s HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.63325e+00 Time spent in subproblems: 1.13308e-02 (1%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 4.02901e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.03190e-01 Time spent in subproblems: 4.01083e-01 (99%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.39191e-01 2 -6.88750e+01 -5.72500e+01 4.42604e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.42741e-01 Time spent in subproblems: 4.42056e-01 (100%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: EpsilonConstraint ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.44081e-01 2 -6.88750e+01 -5.72500e+01 4.41981e-01 3 -5.77797e+01 -6.19322e+01 6.09738e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 6.09856e-01 Time spent in subproblems: 6.08516e-01 (100%) Number of subproblems: 6 ---------------------------------------------- ------------------------------------------------------------------------ MultiObjectiveAlgorithms.jl ------------------------------------------------------------------------ Algorithm: EpsilonConstraint ------------------------------------------------------------------------ solve # Obj. 1 Obj. 2 Obj. 3 Obj. 4 Time ------------------------------------------------------------------------ Test Summary: | Pass Broken Total Time EpsilonConstraint.jl | 582 1 583 3m49.7s Test Summary: | Pass Total Time Hierarchical.jl | 21 21 5.4s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 8.67025e-01 Time spent in subproblems: 1.18740e-02 (1%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.72069e-01 ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.KirlikSayin` algorithm because the anti-ideal point of objective 1 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 1 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.46464e+00 Time spent in subproblems: 3.70659e-01 (25%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.16793e-01 2 -3.67843e+01 -4.93137e+01 4.60074e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.60151e-01 Time spent in subproblems: 3.47646e-01 (76%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.29160e-01 2 -3.67843e+01 -4.93137e+01 4.49940e-01 3 -5.77797e+01 -6.19322e+01 5.96655e-01 ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.KirlikSayin` algorithm because the anti-ideal point of objective 2 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 2 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.96913e-01 Time spent in subproblems: 5.96002e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.25943e-01 2 -3.67843e+01 -4.93137e+01 5.38708e-01 3 -5.77797e+01 -6.19322e+01 7.13232e-01 4 -4.92857e+01 -4.27143e+01 9.01020e-01 5 auxillary subproblem 9.92417e-01 ---------------------------------------------- termination_status: OPTIMAL result_count: 0 Total solve time: 9.92566e-01 Time spent in subproblems: 9.00202e-01 (91%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: KirlikSayin ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 1.36518e-01 2 -3.67843e+01 -4.93137e+01 2.26424e-01 3 -5.77797e+01 -6.19322e+01 3.60804e-01 4 -4.92857e+01 -4.27143e+01 5.07866e-01 5 auxillary subproblem 6.46954e-01 6 subproblem not optimal 8.80309e-01 ---------------------------------------------- termination_status: OPTIMAL result_count: 0 Total solve time: 1.10596e+00 Time spent in subproblems: 6.45792e-01 (58%) Number of subproblems: 6 ---------------------------------------------- Test Summary: | Pass Total Time KirlikSayin.jl | 697 697 3m29.9s Test Summary: | Pass Total Time Lexicographic.jl | 48 48 15.4s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: RandomWeighting ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- Test Summary: | Pass Total Time RandomWeighting.jl | 24 24 6.9s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Sandwiching ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 2.53273e+00 Time spent in subproblems: 4.30204e-01 (17%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Sandwiching ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.Sandwiching` algorithm because the anti-ideal point of objective 1 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 1 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.44811e+00 Time spent in subproblems: 1.41965e+00 (98%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Sandwiching ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.50742e-01 Time spent in subproblems: 3.93907e-01 (72%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Sandwiching ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.Sandwiching` algorithm because the anti-ideal point of objective 2 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 2 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 5.69532e-01 Time spent in subproblems: 5.68862e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: Sandwiching ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.97628e+00 Time spent in subproblems: 6.55068e-01 (33%) Number of subproblems: 5 ---------------------------------------------- Test Summary: | Pass Total Time Sandwiching.jl | 40 40 42.9s ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.18328e+00 Time spent in subproblems: 1.13790e-02 (1%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.95538e-01 ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.TambyVanderpooten` algorithm because the anti-ideal point of objective 1 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 1 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 4.06154e-01 Time spent in subproblems: 3.93625e-01 (97%) Number of subproblems: 3 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 2.01773e-01 2 -3.67843e+01 -4.93137e+01 3.77526e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 3.77605e-01 Time spent in subproblems: 3.65015e-01 (97%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.29161e-01 2 -3.67843e+01 -4.93137e+01 4.63802e-01 3 -5.77797e+01 -6.19322e+01 6.36510e-01 ┌ Warning: Unable to solve the model using the `MultiObjectiveAlgorithms.TambyVanderpooten` algorithm because the anti-ideal point of objective 2 is not bounded above, and the algorithm requires a finitely bounded objective domain. The easiest way to fix this is to add objective 2 as a constraint with a finite upper. Alteratively, ensure that all of your decision variables have finite lower and upper bounds. └ @ MultiObjectiveAlgorithms ~/.julia/packages/MultiObjectiveAlgorithms/0zJz1/src/MultiObjectiveAlgorithms.jl:976 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 6.36776e-01 Time spent in subproblems: 6.35773e-01 (100%) Number of subproblems: 4 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.08141e-01 2 -3.67843e+01 -4.93137e+01 4.42718e-01 3 -5.77797e+01 -6.19322e+01 5.93547e-01 4 -4.92857e+01 -4.27143e+01 7.75106e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 7.75264e-01 Time spent in subproblems: 7.74193e-01 (100%) Number of subproblems: 5 ---------------------------------------------- ---------------------------------------------- MultiObjectiveAlgorithms.jl ---------------------------------------------- Algorithm: TambyVanderpooten ---------------------------------------------- solve # Obj. 1 Obj. 2 Time ---------------------------------------------- 1 -6.88750e+01 -5.72500e+01 3.20333e-01 2 -3.67843e+01 -4.93137e+01 4.95637e-01 3 -5.77797e+01 -6.19322e+01 6.67600e-01 4 -4.92857e+01 -4.27143e+01 8.40629e-01 ---------------------------------------------- termination_status: NUMERICAL_ERROR result_count: 0 Total solve time: 1.00773e+00 Time spent in subproblems: 1.00658e+00 (100%) Number of subproblems: 6 ---------------------------------------------- Test Summary: | Pass Total Time TambyVanderpooten.jl | 697 697 4m15.2s Test Summary: | Total Time algorithms | 0 0.0s Test Summary: | Total Time mock_optimizer.jl | 0 0.0s Test Summary: | Total Time problems.jl | 0 0.0s Test Summary: | Total Time runtests.jl | 0 0.0s ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 103 running 1 of 1 signal (10): User defined signal 1 _ZN4llvm15ValueHandleBase17RemoveFromUseListEv at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm8DenseMapINS_18ValueMapCallbackVHIPKNS_5ValueENS_14WeakTrackingVHENS_14ValueMapConfigIS4_NS_3sys10SmartMutexILb0EEEEEEES5_NS_12DenseMapInfoISB_vEENS_6detail12DenseMapPairISB_S5_EEE4growEj at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm12DenseMapBaseINS_8DenseMapINS_18ValueMapCallbackVHIPKNS_5ValueENS_14WeakTrackingVHENS_14ValueMapConfigIS5_NS_3sys10SmartMutexILb0EEEEEEES6_NS_12DenseMapInfoISC_vEENS_6detail12DenseMapPairISC_S6_EEEESC_S6_SE_SH_E20InsertIntoBucketImplISC_EEPSH_RKT_SL_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm8ValueMapIPKNS_5ValueENS_14WeakTrackingVHENS_14ValueMapConfigIS3_NS_3sys10SmartMutexILb0EEEEEEixERKS3_.isra.0 at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm15CloneBasicBlockEPKNS_10BasicBlockERNS_8ValueMapIPKNS_5ValueENS_14WeakTrackingVHENS_14ValueMapConfigIS6_NS_3sys10SmartMutexILb0EEEEEEERKNS_5TwineEPNS_8FunctionEPNS_14ClonedCodeInfoE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm21CloneFunctionBodyIntoERNS_8FunctionERKS0_RNS_8ValueMapIPKNS_5ValueENS_14WeakTrackingVHENS_14ValueMapConfigIS7_NS_3sys10SmartMutexILb0EEEEEEENS_10RemapFlagsERNS_15SmallVectorImplIPNS_10ReturnInstEEEPKcPNS_14ClonedCodeInfoEPNS_20ValueMapTypeRemapperEPNS_17ValueMaterializerEPKNS_11SmallPtrSetIPKNS_8MetadataELj16EEE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) _ZN4llvm17CloneFunctionIntoEPNS_8FunctionEPKS0_RNS_8ValueMapIPKNS_5ValueENS_14WeakTrackingVHENS_14ValueMapConfigIS7_NS_3sys10SmartMutexILb0EEEEEEENS_23CloneFunctionChangeTypeERNS_15SmallVectorImplIPNS_10ReturnInstEEEPKcPNS_14ClonedCodeInfoEPNS_20ValueMapTypeRemapperEPNS_17ValueMaterializerE at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) removeAddrspaces at /source/src/llvm-remove-addrspaces.cpp:357 run at /source/src/llvm-remove-addrspaces.cpp:430 run at /source/src/llvm-remove-addrspaces.cpp:456 run at /source/usr/include/llvm/IR/PassManagerInternal.h:91 _ZN4llvm11PassManagerINS_6ModuleENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM.so.20.1jl (unknown line) run at /source/src/pipeline.cpp:787 operator() at /source/src/jitlayers.cpp:1520 withModuleDo<(anonymous namespace)::sizedOptimizerT::operator()(llvm::orc::ThreadSafeModule) [with long unsigned int N = 4]:: > at /source/usr/include/llvm/ExecutionEngine/Orc/ThreadSafeModule.h:136 [inlined] operator() at /source/src/jitlayers.cpp:1480 [inlined] operator() at /source/src/jitlayers.cpp:1656 [inlined] addModule at /source/src/jitlayers.cpp:2129 jl_compile_codeinst_now at /source/src/jitlayers.cpp:688 jl_compile_codeinst_impl at /source/src/jitlayers.cpp:882 jl_compile_method_internal at /source/src/gf.c:3652 _jl_invoke at /source/src/gf.c:4112 [inlined] ijl_apply_generic at /source/src/gf.c:4317 macro expansion at /home/pkgeval/.julia/packages/MathOptInterface/Q3V1z/src/Test/Test.jl:270 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/Test/src/Test.jl:2244 [inlined] #runtests#2 at /home/pkgeval/.julia/packages/MathOptInterface/Q3V1z/src/Test/Test.jl:265 runtests at /home/pkgeval/.julia/packages/MathOptInterface/Q3V1z/src/Test/Test.jl:223 [inlined] test_moi_runtests at /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/0zJz1/test/test_model.jl:32 unknown function (ip: 0x77f89703ff4f) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 macro expansion at /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/0zJz1/test/test_model.jl:18 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/Test/src/Test.jl:2244 [inlined] run_tests at /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/0zJz1/test/test_model.jl:18 unknown function (ip: 0x77f89702e07f) at (unknown file) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:765 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_78407.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 macro expansion at /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/0zJz1/test/runtests.jl:14 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.14/Test/src/Test.jl:2325 [inlined] top-level scope at /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/0zJz1/test/runtests.jl:2349 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_invoke at /source/src/gf.c:4127 ijl_eval_thunk at /source/src/toplevel.c:757 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 include_string at ./loading.jl:3130 _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 _include at ./loading.jl:3190 include at ./Base.jl:310 IncludeInto at ./Base.jl:311 jfptr_IncludeInto_78407.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:884 ijl_eval_thunk at /source/src/toplevel.c:765 jl_toplevel_eval_flex at /source/src/toplevel.c:712 jl_eval_toplevel_stmts at /source/src/toplevel.c:602 jl_toplevel_eval_flex at /source/src/toplevel.c:684 ijl_toplevel_eval at /source/src/toplevel.c:779 ijl_toplevel_eval_in at /source/src/toplevel.c:824 eval at ./boot.jl:489 exec_options at ./client.jl:310 _start at ./client.jl:585 jfptr__start_47170.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1138 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x77f8da951249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile. --trace-compile is enabled during profile collection. ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_47622.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point. Disabling --trace-compile ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.14/Profile/src/Profile.jl:1361 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007a3e40c824a0 Total snapshots: 425. Utilization: 0% ╎425 @Base/task.jl:1168 wait_forever() 424╎ 425 @Base/task.jl:1246 wait() [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 wait at ./task.jl:1246 wait_forever at ./task.jl:1168 jfptr_wait_forever_47622.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:4120 [inlined] ijl_apply_generic at /source/src/gf.c:4317 jl_apply at /source/src/julia.h:2285 [inlined] start_task at /source/src/task.c:1275 unknown function (ip: (nil)) at (unknown file) Allocations: 16671418 (Pool: 16670770; Big: 648); GC: 14 HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); HighsMipSolverData::transformNewIntegerFeasibleSolution tmpSolver.run(); [103] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/MultiObjectiveAlgorithms/0zJz1/test/test_model.jl:276 _dl_catch_error at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x77f8dab4babf) at /lib64/ld-linux-x86-64.so.2 unknown function (ip: (nil)) at (unknown file) Allocations: 415119290 (Pool: 415115133; Big: 4157); GC: 107 PkgEval terminated after 2722.61s: test duration exceeded the time limit