Package evaluation of Polyhedra on Julia 1.10.9 (96dc2d8c45*) started at 2025-06-06T16:49:00.959 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 4.7s ################################################################################ # Installation # Installing Polyhedra... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [67491407] + Polyhedra v0.8.1 Updating `~/.julia/environments/v1.10/Manifest.toml` [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.16.0 [864edb3b] + DataStructures v0.18.22 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [ffbed154] + DocStringExtensions v0.9.4 [f6369f11] + ForwardDiff v1.0.1 [14197337] + GenericLinearAlgebra v0.3.17 [92d709cd] + IrrationalConstants v0.2.4 [692b3bcd] + JLLWrappers v1.7.0 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.40.2 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [69de0a69] + Parsers v2.8.3 [67491407] + Polyhedra v0.8.1 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [856f2bd8] + StructTypes v1.11.0 [3bb67fe8] + TranscodingStreams v0.11.3 [6e34b625] + Bzip2_jll v1.0.9+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [56f22d72] + Artifacts [2a0f44e3] + Base64 [ade2ca70] + Dates [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 ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 8.28s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 47.19s ################################################################################ # Testing # Testing Polyhedra Status `/tmp/jl_kN0Mvb/Project.toml` [861a8166] Combinatorics v1.0.3 [60bf3e95] GLPK v1.2.1 [5c1252a2] GeometryBasics v0.5.9 [87dc4568] HiGHS v1.18.0 [4076af6c] JuMP v1.26.0 [98b081ad] Literate v2.20.1 [67491407] Polyhedra v0.8.1 [3cdcf5f2] RecipesBase v1.3.4 [90137ffa] StaticArrays v1.9.13 [37e2e46d] LinearAlgebra [2f01184e] SparseArrays v1.10.0 [8dfed614] Test Status `/tmp/jl_kN0Mvb/Manifest.toml` [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.3 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.16.0 [9a962f9c] DataAPI v1.16.0 [864edb3b] DataStructures v0.18.22 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [ffbed154] DocStringExtensions v0.9.4 [411431e0] Extents v0.1.6 [f6369f11] ForwardDiff v1.0.1 [60bf3e95] GLPK v1.2.1 [14197337] GenericLinearAlgebra v0.3.17 [68eda718] GeoFormatTypes v0.4.4 [cf35fbd7] GeoInterface v1.4.1 [5c1252a2] GeometryBasics v0.5.9 [87dc4568] HiGHS v1.18.0 [b5f81e59] IOCapture v0.2.5 [92d709cd] IrrationalConstants v0.2.4 [c8e1da08] IterTools v1.10.0 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.26.0 [98b081ad] Literate v2.20.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.40.2 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 [67491407] Polyhedra v0.8.1 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [3cdcf5f2] RecipesBase v1.3.4 [276daf66] SpecialFunctions v2.5.1 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [856f2bd8] StructTypes v1.11.0 [3bb67fe8] TranscodingStreams v0.11.3 [6e34b625] Bzip2_jll v1.0.9+0 [5ae413db] EarCut_jll v2.2.4+0 [e8aa6df9] GLPK_jll v5.0.1+1 [8fd58aa0] HiGHS_jll v1.11.0+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [0dad84c5] ArgTools v1.1.1 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching [b77e0a4c] InteractiveUtils [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 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test [cf7118a7] UUIDs [4ec0a83e] Unicode [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [781609d7] GMP_jll v6.2.1+6 [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 [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 ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Test Summary: | Pass Total Time Element | 33 33 5.8s Test Summary: | Pass Total Time Comparison | 2 2 0.0s Test Summary: | Pass Total Time test_MixMatRep | 82 82 11.4s Test Summary: | Pass Total Time test_Vconsistency | 26 26 17.5s Test Summary: | Pass Total Time test_building_rep_with_different_type | 4 4 0.3s Test Summary: | Pass Total Time test_cartesian_product_mixed | 2 2 2.9s The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `2` which is nonzero but lower than the previous dimension `3`: we now compute the set of Chebyshev center of `q`. The set `q` of Chebyshev centers has dimension `1` which is nonzero but lower than the previous dimension `2`: we now compute the set of Chebyshev center of `q`. Test Summary: | Pass Total Time test_chebyshev_center | 132 132 52.7s Test Summary: | Pass Total Time test_combination_different_coef_type | 15 15 10.9s Test Summary: | Pass Total Time test_conversion_different_array_type | 30 30 7.4s Test Summary: | Pass Total Time test_convexhull | 30 30 2.0s Test Summary: | Pass Total Time test_copy | 54 54 5.5s Test Summary: | Pass Total Time test_eltype_incorrect | 362 362 24.7s Test Summary: | Pass Total Time test_intersect | 12 12 0.3s Test Summary: | Pass Total Time test_iterating | 21 21 0.8s Test Summary: | Pass Total Time test_lifted_representation | 80 80 3.4s Test Summary: | Pass Total Time test_lphrep | 4 4 12.8s Test Summary: | Pass Total Time test_order_lphrep | 2 2 2.1s Test Summary: | Pass Total Time test_perserve_sparsity | 28 28 13.6s Test Summary: | Pass Total Time test_polar | 16 16 8.5s Test Summary: | Pass Total Time test_radius | 10 10 10.4s Test Summary: | Pass Total Time test_scalar_multiplication | 12 12 2.0s Test Summary: | Pass Total Time Hypercube name | 4 4 4.3s Test Summary: | Pass Total Time Dual Type | 5 5 3.6s Test Summary: | Pass Total Time Unimplemented methods | 9 9 0.2s Test Summary: | Pass Total Time Polyhedra.DefaultPolyhedron constructor with nothing | 6 6 1.9s Test Summary: | Pass Total Time Redundancy removal | 661 661 41.0s ┌ Warning: Cannot detect exact linearity as no solver was provided and the polyhedron is not affine. │ As fallback, we will only detect halfspaces from opposite hyperplanes but that may not detect all halfspaces. │ Set a solver if you believe that the polyhedron may have more linearity. │ To provide a solver to a polyhedron, first select a solver from https://jump.dev/JuMP.jl/stable/installation/#Getting-Solvers-1. │ If you choose for instance `GLPK`, do `using GLPK; solver = GLPK.Optimizer`. │ Then provide the solver to the library. For instance, with the default library, do `lib = DefaultLibrary{Float64}(solver)` │ or if you use an external library, say `QHull`, do `lib = QHull.Library(solver)`. │ Then when you create the polyhedron, say from a representation `rep`, do `polyhedron(rep, lib)`. └ @ Polyhedra ~/.julia/packages/Polyhedra/Rh0hj/src/linearity.jl:238 ┌ Warning: Cannot detect exact linearity as no solver was provided and the polyhedron is not affine. │ As fallback, we will only detect halfspaces from opposite hyperplanes but that may not detect all halfspaces. │ Set a solver if you believe that the polyhedron may have more linearity. │ To provide a solver to a polyhedron, first select a solver from https://jump.dev/JuMP.jl/stable/installation/#Getting-Solvers-1. │ If you choose for instance `GLPK`, do `using GLPK; solver = GLPK.Optimizer`. │ Then provide the solver to the library. For instance, with the default library, do `lib = DefaultLibrary{Float64}(solver)` │ or if you use an external library, say `QHull`, do `lib = QHull.Library(solver)`. │ Then when you create the polyhedron, say from a representation `rep`, do `polyhedron(rep, lib)`. └ @ Polyhedra ~/.julia/packages/Polyhedra/Rh0hj/src/linearity.jl:238 Test Summary: | Pass Total Time Duplicate removal | 10 10 1.0s Test Summary: | Pass Total Time Numerically delicate #270 | 3 3 9.7s Test Summary: | Pass Total Time Noise linearity #259 | 3 3 7.5s Test Summary: | Pass Total Time Planar | 526 526 12.6s Test Summary: | Pass Total Time Double Description | 73 73 28.2s ┌ Warning: Cannot detect exact linearity as no solver was provided and the polyhedron is not affine. │ As fallback, we will only detect halfspaces from opposite hyperplanes but that may not detect all halfspaces. │ Set a solver if you believe that the polyhedron may have more linearity. │ To provide a solver to a polyhedron, first select a solver from https://jump.dev/JuMP.jl/stable/installation/#Getting-Solvers-1. │ If you choose for instance `GLPK`, do `using GLPK; solver = GLPK.Optimizer`. │ Then provide the solver to the library. For instance, with the default library, do `lib = DefaultLibrary{Float64}(solver)` │ or if you use an external library, say `QHull`, do `lib = QHull.Library(solver)`. │ Then when you create the polyhedron, say from a representation `rep`, do `polyhedron(rep, lib)`. └ @ Polyhedra ~/.julia/packages/Polyhedra/Rh0hj/src/linearity.jl:238 ┌ Warning: `removehredundancy!` will trigger the computation of the H-representation, which │ is computationally demanding because no solver was provided to the library. │ If this is expected, call `computevrep!` explicitely before calling this │ function to remove this warning. │ To provide a solver to a polyhedron, first select a solver from https://jump.dev/JuMP.jl/stable/installation/#Getting-Solvers-1. │ If you choose for instance `GLPK`, do `using GLPK; solver = GLPK.Optimizer`. │ Then provide the solver to the library. For instance, with the default library, do `lib = DefaultLibrary{Float64}(solver)` │ or if you use an external library, say `QHull`, do `lib = QHull.Library(solver)`. │ Then when you create the polyhedron, say from a representation `rep`, do `polyhedron(rep, lib)`. └ @ Polyhedra ~/.julia/packages/Polyhedra/Rh0hj/src/redundancy.jl:107 Test Summary: | Pass Total Time Interval tests | 418 418 7.9s Test Summary: | Pass Total Time Model to Polyhedra with default library | 6 6 2.5s Test Summary: | Pass Total Time Continuous Linear problems with VRepOptimizer | 1631 1631 21m30.2s Test Summary: | Pass Total Time simplex chebyshev center with Float64 | 3 3 15.7s Test Summary: | Pass Total Time simplex chebyshev center with Rational{BigInt} | 3 3 49.1s Test Summary: | Pass Total Time AbstractPolyhedraOptimizer | 8 8 21.6s Test Summary: | Pass Total Time PolyhedraToLPBridge{Float64} | 15 15 5.3s Test Summary: | Pass Total Time PolyhedraToLPBridge{Int64} | 15 15 8.2s Test Summary: | Pass Total Time PolyhedraToLPBridge{BigInt} | 15 15 15.0s Test Summary: | Pass Total Time PolyhedraToLPBridge{Rational{BigInt}} | 15 15 8.0s Test Summary: | Pass Total Time Default | 15 15 0.3s Test Summary: | Pass Total Time Simple show | 2 2 0.3s Test Summary: | Pass Total Time Iterator | 6 6 0.2s Test Summary: | Pass Total Time Polyhedron without H-representation | 3 3 1.3s Test Summary: | Pass Total Time V-Representation | 3 3 0.4s Test Summary: | Pass Total Time H-Representation | 3 3 0.5s Test Summary: | Pass Total Time Polyhedron | 3 3 0.0s Test Summary: | Pass Total Time Polyhedron without V-representation | 3 3 0.0s WARNING: Method definition cartesian_interval_test(Polyhedra.Library) in module Main at /home/pkgeval/.julia/packages/Polyhedra/Rh0hj/test/cartesian_interval.jl:1 overwritten on the same line (check for duplicate calls to `include`). ┌ Warning: `isredundant` with a solver is not supported yet so it triggers the computation of the V-representation, which │ is computationally demanding because no solver was provided to the library. │ If this is expected, call `computevrep!` explicitely before calling this │ function to remove this warning. └ @ Polyhedra ~/.julia/packages/Polyhedra/Rh0hj/src/redundancy.jl:66 Test Summary: | Pass Total Time Polyhedra tests in floating point arithmetic | 789 789 2m20.0s ┌ Warning: `isredundant` with a solver is not supported yet so it triggers the computation of the V-representation, which │ is computationally demanding because no solver was provided to the library. │ If this is expected, call `computevrep!` explicitely before calling this │ function to remove this warning. └ @ Polyhedra ~/.julia/packages/Polyhedra/Rh0hj/src/redundancy.jl:66 Test Summary: | Pass Total Time Polyhedra tests in exact arithmetic | 789 789 2m23.3s [ Info: generating plain script file from `~/.julia/packages/Polyhedra/Rh0hj/examples/Convex hull and intersection.jl` [ Info: writing result to `~/.julia/packages/Polyhedra/Rh0hj/examples/generated/Convex hull and intersection.jl` [ Info: generating plain script file from `~/.julia/packages/Polyhedra/Rh0hj/examples/Extended Formulation.jl` [ Info: writing result to `~/.julia/packages/Polyhedra/Rh0hj/examples/generated/Extended Formulation.jl` [ Info: generating plain script file from `~/.julia/packages/Polyhedra/Rh0hj/examples/Minimal Robust Positively Invariant Set.jl` [ Info: writing result to `~/.julia/packages/Polyhedra/Rh0hj/examples/generated/Minimal Robust Positively Invariant Set.jl` Number of points after adding A^1 * W: 16 Number of points after removing redundant ones: 8 Number of points after adding A^2 * W: 32 Number of points after removing redundant ones: 12 Number of points after adding A^3 * W: 48 Number of points after removing redundant ones: 16 Test Summary: | Pass Total Time test_examples.jl | 21 21 45.5s Test Summary: | Pass Total Time volumes | 11 11 1.3s Testing Polyhedra tests passed Testing completed after 2225.41s PkgEval succeeded after 2294.58s