Package evaluation of JSOSuite on Julia 1.10.9 (96dc2d8c45*) started at 2025-06-06T20:22:57.076 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 5.55s ################################################################################ # Installation # Installing JSOSuite... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [ed6ae0be] + JSOSuite v0.2.2 Updating `~/.julia/environments/v1.10/Manifest.toml` [54578032] + ADNLPModels v0.8.12 [47edcb42] + ADTypes v1.14.0 [66dad0bd] + AliasTables v1.1.3 [6e4b80f9] + BenchmarkTools v1.6.0 [d360d2e6] + ChainRulesCore v1.25.1 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [35d6a980] + ColorSchemes v3.29.0 [3da002f7] + ColorTypes v0.12.1 [c3611d14] + ColorVectorSpace v0.11.0 [5ae59095] + Colors v0.13.1 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [d38c429a] + Contour v0.6.3 [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 [a93c6f00] + DataFrames v1.7.0 [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.4 [e2ba6199] + ExprTools v0.1.10 [9aa1b823] + FastClosures v0.3.2 [1a297f60] + FillArrays v1.13.0 [53c48c17] + FixedPointNumbers v0.8.5 [f6369f11] + ForwardDiff v1.0.1 [069b7b12] + FunctionWrappers v1.1.3 [842dd82b] + InlineStrings v1.4.3 [41ab1584] + InvertedIndices v1.3.1 [92d709cd] + IrrationalConstants v0.2.4 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 ⌅ [10dff2fc] + JSOSolvers v0.13.2 [ed6ae0be] + JSOSuite v0.2.2 [4076af6c] + JuMP v1.26.0 ⌅ [ba0b0d4f] + Krylov v0.9.10 ⌅ [39f5bc3e] + LLSModels v0.4.0 [b964fa9f] + LaTeXStrings v1.4.0 [5c8ed15e] + LinearOperators v2.10.0 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [299715c1] + MarchingCubes v0.1.11 [b8f27783] + MathOptInterface v1.40.2 [e1d29d7a] + Missings v1.2.0 [d8a4904e] + MutableArithmetics v1.6.4 [a4795742] + NLPModels v0.21.5 [792afdf1] + NLPModelsJuMP v0.13.2 [e01155f1] + NLPModelsModifiers v0.7.2 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 ⌃ [01435c0c] + Percival v0.7.3 [2dfb63ee] + PooledArrays v1.4.3 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [08abe8d2] + PrettyTables v2.4.0 [43287f4e] + PtrArrays v1.3.0 [f468eda6] + QuadraticModels v0.9.13 [189a3867] + Reexport v1.2.2 [ae029012] + Requires v1.3.1 [37e2e3b7] + ReverseDiff v1.16.1 [91c51154] + SentinelArrays v1.4.8 [ff4d7338] + SolverCore v0.3.8 [d076d87d] + SolverParameters v0.1.1 [b5612192] + SolverTools v0.9.0 [a2af1166] + SortingAlgorithms v1.2.1 [9f842d2f] + SparseConnectivityTracer v0.6.19 [fa32481b] + SparseMatricesCOO v0.2.4 [0a514795] + SparseMatrixColorings v0.4.20 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [82ae8749] + StatsAPI v1.7.1 [2913bbd2] + StatsBase v0.34.5 [892a3eda] + StringManipulation v0.4.1 [856f2bd8] + StructTypes v1.11.0 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [62fd8b95] + TensorCore v0.1.1 [a759f4b9] + TimerOutputs v0.5.29 [3bb67fe8] + TranscodingStreams v0.11.3 [b8865327] + UnicodePlots v3.7.2 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [9fa8497b] + Future [b77e0a4c] + InteractiveUtils [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [d6f4376e] + Markdown [a63ad114] + Mmap [de0858da] + Printf [9abbd945] + Profile [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [2f01184e] + SparseArrays v1.10.0 [10745b16] + Statistics v1.10.0 [fa267f1f] + TOML v1.0.3 [8dfed614] + Test [cf7118a7] + UUIDs [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [4536629a] + OpenBLAS_jll v0.3.23+4 [05823500] + OpenLibm_jll v0.8.5+0 [bea87d4a] + SuiteSparse_jll v7.2.1+1 [83775a58] + Zlib_jll v1.2.13+1 [8e850b90] + libblastrampoline_jll v5.11.0+0 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Installation completed after 9.14s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ TestEnv ~/.julia/packages/TestEnv/iS95e/src/julia-1.9/activate_set.jl:63 Precompiling package dependencies... Precompilation completed after 1428.94s ################################################################################ # Testing # Testing JSOSuite ┌ Warning: Could not use exact versions of packages in manifest, re-resolving └ @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1829 Status `/tmp/jl_YUQ721/Project.toml` [54578032] ADNLPModels v0.8.12 ⌅ [5a1c9e79] CaNNOLeS v0.7.7 [bee2e536] DCISolver v0.4.6 [a93c6f00] DataFrames v1.7.0 ⌅ [93090adf] ExpressionTreeForge v0.1.7 [e59f0261] FletcherPenaltySolver v0.2.8 ⌅ [10dff2fc] JSOSolvers v0.13.2 [ed6ae0be] JSOSuite v0.2.2 ⌅ [4076af6c] JuMP v1.8.2 [67920dd8] KNITRO v0.14.8 ⌅ [39f5bc3e] LLSModels v0.3.11 [5c8ed15e] LinearOperators v2.10.0 [a4795742] NLPModels v0.21.5 [f4238b75] NLPModelsIpopt v0.10.4 ⌅ [792afdf1] NLPModelsJuMP v0.13.0 [bec4dd0d] NLPModelsKnitro v0.9.1 [e01155f1] NLPModelsModifiers v0.7.2 [7cde8186] NLSProblems v0.5.3 ⌅ [5049e819] OptimizationProblems v0.8.1 ⌃ [01435c0c] Percival v0.7.3 [f468eda6] QuadraticModels v0.9.13 ⌅ [1e40b3f8] RipQP v0.6.4 [581a75fa] SolverBenchmark v0.6.2 [ff4d7338] SolverCore v0.3.8 [fa32481b] SparseMatricesCOO v0.2.4 [37e2e46d] LinearAlgebra [56ddb016] Logging [2f01184e] SparseArrays v1.10.0 [8dfed614] Test Status `/tmp/jl_YUQ721/Manifest.toml` [54578032] ADNLPModels v0.8.12 [47edcb42] ADTypes v1.14.0 [14f7f29c] AMD v0.5.3 ⌅ [c3fe647b] AbstractAlgebra v0.27.10 [1520ce14] AbstractTrees v0.4.5 ⌅ [79e6a3ab] Adapt v3.7.2 [66dad0bd] AliasTables v1.1.3 [dce04be8] ArgCheck v2.5.0 ⌃ [4fba245c] ArrayInterface v7.7.1 [ecbce9bc] BenchmarkProfiles v0.4.6 [6e4b80f9] BenchmarkTools v1.6.0 ⌅ [e2ed5e7c] Bijections v0.1.10 [d1d4a3ce] BitFlags v0.1.9 [fa961155] CEnum v0.5.0 [336ed68f] CSV v0.10.15 ⌅ [5a1c9e79] CaNNOLeS v0.7.7 [d360d2e6] ChainRulesCore v1.25.1 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [35d6a980] ColorSchemes v3.29.0 [3da002f7] ColorTypes v0.12.1 [c3611d14] ColorVectorSpace v0.11.0 [5ae59095] Colors v0.13.1 [861a8166] Combinatorics v1.0.3 [38540f10] CommonSolve v0.2.4 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [b152e2b5] CompositeTypes v0.1.4 [f0e56b4a] ConcurrentUtilities v2.5.0 ⌅ [187b0558] ConstructionBase v1.5.6 [d38c429a] Contour v0.6.3 [a8cc5b0e] Crayons v4.1.1 [bee2e536] DCISolver v0.4.6 [9a962f9c] DataAPI v1.16.0 [a93c6f00] DataFrames v1.7.0 [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [3f0dd361] DefaultApplication v1.1.0 [8bb1440f] DelimitedFiles v1.9.1 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.4 ⌅ [5b8099bc] DomainSets v0.5.14 ⌅ [7c1d4256] DynamicPolynomials v0.4.6 [4e289a0a] EnumX v1.0.5 [460bff9d] ExceptionUnwrapping v0.1.11 [e2ba6199] ExprTools v0.1.10 ⌅ [93090adf] ExpressionTreeForge v0.1.7 [c87230d0] FFMPEG v0.4.2 [9aa1b823] FastClosures v0.3.2 [5789e2e9] FileIO v1.17.0 [48062228] FilePathsBase v0.9.24 [1a297f60] FillArrays v1.13.0 [53c48c17] FixedPointNumbers v0.8.5 [e59f0261] FletcherPenaltySolver v0.2.8 [59287772] Formatting v0.4.3 ⌅ [f6369f11] ForwardDiff v0.10.38 [069b7b12] FunctionWrappers v1.1.3 [77dc65aa] FunctionWrappersWrappers v0.1.3 ⌃ [0c68f7d7] GPUArrays v9.1.0 ⌅ [46192b85] GPUArraysCore v0.1.5 [28b8d3ca] GR v0.73.16 [bc5e4493] GitHub v5.9.0 [42e2da0e] Grisu v1.0.2 ⌅ [0b43b601] Groebner v0.2.11 ⌅ [d5909c97] GroupsCore v0.4.2 ⌅ [34c5aeac] HSL v0.4.3 [cd3eb016] HTTP v1.10.16 [34004b35] HypergeometricFunctions v0.3.28 [615f187c] IfElse v0.1.1 [842dd82b] InlineStrings v1.4.3 [18e54dd8] IntegerMathUtils v0.1.2 [8197267c] IntervalSets v0.7.11 [41ab1584] InvertedIndices v1.3.1 [b6b21f68] Ipopt v1.10.6 [92d709cd] IrrationalConstants v0.2.4 [82899510] IteratorInterfaceExtensions v1.0.0 ⌅ [033835bb] JLD2 v0.4.54 [1019f520] JLFzf v0.1.11 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 ⌅ [10dff2fc] JSOSolvers v0.13.2 [ed6ae0be] JSOSuite v0.2.2 ⌅ [4076af6c] JuMP v1.8.2 [67920dd8] KNITRO v0.14.8 ⌅ [ba0b0d4f] Krylov v0.9.10 [40e66cde] LDLFactorizations v0.10.1 ⌅ [39f5bc3e] LLSModels v0.3.11 ⌅ [929cbde3] LLVM v6.6.3 [b964fa9f] LaTeXStrings v1.4.0 ⌅ [266f59ce] LaTeXTabulars v0.1.3 ⌃ [2ee39098] LabelledArrays v1.15.1 ⌅ [984bce1d] LambertW v0.4.6 ⌅ [23fbe1c1] Latexify v0.15.21 [50d2b5c4] Lazy v0.15.1 [1d6d02ad] LeftChildRightSiblingTrees v0.2.0 [f5a24dde] LimitedLDLFactorizations v0.5.2 [5c8ed15e] LinearOperators v2.10.0 [2ab3a3ac] LogExpFunctions v0.3.29 [e6f89c97] LoggingExtras v1.1.0 [1914dd2f] MacroTools v0.5.16 [299715c1] MarchingCubes v0.1.11 ⌅ [b8f27783] MathOptInterface v1.27.1 [4d4711f2] MatrixMarket v0.5.2 [739be429] MbedTLS v1.1.9 [442fdcdd] Measures v0.3.2 [e1d29d7a] Missings v1.2.0 ⌅ [102ac46a] MultivariatePolynomials v0.4.7 [d8a4904e] MutableArithmetics v1.6.4 [a4795742] NLPModels v0.21.5 [f4238b75] NLPModelsIpopt v0.10.4 ⌅ [792afdf1] NLPModelsJuMP v0.13.0 [bec4dd0d] NLPModelsKnitro v0.9.1 [e01155f1] NLPModelsModifiers v0.7.2 [7cde8186] NLSProblems v0.5.3 [77ba4419] NaNMath v1.1.3 [4d8831e6] OpenSSL v1.5.0 [c32e1cdf] OperatorScaling v0.1.0 ⌅ [5049e819] OptimizationProblems v0.8.1 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [8314cec4] PGFPlotsX v1.6.2 [d96e819e] Parameters v0.12.3 [69de0a69] Parsers v2.8.3 ⌃ [01435c0c] Percival v0.7.3 [32113eaa] PkgBenchmark v0.2.13 [ccf2f8ad] PlotThemes v3.3.0 [995b91a9] PlotUtils v1.4.3 [91a5bcdd] Plots v1.40.13 [2dfb63ee] PooledArrays v1.4.3 ⌃ [d236fae5] PreallocationTools v0.4.24 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [08abe8d2] PrettyTables v2.4.0 [27ebfcd6] Primes v0.5.7 [33c8b6b6] ProgressLogging v0.1.4 [43287f4e] PtrArrays v1.3.0 [1fd47b50] QuadGK v2.11.2 [f468eda6] QuadraticModels v0.9.13 [fb686558] RandomExtensions v0.4.4 [3cdcf5f2] RecipesBase v1.3.4 [01d81517] RecipesPipeline v0.6.12 ⌅ [731186ca] RecursiveArrayTools v2.38.10 [189a3867] Reexport v1.2.2 [05181044] RelocatableFolders v1.0.1 [ae029012] Requires v1.3.1 [37e2e3b7] ReverseDiff v1.16.1 ⌅ [1e40b3f8] RipQP v0.6.4 [79098fc4] Rmath v0.8.0 [7e49a35a] RuntimeGeneratedFunctions v0.5.15 ⌅ [0bca4576] SciMLBase v1.92.0 ⌅ [c0aeaf25] SciMLOperators v0.2.12 [6c6a2e73] Scratch v1.2.1 [91c51154] SentinelArrays v1.4.8 [efcf1570] Setfield v1.1.2 [992d4aef] Showoff v1.0.3 [777ac1f9] SimpleBufferStream v1.2.0 [66db9d55] SnoopPrecompile v1.0.3 [2133526b] SodiumSeal v0.1.1 [581a75fa] SolverBenchmark v0.6.2 [ff4d7338] SolverCore v0.3.8 [d076d87d] SolverParameters v0.1.1 [b5612192] SolverTools v0.9.0 [a2af1166] SortingAlgorithms v1.2.1 [9f842d2f] SparseConnectivityTracer v0.6.19 [fa32481b] SparseMatricesCOO v0.2.4 [0a514795] SparseMatrixColorings v0.4.20 [276daf66] SpecialFunctions v2.5.1 [860ef19b] StableRNGs v1.0.3 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.5 [4c63d2b9] StatsFuns v1.5.0 [c4fe5a9e] Stopping v0.6.6 [53949629] StoppingInterface v0.5.4 [892a3eda] StringManipulation v0.4.1 ⌅ [2efcf032] SymbolicIndexingInterface v0.2.2 ⌅ [d1185830] SymbolicUtils v1.1.0 ⌅ [0c5d862f] Symbolics v5.1.0 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [62fd8b95] TensorCore v0.1.1 [5d786b92] TerminalLoggers v0.1.7 [a759f4b9] TimerOutputs v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [a2a6695c] TreeViews v0.3.0 [410a4b4d] Tricks v0.1.10 [781d530d] TruncatedStacktraces v1.4.0 [5c2747f8] URIs v1.5.2 [3a884ed6] UnPack v1.0.2 [1cfade01] UnicodeFun v0.4.1 [b8865327] UnicodePlots v3.7.2 [1986cc42] Unitful v1.22.1 ⌃ [45397f5d] UnitfulLatexify v1.6.4 [a7c27f48] Unityper v0.1.6 [41fe7b60] Unzip v0.2.0 [ea10d353] WeakRefStrings v1.4.2 [76eceee3] WorkerUtilities v1.6.1 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 [83423d85] Cairo_jll v1.18.5+0 [ee1fde0b] Dbus_jll v1.16.2+0 [2702e6a9] EpollShim_jll v0.0.20230411+1 [2e619515] Expat_jll v2.6.5+0 ⌅ [b22a6f82] FFMPEG_jll v4.4.4+1 [a3f928ae] Fontconfig_jll v2.16.0+0 [d7e528f0] FreeType2_jll v2.13.4+0 [559328eb] FriBidi_jll v1.0.17+0 [0656b61e] GLFW_jll v3.4.0+2 [d2c73de3] GR_jll v0.73.16+0 [78b55507] Gettext_jll v0.21.0+0 [7746bdde] Glib_jll v2.84.0+0 [3b182d85] Graphite2_jll v1.3.15+0 [017b0a0e] HSL_jll v4.0.2+0 [2e76f6c2] HarfBuzz_jll v8.5.1+0 [e33a78d0] Hwloc_jll v2.12.1+0 [9cc047cb] Ipopt_jll v300.1400.1701+0 [aacddb02] JpegTurbo_jll v3.1.1+0 [c1c5ebd0] LAME_jll v3.100.2+0 [88015f11] LERC_jll v4.0.1+0 ⌅ [dad2f222] LLVMExtra_jll v0.0.29+0 [1d63c593] LLVMOpenMP_jll v18.1.8+0 [dd4b983a] LZO_jll v2.10.3+0 [e9f186c6] Libffi_jll v3.4.7+0 [7e76a0d4] Libglvnd_jll v1.7.1+1 [94ce4f54] Libiconv_jll v1.18.0+0 [4b2f31a3] Libmount_jll v2.41.0+0 [89763e89] Libtiff_jll v4.7.1+0 [38a345b3] Libuuid_jll v2.41.0+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.800.0+0 [e7412a2a] Ogg_jll v1.3.5+1 ⌅ [656ef2d0] OpenBLAS32_jll v0.3.24+0 [458c3c95] OpenSSL_jll v3.5.0+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [91d4177d] Opus_jll v1.3.3+0 [36c8627f] Pango_jll v1.56.3+0 ⌅ [30392449] Pixman_jll v0.44.2+0 [c0090381] Qt6Base_jll v6.8.2+1 [629bc702] Qt6Declarative_jll v6.8.2+1 [ce943373] Qt6ShaderTools_jll v6.8.2+1 [e99dba38] Qt6Wayland_jll v6.8.2+0 [f50d1b31] Rmath_jll v0.5.1+0 [319450e9] SPRAL_jll v2025.5.20+0 [a44049a8] Vulkan_Loader_jll v1.3.243+0 [a2964d1f] Wayland_jll v1.23.1+0 [2381bf8a] Wayland_protocols_jll v1.36.0+0 ⌅ [02c8fc9c] XML2_jll v2.13.6+1 [ffd25f8a] XZ_jll v5.8.1+0 [f67eecfb] Xorg_libICE_jll v1.1.2+0 [c834827a] Xorg_libSM_jll v1.2.6+0 [4f6342f7] Xorg_libX11_jll v1.8.12+0 [0c0b7dd1] Xorg_libXau_jll v1.0.13+0 [935fb764] Xorg_libXcursor_jll v1.2.4+0 [a3789734] Xorg_libXdmcp_jll v1.1.6+0 [1082639a] Xorg_libXext_jll v1.3.7+0 [d091e8ba] Xorg_libXfixes_jll v6.0.1+0 [a51aa0fd] Xorg_libXi_jll v1.8.3+0 [d1454406] Xorg_libXinerama_jll v1.1.6+0 [ec84b674] Xorg_libXrandr_jll v1.5.5+0 [ea2f1a96] Xorg_libXrender_jll v0.9.12+0 [c7cfdc94] Xorg_libxcb_jll v1.17.1+0 [cc61e674] Xorg_libxkbfile_jll v1.1.3+0 [e920d4aa] Xorg_xcb_util_cursor_jll v0.1.4+0 [12413925] Xorg_xcb_util_image_jll v0.4.0+1 [2def613f] Xorg_xcb_util_jll v0.4.0+1 [975044d2] Xorg_xcb_util_keysyms_jll v0.4.0+1 [0d47668e] Xorg_xcb_util_renderutil_jll v0.3.9+1 [c22f9ab0] Xorg_xcb_util_wm_jll v0.4.1+1 [35661453] Xorg_xkbcomp_jll v1.4.7+0 [33bec58e] Xorg_xkeyboard_config_jll v2.44.0+0 [c5fb5394] Xorg_xtrans_jll v1.6.0+0 [3161d3a3] Zstd_jll v1.5.7+1 [35ca27e7] eudev_jll v3.2.9+0 [214eeab7] fzf_jll v0.61.1+0 [1a1c6b14] gperf_jll v3.3.0+0 [a4ae2306] libaom_jll v3.11.0+0 [0ac62f75] libass_jll v0.15.2+0 [1183f4f0] libdecor_jll v0.2.2+0 [2db6ffa8] libevdev_jll v1.11.0+0 [f638f0a6] libfdk_aac_jll v2.0.3+0 [36db933b] libinput_jll v1.18.0+0 [b53b4c65] libpng_jll v1.6.48+0 [a9144af2] libsodium_jll v1.0.21+0 [f27f6e37] libvorbis_jll v1.3.7+2 [009596ad] mtdev_jll v1.1.6+0 ⌅ [1270edf5] x264_jll v2021.5.5+0 ⌅ [dfaa095f] x265_jll v3.5.0+0 [d8fb68d0] xkbcommon_jll v1.8.1+0 [0dad84c5] ArgTools v1.1.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [8ba89e20] Distributed [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [9fa8497b] Future [b77e0a4c] InteractiveUtils [4af54fe1] LazyArtifacts [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [a63ad114] Mmap [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.10.0 [de0858da] Printf [9abbd945] Profile [3fa0cd96] REPL [9a3f8284] Random [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization [6462fe0b] Sockets [2f01184e] SparseArrays v1.10.0 [10745b16] Statistics v1.10.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [deac9b47] LibCURL_jll v8.4.0+0 [e37daf67] LibGit2_jll v1.6.4+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.2+1 [14a3606d] MozillaCACerts_jll v2023.1.10 [4536629a] OpenBLAS_jll v0.3.23+4 [05823500] OpenLibm_jll v0.8.5+0 [efcefdf7] PCRE2_jll v10.42.0+1 [bea87d4a] SuiteSparse_jll v7.2.1+1 [83775a58] Zlib_jll v1.2.13+1 [8e850b90] libblastrampoline_jll v5.11.0+0 [8e850ede] nghttp2_jll v1.52.0+1 [3f19e933] p7zip_jll v17.4.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... WARNING: method definition for _node_bound at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/node_expr_tree/impl_times.jl:103 declares type variable Y but does not use it. WARNING: method definition for _node_bound at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/node_expr_tree/impl_exp.jl:54 declares type variable Y but does not use it. WARNING: method definition for _evaluate_node at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/node_expr_tree/impl_power.jl:174 declares type variable Z but does not use it. WARNING: could not import M_interface_expr_tree._transform_to_Expr_JuMP into M_trait_expr_tree WARNING: Method definition is_expr_tree(Number) in module M_trait_expr_tree at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/expr_tree/tr_expr_tree.jl:28 overwritten at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/expr_tree/tr_expr_tree.jl:29. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. WARNING: method definition for _node_bound at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/node_expr_tree/impl_times.jl:103 declares type variable Y but does not use it. WARNING: method definition for _node_bound at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/node_expr_tree/impl_exp.jl:54 declares type variable Y but does not use it. WARNING: method definition for _evaluate_node at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/node_expr_tree/impl_power.jl:174 declares type variable Z but does not use it. WARNING: could not import M_interface_expr_tree._transform_to_Expr_JuMP into M_trait_expr_tree WARNING: Method definition is_expr_tree(Number) in module M_trait_expr_tree at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/expr_tree/tr_expr_tree.jl:28 overwritten at /home/pkgeval/.julia/packages/ExpressionTreeForge/tboAI/src/expr_tree/tr_expr_tree.jl:29. WARNING: Method definition isapprox(IntervalSets.AbstractInterval{T} where T, IntervalSets.AbstractInterval{T} where T) in module IntervalSets at /home/pkgeval/.julia/packages/IntervalSets/CFJJK/src/IntervalSets.jl:297 overwritten in module DomainSets at /home/pkgeval/.julia/packages/DomainSets/aafhp/src/domains/interval.jl:52. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. WARNING: Method definition isapprox(IntervalSets.AbstractInterval{T} where T, IntervalSets.AbstractInterval{T} where T) in module IntervalSets at /home/pkgeval/.julia/packages/IntervalSets/CFJJK/src/IntervalSets.jl:297 overwritten in module DomainSets at /home/pkgeval/.julia/packages/DomainSets/aafhp/src/domains/interval.jl:52. ERROR: Method overwriting is not permitted during Module precompilation. Use `__precompile__(false)` to opt-out of precompilation. WARNING: Method definition isapprox(IntervalSets.AbstractInterval{T} where T, IntervalSets.AbstractInterval{T} where T) in module IntervalSets at /home/pkgeval/.julia/packages/IntervalSets/CFJJK/src/IntervalSets.jl:297 overwritten in module DomainSets at /home/pkgeval/.julia/packages/DomainSets/aafhp/src/domains/interval.jl:52. WARNING: Wrapping `Vararg` directly in UnionAll is deprecated (wrap the tuple instead). You may need to write `f(x::Vararg{T})` rather than `f(x::Vararg{<:T})` or `f(x::Vararg{T}) where T` instead of `f(x::Vararg{T} where T)`. WARNING: Code.get_symbolify is deprecated, use get_rewrites instead. likely near /home/pkgeval/.julia/packages/Symbolics/VIBnK/src/build_function.jl:130 Test Summary: | Pass Total Time NLS from NLP | 2 2 2m38.7s Test Summary: |Time Test loading parameter set | None 0.5s Test Summary: | Pass Total Time Test loading parameter set | 1 1 0.0s Test Summary: | Pass Total Time Test loading parameter set | 1 1 0.0s Test Summary: | Pass Total Time Test loading parameter set | 1 1 0.0s Test Summary: | Pass Total Time Test loading parameter set | 1 1 0.0s Test Summary: | Pass Total Time Test loading parameter set | 1 1 0.0s Test Summary: | Pass Total Time Test loading parameter set | 1 1 0.0s Test Summary: |Time Test loading parameter set | None 0.0s Test Summary: |Time Test loading parameter set | None 0.0s Test Summary: |Time Test loading parameter set | None 0.0s Test Summary: |Time Test loading parameter set | None 0.0s Test Summary: |Time Test loading parameter set | None 0.0s Test Summary: |Time Test loading parameter set | None 0.0s Test Summary: | Pass Total Time Test not loaded solvers | 6 6 3.0s WARNING: using Krylov.solve! in module DCISolver conflicts with an existing identifier. WARNING: method definition for solve_two_least_squares at /home/pkgeval/.julia/packages/FletcherPenaltySolver/6pn0y/src/solve_linear_system.jl:161 declares type variable Tt but does not use it. ┌ Warning: Warning: KNITRO is not properly installed. See, KNITRO.jl. └ @ StoppingInterface ~/.julia/packages/StoppingInterface/Lrl6f/src/stopping_to_nlpmodels_knitro.jl:193 ┌ Warning: `R2Solver(nlp::AbstractNLPModel; kwargs...)` is deprecated, use `FoSolver(nlp::AbstractNLPModel; M = get(FOMO_M, nlp), kwargs...)` instead. │ caller = ip:0x0 └ @ Core :-1 ****************************************************************************** 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.: 0 Number of nonzeros in Lagrangian Hessian.............: 5050 Total number of variables............................: 100 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5000000e+02 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0000000e+01 0.00e+00 5.98e-15 -1.0 2.00e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 5.0000000000000128e+01 5.0000000000000128e+01 Dual infeasibility......: 5.9778570982160788e-15 5.9778570982160788e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 5.9778570982160788e-15 5.9778570982160788e-15 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 5.041 EXIT: Optimal Solution Found. 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.: 0 Number of nonzeros in Lagrangian Hessian.............: 5050 Total number of variables............................: 100 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5000000e+02 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0000000e+01 0.00e+00 5.98e-15 -1.0 2.00e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 5.0000000000000128e+01 5.0000000000000128e+01 Dual infeasibility......: 5.9778570982160788e-15 5.9778570982160788e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 5.9778570982160788e-15 5.9778570982160788e-15 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.023 EXIT: Optimal Solution Found. 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.: 0 Number of nonzeros in Lagrangian Hessian.............: 5050 Total number of variables............................: 100 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5000000e+02 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0000000e+01 0.00e+00 5.93e-15 -1.0 2.00e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 5.0000000000000064e+01 5.0000000000000064e+01 Dual infeasibility......: 5.9327542878406661e-15 5.9327542878406661e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 5.9327542878406661e-15 5.9327542878406661e-15 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 6.859 EXIT: Optimal Solution Found. 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.: 0 Number of nonzeros in Lagrangian Hessian.............: 5050 Total number of variables............................: 100 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5000000e+02 0.00e+00 2.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 5.0000000e+01 0.00e+00 5.93e-15 -1.0 2.00e+00 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 5.0000000000000064e+01 5.0000000000000064e+01 Dual infeasibility......: 5.9327542878406661e-15 5.9327542878406661e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 5.9327542878406661e-15 5.9327542878406661e-15 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.010 EXIT: Optimal Solution Found. Test Summary: | Pass Total Time Test in-place solve! | 34 34 3m41.2s The problem uncqp_QP has 2 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. Solve using LBFGS: [ Info: iter f(x) ‖∇f‖ ∇fᵀd bk [ Info: 0 7.4e+00 1.2e+01 - - [ Info: 1 3.1e+00 7.6e+00 -1.4e+02 2 [ Info: 2 3.1e-01 2.2e-01 -5.6e+00 0 [ Info: 3 3.0e-01 5.5e-02 -4.9e-03 0 [ Info: 4 3.0e-01 1.2e-06 -3.9e-04 0 [ Info: 5 3.0e-01 3.6e-10 -1.3e-13 0 [ Info: 5 3.0e-01 3.6e-10 The problem uncqp_QP has 2 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. Solve using LBFGS: [ Info: iter f(x) ‖∇f‖ ∇fᵀd bk [ Info: 0 7.4e+00 1.2e+01 - - [ Info: 1 3.1e+00 7.6e+00 -1.4e+02 2 [ Info: 2 3.1e-01 2.2e-01 -5.6e+00 0 [ Info: 3 3.0e-01 5.5e-02 -4.9e-03 0 [ Info: 4 3.0e-01 1.2e-06 -3.9e-04 0 [ Info: 5 3.0e-01 3.6e-10 -1.3e-13 0 [ Info: 5 3.0e-01 3.6e-10 [ Info: Solving in Float64 using K2LDL with LDLFactorizationData [ Info: iter obj rgap ‖rb‖ ‖rc‖ α_pri α_du μ ρ δ [ Info: 0 1.0e+00 0.0e+00 0.0e+00 1.1e+00 0.0e+00 0.0e+00 NaN 1.5e-03 1.5e-03 [ Info: 1 3.0e-01 1.5e-03 0.0e+00 1.5e-03 1.0e+00 1.0e+00 NaN 1.5e-03 1.5e-03 [ Info: 2 3.0e-01 2.0e-07 0.0e+00 2.1e-07 1.0e+00 1.0e+00 NaN 1.5e-04 1.5e-04 [ Info: 3 3.0e-01 2.8e-12 0.0e+00 3.0e-12 1.0e+00 1.0e+00 NaN 1.5e-05 1.5e-05 The problem bndqp_QP has 2 variables and no constraints. Algorithm selection: - bounds: ✓; - nonlinear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 3 optimizers available: ["TRON", "IPOPT", "Percival"]. Solve using TRON: [ Info: iter f(x) π Δ ratio cgstatus [ Info: 0 2.0e+00 7.1e-01 - - - [ Info: 1 0.0e+00 0.0e+00 1.0e+00 1.0e+00 stationary point found [ Info: 1 0.0e+00 0.0e+00 1.1e+00 The problem bndqp_QP has 2 variables and no constraints. Algorithm selection: - bounds: ✓; - nonlinear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 3 optimizers available: ["TRON", "IPOPT", "Percival"]. Solve using TRON: [ Info: iter f(x) π Δ ratio cgstatus [ Info: 0 2.0e+00 7.1e-01 - - - [ Info: 1 0.0e+00 0.0e+00 1.0e+00 1.0e+00 stationary point found [ Info: 1 0.0e+00 0.0e+00 1.1e+00 [ Info: Solving in Float64 using K2LDL with LDLFactorizationData [ Info: iter obj rgap ‖rb‖ ‖rc‖ α_pri α_du μ ρ δ [ Info: 0 1.4e-04 2.2e+00 0.0e+00 6.7e-01 0.0e+00 0.0e+00 5.6e-01 1.5e-03 1.5e-03 [ Info: 1 6.5e-05 2.3e-03 0.0e+00 6.8e-04 1.0e+00 1.0e+00 5.8e-04 1.5e-03 1.5e-03 [ Info: 2 6.5e-08 2.3e-06 0.0e+00 6.7e-07 1.0e+00 1.0e+00 5.8e-07 1.5e-04 1.5e-04 [ Info: 3 6.5e-11 2.3e-09 0.0e+00 6.7e-10 1.0e+00 1.0e+00 5.8e-10 1.5e-05 1.5e-05 The problem eqconqp_QP has 50 variables and 1 constraint. Algorithm selection: - equalities: ✓; - linear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 4 optimizers available: ["IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. Solve using IPOPT: This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. Number of nonzeros in equality constraint Jacobian...: 50 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 51 Total number of variables............................: 50 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1162694e-01 4.44e-16 2.78e-17 -1.7 2.23e-01 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.1162694322615738e-01 1.1162694322615738e-01 Dual infeasibility......: 2.7755575615628914e-17 2.7755575615628914e-17 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 4.4408920985006262e-16 4.4408920985006262e-16 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 2 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 1.791 EXIT: Optimal Solution Found. The problem eqconqp_QP has 50 variables and 1 constraint. Algorithm selection: - equalities: ✓; - linear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 4 optimizers available: ["IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. Solve using IPOPT: This is Ipopt version 3.14.17, running with linear solver MUMPS 5.8.0. Number of nonzeros in equality constraint Jacobian...: 50 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 51 Total number of variables............................: 50 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+00 0.00e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 1.1162694e-01 4.44e-16 2.78e-17 -1.7 2.23e-01 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 1 (scaled) (unscaled) Objective...............: 1.1162694322615738e-01 1.1162694322615738e-01 Dual infeasibility......: 2.7755575615628914e-17 2.7755575615628914e-17 Constraint violation....: 4.4408920985006262e-16 4.4408920985006262e-16 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 4.4408920985006262e-16 4.4408920985006262e-16 Number of objective function evaluations = 2 Number of objective gradient evaluations = 2 Number of equality constraint evaluations = 2 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 2 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 1 Total seconds in IPOPT = 0.002 EXIT: Optimal Solution Found. [ Info: Solving in Float64 using K2LDL with LDLFactorizationData [ Info: iter obj rgap ‖rb‖ ‖rc‖ α_pri α_du μ ρ δ [ Info: 0 1.1e-01 1.0e-01 5.0e-04 1.1e-01 0.0e+00 0.0e+00 NaN 1.5e-03 1.5e-03 [ Info: 1 1.1e-01 3.3e-05 1.7e-04 1.6e-05 1.0e+00 1.0e+00 NaN 1.5e-03 1.5e-03 [ Info: 2 1.1e-01 6.0e-09 5.6e-09 5.0e-09 1.0e+00 1.0e+00 NaN 1.5e-04 1.5e-04 The problem ineqconqp_QP has 2 variables and 3 constraints. Algorithm selection: - inequalities: ✓; - linear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 2 optimizers available: ["IPOPT", "Percival"]. Solve using 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.: 6 Number of nonzeros in Lagrangian Hessian.............: 2 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 3 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 1 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+00 8.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.0744353e-01 0.00e+00 1.00e-06 -1.0 6.07e-01 - 1.00e+00 1.00e+00f 1 2 2.6620982e-01 0.00e+00 1.06e-03 -2.5 7.71e-02 - 9.73e-01 1.00e+00f 1 3 2.5129029e-01 0.00e+00 1.50e-09 -3.8 5.04e-02 - 1.00e+00 1.00e+00f 1 4 2.5019974e-01 0.00e+00 1.84e-11 -5.7 2.80e-02 - 1.00e+00 1.00e+00f 1 5 2.5005210e-01 0.00e+00 1.84e-11 -5.7 1.39e-02 - 1.00e+00 1.00e+00f 1 6 2.5001534e-01 0.00e+00 1.84e-11 -5.7 6.83e-03 - 1.00e+00 1.00e+00f 1 7 2.5000337e-01 0.00e+00 2.51e-14 -8.6 3.67e-03 - 1.00e+00 1.00e+00f 1 8 2.5000084e-01 0.00e+00 2.51e-14 -8.6 1.84e-03 - 1.00e+00 1.00e+00f 1 9 2.5000021e-01 0.00e+00 2.51e-14 -8.6 9.17e-04 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.5000005e-01 0.00e+00 2.51e-14 -8.6 4.56e-04 - 1.00e+00 1.00e+00f 1 11 2.5000001e-01 0.00e+00 2.51e-14 -8.6 2.23e-04 - 1.00e+00 1.00e+00f 1 12 2.5000000e-01 0.00e+00 9.09e-15 -9.0 1.15e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 2.5000000009898249e-01 2.5000000009898249e-01 Dual infeasibility......: 9.0909132435465501e-15 9.0909132435465501e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.1902152191904154e-09 4.1902152191904154e-09 Overall NLP error.......: 4.1902152191904154e-09 4.1902152191904154e-09 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 = 12 Total seconds in IPOPT = 2.475 EXIT: Optimal Solution Found. The problem ineqconqp_QP has 2 variables and 3 constraints. Algorithm selection: - inequalities: ✓; - linear constraints: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 2 optimizers available: ["IPOPT", "Percival"]. Solve using 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.: 6 Number of nonzeros in Lagrangian Hessian.............: 2 Total number of variables............................: 2 variables with only lower bounds: 0 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 3 inequality constraints with only lower bounds: 1 inequality constraints with lower and upper bounds: 1 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 0.0000000e+00 1.00e+00 8.00e-01 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 3.0744353e-01 0.00e+00 1.00e-06 -1.0 6.07e-01 - 1.00e+00 1.00e+00f 1 2 2.6620982e-01 0.00e+00 1.06e-03 -2.5 7.71e-02 - 9.73e-01 1.00e+00f 1 3 2.5129029e-01 0.00e+00 1.50e-09 -3.8 5.04e-02 - 1.00e+00 1.00e+00f 1 4 2.5019974e-01 0.00e+00 1.84e-11 -5.7 2.80e-02 - 1.00e+00 1.00e+00f 1 5 2.5005210e-01 0.00e+00 1.84e-11 -5.7 1.39e-02 - 1.00e+00 1.00e+00f 1 6 2.5001534e-01 0.00e+00 1.84e-11 -5.7 6.83e-03 - 1.00e+00 1.00e+00f 1 7 2.5000337e-01 0.00e+00 2.51e-14 -8.6 3.67e-03 - 1.00e+00 1.00e+00f 1 8 2.5000084e-01 0.00e+00 2.51e-14 -8.6 1.84e-03 - 1.00e+00 1.00e+00f 1 9 2.5000021e-01 0.00e+00 2.51e-14 -8.6 9.17e-04 - 1.00e+00 1.00e+00f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.5000005e-01 0.00e+00 2.51e-14 -8.6 4.56e-04 - 1.00e+00 1.00e+00f 1 11 2.5000001e-01 0.00e+00 2.51e-14 -8.6 2.23e-04 - 1.00e+00 1.00e+00f 1 12 2.5000000e-01 0.00e+00 9.09e-15 -9.0 1.15e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 2.5000000009898249e-01 2.5000000009898249e-01 Dual infeasibility......: 9.0909132435465501e-15 9.0909132435465501e-15 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Variable bound violation: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 4.1902152191904154e-09 4.1902152191904154e-09 Overall NLP error.......: 4.1902152191904154e-09 4.1902152191904154e-09 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 = 12 Total seconds in IPOPT = 0.005 EXIT: Optimal Solution Found. [ Info: Solving in Float64 using K2LDL with LDLFactorizationData [ Info: iter obj rgap ‖rb‖ ‖rc‖ α_pri α_du μ ρ δ [ Info: 0 1.0e+00 1.8e-04 2.5e-01 1.0e+00 0.0e+00 0.0e+00 1.1e-04 1.5e-03 1.5e-03 [ Info: 1 2.5e-01 4.0e-01 1.2e-01 5.0e-01 5.0e-01 1.0e+00 3.7e-04 1.5e-03 1.5e-03 [ Info: 2 2.2e+00 1.6e+01 1.2e-01 4.8e+01 2.0e-02 1.0e+00 2.5e+01 1.5e-04 1.5e-04 [ Info: 3 8.0e+00 1.3e+03 1.2e-01 4.3e+02 8.6e-03 1.0e+00 3.4e+03 1.5e-05 1.5e-05 [ Info: 4 8.0e+00 3.0e+00 2.4e-04 4.3e-01 1.0e+00 1.0e+00 7.3e+00 1.5e-06 1.5e-06 [ Info: 5 1.5e+00 1.0e+00 1.5e-07 5.0e-07 1.0e+00 1.0e+00 6.3e-01 1.5e-07 1.5e-07 [ Info: 6 4.3e-01 2.6e-01 5.1e-09 2.1e-08 1.0e+00 1.0e+00 9.3e-02 1.5e-08 1.5e-08 [ Info: 7 2.8e-01 4.2e-02 1.9e-10 7.8e-10 1.0e+00 1.0e+00 1.3e-02 1.5e-09 1.5e-09 [ Info: 8 2.5e-01 6.1e-03 7.4e-11 2.9e-11 1.0e+00 1.0e+00 1.9e-03 1.5e-10 1.5e-09 [ Info: 9 2.5e-01 8.7e-04 2.8e-11 1.1e-12 1.0e+00 1.0e+00 2.7e-04 1.5e-11 1.5e-09 [ Info: 10 2.5e-01 1.2e-04 1.1e-11 4.2e-14 1.0e+00 1.0e+00 3.9e-05 1.5e-12 1.5e-09 [ Info: 11 2.5e-01 1.8e-05 4.0e-12 1.6e-15 1.0e+00 1.0e+00 5.6e-06 1.5e-13 1.5e-09 [ Info: 12 2.5e-01 2.6e-06 1.5e-12 6.0e-17 1.0e+00 1.0e+00 8.0e-07 1.5e-14 1.5e-09 [ Info: 13 2.5e-01 3.7e-07 5.7e-13 2.3e-17 1.0e+00 1.0e+00 1.1e-07 1.5e-14 1.5e-09 [ Info: 14 2.5e-01 5.3e-08 2.2e-13 8.7e-18 1.0e+00 1.0e+00 1.6e-08 1.5e-14 1.5e-09 [ Info: 15 2.5e-01 7.5e-09 8.2e-14 1.1e-16 1.0e+00 1.0e+00 2.4e-09 1.5e-14 1.5e-09 Test Summary: | Pass Total Time Solve quadratic models | 12 12 1m15.5s The problem genrose has 100 variables and no constraints. Algorithm selection: - Float32 precision: ✓; - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 7 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "DCISolver", "FletcherPenaltySolver", "Percival"]. ====================================================================================== Information request received. A stacktrace will print followed by a 1.0 second profile ====================================================================================== cmd: /opt/julia/bin/julia 271 running 1 of 1 signal (10): User defined signal 1 _ZN4llvm13slpvectorizer7BoUpSLP10VLOperands7reorderEv at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm13slpvectorizer7BoUpSLP30reorderInputsAccordingToOpcodeENS_8ArrayRefIPNS_5ValueEEERNS_15SmallVectorImplIS4_EES8_RKNS_10DataLayoutERNS_15ScalarEvolutionERKS1_ at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm13slpvectorizer7BoUpSLP13buildTree_recENS_8ArrayRefIPNS_5ValueEEEjRKNS1_8EdgeInfoE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm13slpvectorizer7BoUpSLP13buildTree_recENS_8ArrayRefIPNS_5ValueEEEjRKNS1_8EdgeInfoE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm13slpvectorizer7BoUpSLP9buildTreeENS_8ArrayRefIPNS_5ValueEEE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm17SLPVectorizerPass19vectorizeStoreChainENS_8ArrayRefIPNS_5ValueEEERNS_13slpvectorizer7BoUpSLPEjj at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm17SLPVectorizerPass15vectorizeStoresENS_8ArrayRefIPNS_9StoreInstEEERNS_13slpvectorizer7BoUpSLPE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm17SLPVectorizerPass20vectorizeStoreChainsERNS_13slpvectorizer7BoUpSLPE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm17SLPVectorizerPass7runImplERNS_8FunctionEPNS_15ScalarEvolutionEPNS_19TargetTransformInfoEPNS_17TargetLibraryInfoEPNS_9AAResultsEPNS_8LoopInfoEPNS_13DominatorTreeEPNS_15AssumptionCacheEPNS_12DemandedBitsEPNS_25OptimizationRemarkEmitterE.part.3416 at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm17SLPVectorizerPass3runERNS_8FunctionERNS_15AnalysisManagerIS1_JEEE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:88 _ZN4llvm11PassManagerINS_8FunctionENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:88 _ZN4llvm27ModuleToFunctionPassAdaptor3runERNS_6ModuleERNS_15AnalysisManagerIS1_JEEE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) run at /source/usr/include/llvm/IR/PassManagerInternal.h:88 _ZN4llvm11PassManagerINS_6ModuleENS_15AnalysisManagerIS1_JEEEJEE3runERS1_RS3_ at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) run at /source/src/pipeline.cpp:751 operator() at /source/src/jitlayers.cpp:1257 withModuleDo<(anonymous namespace)::OptimizerT::operator()(llvm::orc::ThreadSafeModule, llvm::orc::MaterializationResponsibility&):: > at /source/usr/include/llvm/ExecutionEngine/Orc/ThreadSafeModule.h:136 [inlined] operator() at /source/src/jitlayers.cpp:1222 [inlined] CallImpl<(anonymous namespace)::OptimizerT> at /source/usr/include/llvm/ADT/FunctionExtras.h:222 _ZN4llvm3orc16IRTransformLayer4emitESt10unique_ptrINS0_29MaterializationResponsibilityESt14default_deleteIS3_EENS0_16ThreadSafeModuleE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) emit at /source/src/jitlayers.cpp:724 _ZN4llvm3orc31BasicIRLayerMaterializationUnit11materializeESt10unique_ptrINS0_29MaterializationResponsibilityESt14default_deleteIS3_EE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc19MaterializationTask3runEv at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm6detail18UniqueFunctionBaseIvJSt10unique_ptrINS_3orc4TaskESt14default_deleteIS4_EEEE8CallImplIPFvS7_EEEvPvRS7_ at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession12dispatchTaskESt10unique_ptrINS0_4TaskESt14default_deleteIS3_EE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession22dispatchOutstandingMUsEv at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession17OL_completeLookupESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EESt10shared_ptrINS0_23AsynchronousSymbolQueryEESt8functionIFvRKNS_8DenseMapIPNS0_8JITDylibENS_8DenseSetINS0_15SymbolStringPtrENS_12DenseMapInfoISF_vEEEENSG_ISD_vEENS_6detail12DenseMapPairISD_SI_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc25InProgressFullLookupState8completeESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession19OL_applyQueryPhase1ESt10unique_ptrINS0_21InProgressLookupStateESt14default_deleteIS3_EENS_5ErrorE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession6lookupENS0_10LookupKindERKSt6vectorISt4pairIPNS0_8JITDylibENS0_19JITDylibLookupFlagsEESaIS8_EENS0_15SymbolLookupSetENS0_11SymbolStateENS_15unique_functionIFvNS_8ExpectedINS_8DenseMapINS0_15SymbolStringPtrENS_18JITEvaluatedSymbolENS_12DenseMapInfoISI_vEENS_6detail12DenseMapPairISI_SJ_EEEEEEEEESt8functionIFvRKNSH_IS6_NS_8DenseSetISI_SL_EENSK_IS6_vEENSN_IS6_SV_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN4llvm3orc16ExecutionSession6lookupERKSt6vectorISt4pairIPNS0_8JITDylibENS0_19JITDylibLookupFlagsEESaIS7_EENS0_15SymbolLookupSetENS0_10LookupKindENS0_11SymbolStateESt8functionIFvRKNS_8DenseMapIS5_NS_8DenseSetINS0_15SymbolStringPtrENS_12DenseMapInfoISI_vEEEENSJ_IS5_vEENS_6detail12DenseMapPairIS5_SL_EEEEEE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) addModule at /source/src/jitlayers.cpp:1604 jl_add_to_ee at /source/src/jitlayers.cpp:2015 jl_add_to_ee at /source/src/jitlayers.cpp:1994 _jl_compile_codeinst at /source/src/jitlayers.cpp:276 jl_generate_fptr_impl at /source/src/jitlayers.cpp:528 jl_compile_method_internal at /source/src/gf.c:2481 [inlined] jl_compile_method_internal at /source/src/gf.c:2368 _jl_invoke at /source/src/gf.c:2887 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] jl_f__call_in_world_total at /source/src/builtins.c:850 _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] do_apply at /source/src/builtins.c:768 concrete_eval_call at ./compiler/abstractinterpretation.jl:913 abstract_call_method_with_const_args at ./compiler/abstractinterpretation.jl:798 abstract_call_method_with_const_args at ./compiler/abstractinterpretation.jl:792 abstract_call_gf_by_type at ./compiler/abstractinterpretation.jl:103 abstract_call_known at ./compiler/abstractinterpretation.jl:2101 abstract_call at ./compiler/abstractinterpretation.jl:2184 abstract_call at ./compiler/abstractinterpretation.jl:2177 abstract_call at ./compiler/abstractinterpretation.jl:2369 abstract_eval_call at ./compiler/abstractinterpretation.jl:2385 abstract_eval_statement_expr at ./compiler/abstractinterpretation.jl:2395 abstract_eval_statement at ./compiler/abstractinterpretation.jl:2639 abstract_eval_basic_statement at ./compiler/abstractinterpretation.jl:2928 typeinf_local at ./compiler/abstractinterpretation.jl:3122 typeinf_nocycle at ./compiler/abstractinterpretation.jl:3210 _typeinf at ./compiler/typeinfer.jl:247 typeinf at ./compiler/typeinfer.jl:216 typeinf_edge at ./compiler/typeinfer.jl:930 abstract_call_method at ./compiler/abstractinterpretation.jl:633 abstract_call_gf_by_type at ./compiler/abstractinterpretation.jl:95 abstract_call_known at ./compiler/abstractinterpretation.jl:2101 abstract_call at ./compiler/abstractinterpretation.jl:2184 abstract_call at ./compiler/abstractinterpretation.jl:2177 abstract_call at ./compiler/abstractinterpretation.jl:2369 abstract_eval_call at ./compiler/abstractinterpretation.jl:2385 abstract_eval_statement_expr at ./compiler/abstractinterpretation.jl:2395 abstract_eval_statement at ./compiler/abstractinterpretation.jl:2639 abstract_eval_basic_statement at ./compiler/abstractinterpretation.jl:2928 typeinf_local at ./compiler/abstractinterpretation.jl:3122 typeinf_nocycle at ./compiler/abstractinterpretation.jl:3210 _typeinf at ./compiler/typeinfer.jl:247 typeinf at ./compiler/typeinfer.jl:216 typeinf_edge at ./compiler/typeinfer.jl:930 abstract_call_method at ./compiler/abstractinterpretation.jl:633 abstract_call_gf_by_type at ./compiler/abstractinterpretation.jl:95 abstract_call_known at ./compiler/abstractinterpretation.jl:2101 abstract_call at ./compiler/abstractinterpretation.jl:2184 abstract_call at ./compiler/abstractinterpretation.jl:2177 abstract_call at ./compiler/abstractinterpretation.jl:2369 abstract_eval_call at ./compiler/abstractinterpretation.jl:2385 abstract_eval_statement_expr at ./compiler/abstractinterpretation.jl:2395 abstract_eval_statement at ./compiler/abstractinterpretation.jl:2639 abstract_eval_basic_statement at ./compiler/abstractinterpretation.jl:2928 typeinf_local at ./compiler/abstractinterpretation.jl:3122 typeinf_nocycle at ./compiler/abstractinterpretation.jl:3210 _typeinf at ./compiler/typeinfer.jl:247 typeinf at ./compiler/typeinfer.jl:216 typeinf_edge at ./compiler/typeinfer.jl:930 abstract_call_method at ./compiler/abstractinterpretation.jl:633 abstract_call_gf_by_type at ./compiler/abstractinterpretation.jl:95 abstract_call_unknown at ./compiler/abstractinterpretation.jl:2171 abstract_call at ./compiler/abstractinterpretation.jl:2181 abstract_call at ./compiler/abstractinterpretation.jl:2177 abstract_call at ./compiler/abstractinterpretation.jl:2369 abstract_eval_call at ./compiler/abstractinterpretation.jl:2385 abstract_eval_statement_expr at ./compiler/abstractinterpretation.jl:2395 abstract_eval_statement at ./compiler/abstractinterpretation.jl:2639 abstract_eval_basic_statement at ./compiler/abstractinterpretation.jl:2928 typeinf_local at ./compiler/abstractinterpretation.jl:3122 typeinf_nocycle at ./compiler/abstractinterpretation.jl:3210 _typeinf at ./compiler/typeinfer.jl:247 typeinf at ./compiler/typeinfer.jl:216 typeinf_edge at ./compiler/typeinfer.jl:930 abstract_call_method at ./compiler/abstractinterpretation.jl:633 abstract_call_gf_by_type at ./compiler/abstractinterpretation.jl:95 abstract_call_known at ./compiler/abstractinterpretation.jl:2101 abstract_call at ./compiler/abstractinterpretation.jl:2184 abstract_call at ./compiler/abstractinterpretation.jl:2177 abstract_call at ./compiler/abstractinterpretation.jl:2369 abstract_eval_call at ./compiler/abstractinterpretation.jl:2385 abstract_eval_statement_expr at ./compiler/abstractinterpretation.jl:2395 abstract_eval_statement at ./compiler/abstractinterpretation.jl:2639 abstract_eval_basic_statement at ./compiler/abstractinterpretation.jl:2904 typeinf_local at ./compiler/abstractinterpretation.jl:3122 typeinf_nocycle at ./compiler/abstractinterpretation.jl:3210 _typeinf at ./compiler/typeinfer.jl:247 typeinf at ./compiler/typeinfer.jl:216 typeinf_edge at ./compiler/typeinfer.jl:930 abstract_call_method at ./compiler/abstractinterpretation.jl:633 abstract_call_gf_by_type at ./compiler/abstractinterpretation.jl:95 abstract_call_known at ./compiler/abstractinterpretation.jl:2101 abstract_call at ./compiler/abstractinterpretation.jl:2184 abstract_call at ./compiler/abstractinterpretation.jl:2177 abstract_call at ./compiler/abstractinterpretation.jl:2369 abstract_eval_call at ./compiler/abstractinterpretation.jl:2385 abstract_eval_statement_expr at ./compiler/abstractinterpretation.jl:2395 abstract_eval_statement at ./compiler/abstractinterpretation.jl:2639 abstract_eval_basic_statement at ./compiler/abstractinterpretation.jl:2928 typeinf_local at ./compiler/abstractinterpretation.jl:3122 typeinf_nocycle at ./compiler/abstractinterpretation.jl:3210 _typeinf at ./compiler/typeinfer.jl:247 typeinf at ./compiler/typeinfer.jl:216 typeinf_edge at ./compiler/typeinfer.jl:930 abstract_call_method at ./compiler/abstractinterpretation.jl:633 abstract_call_gf_by_type at ./compiler/abstractinterpretation.jl:95 abstract_call_known at ./compiler/abstractinterpretation.jl:2101 abstract_call at ./compiler/abstractinterpretation.jl:2184 abstract_call at ./compiler/abstractinterpretation.jl:2177 abstract_call at ./compiler/abstractinterpretation.jl:2369 abstract_eval_call at ./compiler/abstractinterpretation.jl:2385 abstract_eval_statement_expr at ./compiler/abstractinterpretation.jl:2395 abstract_eval_statement at ./compiler/abstractinterpretation.jl:2639 abstract_eval_basic_statement at ./compiler/abstractinterpretation.jl:2928 typeinf_local at ./compiler/abstractinterpretation.jl:3122 typeinf_nocycle at ./compiler/abstractinterpretation.jl:3210 _typeinf at ./compiler/typeinfer.jl:247 typeinf at ./compiler/typeinfer.jl:216 typeinf_ext at ./compiler/typeinfer.jl:1051 typeinf_ext_toplevel at ./compiler/typeinfer.jl:1082 typeinf_ext_toplevel at ./compiler/typeinfer.jl:1078 jfptr_typeinf_ext_toplevel_35735.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] jl_type_infer at /source/src/gf.c:394 jl_generate_fptr_impl at /source/src/jitlayers.cpp:512 jl_compile_method_internal at /source/src/gf.c:2481 [inlined] jl_compile_method_internal at /source/src/gf.c:2368 _jl_invoke at /source/src/gf.c:2887 [inlined] ijl_apply_generic at /source/src/gf.c:3077 ∇φ!#159 at /home/pkgeval/.julia/packages/ADNLPModels/nR2jK/src/forward.jl:215 unknown function (ip: 0x7a882f33c2f5) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 ∇φ! at /home/pkgeval/.julia/packages/ADNLPModels/nR2jK/src/forward.jl:214 Hvprod! at /home/pkgeval/.julia/packages/ADNLPModels/nR2jK/src/forward.jl:252 unknown function (ip: 0x7a882f33b7a1) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 #hprod!#413 at /home/pkgeval/.julia/packages/ADNLPModels/nR2jK/src/nlp.jl:745 hprod! at /home/pkgeval/.julia/packages/ADNLPModels/nR2jK/src/nlp.jl:731 [inlined] #hprod_nln!#12 at /home/pkgeval/.julia/packages/FletcherPenaltySolver/6pn0y/src/model-Fletcherpenaltynlp.jl:293 hprod_nln! at /home/pkgeval/.julia/packages/FletcherPenaltySolver/6pn0y/src/model-Fletcherpenaltynlp.jl:287 [inlined] objgrad! at /home/pkgeval/.julia/packages/FletcherPenaltySolver/6pn0y/src/model-Fletcherpenaltynlp.jl:415 #solve!#74 at /home/pkgeval/.julia/packages/JSOSolvers/LBbfI/src/tron.jl:286 solve! at /home/pkgeval/.julia/packages/JSOSolvers/LBbfI/src/tron.jl:233 [inlined] #solve!#26 at /home/pkgeval/.julia/packages/StoppingInterface/Lrl6f/src/stopping_to_jsosolvers.jl:67 solve! at /home/pkgeval/.julia/packages/StoppingInterface/Lrl6f/src/stopping_to_jsosolvers.jl:43 unknown function (ip: 0x7a882f339d45) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 #solve!#51 at /home/pkgeval/.julia/packages/FletcherPenaltySolver/6pn0y/src/algo.jl:116 solve! at /home/pkgeval/.julia/packages/FletcherPenaltySolver/6pn0y/src/algo.jl:26 [inlined] #solve!#21 at /home/pkgeval/.julia/packages/StoppingInterface/Lrl6f/src/StoppingInterface.jl:27 [inlined] solve! at /home/pkgeval/.julia/packages/StoppingInterface/Lrl6f/src/StoppingInterface.jl:25 unknown function (ip: 0x7a882f318aa0) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 #fps_solve#40 at /home/pkgeval/.julia/packages/FletcherPenaltySolver/6pn0y/src/FletcherPenaltySolver.jl:146 fps_solve at /home/pkgeval/.julia/packages/FletcherPenaltySolver/6pn0y/src/FletcherPenaltySolver.jl:127 [inlined] fps_solve at /home/pkgeval/.julia/packages/FletcherPenaltySolver/6pn0y/src/FletcherPenaltySolver.jl:127 [inlined] #minimize#106 at /home/pkgeval/.julia/packages/JSOSuite/M8lgT/src/load-solvers.jl:23 [inlined] minimize at /home/pkgeval/.julia/packages/JSOSuite/M8lgT/src/load-solvers.jl:22 unknown function (ip: 0x7a882f2f6fb9) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 #minimize#27 at /home/pkgeval/.julia/packages/JSOSuite/M8lgT/src/solve.jl:44 minimize at /home/pkgeval/.julia/packages/JSOSuite/M8lgT/src/solve.jl:38 unknown function (ip: 0x7a882ff399a0) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 macro expansion at /home/pkgeval/.julia/packages/JSOSuite/M8lgT/test/runtests.jl:104 [inlined] macro expansion at /source/usr/share/julia/stdlib/v1.10/Test/src/Test.jl:1577 [inlined] top-level scope at /home/pkgeval/.julia/packages/JSOSuite/M8lgT/test/runtests.jl:100 _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_invoke at /source/src/gf.c:2902 jl_toplevel_eval_flex at /source/src/toplevel.c:925 jl_toplevel_eval_flex at /source/src/toplevel.c:877 ijl_toplevel_eval_in at /source/src/toplevel.c:985 eval at ./boot.jl:385 [inlined] include_string at ./loading.jl:2146 _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 _include at ./loading.jl:2206 include at ./client.jl:494 unknown function (ip: 0x7a884d5ff125) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] do_call at /source/src/interpreter.c:126 eval_value at /source/src/interpreter.c:223 eval_stmt_value at /source/src/interpreter.c:174 [inlined] eval_body at /source/src/interpreter.c:635 jl_interpret_toplevel_thunk at /source/src/interpreter.c:775 jl_toplevel_eval_flex at /source/src/toplevel.c:934 jl_toplevel_eval_flex at /source/src/toplevel.c:877 ijl_toplevel_eval_in at /source/src/toplevel.c:985 eval at ./boot.jl:385 [inlined] exec_options at ./client.jl:296 _start at ./client.jl:557 jfptr__start_83099.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] true_main at /source/src/jlapi.c:582 jl_repl_entrypoint at /source/src/jlapi.c:731 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7a884e4aa249) __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) unknown function (ip: (nil)) ============================================================== Profile collected. A report will print at the next yield point ============================================================== ┌ Warning: Problem does not have general constraints; calling tron └ @ Percival ~/.julia/packages/Percival/ZPIzj/src/method.jl:36 Test Summary: | Pass ====================================================================================== 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_wait at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) uv__io_poll at /workspace/srcdir/libuv/src/unix/epoll.c:236 uv_run at /workspace/srcdir/libuv/src/unix/core.c:400 ijl_task_get_next at /source/src/partr.c:478 poptask at ./task.jl:999 wait at ./task.jl:1008 #wait#647 at ./condition.jl:130 wait at ./condition.jl:125 [inlined] wait at ./process.jl:661 jfptr_wait_74802.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 subprocess_handler at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:2048 #130 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1992 withenv at ./env.jl:257 #117 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1840 with_temp_env at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1721 #115 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1810 #mktempdir#24 at ./file.jl:766 unknown function (ip: 0x7683e87b0910) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 mktempdir at ./file.jl:762 mktempdir at ./file.jl:762 [inlined] #sandbox#114 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1768 sandbox at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1759 unknown function (ip: 0x7683e87a92ad) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 #test#127 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1971 test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/Operations.jl:1915 [inlined] #test#146 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:444 test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:423 unknown function (ip: 0x7683e87a8da0) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 #test#77 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:159 unknown function (ip: 0x7683e87a8660) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:148 #test#75 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:147 [inlined] test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:147 [inlined] #test#74 at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:146 [inlined] test at /source/usr/share/julia/stdlib/v1.10/Pkg/src/API.jl:146 unknown function (ip: 0x7683e87a4d59) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] do_call at /source/src/interpreter.c:126 eval_value at /source/src/interpreter.c:223 eval_stmt_value at /source/src/interpreter.c:174 [inlined] eval_body at /source/src/interpreter.c:635 eval_body at /source/src/interpreter.c:544 eval_body at /source/src/interpreter.c:544 jl_interpret_toplevel_thunk at /source/src/interpreter.c:775 jl_toplevel_eval_flex at /source/src/toplevel.c:934 jl_toplevel_eval_flex at /source/src/toplevel.c:877 ijl_toplevel_eval_in at /source/src/toplevel.c:985 eval at ./boot.jl:385 [inlined] include_string at ./loading.jl:2146 _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 _include at ./loading.jl:2206 include at ./Base.jl:495 jfptr_include_46645.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 exec_options at ./client.jl:323 _start at ./client.jl:557 jfptr__start_83099.1 at /opt/julia/lib/julia/sys.so (unknown line) _jl_invoke at /source/src/gf.c:2876 [inlined] ijl_apply_generic at /source/src/gf.c:3077 jl_apply at /source/src/julia.h:1982 [inlined] true_main at /source/src/jlapi.c:582 jl_repl_entrypoint at /source/src/jlapi.c:731 main at /source/cli/loader_exe.c:58 unknown function (ip: 0x7683e959f249) __libc_start_main at /lib/x86_64-linux-gnu/libc.so.6 (unknown line) unknown function (ip: 0x4010b8) unknown function (ip: (nil)) ============================================================== 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.10/Profile/src/Profile.jl:1225 Total Overhead ╎ [+additional indent] Count File:Line; Function ========================================================= Thread 1 Task 0x00007a8840e00010 Total snapshots: 1. Utilization: 100% ╎1 @Base/client.jl:557; _start() ╎ 1 @Base/client.jl:296; exec_options(opts::Base.JLOptions) ╎ 1 @Base/boot.jl:385; eval ╎ 1 @Base/client.jl:494; include(fname::String) ╎ 1 @Base/loading.jl:2206; _include(mapexpr::Function, mod::Module, _path::… ╎ 1 @Base/loading.jl:2146; include_string(mapexpr::typeof(identity), mod::… ╎ ╎ 1 @Base/boot.jl:385; eval ╎ ╎ 1 …8lgT/test/runtests.jl:100; top-level scope ╎ ╎ 1 @Test/src/Test.jl:1577; macro expansion ╎ ╎ 1 …lgT/test/runtests.jl:104; macro expansion ╎ ╎ 1 …SOSuite/src/solve.jl:38; kwcall(::@NamedTuple{verbose::Int64, at… ╎ ╎ ╎ 1 …SOSuite/src/solve.jl:44; minimize(solver_name::String, nlp::ADN… ╎ ╎ ╎ 1 …src/load-solvers.jl:22; kwcall(::@NamedTuple{verbose::Int64, a… ╎ ╎ ╎ 1 …src/load-solvers.jl:23; #minimize#106 ╎ ╎ ╎ 1 …erPenaltySolver.jl:127; fps_solve ╎ ╎ ╎ 1 …erPenaltySolver.jl:127; fps_solve ╎ ╎ ╎ ╎ 1 …rPenaltySolver.jl:146; fps_solve(nlp::ADNLPModel{Float32, … ╎ ╎ ╎ ╎ 1 …ppingInterface.jl:25; kwcall(::@NamedTuple{verbose::Int64… ╎ ╎ ╎ ╎ 1 …ppingInterface.jl:27; #solve!#21 ╎ ╎ ╎ ╎ 1 …olver/src/algo.jl:26; solve! ╎ ╎ ╎ ╎ 1 …lver/src/algo.jl:259; solve!(fpssolver::FPSSSolver{Flo… ╎ ╎ ╎ ╎ ╎ 1 …ver/src/algo.jl:374; update_parameters!(meta::AlgoDat… ╎ ╎ ╎ ╎ ╎ 1 …te/NLPAtXmod.jl:353; kwcall(::@NamedTuple{cx::Vector… ╎ ╎ ╎ ╎ ╎ 1 …te/NLPAtXmod.jl:355; reinit!(stateatx::Stopping.NLP… Time Test `Float32` | 7 7 1m45.9s ┌ 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.10/Profile/src/Profile.jl:1225 Overhead ╎ [+additional indent] Count File:Line; Function ========================================================= Thread 1 Task 0x00007683dc000010 Total snapshots: 1. Utilization: 0% ╎1 @Base/client.jl:557; _start() ╎ 1 @Base/client.jl:323; exec_options(opts::Base.JLOptions) ╎ 1 @Base/Base.jl:495; include(mod::Module, _path::String) ╎ 1 @Base/loading.jl:2206; _include(mapexpr::Function, mod::Module, _path::S… ╎ 1 @Base/loading.jl:2146; include_string(mapexpr::typeof(identity), mod::M… ╎ 1 @Base/boot.jl:385; eval ╎ ╎ 1 @Pkg/src/API.jl:146; kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(… ╎ ╎ 1 @Pkg/src/API.jl:146; #test#74 ╎ ╎ 1 @Pkg/src/API.jl:147; test ╎ ╎ 1 @Pkg/src/API.jl:147; #test#75 ╎ ╎ 1 @Pkg/src/API.jl:148; kwcall(::@NamedTuple{julia_args::Cmd}, ::typ… ╎ ╎ ╎ 1 @Pkg/src/API.jl:159; test(pkgs::Vector{Pkg.Types.PackageSpec}; i… ╎ ╎ ╎ 1 @Pkg/src/API.jl:423; kwcall(::@NamedTuple{julia_args::Cmd, io::… ╎ ╎ ╎ 1 @Pkg/src/API.jl:444; test(ctx::Pkg.Types.Context, pkgs::Vector… ╎ ╎ ╎ 1 …/src/Operations.jl:1915; test ╎ ╎ ╎ 1 …src/Operations.jl:1971; test(ctx::Pkg.Types.Context, pkgs::… ╎ ╎ ╎ ╎ 1 …src/Operations.jl:1759; kwcall(::@NamedTuple{preferences::… ╎ ╎ ╎ ╎ 1 …src/Operations.jl:1768; sandbox(fn::Function, ctx::Pkg.Ty… ╎ ╎ ╎ ╎ 1 @Base/file.jl:762; mktempdir ╎ ╎ ╎ ╎ 1 @Base/file.jl:762; mktempdir(fn::Function, parent::Strin… ╎ ╎ ╎ ╎ 1 @Base/file.jl:766; mktempdir(fn::Pkg.Operations.var"#11… ╎ ╎ ╎ ╎ ╎ 1 …c/Operations.jl:1810; (::Pkg.Operations.var"#115#120"… ╎ ╎ ╎ ╎ ╎ 1 …c/Operations.jl:1721; with_temp_env(fn::Pkg.Operatio… ╎ ╎ ╎ ╎ ╎ 1 …/Operations.jl:1840; (::Pkg.Operations.var"#117#122… ╎ ╎ ╎ ╎ ╎ 1 @Base/env.jl:257; withenv(::Pkg.Operations.var"#130… ╎ ╎ ╎ ╎ ╎ 1 …Operations.jl:1992; (::Pkg.Operations.var"#130#13… ╎ ╎ ╎ ╎ ╎ ╎ 1 …Operations.jl:2048; subprocess_handler(cmd::Cmd,… ╎ ╎ ╎ ╎ ╎ ╎ 1 …se/process.jl:661; wait(x::Base.Process) ╎ ╎ ╎ ╎ ╎ ╎ 1 …/condition.jl:125; wait ╎ ╎ ╎ ╎ ╎ ╎ 1 …condition.jl:130; wait(c::Base.GenericConditi… ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/task.jl:1008; wait() ╎ ╎ ╎ ╎ ╎ ╎ ╎ 1 …ase/task.jl:999; poptask(W::Base.IntrusiveL… The problem has 100 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. The problem has 100 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. The problem has 100 variables and no constraints. Algorithm selection: - unconstrained: ✓; - nonlinear objective: ✓; - may use 2-th order derivative. There are 8 optimizers available: ["LBFGS", "R2", "TRON", "TRUNK", "IPOPT", "DCISolver", "FletcherPenaltySolver", "Percival"]. [271] signal (15): Terminated in expression starting at /home/pkgeval/.julia/packages/JSOSuite/M8lgT/test/runtests.jl:114 _ZN12_GLOBAL__N_18Verifier11visitMDNodeERKN4llvm6MDNodeENS0_19AreDebugLocsAllowedE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) _ZN12_GLOBAL__N_18Verifier11visitMDNodeERKN4llvm6MDNodeENS0_19AreDebugLocsAllowedE at /opt/julia/bin/../lib/julia/libLLVM-15jl.so (unknown line) PkgEval terminated after 2731.31s: test duration exceeded the time limit