Package evaluation to test EAGO on Julia 1.12.6 (15346901f00) started at 2026-06-29T12:01:10.133 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.12` Set-up completed after 6.34s ################################################################################ # Installation # Installing EAGO... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [bb8be931] + EAGO v0.9.2 Updating `~/.julia/environments/v1.12/Manifest.toml` [1520ce14] + AbstractTrees v0.4.5 [79e6a3ab] + Adapt v4.7.0 [a9b6321e] + Atomix v1.1.3 [d3bc4f2e] + BranchAndPrune v0.2.2 [96374032] + CRlibm v1.0.2 [7057c7e9] + Cassette v0.3.14 [d360d2e6] + ChainRulesCore v1.26.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.1 [b7a15901] + CoreMath v0.1.0 [864edb3b] + DataStructures v0.19.6 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [bb8be931] + EAGO v0.9.2 [90fa49ef] + ErrorfreeArithmetic v0.5.2 [fa42c844] + FastRounding v0.3.1 [f6369f11] + ForwardDiff v1.4.1 [60bf3e95] + GLPK v1.2.1 [46192b85] + GPUArraysCore v0.2.0 [076d061b] + HashArrayMappedTries v0.2.0 [d1acc4aa] + IntervalArithmetic v1.0.9 [43d83c95] + IntervalBoxes v0.3.1 [15111844] + IntervalContractors v0.6.0 ⌅ [d2bf35a9] + IntervalRootFinding v0.6.3 [b6b21f68] + Ipopt v1.15.0 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.1 [4076af6c] + JuMP v1.30.1 [63c18a36] + KernelAbstractions v0.9.41 [2ab3a3ac] + LogExpFunctions v1.0.1 [ee0a3090] + MINLPTests v0.6.2 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.1 [53c679d3] + McCormick v0.14.0 [d8a4904e] + MutableArithmetics v1.8.0 [872c559c] + NNlib v0.9.37 [77ba4419] + NaNMath v1.1.4 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.6 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [5eaf0fd0] + RoundingEmulator v0.2.1 [7e506255] + ScopedValues v1.6.2 [276daf66] + SpecialFunctions v2.8.0 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.2 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [013be700] + UnsafeAtomics v0.3.1 [ae81ac8f] + ASL_jll v0.1.3+0 [6e34b625] + Bzip2_jll v1.0.9+0 [4e9b3aee] + CRlibm_jll v1.0.1+0 [a38c48d9] + CoreMath_jll v0.1.0+0 ⌅ [e8aa6df9] + GLPK_jll v5.0.1+1 [e33a78d0] + Hwloc_jll v2.14.0+0 [9cc047cb] + Ipopt_jll v300.1400.1902+0 [94ce4f54] + Libiconv_jll v1.18.0+0 [d00139f3] + METIS_jll v5.1.3+0 [d7ed1dd3] + MUMPS_seq_jll v500.900.0+0 [656ef2d0] + OpenBLAS32_jll v0.3.33+1 [6cdc7f73] + OpenBLASConsistentFPCSR_jll v0.3.33+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.19.0+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.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.12.1 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.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 [781609d7] + GMP_jll v6.3.0+2 [deac9b47] + LibCURL_jll v8.15.0+0 [e37daf67] + LibGit2_jll v1.9.0+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.11.4 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.4+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.64.0+1 [3f19e933] + p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 6.14s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 2034.5 ms ✓ Cassette 907.8 ms ✓ ErrorfreeArithmetic 838.7 ms ✓ BranchAndPrune 2701.6 ms ✓ MUMPS_seq_jll 13548.8 ms ✓ NNlib 1329.3 ms ✓ IntervalArithmetic → IntervalArithmeticSparseArraysExt 1086.2 ms ✓ IntervalArithmetic → IntervalArithmeticIrrationalConstantsExt 900.4 ms ✓ IntervalArithmetic → IntervalArithmeticDiffRulesExt 1300.1 ms ✓ SPRAL_jll 1481.3 ms ✓ IntervalBoxes 15197.4 ms ✓ IntervalArithmetic → IntervalArithmeticForwardDiffExt 15485.6 ms ✓ MINLPTests 803.4 ms ✓ FastRounding 48998.0 ms ✓ NNlib → NNlibForwardDiffExt 2006.2 ms ✓ NNlib → NNlibSpecialFunctionsExt 2773.6 ms ✓ Ipopt_jll 2394.9 ms ✓ IntervalContractors 5404.7 ms ✓ IntervalRootFinding 2684.3 ms ✓ Ipopt 12196.5 ms ✓ McCormick 137353.5 ms ✓ Ipopt → IpoptMathOptInterfaceExt 174401.8 ms ✓ EAGO 22 dependencies successfully precompiled in 447 seconds. 105 already precompiled. 2 dependencies had output during precompilation: ┌ EAGO │ WARNING: Constructor for type "MC" was extended in `EAGO` without explicit qualification or import. │ NOTE: Assumed "MC" refers to `McCormick.MC`. This behavior is deprecated and may differ in future versions.` │ NOTE: This behavior may have differed in Julia versions prior to 1.12. │ Hint: If you intended to create a new generic function of the same name, use `function MC end`. │ Hint: To silence the warning, qualify `MC` as `McCormick.MC` in the method signature or explicitly `import McCormick: MC`. └ ┌ Cassette │ ┌ Warning: Cassette.jl may not work on this version of Julia │ │ Base.VERSION = v"1.12.6" │ └ @ Cassette ~/.julia/packages/Cassette/ROd5e/src/overdub.jl:600 └ Precompilation completed after 459.66s ################################################################################ # Testing # Testing EAGO Status `/tmp/jl_Y4UOj6/Project.toml` [7057c7e9] Cassette v0.3.14 [864edb3b] DataStructures v0.19.6 [ffbed154] DocStringExtensions v0.9.5 [bb8be931] EAGO v0.9.2 [fa42c844] FastRounding v0.3.1 [f6369f11] ForwardDiff v1.4.1 [60bf3e95] GLPK v1.2.1 [d1acc4aa] IntervalArithmetic v1.0.9 [15111844] IntervalContractors v0.6.0 [b6b21f68] Ipopt v1.15.0 [4076af6c] JuMP v1.30.1 [ee0a3090] MINLPTests v0.6.2 [b8f27783] MathOptInterface v1.51.1 [53c679d3] McCormick v0.14.0 [77ba4419] NaNMath v1.1.4 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [276daf66] SpecialFunctions v2.8.0 [37e2e46d] LinearAlgebra v1.12.0 [de0858da] Printf v1.11.0 [2f01184e] SparseArrays v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_Y4UOj6/Manifest.toml` [1520ce14] AbstractTrees v0.4.5 [79e6a3ab] Adapt v4.7.0 [a9b6321e] Atomix v1.1.3 [d3bc4f2e] BranchAndPrune v0.2.2 [96374032] CRlibm v1.0.2 [7057c7e9] Cassette v0.3.14 [d360d2e6] ChainRulesCore v1.26.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.1 [b7a15901] CoreMath v0.1.0 [864edb3b] DataStructures v0.19.6 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [ffbed154] DocStringExtensions v0.9.5 [bb8be931] EAGO v0.9.2 [90fa49ef] ErrorfreeArithmetic v0.5.2 [fa42c844] FastRounding v0.3.1 [f6369f11] ForwardDiff v1.4.1 [60bf3e95] GLPK v1.2.1 [46192b85] GPUArraysCore v0.2.0 [076d061b] HashArrayMappedTries v0.2.0 [d1acc4aa] IntervalArithmetic v1.0.9 [43d83c95] IntervalBoxes v0.3.1 [15111844] IntervalContractors v0.6.0 ⌅ [d2bf35a9] IntervalRootFinding v0.6.3 [b6b21f68] Ipopt v1.15.0 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.6.1 [4076af6c] JuMP v1.30.1 [63c18a36] KernelAbstractions v0.9.41 [2ab3a3ac] LogExpFunctions v1.0.1 [ee0a3090] MINLPTests v0.6.2 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.51.1 [53c679d3] McCormick v0.14.0 [d8a4904e] MutableArithmetics v1.8.0 [872c559c] NNlib v0.9.37 [77ba4419] NaNMath v1.1.4 ⌅ [bac558e1] OrderedCollections v1.8.2 [69de0a69] Parsers v2.8.6 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [5eaf0fd0] RoundingEmulator v0.2.1 [7e506255] ScopedValues v1.6.2 [276daf66] SpecialFunctions v2.8.0 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [ec057cc2] StructUtils v2.8.2 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [013be700] UnsafeAtomics v0.3.1 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [4e9b3aee] CRlibm_jll v1.0.1+0 [a38c48d9] CoreMath_jll v0.1.0+0 ⌅ [e8aa6df9] GLPK_jll v5.0.1+1 [e33a78d0] Hwloc_jll v2.14.0+0 [9cc047cb] Ipopt_jll v300.1400.1902+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.900.0+0 [656ef2d0] OpenBLAS32_jll v0.3.33+1 [6cdc7f73] OpenBLASConsistentFPCSR_jll v0.3.33+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.19.0+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.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.1 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.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 [781609d7] GMP_jll v6.3.0+2 [deac9b47] LibCURL_jll v8.15.0+0 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.11.4 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.64.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... CHECK REVISED TESTS ┌ Warning: The exclude string "test_linear_DUAL_INFEASIBLE" is ambiguous because it exactly matches a test, but it also partially matches another. Use `r"^test_linear_DUAL_INFEASIBLE$"` to exclude the exactly matching test, or `r"test_linear_DUAL_INFEASIBLE.*"` to exclude all partially matching tests. └ @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/iaRBO/src/Test/Test.jl:239 ┌ Warning: The exclude string "test_conic_linear_VectorAffineFunction" is ambiguous because it exactly matches a test, but it also partially matches another. Use `r"^test_conic_linear_VectorAffineFunction$"` to exclude the exactly matching test, or `r"test_conic_linear_VectorAffineFunction.*"` to exclude all partially matching tests. └ @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/iaRBO/src/Test/Test.jl:239 ┌ Warning: The exclude string "test_linear_integration" is ambiguous because it exactly matches a test, but it also partially matches another. Use `r"^test_linear_integration$"` to exclude the exactly matching test, or `r"test_linear_integration.*"` to exclude all partially matching tests. └ @ MathOptInterface.Test ~/.julia/packages/MathOptInterface/iaRBO/src/Test/Test.jl:239 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ****************************************************************************** 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 ****************************************************************************** ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 Test Summary: | Pass Total Time MOI | 3795 3795 30m33.5s Precompiling packages... 16203.0 ms ✓ MINLPTests 1 dependency successfully precompiled in 17 seconds. 45 already precompiled. ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 3 | 0 | -1.832E+00 | -1.832E+00 | 2.339E-04 | 1.276E-04 | 0.02 | 3599.98 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 1 Lower Bound: 1.8320785097406052 Upper Bound: 1.8323123983376763 Solution: x = 3.2565119989142417 y = 2.0131473276287477 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 3 | 0 | -4.974E+00 | -4.974E+00 | 2.339E-04 | 4.702E-05 | 0.01 | 3599.99 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 1 Lower Bound: 4.973671163330398 Upper Bound: 4.973905051927469 Solution: x = 3.2565119989142417 y = 2.0131473276287477 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 3 | 0 | -3.257E+00 | -3.257E+00 | 8.505E-04 | 2.611E-04 | 0.01 | 3599.99 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 1 Lower Bound: 3.256512482966831 Upper Bound: 3.257363022109319 Solution: x = 3.256512482966831 y = 2.0131482330364863 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 3 | 0 | -3.257E+00 | -3.257E+00 | 8.506E-04 | 2.611E-04 | 0.01 | 3599.99 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 1 Lower Bound: 3.256512392067736 Upper Bound: 3.257363032109319 Solution: x = 3.256512482966827 y = 2.013148233036477 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 11 | 0 | -1.262E+01 | -1.262E+01 | 1.640E-04 | 1.300E-05 | 0.04 | 3599.96 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 3 Lower Bound: 12.618023036214682 Upper Bound: 12.6181870292652 Solution: x = 3.2565126422192257 y = 2.0131485381802947 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 11 | 0 | -1.262E+01 | -1.262E+01 | 1.640E-04 | 1.300E-05 | 0.03 | 3599.97 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 3 Lower Bound: 12.618023036214682 Upper Bound: 12.6181870292652 Solution: x = 3.2565126422192257 y = 2.0131485381802947 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 3 | 0 | -6.399E+00 | -6.398E+00 | 8.505E-04 | 1.329E-04 | 0.01 | 3599.99 | ----------------------------------------------------------------------------------------------------------------- Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node 1 Lower Bound: 6.398105136556624 Upper Bound: 6.398955675699112 Solution: x = 3.256512482966831 y = 2.0131482330364863 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 1 | 2 | Inf | -7.500E-01 | Inf | NaN | 0.01 | 3599.99 | ----------------------------------------------------------------------------------------------------------------- Absolute Tolerance Achieved Optimal Solution Found at Node 1 Lower Bound: 0.7499999091007233 Upper Bound: -Inf Solution: x = 0.5000000000000003 ┌ Warning: At least one branching variable is unbounded. This will interfere with EAGO's global │ optimization routine and may cause unexpected results. Bounds have been automatically │ generated at +/- 1E6 for all unbounded variables, but tighter user-defined bounds are │ highly recommended. To disable this warning and the automatic generation of bounds, use │ the option `unbounded_check = false`. └ @ EAGO ~/.julia/packages/EAGO/slwcZ/src/eago_optimizer/optimize/nonconvex/stack_management.jl:273 ----------------------------------------------------------------------------------------------------------------- | Iteration # | Nodes | Lower Bound | Upper Bound | Gap | Ratio | Timer | Time Left | ----------------------------------------------------------------------------------------------------------------- | 1 | 2 | Inf | 7.500E-01 | Inf | NaN | 0.01 | 3599.99 | ----------------------------------------------------------------------------------------------------------------- Absolute Tolerance Achieved Optimal Solution Found at Node 1 Lower Bound: Inf Upper Bound: 0.7500000908990736 Solution: x = 0.4999999997471924 Test Summary: | Pass Total Time nlp | 43 43 11.2s Test Summary: | Total Time nlp-cvx | 0 0.0s Test Summary: | Total Time nlp-mi | 0 0.0s Test Summary: | Pass Total Time Test Stack Management Functions | 11 11 0.4s Test Summary: | Pass Total Time Test B&B Checks | 11 11 0.1s Test Summary: | Pass Total Time Node Access Functions | 18 18 0.2s Test Summary: | Pass Total Time Duality-Based Bound Tightening | 8 8 0.1s Test Summary: | Pass Total Time MOI Utilities | 2 2 0.0s Test Summary: | Pass Total Time Set/Get Attributes | 10 10 0.1s Test Summary: | Pass Total Time Get Termination Code | 2 2 0.0s Test Summary: | Pass Total Time Add Variable, Get Number/Index | 5 5 0.2s Test Summary: | Pass Total Time Variable Bounds | 21 21 0.3s Test Summary: | Pass Total Time Add Linear Constraint | 21 21 0.5s Test Summary: | Pass Total Time Add Quadratic Constraint | 24 24 0.3s Test Summary: | Pass Total Time Set Objective | 9 9 0.1s Test Summary: | Pass Total Time Empty/Isempty, EAGO Model, Single Storage, Optimize Hook | 6 6 0.0s Test Summary: | Pass Total Time LP Problems | 20 20 2.0s Test Summary: | Pass Total Time NLP Problem #1 | 5 5 0.9s Test Summary: | Pass Total Time NLP Problem #2 | 3 3 1.7s Test Summary: | Pass Total Time NLP Problem #3 | 1 1 0.8s Test Summary: | Pass Total Time NLP Problem #4 | 3 3 0.2s Test Summary: | Pass Total Time NLP Problem #5 | 1 1 2.1s Test Summary: | Pass Total Time NLP Problem #6 | 1 1 0.7s Test Summary: | Pass Total Time NLP Problem #7 | 1 1 0.1s Test Summary: | Pass Total Time NLP Problem #8 | 1 1 0.1s Test Summary: | Pass Total Time Register Special Expressions | 56 56 5.3s Empty Stack: Exhaustive Search Finished Optimal Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Empty Stack: Infeasible No Solution Found Node Limit Exceeded Best Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Iteration Limit Exceeded Best Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Relative Tolerance Achieved Optimal Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Absolute Tolerance Achieved Optimal Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Time Limit Exceeded Best Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf Best Solution Found at Node -1 Lower Bound: -Inf Upper Bound: Inf ----------------------------------------------------------------------------------------------------------------- ----------------------------- Display Test ----------------------------- Feasibility Subject to: ----------------------------- Test Summary: | Pass Total Time Display Testset | 14 14 1.3s Test Trace Script: Error During Test at /home/pkgeval/.julia/packages/EAGO/slwcZ/test/script_optimizer.jl:20 Got exception outside of a @test As of Julia 1.12, generated functions must return `CodeInfo`. See `Base.generated_body_to_codeinfo`. Stacktrace: [1] trace_script(f::Function, n::Int64) @ EAGO.Script ~/.julia/packages/EAGO/slwcZ/src/eago_script/tracer.jl:175 [2] top-level scope @ ~/.julia/packages/EAGO/slwcZ/test/script_optimizer.jl:21 [3] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1777 [inlined] [4] macro expansion @ ~/.julia/packages/EAGO/slwcZ/test/script_optimizer.jl:28 [inlined] [5] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:307 [6] top-level scope @ ~/.julia/packages/EAGO/slwcZ/test/runtests.jl:19 [7] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:307 [8] top-level scope @ none:6 [9] eval(m::Module, e::Any) @ Core ./boot.jl:489 [10] exec_options(opts::Base.JLOptions) @ Base ./client.jl:283 [11] _start() @ Base ./client.jl:550 Test Summary: | Error Total Time Test Trace Script | 1 1 4.1s RNG of the outermost testset: Random.Xoshiro(0x8c6305ba64f0133e, 0xf53c9767d6c138bc, 0x09299b12c5f3aceb, 0x23da74c3b2630d98, 0x94e204a9a7ab7d31) ERROR: LoadError: Some tests did not pass: 0 passed, 0 failed, 1 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/EAGO/slwcZ/test/script_optimizer.jl:20 in expression starting at /home/pkgeval/.julia/packages/EAGO/slwcZ/test/runtests.jl:19 Testing failed after 1914.98s ERROR: LoadError: Package EAGO errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2538 [3] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2387 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:552 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:169 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:157 [7] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:157 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:156 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:223 [10] include(mod::Module, _path::String) @ Base ./Base.jl:306 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:317 [12] _start() @ Base ./client.jl:550 in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 PkgEval failed after 2411.79s: package tests unexpectedly errored