Package evaluation to test NonconvexJuniper on Julia 1.13.0-DEV.1319 (9cddfda8ef*) started at 2025-10-16T23:14:08.974 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.78s ################################################################################ # Installation # Installing NonconvexJuniper... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [611adb69] + NonconvexJuniper v0.3.1 Updating `~/.julia/environments/v1.13/Manifest.toml` [47edcb42] + ADTypes v1.18.0 ⌅ [c29ec348] + AbstractDifferentiation v0.4.4 [621f4979] + AbstractFFTs v1.5.0 [1520ce14] + AbstractTrees v0.4.5 [7d9f7c33] + Accessors v0.1.42 [79e6a3ab] + Adapt v4.4.0 [66dad0bd] + AliasTables v1.1.3 [ec485272] + ArnoldiMethod v0.4.0 [4fba245c] + ArrayInterface v7.21.0 [a9b6321e] + Atomix v1.1.2 [6e4b80f9] + BenchmarkTools v1.6.1 ⌅ [e2ed5e7c] + Bijections v0.1.10 [fa961155] + CEnum v0.5.0 [96374032] + CRlibm v1.0.2 [082447d4] + ChainRules v1.72.6 [d360d2e6] + ChainRulesCore v1.26.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.0.3 [38540f10] + CommonSolve v0.2.4 [bbf7d656] + CommonSubexpressions v0.3.1 [f70d9fcc] + CommonWorldInvalidations v1.0.0 [34da2185] + Compat v4.18.1 [b152e2b5] + CompositeTypes v0.1.4 [a33af91c] + CompositionsBase v0.1.2 ⌅ [187b0558] + ConstructionBase v1.5.6 [9a962f9c] + DataAPI v1.16.0 ⌅ [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [c78775a3] + DifferentiableFlatten v0.1.1 [31c24e10] + Distributions v0.25.122 [ffbed154] + DocStringExtensions v0.9.5 [5b8099bc] + DomainSets v0.7.16 ⌅ [7c1d4256] + DynamicPolynomials v0.5.7 [4e289a0a] + EnumX v1.0.5 [90fa49ef] + ErrorfreeArithmetic v0.5.2 [e2ba6199] + ExprTools v0.1.10 [55351af7] + ExproniconLite v0.10.14 [9aa1b823] + FastClosures v0.3.2 [fa42c844] + FastRounding v0.3.1 [1a297f60] + FillArrays v1.14.0 [6a86dc24] + FiniteDiff v2.29.0 [1fa38f19] + Format v1.3.7 ⌅ [f6369f11] + ForwardDiff v0.10.39 [069b7b12] + FunctionWrappers v1.1.3 [77dc65aa] + FunctionWrappersWrappers v0.1.3 [0c68f7d7] + GPUArrays v11.2.6 [46192b85] + GPUArraysCore v0.2.0 [86223c79] + Graphs v1.13.1 [076d061b] + HashArrayMappedTries v0.2.0 [34004b35] + HypergeometricFunctions v0.3.28 [7869d1d1] + IRTools v0.4.15 [615f187c] + IfElse v0.1.1 [d25df0c9] + Inflate v0.1.5 ⌅ [d1acc4aa] + IntervalArithmetic v0.20.9 [8197267c] + IntervalSets v0.7.11 [3587e190] + InverseFunctions v0.1.17 [b6b21f68] + Ipopt v1.11.0 [92d709cd] + IrrationalConstants v0.2.6 [42fd0dbc] + IterativeSolvers v0.9.4 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v1.1.0 [0f8b85d8] + JSON3 v1.14.3 [ae98c720] + Jieko v0.2.1 [4076af6c] + JuMP v1.29.1 [2ddba703] + Juniper v0.9.4 [63c18a36] + KernelAbstractions v0.9.38 [929cbde3] + LLVM v9.4.4 [b964fa9f] + LaTeXStrings v1.4.0 [2ee39098] + LabelledArrays v1.16.1 ⌅ [984bce1d] + LambertW v0.4.6 [23fbe1c1] + Latexify v0.16.10 [7a12625a] + LinearMaps v3.11.4 [5c8ed15e] + LinearOperators v2.11.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.45.0 [e1d29d7a] + Missings v1.2.0 [2e0e35c7] + Moshi v0.3.7 ⌃ [102ac46a] + MultivariatePolynomials v0.5.9 [d8a4904e] + MutableArithmetics v1.6.6 [a4795742] + NLPModels v0.21.5 [77ba4419] + NaNMath v1.1.3 [d9ec5142] + NamedTupleTools v0.14.3 [035190e5] + NonconvexCore v1.4.3 [bf347577] + NonconvexIpopt v0.4.3 [611adb69] + NonconvexJuniper v0.3.1 [c48e48a2] + NonconvexUtils v0.4.3 [bac558e1] + OrderedCollections v1.8.1 [90014a1f] + PDMats v0.11.35 [65ce6f38] + PackageExtensionCompat v1.0.2 [d96e819e] + Parameters v0.12.3 [69de0a69] + Parsers v2.8.3 [d236fae5] + PreallocationTools v0.4.34 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.0 [43287f4e] + PtrArrays v1.3.0 [1fd47b50] + QuadGK v2.11.2 [c1ae055f] + RealDot v0.1.0 [3cdcf5f2] + RecipesBase v1.3.4 ⌃ [731186ca] + RecursiveArrayTools v3.36.0 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [79098fc4] + Rmath v0.8.0 [5eaf0fd0] + RoundingEmulator v0.2.1 [7e49a35a] + RuntimeGeneratedFunctions v0.5.15 ⌃ [0bca4576] + SciMLBase v2.87.0 ⌅ [c0aeaf25] + SciMLOperators v0.3.13 [431bcebd] + SciMLPublic v1.0.0 [53ae85a6] + SciMLStructures v1.7.0 [7e506255] + ScopedValues v1.5.0 [3cc68bcd] + SetRounding v0.2.1 [efcf1570] + Setfield v1.1.2 [699a6c99] + SimpleTraits v0.9.5 [ff4d7338] + SolverCore v0.3.8 [a2af1166] + SortingAlgorithms v1.2.2 ⌃ [47a9eef4] + SparseDiffTools v2.23.1 [dc90abb0] + SparseInverseSubset v0.1.2 [276daf66] + SpecialFunctions v2.6.1 [aedffcd0] + Static v1.3.0 [0d7ed370] + StaticArrayInterface v1.8.0 [90137ffa] + StaticArrays v1.9.15 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.1 [2913bbd2] + StatsBase v0.34.6 [4c63d2b9] + StatsFuns v1.5.0 [09ab397b] + StructArrays v0.7.1 [856f2bd8] + StructTypes v1.11.0 [ec057cc2] + StructUtils v2.5.1 [2efcf032] + SymbolicIndexingInterface v0.3.46 ⌃ [19f23fe9] + SymbolicLimits v0.2.1 ⌅ [d1185830] + SymbolicUtils v2.1.3 ⌅ [0c5d862f] + Symbolics v5.36.0 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 ⌅ [8ea1fca8] + TermInterface v0.4.1 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 [3a884ed6] + UnPack v1.0.2 [a7c27f48] + Unityper v0.1.6 [013be700] + UnsafeAtomics v0.3.0 [19fa3120] + VertexSafeGraphs v0.2.0 ⌅ [e88e6eb3] + Zygote v0.6.77 [700de1a5] + ZygoteRules v0.2.7 [ae81ac8f] + ASL_jll v0.1.3+0 [6e34b625] + Bzip2_jll v1.0.9+0 [4e9b3aee] + CRlibm_jll v1.0.1+0 [61579ee1] + Ghostscript_jll v9.55.1+0 [e33a78d0] + Hwloc_jll v2.12.2+0 [9cc047cb] + Ipopt_jll v300.1400.1900+0 [aacddb02] + JpegTurbo_jll v3.1.3+0 [dad2f222] + LLVMExtra_jll v0.0.38+0 [94ce4f54] + Libiconv_jll v1.18.0+0 [d00139f3] + METIS_jll v5.1.3+0 [d7ed1dd3] + MUMPS_seq_jll v500.800.100+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [f50d1b31] + Rmath_jll v0.5.1+0 ⌅ [319450e9] + SPRAL_jll v2025.5.20+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 [8ba89e20] + Distributed v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [4af54fe1] + LazyArtifacts v1.11.0 [b27032c2] + LibCURL v0.6.4 [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 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [1a1011a3] + SharedArrays v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [4607b0f0] + SuiteSparse [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.16.0+0 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.9.9 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.4+0 [efcefdf7] + PCRE2_jll v10.46.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.67.1+0 [3f19e933] + p7zip_jll v17.6.0+0 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Installation completed after 11.22s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 478.71s ################################################################################ # Testing # Testing NonconvexJuniper Status `/tmp/jl_aCodUd/Project.toml` [b6b21f68] Ipopt v1.11.0 [4076af6c] JuMP v1.29.1 [2ddba703] Juniper v0.9.4 [b8f27783] MathOptInterface v1.45.0 [035190e5] NonconvexCore v1.4.3 [bf347577] NonconvexIpopt v0.4.3 [611adb69] NonconvexJuniper v0.3.1 [d96e819e] Parameters v0.12.3 [189a3867] Reexport v1.2.2 ⌅ [e88e6eb3] Zygote v0.6.77 [37e2e46d] LinearAlgebra v1.13.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_aCodUd/Manifest.toml` [47edcb42] ADTypes v1.18.0 ⌅ [c29ec348] AbstractDifferentiation v0.4.4 [621f4979] AbstractFFTs v1.5.0 [1520ce14] AbstractTrees v0.4.5 [7d9f7c33] Accessors v0.1.42 [79e6a3ab] Adapt v4.4.0 [66dad0bd] AliasTables v1.1.3 [ec485272] ArnoldiMethod v0.4.0 [4fba245c] ArrayInterface v7.21.0 [a9b6321e] Atomix v1.1.2 [6e4b80f9] BenchmarkTools v1.6.1 ⌅ [e2ed5e7c] Bijections v0.1.10 [fa961155] CEnum v0.5.0 [96374032] CRlibm v1.0.2 [082447d4] ChainRules v1.72.6 [d360d2e6] ChainRulesCore v1.26.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.3 [38540f10] CommonSolve v0.2.4 [bbf7d656] CommonSubexpressions v0.3.1 [f70d9fcc] CommonWorldInvalidations v1.0.0 [34da2185] Compat v4.18.1 [b152e2b5] CompositeTypes v0.1.4 [a33af91c] CompositionsBase v0.1.2 ⌅ [187b0558] ConstructionBase v1.5.6 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [c78775a3] DifferentiableFlatten v0.1.1 [31c24e10] Distributions v0.25.122 [ffbed154] DocStringExtensions v0.9.5 [5b8099bc] DomainSets v0.7.16 ⌅ [7c1d4256] DynamicPolynomials v0.5.7 [4e289a0a] EnumX v1.0.5 [90fa49ef] ErrorfreeArithmetic v0.5.2 [e2ba6199] ExprTools v0.1.10 [55351af7] ExproniconLite v0.10.14 [9aa1b823] FastClosures v0.3.2 [fa42c844] FastRounding v0.3.1 [1a297f60] FillArrays v1.14.0 [6a86dc24] FiniteDiff v2.29.0 [1fa38f19] Format v1.3.7 ⌅ [f6369f11] ForwardDiff v0.10.39 [069b7b12] FunctionWrappers v1.1.3 [77dc65aa] FunctionWrappersWrappers v0.1.3 [0c68f7d7] GPUArrays v11.2.6 [46192b85] GPUArraysCore v0.2.0 [86223c79] Graphs v1.13.1 [076d061b] HashArrayMappedTries v0.2.0 [34004b35] HypergeometricFunctions v0.3.28 [7869d1d1] IRTools v0.4.15 [615f187c] IfElse v0.1.1 [d25df0c9] Inflate v0.1.5 ⌅ [d1acc4aa] IntervalArithmetic v0.20.9 [8197267c] IntervalSets v0.7.11 [3587e190] InverseFunctions v0.1.17 [b6b21f68] Ipopt v1.11.0 [92d709cd] IrrationalConstants v0.2.6 [42fd0dbc] IterativeSolvers v0.9.4 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.1.0 [0f8b85d8] JSON3 v1.14.3 [ae98c720] Jieko v0.2.1 [4076af6c] JuMP v1.29.1 [2ddba703] Juniper v0.9.4 [63c18a36] KernelAbstractions v0.9.38 [929cbde3] LLVM v9.4.4 [b964fa9f] LaTeXStrings v1.4.0 [2ee39098] LabelledArrays v1.16.1 ⌅ [984bce1d] LambertW v0.4.6 [23fbe1c1] Latexify v0.16.10 [7a12625a] LinearMaps v3.11.4 [5c8ed15e] LinearOperators v2.11.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.45.0 [e1d29d7a] Missings v1.2.0 [2e0e35c7] Moshi v0.3.7 ⌃ [102ac46a] MultivariatePolynomials v0.5.9 [d8a4904e] MutableArithmetics v1.6.6 [a4795742] NLPModels v0.21.5 [77ba4419] NaNMath v1.1.3 [d9ec5142] NamedTupleTools v0.14.3 [035190e5] NonconvexCore v1.4.3 [bf347577] NonconvexIpopt v0.4.3 [611adb69] NonconvexJuniper v0.3.1 [c48e48a2] NonconvexUtils v0.4.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [65ce6f38] PackageExtensionCompat v1.0.2 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 [d236fae5] PreallocationTools v0.4.34 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.0 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [c1ae055f] RealDot v0.1.0 [3cdcf5f2] RecipesBase v1.3.4 ⌃ [731186ca] RecursiveArrayTools v3.36.0 [189a3867] Reexport v1.2.2 [ae029012] Requires v1.3.1 [79098fc4] Rmath v0.8.0 [5eaf0fd0] RoundingEmulator v0.2.1 [7e49a35a] RuntimeGeneratedFunctions v0.5.15 ⌃ [0bca4576] SciMLBase v2.87.0 ⌅ [c0aeaf25] SciMLOperators v0.3.13 [431bcebd] SciMLPublic v1.0.0 [53ae85a6] SciMLStructures v1.7.0 [7e506255] ScopedValues v1.5.0 [3cc68bcd] SetRounding v0.2.1 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.5 [ff4d7338] SolverCore v0.3.8 [a2af1166] SortingAlgorithms v1.2.2 ⌃ [47a9eef4] SparseDiffTools v2.23.1 [dc90abb0] SparseInverseSubset v0.1.2 [276daf66] SpecialFunctions v2.6.1 [aedffcd0] Static v1.3.0 [0d7ed370] StaticArrayInterface v1.8.0 [90137ffa] StaticArrays v1.9.15 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.6 [4c63d2b9] StatsFuns v1.5.0 [09ab397b] StructArrays v0.7.1 [856f2bd8] StructTypes v1.11.0 [ec057cc2] StructUtils v2.5.1 [2efcf032] SymbolicIndexingInterface v0.3.46 ⌃ [19f23fe9] SymbolicLimits v0.2.1 ⌅ [d1185830] SymbolicUtils v2.1.3 ⌅ [0c5d862f] Symbolics v5.36.0 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 ⌅ [8ea1fca8] TermInterface v0.4.1 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [3a884ed6] UnPack v1.0.2 [a7c27f48] Unityper v0.1.6 [013be700] UnsafeAtomics v0.3.0 [19fa3120] VertexSafeGraphs v0.2.0 ⌅ [e88e6eb3] Zygote v0.6.77 [700de1a5] ZygoteRules v0.2.7 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [4e9b3aee] CRlibm_jll v1.0.1+0 [61579ee1] Ghostscript_jll v9.55.1+0 [e33a78d0] Hwloc_jll v2.12.2+0 [9cc047cb] Ipopt_jll v300.1400.1900+0 [aacddb02] JpegTurbo_jll v3.1.3+0 [dad2f222] LLVMExtra_jll v0.0.38+0 [94ce4f54] Libiconv_jll v1.18.0+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.100+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [f50d1b31] Rmath_jll v0.5.1+0 ⌅ [319450e9] SPRAL_jll v2025.5.20+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 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [9fa8497b] Future v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [4af54fe1] LazyArtifacts v1.11.0 [b27032c2] LibCURL v0.6.4 [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 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [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.16.0+0 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.9.9 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.4+0 [efcefdf7] PCRE2_jll v10.46.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.67.1+0 [3f19e933] p7zip_jll v17.6.0+0 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. Testing Running tests... ┌ Error: Error during loading of extension SymbolicsPreallocationToolsExt of Symbolics, use `Base.retry_load_extensions()` to retry. │ exception = │ 1-element ExceptionStack: │ LoadError: UndefVarError: `ForwardDiff` not defined in `PreallocationTools` │ Suggestion: check for spelling errors or missing imports. │ Hint: ForwardDiff is loaded but not imported in the active module Main. │ Stacktrace: │ [1] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:62 │ [2] _eval_using(to::Module, path::Expr) │ @ Base ./module.jl:137 │ [3] top-level scope │ @ ~/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:5 │ [4] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [5] __require_prelocked(pkg::Base.PkgId, env::Nothing) │ @ Base ./loading.jl:2777 │ [6] _require_prelocked(uuidkey::Base.PkgId, env::Nothing) │ @ Base ./loading.jl:2536 │ [7] _require_prelocked │ @ ./loading.jl:2530 [inlined] │ [8] run_extension_callbacks(extid::Base.ExtensionId) │ @ Base ./loading.jl:1582 │ [9] run_extension_callbacks(pkgid::Base.PkgId) │ @ Base ./loading.jl:1619 │ [10] run_package_callbacks(modkey::Base.PkgId) │ @ Base ./loading.jl:1435 │ [11] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:2544 │ [12] macro expansion │ @ ./loading.jl:2464 [inlined] │ [13] macro expansion │ @ ./lock.jl:376 [inlined] │ [14] __require(into::Module, mod::Symbol) │ @ Base ./loading.jl:2428 │ [15] require │ @ ./loading.jl:2404 [inlined] │ [16] eval_import_path │ @ ./module.jl:36 [inlined] │ [17] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:60 │ [18] _eval_import(::Bool, ::Module, ::Expr, ::Expr, ::Vararg{Expr}) │ @ Base ./module.jl:101 │ [19] top-level scope │ @ ~/.julia/packages/NonconvexUtils/i3gzf/src/NonconvexUtils.jl:18 │ [20] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [21] __require_prelocked(pkg::Base.PkgId, env::String) │ @ Base ./loading.jl:2777 │ [22] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:2536 │ [23] macro expansion │ @ ./loading.jl:2464 [inlined] │ [24] macro expansion │ @ ./lock.jl:376 [inlined] │ [25] __require(into::Module, mod::Symbol) │ @ Base ./loading.jl:2428 │ [26] require │ @ ./loading.jl:2404 [inlined] │ [27] eval_import_path │ @ ./module.jl:36 [inlined] │ [28] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:60 │ [29] _eval_using(to::Module, path::Expr) │ @ Base ./module.jl:137 │ [30] top-level scope │ @ ~/.julia/packages/NonconvexIpopt/yAEgT/src/NonconvexIpopt.jl:5 │ [31] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [32] __require_prelocked(pkg::Base.PkgId, env::String) │ @ Base ./loading.jl:2777 │ [33] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:2536 │ [34] macro expansion │ @ ./loading.jl:2464 [inlined] │ [35] macro expansion │ @ ./lock.jl:376 [inlined] │ [36] __require(into::Module, mod::Symbol) │ @ Base ./loading.jl:2428 │ [37] require │ @ ./loading.jl:2404 [inlined] │ [38] eval_import_path │ @ ./module.jl:36 [inlined] │ [39] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:60 │ [40] _eval_using(to::Module, path::Expr) │ @ Base ./module.jl:137 │ [41] top-level scope │ @ ~/.julia/packages/NonconvexJuniper/7AcRL/src/NonconvexJuniper.jl:8 │ [42] include(mod::Module, _path::String) │ @ Base ./Base.jl:309 │ [43] __require_prelocked(pkg::Base.PkgId, env::String) │ @ Base ./loading.jl:2777 │ [44] _require_prelocked(uuidkey::Base.PkgId, env::String) │ @ Base ./loading.jl:2536 │ [45] macro expansion │ @ ./loading.jl:2464 [inlined] │ [46] macro expansion │ @ ./lock.jl:376 [inlined] │ [47] __require(into::Module, mod::Symbol) │ @ Base ./loading.jl:2428 │ [48] require │ @ ./loading.jl:2404 [inlined] │ [49] eval_import_path │ @ ./module.jl:36 [inlined] │ [50] eval_import_path_all(at::Module, path::Expr, keyword::String) │ @ Base ./module.jl:60 │ [51] _eval_using(to::Module, path::Expr) │ @ Base ./module.jl:137 │ [52] top-level scope │ @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:1 │ [53] include(mapexpr::Function, mod::Module, _path::String) │ @ Base ./Base.jl:310 │ [54] top-level scope │ @ none:6 │ [55] eval(m::Module, e::Any) │ @ Core ./boot.jl:489 │ [56] exec_options(opts::Base.JLOptions) │ @ Base ./client.jl:310 │ [57] _start() │ @ Base ./client.jl:577 │ in expression starting at /home/pkgeval/.julia/packages/Symbolics/qKoME/ext/SymbolicsPreallocationToolsExt.jl:1 └ @ Base loading.jl:1592 WARNING: Constructor for type "Workspace" was extended in `NonconvexIpopt` without explicit qualification or import. NOTE: Assumed "Workspace" refers to `NonconvexCore.Workspace`. 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 Workspace end`. Hint: To silence the warning, qualify `Workspace` as `NonconvexCore.Workspace` in the method signature or explicitly `import NonconvexCore: Workspace`. WARNING: Constructor for type "Workspace" was extended in `NonconvexJuniper` without explicit qualification or import. NOTE: Assumed "Workspace" refers to `.Workspace`. 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 Workspace end`. Hint: To silence the warning, qualify `Workspace` as `.Workspace` in the method signature or explicitly `import : Workspace`. nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("jac_c_constant") => "no", MathOptInterface.RawOptimizerAttribute("hessian_approximation") => "limited-memory", MathOptInterface.RawOptimizerAttribute("jac_d_constant") => "no"]) feasibility_pump : false log_levels : [:Options, :Table, :Info] #Variables: 2 #IntBinVar: 0 Obj Sense: Min ****************************************************************************** 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 ****************************************************************************** This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.97e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4839416e+00 3.30e+00 1.57e-01 -5.4 3.51e-01 - 9.52e-01 1.00e+00h 1 2 1.3048472e+00 8.02e-01 3.19e-01 -6.7 4.99e-01 - 9.30e-01 1.00e+00h 1 3 1.0533955e+00 9.73e-02 4.48e-01 -2.6 6.61e-01 - 1.00e+00 1.00e+00h 1 4 5.8982897e-01 0.00e+00 8.25e-01 -3.6 9.23e-01 - 1.00e+00 1.00e+00h 1 5 4.0024267e-01 3.68e-01 1.10e+00 -1.7 1.63e+00 - 1.00e+00 3.42e-01h 1 6 5.9531365e-01 4.06e-03 1.04e+00 -2.0 2.70e-01 - 8.80e-01 1.00e+00h 1 7 5.5076681e-01 0.00e+00 2.84e-01 -2.7 2.49e-01 - 1.00e+00 1.00e+00h 1 8 5.4546369e-01 2.21e-04 5.12e-03 -3.4 2.70e-02 - 1.00e+00 9.67e-01h 1 9 5.4435008e-01 0.00e+00 1.90e-02 -5.4 2.07e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433135e-01 0.00e+00 1.11e-04 -7.1 2.84e-05 - 1.00e+00 9.76e-01h 1 11 5.4433104e-01 0.00e+00 8.90e-07 -11.0 5.32e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 1.23e-10 -11.0 1.98e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623084e-01 5.4433104478623084e-01 Dual infeasibility......: 1.2290779505264027e-10 1.2290779505264027e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000026449328530e-11 1.0000026449328530e-11 Overall NLP error.......: 1.2290779505264027e-10 1.2290779505264027e-10 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 7.779 EXIT: Optimal Solution Found. Incumbent using start values: 0.5443310447862308 This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.97e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4839416e+00 3.30e+00 1.57e-01 -5.4 3.51e-01 - 9.52e-01 1.00e+00h 1 2 1.3048472e+00 8.02e-01 3.19e-01 -6.7 4.99e-01 - 9.30e-01 1.00e+00h 1 3 1.0533955e+00 9.73e-02 4.48e-01 -2.6 6.61e-01 - 1.00e+00 1.00e+00h 1 4 5.8982897e-01 0.00e+00 8.25e-01 -3.6 9.23e-01 - 1.00e+00 1.00e+00h 1 5 4.0024267e-01 3.68e-01 1.10e+00 -1.7 1.63e+00 - 1.00e+00 3.42e-01h 1 6 5.9531365e-01 4.06e-03 1.04e+00 -2.0 2.70e-01 - 8.80e-01 1.00e+00h 1 7 5.5076681e-01 0.00e+00 2.84e-01 -2.7 2.49e-01 - 1.00e+00 1.00e+00h 1 8 5.4546369e-01 2.21e-04 5.12e-03 -3.4 2.70e-02 - 1.00e+00 9.67e-01h 1 9 5.4435008e-01 0.00e+00 1.90e-02 -5.4 2.07e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433135e-01 0.00e+00 1.11e-04 -7.1 2.84e-05 - 1.00e+00 9.76e-01h 1 11 5.4433104e-01 0.00e+00 8.90e-07 -11.0 5.32e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 1.23e-10 -11.0 1.98e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623084e-01 5.4433104478623084e-01 Dual infeasibility......: 1.2290779505264027e-10 1.2290779505264027e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000026449328530e-11 1.0000026449328530e-11 Overall NLP error.......: 1.2290779505264027e-10 1.2290779505264027e-10 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.020 EXIT: Optimal Solution Found. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 36.44183397293091 Relaxation Obj: 0.5443310447862308 Obj: 0.5443310447862308 Simple constraints: Error During Test at /home/pkgeval/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:8 Got exception outside of a @test UndefVarError: `JuniperIpoptResult` not defined in `NonconvexJuniper` Suggestion: define the const at top-level before running function that uses it (stricter Julia v1.12+ rule). Note: the binding state changed since the error occurred (was: 11, now: 0). Stacktrace: [1] #s27#1 @ ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:30 [inlined] [2] var"#s27#1"(T::Any, ::Any, ::Any) @ ConstructionBase ./none:0 [3] (::Core.GeneratedFunctionStub)(::UInt64, ::Method, ::Any, ::Vararg{Any}) @ Base ./expr.jl:1828 [4] setproperties_object(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#19#20"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#21#22"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#19#20"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#21#22"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:219 [5] setproperties(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#19#20"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#21#22"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#19#20"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#21#22"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:133 [6] set @ ~/.julia/packages/Setfield/ZezIj/src/lens.jl:122 [inlined] [7] macro expansion @ ~/.julia/packages/Setfield/ZezIj/src/sugar.jl:198 [inlined] [8] optimize(::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}; kwargs::@Kwargs{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:244 [9] kwcall(::@NamedTuple{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}, ::typeof(optimize), ::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:234 [10] top-level scope @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:2066 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:2042 [inlined] [12] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:9 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1961 [inlined] [14] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:15 [inlined] [15] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [16] top-level scope @ none:6 [17] eval(m::Module, e::Any) @ Core ./boot.jl:489 [18] exec_options(opts::Base.JLOptions) @ Base ./client.jl:310 [19] _start() @ Base ./client.jl:577 Equality constraints: Error During Test at /home/pkgeval/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:32 Got exception outside of a @test UndefVarError: `s1` not defined in `Main` Suggestion: add an appropriate import or assignment. This global was declared but not assigned. Stacktrace: [1] (::var"#27#28")(x::Vector{Float64}) @ Main ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:37 [2] add_eq_constraint!(m::Model{Vector{Any}}, f::var"#27#28", s::Float64) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/models/model.jl:214 [3] top-level scope @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:2066 [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:2042 [inlined] [5] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:33 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1961 [inlined] [7] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:37 [inlined] [8] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [9] top-level scope @ none:6 [10] eval(m::Module, e::Any) @ Core ./boot.jl:489 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:310 [12] _start() @ Base ./client.jl:577 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("jac_c_constant") => "no", MathOptInterface.RawOptimizerAttribute("hessian_approximation") => "limited-memory", MathOptInterface.RawOptimizerAttribute("jac_d_constant") => "no"]) feasibility_pump : false log_levels : [:Options, :Table, :Info] #Variables: 2 #IntBinVar: 0 Obj Sense: Min This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.97e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4839416e+00 3.30e+00 1.57e-01 -5.4 3.51e-01 - 9.52e-01 1.00e+00h 1 2 1.3048472e+00 8.02e-01 3.19e-01 -6.7 4.99e-01 - 9.30e-01 1.00e+00h 1 3 1.0533955e+00 9.73e-02 4.48e-01 -2.6 6.61e-01 - 1.00e+00 1.00e+00h 1 4 5.8982897e-01 0.00e+00 8.25e-01 -3.6 9.23e-01 - 1.00e+00 1.00e+00h 1 5 4.0024267e-01 3.68e-01 1.10e+00 -1.7 1.63e+00 - 1.00e+00 3.42e-01h 1 6 5.9531365e-01 4.06e-03 1.04e+00 -2.0 2.70e-01 - 8.80e-01 1.00e+00h 1 7 5.5076681e-01 0.00e+00 2.84e-01 -2.7 2.49e-01 - 1.00e+00 1.00e+00h 1 8 5.4546369e-01 2.21e-04 5.12e-03 -3.4 2.70e-02 - 1.00e+00 9.67e-01h 1 9 5.4435008e-01 0.00e+00 1.90e-02 -5.4 2.07e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433135e-01 0.00e+00 1.11e-04 -7.1 2.84e-05 - 1.00e+00 9.76e-01h 1 11 5.4433104e-01 0.00e+00 8.90e-07 -11.0 5.32e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 1.23e-10 -11.0 1.98e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623084e-01 5.4433104478623084e-01 Dual infeasibility......: 1.2290779505264027e-10 1.2290779505264027e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000026449328530e-11 1.0000026449328530e-11 Overall NLP error.......: 1.2290779505264027e-10 1.2290779505264027e-10 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.278 EXIT: Optimal Solution Found. Incumbent using start values: 0.5443310447862308 This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 2 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.97e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4839416e+00 3.30e+00 1.57e-01 -5.4 3.51e-01 - 9.52e-01 1.00e+00h 1 2 1.3048472e+00 8.02e-01 3.19e-01 -6.7 4.99e-01 - 9.30e-01 1.00e+00h 1 3 1.0533955e+00 9.73e-02 4.48e-01 -2.6 6.61e-01 - 1.00e+00 1.00e+00h 1 4 5.8982897e-01 0.00e+00 8.25e-01 -3.6 9.23e-01 - 1.00e+00 1.00e+00h 1 5 4.0024267e-01 3.68e-01 1.10e+00 -1.7 1.63e+00 - 1.00e+00 3.42e-01h 1 6 5.9531365e-01 4.06e-03 1.04e+00 -2.0 2.70e-01 - 8.80e-01 1.00e+00h 1 7 5.5076681e-01 0.00e+00 2.84e-01 -2.7 2.49e-01 - 1.00e+00 1.00e+00h 1 8 5.4546369e-01 2.21e-04 5.12e-03 -3.4 2.70e-02 - 1.00e+00 9.67e-01h 1 9 5.4435008e-01 0.00e+00 1.90e-02 -5.4 2.07e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433135e-01 0.00e+00 1.11e-04 -7.1 2.84e-05 - 1.00e+00 9.76e-01h 1 11 5.4433104e-01 0.00e+00 8.90e-07 -11.0 5.32e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 1.23e-10 -11.0 1.98e-10 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623084e-01 5.4433104478623084e-01 Dual infeasibility......: 1.2290779505264027e-10 1.2290779505264027e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000026449328530e-11 1.0000026449328530e-11 Overall NLP error.......: 1.2290779505264027e-10 1.2290779505264027e-10 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.018 EXIT: Optimal Solution Found. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.43778419494628906 Relaxation Obj: 0.5443310447862308 Obj: 0.5443310447862308 Block constraints: Error During Test at /home/pkgeval/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:62 Got exception outside of a @test UndefVarError: `JuniperIpoptResult` not defined in `NonconvexJuniper` Suggestion: define the const at top-level before running function that uses it (stricter Julia v1.12+ rule). Note: the binding state changed since the error occurred (was: 11, now: 0). Stacktrace: [1] #s27#1 @ ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:30 [inlined] [2] var"#s27#1"(T::Any, ::Any, ::Any) @ ConstructionBase ./none:0 [3] (::Core.GeneratedFunctionStub)(::UInt64, ::Method, ::Any, ::Vararg{Any}) @ Base ./expr.jl:1828 [4] setproperties_object(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#41#42"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#41#42"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:219 [5] setproperties(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#41#42"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#41#42"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:133 [6] set @ ~/.julia/packages/Setfield/ZezIj/src/lens.jl:122 [inlined] [7] macro expansion @ ~/.julia/packages/Setfield/ZezIj/src/sugar.jl:198 [inlined] [8] optimize(::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}; kwargs::@Kwargs{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:244 [9] kwcall(::@NamedTuple{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}, ::typeof(optimize), ::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:234 [10] top-level scope @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:2066 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:2042 [inlined] [12] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:63 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1961 [inlined] [14] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:68 [inlined] [15] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [16] top-level scope @ none:6 [17] eval(m::Module, e::Any) @ Core ./boot.jl:489 [18] exec_options(opts::Base.JLOptions) @ Base ./client.jl:310 [19] _start() @ Base ./client.jl:577 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("jac_c_constant") => "no", MathOptInterface.RawOptimizerAttribute("hessian_approximation") => "limited-memory", MathOptInterface.RawOptimizerAttribute("jac_d_constant") => "no"]) feasibility_pump : false log_levels : [:Options, :Table, :Info] #Variables: 2 #IntBinVar: 0 Obj Sense: Min This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 2 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.72e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4803481e+00 3.30e+00 1.65e-01 -5.8 3.52e-01 - 1.00e+00 1.00e+00h 1 2 1.2685150e+00 8.40e-01 3.48e-01 -6.8 5.82e-01 - 1.00e+00 1.00e+00h 1 3 9.5252729e-01 4.30e-02 5.03e-01 -2.6 7.84e-01 - 9.95e-01 1.00e+00h 1 4 5.1212396e-01 5.54e-02 9.50e-01 -4.2 1.18e+00 - 1.00e+00 6.85e-01h 1 5 3.9391736e-01 4.69e-01 1.13e+00 -2.2 2.27e+00 - 1.00e+00 2.07e-01h 1 6 5.1846953e-01 6.49e-02 5.53e-01 -1.9 8.69e-01 - 1.00e+00 4.80e-01h 1 7 5.4557200e-01 6.15e-03 2.98e-01 -2.1 4.21e-01 - 1.00e+00 9.90e-01h 1 8 5.4591049e-01 0.00e+00 9.06e-03 -3.9 5.29e-03 - 1.00e+00 1.00e+00h 1 9 5.4435013e-01 0.00e+00 3.03e-03 -5.4 2.19e-03 - 1.00e+00 9.98e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433113e-01 0.00e+00 1.60e-05 -7.2 2.40e-05 - 1.00e+00 9.98e-01h 1 11 5.4433104e-01 0.00e+00 6.93e-08 -11.0 1.61e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 4.71e-12 -11.0 5.58e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623073e-01 5.4433104478623073e-01 Dual infeasibility......: 4.7062354013860386e-12 4.7062354013860386e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000274257271e-11 1.0000000274257271e-11 Overall NLP error.......: 1.0000000274257271e-11 1.0000000274257271e-11 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.224 EXIT: Optimal Solution Found. Incumbent using start values: 0.5443310447862307 This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 2 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.72e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4803481e+00 3.30e+00 1.65e-01 -5.8 3.52e-01 - 1.00e+00 1.00e+00h 1 2 1.2685150e+00 8.40e-01 3.48e-01 -6.8 5.82e-01 - 1.00e+00 1.00e+00h 1 3 9.5252729e-01 4.30e-02 5.03e-01 -2.6 7.84e-01 - 9.95e-01 1.00e+00h 1 4 5.1212396e-01 5.54e-02 9.50e-01 -4.2 1.18e+00 - 1.00e+00 6.85e-01h 1 5 3.9391736e-01 4.69e-01 1.13e+00 -2.2 2.27e+00 - 1.00e+00 2.07e-01h 1 6 5.1846953e-01 6.49e-02 5.53e-01 -1.9 8.69e-01 - 1.00e+00 4.80e-01h 1 7 5.4557200e-01 6.15e-03 2.98e-01 -2.1 4.21e-01 - 1.00e+00 9.90e-01h 1 8 5.4591049e-01 0.00e+00 9.06e-03 -3.9 5.29e-03 - 1.00e+00 1.00e+00h 1 9 5.4435013e-01 0.00e+00 3.03e-03 -5.4 2.19e-03 - 1.00e+00 9.98e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433113e-01 0.00e+00 1.60e-05 -7.2 2.40e-05 - 1.00e+00 9.98e-01h 1 11 5.4433104e-01 0.00e+00 6.93e-08 -11.0 1.61e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 4.71e-12 -11.0 5.58e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623073e-01 5.4433104478623073e-01 Dual infeasibility......: 4.7062354013860386e-12 4.7062354013860386e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000274257271e-11 1.0000000274257271e-11 Overall NLP error.......: 1.0000000274257271e-11 1.0000000274257271e-11 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 13 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.021 EXIT: Optimal Solution Found. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.388822078704834 Relaxation Obj: 0.5443310447862307 Obj: 0.5443310447862307 Infinite upper bound: Error During Test at /home/pkgeval/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:83 Got exception outside of a @test UndefVarError: `JuniperIpoptResult` not defined in `NonconvexJuniper` Suggestion: define the const at top-level before running function that uses it (stricter Julia v1.12+ rule). Note: the binding state changed since the error occurred (was: 11, now: 0). Stacktrace: [1] #s27#1 @ ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:30 [inlined] [2] var"#s27#1"(T::Any, ::Any, ::Any) @ ConstructionBase ./none:0 [3] (::Core.GeneratedFunctionStub)(::UInt64, ::Method, ::Any, ::Vararg{Any}) @ Base ./expr.jl:1828 [4] setproperties_object(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#43#44"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#45#46"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#43#44"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#45#46"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:219 [5] setproperties(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#43#44"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#45#46"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#43#44"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#45#46"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:133 [6] set @ ~/.julia/packages/Setfield/ZezIj/src/lens.jl:122 [inlined] [7] macro expansion @ ~/.julia/packages/Setfield/ZezIj/src/sugar.jl:198 [inlined] [8] optimize(::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}; kwargs::@Kwargs{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:244 [9] kwcall(::@NamedTuple{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}, ::typeof(optimize), ::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:234 [10] top-level scope @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:2066 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:2042 [inlined] [12] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:83 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1961 [inlined] [14] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:84 [inlined] [15] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1961 [inlined] [16] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:90 [inlined] [17] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [18] top-level scope @ none:6 [19] eval(m::Module, e::Any) @ Core ./boot.jl:489 [20] exec_options(opts::Base.JLOptions) @ Base ./client.jl:310 [21] _start() @ Base ./client.jl:577 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("jac_c_constant") => "no", MathOptInterface.RawOptimizerAttribute("hessian_approximation") => "limited-memory", MathOptInterface.RawOptimizerAttribute("jac_d_constant") => "no"]) feasibility_pump : false log_levels : [:Options, :Table, :Info] #Variables: 2 #IntBinVar: 0 Obj Sense: Min This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 2 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 1.02e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4690145e+00 3.32e+00 2.50e-01 -5.3 3.53e-01 - 9.52e-01 1.00e+00h 1 2 1.0730106e+00 8.85e-01 3.93e-01 -1.8 1.01e+00 - 9.48e-01 1.00e+00h 1 3 3.9950642e-01 2.19e-01 1.15e+00 -3.1 1.57e+00 - 9.93e-01 7.20e-01h 1 4 1.3885368e-01 1.46e+00 3.35e+00 -1.2 5.11e+00 - 1.00e+00 2.08e-01f 1 5 3.1878883e-01 4.30e-01 2.51e+00 -0.7 3.88e+00 - 1.00e+00 2.56e-01f 2 6 5.5694773e-01 3.87e-02 8.73e-01 -1.3 1.01e+00 - 1.00e+00 9.84e-01h 1 7 5.6054691e-01 0.00e+00 7.86e-02 -3.3 2.03e-02 - 1.00e+00 1.00e+00h 1 8 5.4533935e-01 4.78e-05 4.17e-02 -4.0 2.38e-02 - 1.00e+00 1.00e+00h 1 9 5.4433825e-01 6.17e-06 4.41e-03 -5.6 1.77e-03 - 1.00e+00 9.61e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433111e-01 0.00e+00 1.25e-05 -7.5 1.72e-05 - 1.00e+00 9.97e-01h 1 11 5.4433104e-01 0.00e+00 7.49e-08 -11.0 1.02e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 3.54e-12 -11.0 5.00e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623073e-01 5.4433104478623073e-01 Dual infeasibility......: 3.5390579355976115e-12 3.5390579355976115e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000288335918e-11 1.0000000288335918e-11 Overall NLP error.......: 1.0000000288335918e-11 1.0000000288335918e-11 Number of objective function evaluations = 17 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 17 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.230 EXIT: Optimal Solution Found. Incumbent using start values: 0.5443310447862307 This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 2 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 1.02e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4690145e+00 3.32e+00 2.50e-01 -5.3 3.53e-01 - 9.52e-01 1.00e+00h 1 2 1.0730106e+00 8.85e-01 3.93e-01 -1.8 1.01e+00 - 9.48e-01 1.00e+00h 1 3 3.9950642e-01 2.19e-01 1.15e+00 -3.1 1.57e+00 - 9.93e-01 7.20e-01h 1 4 1.3885368e-01 1.46e+00 3.35e+00 -1.2 5.11e+00 - 1.00e+00 2.08e-01f 1 5 3.1878883e-01 4.30e-01 2.51e+00 -0.7 3.88e+00 - 1.00e+00 2.56e-01f 2 6 5.5694773e-01 3.87e-02 8.73e-01 -1.3 1.01e+00 - 1.00e+00 9.84e-01h 1 7 5.6054691e-01 0.00e+00 7.86e-02 -3.3 2.03e-02 - 1.00e+00 1.00e+00h 1 8 5.4533935e-01 4.78e-05 4.17e-02 -4.0 2.38e-02 - 1.00e+00 1.00e+00h 1 9 5.4433825e-01 6.17e-06 4.41e-03 -5.6 1.77e-03 - 1.00e+00 9.61e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433111e-01 0.00e+00 1.25e-05 -7.5 1.72e-05 - 1.00e+00 9.97e-01h 1 11 5.4433104e-01 0.00e+00 7.49e-08 -11.0 1.02e-07 - 1.00e+00 1.00e+00h 1 12 5.4433104e-01 0.00e+00 3.54e-12 -11.0 5.00e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.4433104478623073e-01 5.4433104478623073e-01 Dual infeasibility......: 3.5390579355976115e-12 3.5390579355976115e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000288335918e-11 1.0000000288335918e-11 Overall NLP error.......: 1.0000000288335918e-11 1.0000000288335918e-11 Number of objective function evaluations = 17 Number of objective gradient evaluations = 13 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 17 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.019 EXIT: Optimal Solution Found. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.394819974899292 Relaxation Obj: 0.5443310447862307 Obj: 0.5443310447862307 Infinite lower bound: Error During Test at /home/pkgeval/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:103 Got exception outside of a @test UndefVarError: `JuniperIpoptResult` not defined in `NonconvexJuniper` Suggestion: define the const at top-level before running function that uses it (stricter Julia v1.12+ rule). Note: the binding state changed since the error occurred (was: 11, now: 0). Stacktrace: [1] #s27#1 @ ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:30 [inlined] [2] var"#s27#1"(T::Any, ::Any, ::Any) @ ConstructionBase ./none:0 [3] (::Core.GeneratedFunctionStub)(::UInt64, ::Method, ::Any, ::Vararg{Any}) @ Base ./expr.jl:1828 [4] setproperties_object(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#47#48"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#49#50"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#47#48"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#49#50"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:219 [5] setproperties(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#47#48"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#49#50"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#47#48"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#49#50"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:133 [6] set @ ~/.julia/packages/Setfield/ZezIj/src/lens.jl:122 [inlined] [7] macro expansion @ ~/.julia/packages/Setfield/ZezIj/src/sugar.jl:198 [inlined] [8] optimize(::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}; kwargs::@Kwargs{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:244 [9] kwcall(::@NamedTuple{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}, ::typeof(optimize), ::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:234 [10] top-level scope @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:2066 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:2042 [inlined] [12] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:83 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1961 [inlined] [14] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:104 [inlined] [15] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1961 [inlined] [16] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:110 [inlined] [17] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [18] top-level scope @ none:6 [19] eval(m::Module, e::Any) @ Core ./boot.jl:489 [20] exec_options(opts::Base.JLOptions) @ Base ./client.jl:310 [21] _start() @ Base ./client.jl:577 nl_solver : MathOptInterface.OptimizerWithAttributes(IpoptMathOptInterfaceExt.Optimizer, Pair{MathOptInterface.AbstractOptimizerAttribute, Any}[MathOptInterface.RawOptimizerAttribute("jac_c_constant") => "no", MathOptInterface.RawOptimizerAttribute("hessian_approximation") => "limited-memory", MathOptInterface.RawOptimizerAttribute("jac_d_constant") => "no"]) feasibility_pump : false log_levels : [:Options, :Table, :Info] #Variables: 2 #IntBinVar: 0 Obj Sense: Min This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.97e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4629199e+00 3.33e+00 2.20e-01 -5.9 3.53e-01 - 1.00e+00 1.00e+00h 1 2 9.0633301e-01 0.00e+00 4.67e-01 -1.5 3.32e+00 - 1.00e+00 1.00e+00f 1 3 6.0440883e-01 1.57e-02 4.83e-01 -0.6 2.83e+00 - 1.00e+00 1.00e+00h 1 4 6.0956472e-01 2.33e-01 7.42e-01 -0.9 6.38e-01 - 1.00e+00 7.71e-01h 1 5 5.3465681e-01 1.44e-02 3.56e-01 -1.6 2.39e-01 - 1.00e+00 9.80e-01h 1 6 5.5531677e-01 4.24e-03 4.13e-02 -1.9 8.60e-02 - 1.00e+00 9.48e-01h 1 7 5.4465719e-01 2.02e-04 2.91e-02 -8.2 2.04e-02 - 1.00e+00 1.00e+00h 1 8 5.4433569e-01 0.00e+00 1.14e-03 -5.5 7.03e-04 - 1.00e+00 9.87e-01h 1 9 5.4433105e-01 0.00e+00 9.69e-06 -11.0 7.11e-06 - 1.00e+00 9.99e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433104e-01 0.00e+00 3.91e-08 -11.0 2.19e-08 - 1.00e+00 1.00e+00h 1 11 5.4433104e-01 0.00e+00 1.61e-12 -11.0 8.27e-13 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 5.4433104478623073e-01 5.4433104478623073e-01 Dual infeasibility......: 1.6078249842621517e-12 1.6078249842621517e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000038739021e-11 1.0000000038739021e-11 Overall NLP error.......: 1.0000000038739021e-11 1.0000000038739021e-11 Number of objective function evaluations = 12 Number of objective gradient evaluations = 12 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 12 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 12 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.239 EXIT: Optimal Solution Found. Incumbent using start values: 0.5443310447862307 This is Ipopt version 3.14.19, running with linear solver MUMPS 5.8.1. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 4 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 2 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 1.5313393e+00 1.27e+01 9.97e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4629199e+00 3.33e+00 2.20e-01 -5.9 3.53e-01 - 1.00e+00 1.00e+00h 1 2 9.0633301e-01 0.00e+00 4.67e-01 -1.5 3.32e+00 - 1.00e+00 1.00e+00f 1 3 6.0440883e-01 1.57e-02 4.83e-01 -0.6 2.83e+00 - 1.00e+00 1.00e+00h 1 4 6.0956472e-01 2.33e-01 7.42e-01 -0.9 6.38e-01 - 1.00e+00 7.71e-01h 1 5 5.3465681e-01 1.44e-02 3.56e-01 -1.6 2.39e-01 - 1.00e+00 9.80e-01h 1 6 5.5531677e-01 4.24e-03 4.13e-02 -1.9 8.60e-02 - 1.00e+00 9.48e-01h 1 7 5.4465719e-01 2.02e-04 2.91e-02 -8.2 2.04e-02 - 1.00e+00 1.00e+00h 1 8 5.4433569e-01 0.00e+00 1.14e-03 -5.5 7.03e-04 - 1.00e+00 9.87e-01h 1 9 5.4433105e-01 0.00e+00 9.69e-06 -11.0 7.11e-06 - 1.00e+00 9.99e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 5.4433104e-01 0.00e+00 3.91e-08 -11.0 2.19e-08 - 1.00e+00 1.00e+00h 1 11 5.4433104e-01 0.00e+00 1.61e-12 -11.0 8.27e-13 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 11 (scaled) (unscaled) Objective...............: 5.4433104478623073e-01 5.4433104478623073e-01 Dual infeasibility......: 1.6078249842621517e-12 1.6078249842621517e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000000038739021e-11 1.0000000038739021e-11 Overall NLP error.......: 1.0000000038739021e-11 1.0000000038739021e-11 Number of objective function evaluations = 12 Number of objective gradient evaluations = 12 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 12 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 12 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.021 EXIT: Optimal Solution Found. Status of relaxation: LOCALLY_SOLVED Time for relaxation: 0.3999819755554199 Relaxation Obj: 0.5443310447862307 Obj: 0.5443310447862307 Infinite upper and lower bound: Error During Test at /home/pkgeval/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:114 Got exception outside of a @test UndefVarError: `JuniperIpoptResult` not defined in `NonconvexJuniper` Suggestion: define the const at top-level before running function that uses it (stricter Julia v1.12+ rule). Note: the binding state changed since the error occurred (was: 11, now: 0). Stacktrace: [1] #s27#1 @ ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:30 [inlined] [2] var"#s27#1"(T::Any, ::Any, ::Any) @ ConstructionBase ./none:0 [3] (::Core.GeneratedFunctionStub)(::UInt64, ::Method, ::Any, ::Vararg{Any}) @ Base ./expr.jl:1828 [4] setproperties_object(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#51#52"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#53#54"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#51#52"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#53#54"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:219 [5] setproperties(obj::NonconvexJuniper.JuniperIpoptResult{Vector{Float64}, Float64, NonconvexCore.JuMPProblem{NonconvexCore.JuMPEvaluator{Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, Vector{Float64}, NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}, NonconvexCore.var"#eval_g#get_jump_problem##3"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#51#52"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#53#54"}, Float64}}}, Nothing}, NonconvexCore.var"#eval_grad_f#get_jump_problem##4"{NonconvexCore.CountingFunction{NonconvexCore.Objective{typeof(f), Base.RefValue{Float64}}}}, NonconvexCore.var"#eval_jac_g#get_jump_problem##6"{NonconvexCore.VectorOfFunctions{Tuple{NonconvexCore.IneqConstraint{FunctionWrapper{var"#51#52"}, Float64}, NonconvexCore.IneqConstraint{FunctionWrapper{var"#53#54"}, Float64}}}, Nothing}, NonconvexCore.var"#jac_structure#get_jump_problem##5"{Int64}, NonconvexCore.var"#get_jump_problem##7#get_jump_problem##8", NonconvexCore.var"#get_jump_problem##9#get_jump_problem##10"}, JuMP.Model, Vector{MathOptInterface.VariableIndex}}, Tuple{MathOptInterface.TerminationStatusCode, MathOptInterface.ResultStatusCode}, Int64}, patch::@NamedTuple{minimizer::Vector{Float64}}) @ ConstructionBase ~/.julia/packages/ConstructionBase/Am9w7/src/ConstructionBase.jl:133 [6] set @ ~/.julia/packages/Setfield/ZezIj/src/lens.jl:122 [inlined] [7] macro expansion @ ~/.julia/packages/Setfield/ZezIj/src/sugar.jl:198 [inlined] [8] optimize(::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}; kwargs::@Kwargs{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:244 [9] kwcall(::@NamedTuple{options::JuniperIpoptOptions{@NamedTuple{}, IpoptOptions{@NamedTuple{hessian_approximation::String, jac_c_constant::String, jac_d_constant::String, sparse::Bool, symbolic::Bool}}, Bool}}, ::typeof(optimize), ::Model{Vector{Any}}, ::JuniperIpoptAlg, ::Vector{Float64}) @ NonconvexCore ~/.julia/packages/NonconvexCore/TFoWG/src/common.jl:234 [10] top-level scope @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:2066 [11] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:2042 [inlined] [12] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:83 [inlined] [13] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1961 [inlined] [14] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:115 [inlined] [15] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1961 [inlined] [16] macro expansion @ ~/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:121 [inlined] [17] include(mapexpr::Function, mod::Module, _path::String) @ Base ./Base.jl:310 [18] top-level scope @ none:6 [19] eval(m::Module, e::Any) @ Core ./boot.jl:489 [20] exec_options(opts::Base.JLOptions) @ Base ./client.jl:310 [21] _start() @ Base ./client.jl:577 Test Summary: | Error Total Time First order - true | 6 6 4m07.0s Simple constraints | 1 1 3m34.3s Equality constraints | 1 1 0.3s Block constraints | 1 1 7.3s Infinite bounds | 3 3 25.0s Infinite upper bound | 1 1 8.2s Infinite lower bound | 1 1 8.9s Infinite upper and lower bound | 1 1 7.8s RNG of the outermost testset: Random.Xoshiro(0xb3d732b893a8cc3b, 0x3b29f2386830c645, 0x3600528b9b8f8a59, 0x314f5e4e3dd20680, 0xcc823a3f86c70047) ERROR: LoadError: Some tests did not pass: 0 passed, 0 failed, 6 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/NonconvexJuniper/7AcRL/test/runtests.jl:6 Testing failed after 434.15s ERROR: LoadError: Package NonconvexJuniper errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/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.13/Pkg/src/Operations.jl:2674 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2523 [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.13/Pkg/src/API.jl:548 [5] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:525 [6] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:172 [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:161 [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:160 [9] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:160 [inlined] [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:159 [11] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [12] include(mod::Module, _path::String) @ Base ./Base.jl:309 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:344 [14] _start() @ Base ./client.jl:577 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 967.52s: package tests unexpectedly errored