Package evaluation of NonconvexPavito on Julia 1.12.0-rc1 (228edd6610*) started at 2025-07-15T01:16:18.316 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.97s ################################################################################ # Installation # Installing NonconvexPavito... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [75d5b151] + NonconvexPavito v0.1.5 Updating `~/.julia/environments/v1.12/Manifest.toml` [47edcb42] + ADTypes v1.15.0 ⌅ [c29ec348] + AbstractDifferentiation v0.4.4 [621f4979] + AbstractFFTs v1.5.0 [1520ce14] + AbstractTrees v0.4.5 [7d9f7c33] + Accessors v0.1.42 [79e6a3ab] + Adapt v4.3.0 [66dad0bd] + AliasTables v1.1.3 [ec485272] + ArnoldiMethod v0.4.0 [4fba245c] + ArrayInterface v7.19.0 [a9b6321e] + Atomix v1.1.1 [6e4b80f9] + BenchmarkTools v1.6.0 ⌅ [e2ed5e7c] + Bijections v0.1.10 [fa961155] + CEnum v0.5.0 [96374032] + CRlibm v1.0.2 [9961bab8] + Cbc v1.2.0 [082447d4] + ChainRules v1.72.5 [d360d2e6] + ChainRulesCore v1.25.2 [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.17.0 [b152e2b5] + CompositeTypes v0.1.4 [a33af91c] + CompositionsBase v0.1.2 ⌅ [187b0558] + ConstructionBase v1.5.6 [a8cc5b0e] + Crayons v4.1.1 [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.120 [ffbed154] + DocStringExtensions v0.9.5 [5b8099bc] + DomainSets v0.7.15 ⌅ [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.13.0 [6a86dc24] + FiniteDiff v2.27.0 [1fa38f19] + Format v1.3.7 ⌅ [f6369f11] + ForwardDiff v0.10.38 [069b7b12] + FunctionWrappers v1.1.3 [77dc65aa] + FunctionWrappersWrappers v0.1.3 [0c68f7d7] + GPUArrays v11.2.3 [46192b85] + GPUArraysCore v0.2.0 [86223c79] + Graphs v1.13.0 [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.10.6 [92d709cd] + IrrationalConstants v0.2.4 [42fd0dbc] + IterativeSolvers v0.9.4 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [ae98c720] + Jieko v0.2.1 [4076af6c] + JuMP v1.26.0 [63c18a36] + KernelAbstractions v0.9.37 [929cbde3] + LLVM v9.4.2 [b964fa9f] + LaTeXStrings v1.4.0 [2ee39098] + LabelledArrays v1.16.1 ⌅ [984bce1d] + LambertW v0.4.6 [23fbe1c1] + Latexify v0.16.8 [7a12625a] + LinearMaps v3.11.4 [5c8ed15e] + LinearOperators v2.10.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.42.0 [e1d29d7a] + Missings v1.2.0 [2e0e35c7] + Moshi v0.3.7 [102ac46a] + MultivariatePolynomials v0.5.9 [d8a4904e] + MutableArithmetics v1.6.4 [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 [75d5b151] + NonconvexPavito v0.1.5 [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 [cd433a01] + Pavito v0.3.9 [d236fae5] + PreallocationTools v0.4.28 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [08abe8d2] + PrettyTables v2.4.0 [43287f4e] + PtrArrays v1.3.0 [1fd47b50] + QuadGK v2.11.2 [c1ae055f] + RealDot v0.1.0 [3cdcf5f2] + RecipesBase v1.3.4 [731186ca] + RecursiveArrayTools v3.34.1 [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 [53ae85a6] + SciMLStructures v1.7.0 [7e506255] + ScopedValues v1.3.0 [3cc68bcd] + SetRounding v0.2.1 [efcf1570] + Setfield v1.1.2 [699a6c99] + SimpleTraits v0.9.4 [ff4d7338] + SolverCore v0.3.8 [a2af1166] + SortingAlgorithms v1.2.1 ⌃ [47a9eef4] + SparseDiffTools v2.23.1 [dc90abb0] + SparseInverseSubset v0.1.2 [276daf66] + SpecialFunctions v2.5.1 [aedffcd0] + Static v1.2.0 [0d7ed370] + StaticArrayInterface v1.8.0 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.1 [2913bbd2] + StatsBase v0.34.5 [4c63d2b9] + StatsFuns v1.5.0 [892a3eda] + StringManipulation v0.4.1 [09ab397b] + StructArrays v0.7.1 [856f2bd8] + StructTypes v1.11.0 [2efcf032] + SymbolicIndexingInterface v0.3.41 ⌃ [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 [38041ee0] + Cbc_jll v200.1000.800+0 [3830e938] + Cgl_jll v0.6000.600+0 ⌅ [06985876] + Clp_jll v100.1700.700+1 ⌅ [be027038] + CoinUtils_jll v200.1100.600+0 [e33a78d0] + Hwloc_jll v2.12.1+0 [9cc047cb] + Ipopt_jll v300.1400.1701+0 [dad2f222] + LLVMExtra_jll v0.0.37+2 [d00139f3] + METIS_jll v5.1.3+0 [d7ed1dd3] + MUMPS_seq_jll v500.800.0+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 ⌅ [7da25872] + Osi_jll v0.10800.700+0 [f50d1b31] + Rmath_jll v0.5.1+0 [319450e9] + SPRAL_jll v2025.5.20+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.6.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.12.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.12.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.11.1+1 [e37daf67] + LibGit2_jll v1.9.0+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.5.20 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [83775a58] + Zlib_jll v1.3.1+2 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.64.0+1 [3f19e933] + p7zip_jll v17.5.0+2 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 10.61s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 2341.7s ################################################################################ # Testing # Testing NonconvexPavito Status `/tmp/jl_VlmlBf/Project.toml` [9961bab8] Cbc v1.2.0 [b6b21f68] Ipopt v1.10.6 [4076af6c] JuMP v1.26.0 [b8f27783] MathOptInterface v1.42.0 [035190e5] NonconvexCore v1.4.3 [bf347577] NonconvexIpopt v0.4.3 [75d5b151] NonconvexPavito v0.1.5 [d96e819e] Parameters v0.12.3 [cd433a01] Pavito v0.3.9 [189a3867] Reexport v1.2.2 [37e2e46d] LinearAlgebra v1.12.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_VlmlBf/Manifest.toml` [47edcb42] ADTypes v1.15.0 ⌅ [c29ec348] AbstractDifferentiation v0.4.4 [621f4979] AbstractFFTs v1.5.0 [1520ce14] AbstractTrees v0.4.5 [7d9f7c33] Accessors v0.1.42 [79e6a3ab] Adapt v4.3.0 [66dad0bd] AliasTables v1.1.3 [ec485272] ArnoldiMethod v0.4.0 [4fba245c] ArrayInterface v7.19.0 [a9b6321e] Atomix v1.1.1 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [e2ed5e7c] Bijections v0.1.10 [fa961155] CEnum v0.5.0 [96374032] CRlibm v1.0.2 [9961bab8] Cbc v1.2.0 [082447d4] ChainRules v1.72.5 [d360d2e6] ChainRulesCore v1.25.2 [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.17.0 [b152e2b5] CompositeTypes v0.1.4 [a33af91c] CompositionsBase v0.1.2 ⌅ [187b0558] ConstructionBase v1.5.6 [a8cc5b0e] Crayons v4.1.1 [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.120 [ffbed154] DocStringExtensions v0.9.5 [5b8099bc] DomainSets v0.7.15 ⌅ [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.13.0 [6a86dc24] FiniteDiff v2.27.0 [1fa38f19] Format v1.3.7 ⌅ [f6369f11] ForwardDiff v0.10.38 [069b7b12] FunctionWrappers v1.1.3 [77dc65aa] FunctionWrappersWrappers v0.1.3 [0c68f7d7] GPUArrays v11.2.3 [46192b85] GPUArraysCore v0.2.0 [86223c79] Graphs v1.13.0 [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.10.6 [92d709cd] IrrationalConstants v0.2.4 [42fd0dbc] IterativeSolvers v0.9.4 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [ae98c720] Jieko v0.2.1 [4076af6c] JuMP v1.26.0 [63c18a36] KernelAbstractions v0.9.37 [929cbde3] LLVM v9.4.2 [b964fa9f] LaTeXStrings v1.4.0 [2ee39098] LabelledArrays v1.16.1 ⌅ [984bce1d] LambertW v0.4.6 [23fbe1c1] Latexify v0.16.8 [7a12625a] LinearMaps v3.11.4 [5c8ed15e] LinearOperators v2.10.0 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.42.0 [e1d29d7a] Missings v1.2.0 [2e0e35c7] Moshi v0.3.7 [102ac46a] MultivariatePolynomials v0.5.9 [d8a4904e] MutableArithmetics v1.6.4 [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 [75d5b151] NonconvexPavito v0.1.5 [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 [cd433a01] Pavito v0.3.9 [d236fae5] PreallocationTools v0.4.28 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [08abe8d2] PrettyTables v2.4.0 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [c1ae055f] RealDot v0.1.0 [3cdcf5f2] RecipesBase v1.3.4 [731186ca] RecursiveArrayTools v3.34.1 [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 [53ae85a6] SciMLStructures v1.7.0 [7e506255] ScopedValues v1.3.0 [3cc68bcd] SetRounding v0.2.1 [efcf1570] Setfield v1.1.2 [699a6c99] SimpleTraits v0.9.4 [ff4d7338] SolverCore v0.3.8 [a2af1166] SortingAlgorithms v1.2.1 ⌃ [47a9eef4] SparseDiffTools v2.23.1 [dc90abb0] SparseInverseSubset v0.1.2 [276daf66] SpecialFunctions v2.5.1 [aedffcd0] Static v1.2.0 [0d7ed370] StaticArrayInterface v1.8.0 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.5 [4c63d2b9] StatsFuns v1.5.0 [892a3eda] StringManipulation v0.4.1 [09ab397b] StructArrays v0.7.1 [856f2bd8] StructTypes v1.11.0 [2efcf032] SymbolicIndexingInterface v0.3.41 ⌃ [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 [38041ee0] Cbc_jll v200.1000.800+0 [3830e938] Cgl_jll v0.6000.600+0 ⌅ [06985876] Clp_jll v100.1700.700+1 ⌅ [be027038] CoinUtils_jll v200.1100.600+0 [e33a78d0] Hwloc_jll v2.12.1+0 [9cc047cb] Ipopt_jll v300.1400.1701+0 [dad2f222] LLVMExtra_jll v0.0.37+2 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.0+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [7da25872] Osi_jll v0.10800.700+0 [f50d1b31] Rmath_jll v0.5.1+0 [319450e9] SPRAL_jll v2025.5.20+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.6.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.12.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.12.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.11.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.5.20 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.5.0+2 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... MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints Pavito started, using iterative method... ****************************************************************************** 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.17, running with linear solver MUMPS 5.8.0. 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.956 EXIT: Optimal Solution Found. Iter. | Best feasible | Best bound | Rel. gap | Time (s) 1 | +Inf | +9.525794e-01 | >1000 | 5.525e+01 Welcome to the CBC MILP Solver Version: 2.10.8 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.544331 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (1 integer (0 of which binary)) and 6 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 0.952579 Cbc0012I Integer solution of 0.95257935 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.68633046 to 0.95257935 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 0.9525793512948707, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.68633 to 0.952579 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.95257935 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 2 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 0.00e+00 5.58e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4917336e+00 0.00e+00 2.77e-02 -5.5 1.20e-01 - 9.75e-01 1.00e+00f 1 2 1.3932842e+00 0.00e+00 1.03e-01 -2.4 2.84e-01 - 9.99e-01 1.00e+00f 1 3 1.2638096e+00 0.00e+00 1.27e-01 -3.8 3.44e-01 - 1.00e+00 1.00e+00f 1 4 1.0998287e+00 0.00e+00 1.49e-01 -4.6 3.88e-01 - 1.00e+00 1.00e+00f 1 5 1.0010476e+00 0.00e+00 1.61e-01 -5.3 4.40e-01 - 1.00e+00 4.72e-01f 1 6 1.0000105e+00 0.00e+00 2.09e-02 -6.1 6.22e-02 - 1.00e+00 3.34e-02f 1 7 1.0000001e+00 0.00e+00 9.58e-06 -6.7 2.35e-05 - 1.00e+00 8.82e-01f 1 8 1.0000000e+00 0.00e+00 8.73e-08 -11.0 2.10e-07 - 1.00e+00 1.00e+00f 1 9 1.0000000e+00 0.00e+00 5.04e-12 -11.0 1.21e-11 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 9 (scaled) (unscaled) Objective...............: 9.9999999500999992e-01 9.9999999500999992e-01 Dual infeasibility......: 5.0438542231745487e-12 5.0438542231745487e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000003171940096e-11 1.0000003171940096e-11 Overall NLP error.......: 1.0000003171940096e-11 1.0000003171940096e-11 Number of objective function evaluations = 10 Number of objective gradient evaluations = 10 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 10 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 10 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.016 EXIT: Optimal Solution Found. 2 | +1.000000e+00 | +1.190724e+00 | -1.907e-01 | 5.935e+01 Pavito finished... Status LOCALLY_SOLVED Objective value 1.00000 Objective bound 1.19072 Objective gap -0.19072 Iterations 2 Total time 59.83632 sec MIP total time 29.82109 sec NLP total time 14.81251 sec MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints Pavito started, using iterative method... Welcome to the CBC MILP Solver Version: 2.10.8 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.648148 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (1 integer (0 of which binary)) and 10 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 1.19072 Cbc0012I Integer solution of 1.1907242 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.79175426 to 1.1907242 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 1.190724191403735, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.791754 to 1.19072 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.19072419 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. 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.021 EXIT: Optimal Solution Found. Iter. | Best feasible | Best bound | Rel. gap | Time (s) 1 | +Inf | +1.190724e+00 | >1000 | 3.279e-02 Welcome to the CBC MILP Solver Version: 2.10.8 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.544331 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (1 integer (0 of which binary)) and 6 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I Warning: mipstart values could not be used to build a solution. Cbc0012I Integer solution of 1.1907242 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.60120146 to 0.60120146 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 1.190724191403735, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.601201 to 0.601201 Probing was tried 1 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.19072419 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 2 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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.0000000e+00 1.40e+01 9.95e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0000000e+00 3.91e+00 5.05e-02 -5.6 3.84e-01 - 9.48e-01 1.00e+00h 1 2 1.0000000e+00 9.10e-01 7.65e-02 -2.4 2.29e-01 - 9.97e-01 1.00e+00h 1 3 1.0000000e+00 1.08e-01 4.31e-02 -3.9 1.03e-01 - 1.00e+00 1.00e+00h 1 4 1.0000000e+00 0.00e+00 5.25e-03 -4.7 2.91e-02 - 1.00e+00 1.00e+00h 1 5 1.0000000e+00 0.00e+00 2.97e-05 -6.0 1.69e-03 - 1.00e+00 1.00e+00h 1 6 1.0000000e+00 0.00e+00 1.75e-10 -11.0 4.60e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: 1.0000000000000000e+00 1.0000000000000000e+00 Dual infeasibility......: 1.7473112512335106e-10 1.7473112512335106e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 6.1583413772522774e-11 6.1583413772522774e-11 Overall NLP error.......: 1.7473112512335106e-10 1.7473112512335106e-10 Number of objective function evaluations = 7 Number of objective gradient evaluations = 7 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 7 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 7 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.013 EXIT: Optimal Solution Found. Pavito finished... Status LOCALLY_SOLVED Objective value 1.00000 Objective bound 1.19072 Objective gap -0.19072 Iterations 1 Total time 0.04711 sec MIP total time 0.00938 sec NLP total time 0.03665 sec MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints Pavito started, using iterative method... This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. 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.313 EXIT: Optimal Solution Found. Iter. | Best feasible | Best bound | Rel. gap | Time (s) 1 | +Inf | +9.525794e-01 | >1000 | 5.596e-01 Welcome to the CBC MILP Solver Version: 2.10.8 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.544331 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (1 integer (0 of which binary)) and 6 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 0.952579 Cbc0012I Integer solution of 0.95257935 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.68633046 to 0.95257935 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 0.9525793512948707, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.68633 to 0.952579 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.95257935 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 2 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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 0.00e+00 5.58e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4917336e+00 0.00e+00 2.77e-02 -5.5 1.20e-01 - 9.75e-01 1.00e+00f 1 2 1.3932842e+00 0.00e+00 1.03e-01 -2.4 2.84e-01 - 9.99e-01 1.00e+00f 1 3 1.2638096e+00 0.00e+00 1.27e-01 -3.8 3.44e-01 - 1.00e+00 1.00e+00f 1 4 1.0998287e+00 0.00e+00 1.49e-01 -4.6 3.88e-01 - 1.00e+00 1.00e+00f 1 5 1.0010476e+00 0.00e+00 1.61e-01 -5.3 4.40e-01 - 1.00e+00 4.72e-01f 1 6 1.0000105e+00 0.00e+00 2.09e-02 -6.1 6.22e-02 - 1.00e+00 3.34e-02f 1 7 1.0000001e+00 0.00e+00 9.58e-06 -6.7 2.35e-05 - 1.00e+00 8.82e-01f 1 8 1.0000000e+00 0.00e+00 8.73e-08 -11.0 2.10e-07 - 1.00e+00 1.00e+00f 1 9 1.0000000e+00 0.00e+00 5.04e-12 -11.0 1.21e-11 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 9 (scaled) (unscaled) Objective...............: 9.9999999500999992e-01 9.9999999500999992e-01 Dual infeasibility......: 5.0438542231745487e-12 5.0438542231745487e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000003171940096e-11 1.0000003171940096e-11 Overall NLP error.......: 1.0000003171940096e-11 1.0000003171940096e-11 Number of objective function evaluations = 10 Number of objective gradient evaluations = 10 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 10 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 10 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.014 EXIT: Optimal Solution Found. 2 | +1.000000e+00 | +1.190724e+00 | -1.907e-01 | 5.819e-01 Pavito finished... Status LOCALLY_SOLVED Objective value 1.00000 Objective bound 1.19072 Objective gap -0.19072 Iterations 2 Total time 0.58219 sec MIP total time 0.01682 sec NLP total time 0.34600 sec MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints Pavito started, using iterative method... Welcome to the CBC MILP Solver Version: 2.10.8 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.648148 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (1 integer (0 of which binary)) and 10 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 1.19072 Cbc0012I Integer solution of 1.1907242 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.79175426 to 1.1907242 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 1.190724191403735, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.791754 to 1.19072 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.19072419 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. 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. Iter. | Best feasible | Best bound | Rel. gap | Time (s) 1 | +Inf | +1.190724e+00 | >1000 | 3.056e-02 Welcome to the CBC MILP Solver Version: 2.10.8 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.544331 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (1 integer (0 of which binary)) and 6 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I Warning: mipstart values could not be used to build a solution. Cbc0012I Integer solution of 1.1907242 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.60120146 to 0.60120146 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 1.190724191403735, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.601201 to 0.601201 Probing was tried 1 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.19072419 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 2 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 0 variables with lower and upper bounds: 1 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.0000000e+00 1.40e+01 9.95e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0000000e+00 3.91e+00 5.05e-02 -5.6 3.84e-01 - 9.48e-01 1.00e+00h 1 2 1.0000000e+00 9.10e-01 7.65e-02 -2.4 2.29e-01 - 9.97e-01 1.00e+00h 1 3 1.0000000e+00 1.08e-01 4.31e-02 -3.9 1.03e-01 - 1.00e+00 1.00e+00h 1 4 1.0000000e+00 0.00e+00 5.25e-03 -4.7 2.91e-02 - 1.00e+00 1.00e+00h 1 5 1.0000000e+00 0.00e+00 2.97e-05 -6.0 1.69e-03 - 1.00e+00 1.00e+00h 1 6 1.0000000e+00 0.00e+00 1.75e-10 -11.0 4.60e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: 1.0000000000000000e+00 1.0000000000000000e+00 Dual infeasibility......: 1.7473112512335106e-10 1.7473112512335106e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 6.1583413772522774e-11 6.1583413772522774e-11 Overall NLP error.......: 1.7473112512335106e-10 1.7473112512335106e-10 Number of objective function evaluations = 7 Number of objective gradient evaluations = 7 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 7 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 7 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.010 EXIT: Optimal Solution Found. Pavito finished... Status LOCALLY_SOLVED Objective value 1.00000 Objective bound 1.19072 Objective gap -0.19072 Iterations 1 Total time 0.04259 sec MIP total time 0.00979 sec NLP total time 0.03141 sec MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints Pavito started, using iterative method... This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. 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.241 EXIT: Optimal Solution Found. Iter. | Best feasible | Best bound | Rel. gap | Time (s) 1 | +Inf | +9.525794e-01 | >1000 | 4.872e-01 Welcome to the CBC MILP Solver Version: 2.10.8 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.544331 - 0.00 seconds Cgl0003I 0 fixed, 1 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 2 rows, 2 columns (1 integer (0 of which binary)) and 4 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 0.680414 Cbc0012I Integer solution of 0.95257935 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.68633046 to 0.95257935 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 0.9525793512948706, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.68633 to 0.952579 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.95257935 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 2 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 1 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 0.00e+00 8.91e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.4897129e+00 0.00e+00 4.50e-02 -5.7 1.26e-01 - 1.00e+00 1.00e+00f 1 2 1.3859678e+00 0.00e+00 1.08e-01 -6.9 2.98e-01 - 1.00e+00 1.00e+00f 1 3 1.2535760e+00 0.00e+00 1.29e-01 -7.8 3.49e-01 - 1.00e+00 1.00e+00f 1 4 1.0859133e+00 0.00e+00 1.51e-01 -8.5 3.92e-01 - 1.00e+00 1.00e+00f 1 5 1.0008956e+00 0.00e+00 1.61e-01 -9.2 4.45e-01 - 1.00e+00 3.98e-01f 1 6 1.0000090e+00 0.00e+00 1.81e-02 -10.0 5.39e-02 - 1.00e+00 3.29e-02f 1 7 1.0000001e+00 0.00e+00 8.11e-06 -7.0 1.99e-05 - 1.00e+00 8.92e-01f 1 8 1.0000000e+00 0.00e+00 7.47e-08 -11.0 1.79e-07 - 1.00e+00 1.00e+00f 1 9 1.0000000e+00 0.00e+00 3.63e-12 -11.0 8.72e-12 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 9 (scaled) (unscaled) Objective...............: 9.9999999500999992e-01 9.9999999500999992e-01 Dual infeasibility......: 3.6348701826227625e-12 3.6348701826227625e-12 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.0000001954100218e-11 1.0000001954100218e-11 Overall NLP error.......: 1.0000001954100218e-11 1.0000001954100218e-11 Number of objective function evaluations = 10 Number of objective gradient evaluations = 10 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 10 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 10 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.016 EXIT: Optimal Solution Found. 2 | +1.000000e+00 | +1.190724e+00 | -1.907e-01 | 5.106e-01 Pavito finished... Status LOCALLY_SOLVED Objective value 1.00000 Objective bound 1.19072 Objective gap -0.19072 Iterations 2 Total time 0.51067 sec MIP total time 0.01384 sec NLP total time 0.27549 sec MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints Pavito started, using iterative method... Welcome to the CBC MILP Solver Version: 2.10.8 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.648148 - 0.00 seconds Cgl0003I 0 fixed, 1 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (1 integer (0 of which binary)) and 10 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I MIPStart provided solution with cost 1.19072 Cbc0012I Integer solution of 1.1907242 found by Reduced search after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.79175426 to 1.1907242 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 1.190724191403735, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.791754 to 1.19072 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.19072419 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. 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.022 EXIT: Optimal Solution Found. Iter. | Best feasible | Best bound | Rel. gap | Time (s) 1 | +Inf | +1.190724e+00 | >1000 | 3.507e-02 Welcome to the CBC MILP Solver Version: 2.10.8 Build Date: Jan 1 1970 command line - Cbc_C_Interface -solve -quit (default strategy 1) Continuous objective value is 0.544331 - 0.00 seconds Cgl0003I 0 fixed, 1 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (1 integer (0 of which binary)) and 6 elements Cbc0045I Trying just fixing integer variables (and fixingish SOS). Cbc0045I Warning: mipstart values could not be used to build a solution. Cbc0012I Integer solution of 1.1907242 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0.60120146 to 0.60120146 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 1.190724191403735, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0.601201 to 0.601201 Probing was tried 1 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.19072419 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 2 Number of nonzeros in Lagrangian Hessian.............: 0 Total number of variables............................: 1 variables with only lower bounds: 1 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.0000000e+00 1.40e+01 9.67e-01 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.0000000e+00 3.91e+00 1.91e-02 -6.1 3.84e-01 - 1.00e+00 1.00e+00h 1 2 1.0000000e+00 8.82e-01 7.40e-02 -2.6 2.32e-01 - 9.96e-01 1.00e+00h 1 3 1.0000000e+00 8.80e-02 4.03e-02 -7.7 1.03e-01 - 1.00e+00 1.00e+00h 1 4 1.0000000e+00 0.00e+00 4.79e-03 -8.6 2.92e-02 - 1.00e+00 1.00e+00h 1 5 1.0000000e+00 0.00e+00 2.66e-05 -6.0 1.66e-03 - 1.00e+00 1.00e+00h 1 6 1.0000000e+00 0.00e+00 1.29e-10 -11.0 4.48e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 6 (scaled) (unscaled) Objective...............: 1.0000000000000000e+00 1.0000000000000000e+00 Dual infeasibility......: 1.2937721299307604e-10 1.2937721299307604e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.6512502407533024e-11 4.6512502407533024e-11 Overall NLP error.......: 1.2937721299307604e-10 1.2937721299307604e-10 Number of objective function evaluations = 7 Number of objective gradient evaluations = 7 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 7 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 7 Number of Lagrangian Hessian evaluations = 0 Total seconds in IPOPT = 0.015 EXIT: Optimal Solution Found. Pavito finished... Status LOCALLY_SOLVED Objective value 1.00000 Objective bound 1.19072 Objective gap -0.19072 Iterations 1 Total time 0.05148 sec MIP total time 0.00972 sec NLP total time 0.04018 sec Test Summary: | Pass Total Time First order - true | 6 6 3m48.5s ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 591 running 1 of 1 signal (10): User defined signal 1 process_node! at ./../usr/share/julia/Compiler/src/ssair/ir.jl:1559 iterate_compact at ./../usr/share/julia/Compiler/src/ssair/ir.jl:1940 iterate at ./../usr/share/julia/Compiler/src/ssair/ir.jl:1862 [inlined] compact! at ./../usr/share/julia/Compiler/src/ssair/ir.jl:2139 compact! at ./../usr/share/julia/Compiler/src/ssair/ir.jl:2137 [inlined] run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1013 run_passes_ipo_safe at ./../usr/share/julia/Compiler/src/optimize.jl:1027 [inlined] optimize at ./../usr/share/julia/Compiler/src/optimize.jl:1002 jfptr_optimize_121150.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 finish_nocycle at ./../usr/share/julia/Compiler/src/typeinfer.jl:202 jfptr_finish_nocycle_120558.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 typeinf at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:4450 typeinf_ext at ./../usr/share/julia/Compiler/src/typeinfer.jl:1259 typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1442 [inlined] typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1451 jfptr_typeinf_ext_toplevel_118228.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] jl_type_infer at /source/src/gf.c:462 jl_compile_method_internal at /source/src/gf.c:3302 _jl_invoke at /source/src/gf.c:3792 [inlined] ijl_apply_generic at /source/src/gf.c:4000 #s84#365 at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/lib/lib.jl:221 [inlined] #s84#365 at ./none:0 unknown function (ip: 0x7616bdd90496) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 GeneratedFunctionStub at ./expr.jl:1694 _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_call_staged at /source/src/method.c:662 ijl_code_for_staged at /source/src/method.c:735 call_get_staged at ./../usr/share/julia/Compiler/src/utilities.jl:103 [inlined] get_staged at ./../usr/share/julia/Compiler/src/utilities.jl:88 jfptr_get_staged_41546.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_invoke at /source/src/gf.c:3807 tojlinvoke122906.1 at /opt/julia/lib/julia/sys.so (unknown line) j_get_staged_115113.1 at /opt/julia/lib/julia/sys.so (unknown line) retrieve_code_info at ./../usr/share/julia/Compiler/src/utilities.jl:121 InferenceState at ./../usr/share/julia/Compiler/src/inferencestate.jl:602 [inlined] typeinf_edge at ./../usr/share/julia/Compiler/src/typeinfer.jl:963 abstract_call_method at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:735 infercalls at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:167 abstract_call_gf_by_type at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:338 abstract_call_known at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:2782 abstract_call at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:2889 abstract_call at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:2882 [inlined] abstract_call at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:3042 abstract_eval_call at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:3060 [inlined] abstract_eval_statement_expr at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:3389 abstract_eval_basic_statement at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:3778 [inlined] abstract_eval_basic_statement at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:3735 [inlined] typeinf_local at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:4285 jfptr_typeinf_local_121155.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 typeinf at ./../usr/share/julia/Compiler/src/abstractinterpretation.jl:4443 typeinf_ext at ./../usr/share/julia/Compiler/src/typeinfer.jl:1259 typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1442 [inlined] typeinf_ext_toplevel at ./../usr/share/julia/Compiler/src/typeinfer.jl:1451 jfptr_typeinf_ext_toplevel_118228.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] jl_type_infer at /source/src/gf.c:462 jl_compile_method_internal at /source/src/gf.c:3302 _jl_invoke at /source/src/gf.c:3792 [inlined] ijl_apply_generic at /source/src/gf.c:4000 #get_jump_problem##1 at /home/pkgeval/.julia/packages/NonconvexCore/TFoWG/src/models/moi.jl:90 [inlined] Pullback at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/compiler/interface2.jl:0 #pullback##0 at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/compiler/interface.jl:91 unknown function (ip: 0x7616bd679c82) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 gradient at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/compiler/interface.jl:148 #hessian_dual##0 at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/lib/grad.jl:104 [inlined] forward_jacobian at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/lib/forward.jl:29 unknown function (ip: 0x7616bd65f7db) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 #forward_jacobian#2052 at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/lib/forward.jl:44 forward_jacobian at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/lib/forward.jl:42 [inlined] hessian_dual at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/lib/grad.jl:104 [inlined] hessian at /home/pkgeval/.julia/packages/Zygote/zowwZ/src/lib/grad.jl:102 [inlined] get_jump_problem at /home/pkgeval/.julia/packages/NonconvexCore/TFoWG/src/models/moi.jl:135 #get_jump_problem#92 at /home/pkgeval/.julia/packages/NonconvexCore/TFoWG/src/models/moi.jl:45 [inlined] get_jump_problem at /home/pkgeval/.julia/packages/NonconvexCore/TFoWG/src/models/moi.jl:26 [inlined] #PavitoIpoptCbcWorkspace#2 at /home/pkgeval/.julia/packages/NonconvexPavito/n1FgD/src/NonconvexPavito.jl:55 PavitoIpoptCbcWorkspace at /home/pkgeval/.julia/packages/NonconvexPavito/n1FgD/src/NonconvexPavito.jl:34 [inlined] #Workspace#9 at /home/pkgeval/.julia/packages/NonconvexPavito/n1FgD/src/NonconvexPavito.jl:89 [inlined] Workspace at /home/pkgeval/.julia/packages/NonconvexPavito/n1FgD/src/NonconvexPavito.jl:88 [inlined] #optimize#65 at /home/pkgeval/.julia/packages/NonconvexCore/TFoWG/src/models/vec_model.jl:76 optimize at /home/pkgeval/.julia/packages/NonconvexCore/TFoWG/src/models/vec_model.jl:75 unknown function (ip: 0x7616bdd37c73) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 #optimize#33 at /home/pkgeval/.julia/packages/NonconvexCore/TFoWG/src/common.jl:243 optimize at /home/pkgeval/.julia/packages/NonconvexCore/TFoWG/src/common.jl:234 unknown function (ip: 0x7616e839a4a3) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_body at /source/src/interpreter.c:581 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 include_string at ./loading.jl:2837 _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 _include at ./loading.jl:2897 include at ./Base.jl:304 IncludeInto at ./Base.jl:305 jfptr_IncludeInto_82120.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 exec_options at ./client.jl:287 _start at ./client.jl:554 jfptr__start_99273.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1139 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7616e96e2249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== MINLP has a nonlinear objective, 2 continuous variables, 1 integer variables, 2 nonlinear constraints, and 0 quadratic constraints ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 1 running 0 of 1 signal (10): User defined signal 1 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 poptask at ./task.jl:1187 wait at ./task.jl:1199 #wait#399 at ./condition.jl:141 wait at ./condition.jl:136 [inlined] wait at ./process.jl:694 wait at ./process.jl:687 jfptr_wait_82598.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 subprocess_handler at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2476 unknown function (ip: 0x7892fdcf3893) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 #213 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2416 withenv at ./env.jl:265 #198 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2237 with_temp_env at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2087 #194 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2196 #mktempdir#21 at ./file.jl:899 unknown function (ip: 0x7892fdce571c) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 mktempdir at ./file.jl:895 mktempdir at ./file.jl:895 #sandbox#190 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2143 [inlined] sandbox at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2135 unknown function (ip: 0x7892fdcdedc9) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 #test#201 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2401 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2313 [inlined] #test#170 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:511 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:490 unknown function (ip: 0x7892fdcddfd1) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 #test#84 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:164 unknown function (ip: 0x7892fdcdd2a8) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:153 #test#82 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:152 test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:152 [inlined] #test#81 at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:151 [inlined] test at /source/usr/share/julia/stdlib/v1.12/Pkg/src/API.jl:151 unknown function (ip: 0x7892fdcd3c9f) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] do_call at /source/src/interpreter.c:123 eval_value at /source/src/interpreter.c:243 eval_stmt_value at /source/src/interpreter.c:194 [inlined] eval_body at /source/src/interpreter.c:693 eval_body at /source/src/interpreter.c:558 eval_body at /source/src/interpreter.c:558 jl_interpret_toplevel_thunk at /source/src/interpreter.c:898 jl_toplevel_eval_flex at /source/src/toplevel.c:1035 jl_toplevel_eval_flex at /source/src/toplevel.c:975 ijl_toplevel_eval at /source/src/toplevel.c:1047 ijl_toplevel_eval_in at /source/src/toplevel.c:1092 eval at ./boot.jl:489 include_string at ./loading.jl:2837 _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 _include at ./loading.jl:2897 include at ./Base.jl:303 exec_options at ./client.jl:321 _start at ./client.jl:554 jfptr__start_99273.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] true_main at /source/src/jlapi.c:971 jl_repl_entrypoint at /source/src/jlapi.c:1139 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7892ff676249) at /lib/x86_64-linux-gnu/libc.so.6 __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) at /workspace/srcdir/glibc-2.17/csu/../sysdeps/x86_64/start.S unknown function (ip: (nil)) at (unknown file) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ┌ Warning: There were no samples collected in one or more groups. │ This may be due to idle threads, or you may need to run your │ program longer (perhaps by running it multiple times), │ or adjust the delay between samples with `Profile.init()`. └ @ Profile /opt/julia/share/julia/stdlib/v1.12/Profile/src/Profile.jl:1362 Overhead ╎ [+additional indent] Count File:Line Function ========================================================= Thread 1 (default) Task 0x00007892e4c00010 Total snapshots: 402. Utilization: 0% ╎402 @Base/client.jl:554 _start() ╎ 402 @Base/client.jl:321 exec_options(opts::Base.JLOptions) ╎ 402 @Base/Base.jl:303 include(mod::Module, _path::String) ╎ 402 @Base/loading.jl:2897 _include(mapexpr::Function, mod::Module, _pat… ╎ 402 @Base/loading.jl:2837 include_string(mapexpr::typeof(identity), mo… ╎ 402 @Base/boot.jl:489 eval(m::Module, e::Any) ╎ ╎ 402 @Pkg/src/API.jl:151 kwcall(::@NamedTuple{julia_args::Cmd}, ::typ… ╎ ╎ 402 @Pkg/src/API.jl:151 #test#81 ╎ ╎ 402 @Pkg/src/API.jl:152 test ╎ ╎ 402 @Pkg/src/API.jl:152 test(pkgs::Vector{String}; kwargs::Base.P… ╎ ╎ 402 @Pkg/src/API.jl:153 kwcall(::@NamedTuple{julia_args::Cmd}, :… ╎ ╎ ╎ 402 @Pkg/src/API.jl:164 test(pkgs::Vector{PackageSpec}; io::IOC… ╎ ╎ ╎ 402 @Pkg/src/API.jl:490 kwcall(::@NamedTuple{julia_args::Cmd, … ╎ ╎ ╎ 402 @Pkg/src/API.jl:511 test(ctx::Pkg.Types.Context, pkgs::Ve… ╎ ╎ ╎ 402 @Pkg/…erations.jl:2313 test ╎ ╎ ╎ 402 @Pkg/…erations.jl:2401 test(ctx::Pkg.Types.Context, pkg… ╎ ╎ ╎ ╎ 402 @Pkg/…rations.jl:2135 kwcall(::@NamedTuple{preferences… ╎ ╎ ╎ ╎ 402 @Pkg/…rations.jl:2143 #sandbox#190 ╎ ╎ ╎ ╎ 402 @Base/file.jl:895 mktempdir(fn::Function) ╎ ╎ ╎ ╎ 402 @Base/file.jl:895 mktempdir(fn::Function, parent::S… ╎ ╎ ╎ ╎ 402 @Base/file.jl:899 mktempdir(fn::Pkg.Operations.var… ╎ ╎ ╎ ╎ ╎ 402 @Pkg/…tions.jl:2196 (::Pkg.Operations.var"#194#19… ╎ ╎ ╎ ╎ ╎ 402 @Pkg/…tions.jl:2087 with_temp_env(fn::Pkg.Operat… ╎ ╎ ╎ ╎ ╎ 402 @Pkg/…tions.jl:2237 (::Pkg.Operations.var"#198#… ╎ ╎ ╎ ╎ ╎ 402 @Base/env.jl:265 withenv(::Pkg.Operations.var"… ╎ ╎ ╎ ╎ ╎ 402 @Pkg/…ions.jl:2416 (::Pkg.Operations.var"#213… ╎ ╎ ╎ ╎ ╎ ╎ 402 @Pkg/…ons.jl:2476 subprocess_handler(cmd::Cm… ╎ ╎ ╎ ╎ ╎ ╎ 402 @Base/…ss.jl:687 wait(x::Base.Process) ╎ ╎ ╎ ╎ ╎ ╎ 402 @Base/…ss.jl:694 wait(x::Base.Process, syn… ╎ ╎ ╎ ╎ ╎ ╎ 402 @Base/…on.jl:136 wait ╎ ╎ ╎ ╎ ╎ ╎ 402 @Base/…on.jl:141 wait(c::Base.GenericCon… ╎ ╎ ╎ ╎ ╎ ╎ ╎ 402 @Base/…sk.jl:1199 wait() 401╎ ╎ ╎ ╎ ╎ ╎ ╎ 402 @Base/…sk.jl:1187 poptask(W::Base.Intr… Pavito started, using iterative method... [1] signal 15: Terminated in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 epoll_pwait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/linux.c:1404 uv_run at /workspace/srcdir/libuv/src/unix/core.c:430 ijl_task_get_next at /source/src/scheduler.c:457 poptask at ./task.jl:1187 wait at ./task.jl:1199 #wait#399 at ./condition.jl:141 wait at ./condition.jl:136 [inlined] _trywait at ./asyncevent.jl:185 profile_printing_listener at ./Base.jl:329 #start_profile_listener##0 at ./Base.jl:349 jfptr_YY.start_profile_listenerYY.YY.0_53982.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] start_task at /source/src/task.c:1249 unknown function (ip: (nil)) at (unknown file) Allocations: 32312822 (Pool: 32312257; Big: 565); GC: 28 [591] signal 15: Terminated in expression starting at /home/pkgeval/.julia/packages/NonconvexPavito/n1FgD/test/runtests.jl:6 jl_gc_small_alloc_inner at /source/src/gc-stock.c:735 jl_gc_small_alloc_noinline at /source/src/gc-stock.c:783 [inlined] jl_gc_alloc_ at /source/src/gc-stock.c:797 jl_alloc_genericmemory_unchecked at /source/src/genericmemory.c:41 GenericMemory at ./boot.jl:588 [inlined] Array at ./boot.jl:647 [inlined] getindex at ./array.jl:405 _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] jl_f__apply_iterate at /source/src/builtins.c:862 merge_names at ./namedtuple.jl:271 merge_fallback at ./namedtuple.jl:291 merge at ./namedtuple.jl:338 [inlined] setindex at ./namedtuple.jl:484 [inlined] #annotations##0 at ./none (unknown line) [inlined] iterate at ./generator.jl:48 [inlined] _collect at ./array.jl:647 collect at ./array.jl:641 [inlined] annotations at ./strings/annotated.jl:399 [inlined] annotations at ./strings/annotated.jl:404 [inlined] getindex at ./strings/annotated.jl:164 iterate at ./strings/annotated.jl:156 [inlined] check_textwidth at ./strings/util.jl:632 string_truncate_boundaries at ./strings/util.jl:643 string_truncate_boundaries at ./strings/util.jl:642 [inlined] rtruncate at ./strings/util.jl:549 [inlined] rtruncate at ./strings/util.jl:549 [inlined] tree_format at /source/usr/share/julia/stdlib/v1.12/Profile/src/Profile.jl:1075 print_tree at /source/usr/share/julia/stdlib/v1.12/Profile/src/Profile.jl:1255 tree at /source/usr/share/julia/stdlib/v1.12/Profile/src/Profile.jl:1309 print_group at /source/usr/share/julia/stdlib/v1.12/Profile/src/Profile.jl:389 #print#5 at /source/usr/share/julia/stdlib/v1.12/Profile/src/Profile.jl:331 print at /source/usr/share/julia/stdlib/v1.12/Profile/src/Profile.jl:271 [inlined] print at /source/usr/share/julia/stdlib/v1.12/Profile/src/Profile.jl:271 [inlined] print at /source/usr/share/julia/stdlib/v1.12/Profile/src/Profile.jl:271 _peek_report at /source/usr/share/julia/stdlib/v1.12/Profile/src/Profile.jl:94 unknown function (ip: 0x7616bd6ba60f) at (unknown file) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] jl_f_invokelatest at /source/src/builtins.c:875 profile_printing_listener at ./Base.jl:331 #start_profile_listener##0 at ./Base.jl:349 jfptr_YY.start_profile_listenerYY.YY.0_53982.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:3800 [inlined] ijl_apply_generic at /source/src/gf.c:4000 jl_apply at /source/src/julia.h:2374 [inlined] start_task at /source/src/task.c:1249 unknown function (ip: (nil)) at (unknown file) Allocations: 154745093 (Pool: 154744251; Big: 842); GC: 57 PkgEval terminated after 2727.87s: test duration exceeded the time limit