Package evaluation to test Groebner on Julia 1.10.10 (c8be17dcfd*) started at 2026-02-02T16:30:13.587 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.10` Set-up completed after 5.16s ################################################################################ # Installation # Installing Groebner... Resolving package versions... Updating `~/.julia/environments/v1.10/Project.toml` [0b43b601] + Groebner v0.10.2 Updating `~/.julia/environments/v1.10/Manifest.toml` [c3fe647b] + AbstractAlgebra v0.48.2 [a9b6321e] + Atomix v1.1.2 [861a8166] + Combinatorics v1.1.0 [e2ba6199] + ExprTools v0.1.10 [0b43b601] + Groebner v0.10.2 [18e54dd8] + IntegerMathUtils v0.1.3 [692b3bcd] + JLLWrappers v1.7.1 [1914dd2f] + MacroTools v0.5.16 [2edaba10] + Nemo v0.54.1 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.5.1 [27ebfcd6] + Primes v0.5.7 [fb686558] + RandomExtensions v0.4.4 [a759f4b9] + TimerOutputs v0.5.29 [013be700] + UnsafeAtomics v0.3.0 [e134572f] + FLINT_jll v301.400.1+0 ⌅ [656ef2d0] + OpenBLAS32_jll v0.3.24+0 [56f22d72] + Artifacts [ade2ca70] + Dates [8f399da3] + Libdl [37e2e46d] + LinearAlgebra [56ddb016] + Logging [de0858da] + Printf [9a3f8284] + Random [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization [2f01184e] + SparseArrays v1.10.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [781609d7] + GMP_jll v6.2.1+6 [3a97d323] + MPFR_jll v4.2.0+1 [4536629a] + OpenBLAS_jll v0.3.23+5 [bea87d4a] + SuiteSparse_jll v7.2.1+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 9.28s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 78473.6 ms ✓ Groebner 6579.7 ms ✓ Groebner → GroebnerDynamicPolynomialsExt 2 dependencies successfully precompiled in 87 seconds. 37 already precompiled. Precompilation completed after 100.12s ################################################################################ # Testing # Testing Groebner Status `/tmp/jl_SHK9TH/Project.toml` [c3fe647b] AbstractAlgebra v0.48.2 [a9b6321e] Atomix v1.1.2 [6e4b80f9] BenchmarkTools v1.6.3 [861a8166] Combinatorics v1.1.0 [7c1d4256] DynamicPolynomials v0.6.4 [0b43b601] Groebner v0.10.2 [2edaba10] Nemo v0.54.1 ⌅ [aea7be01] PrecompileTools v1.2.1 [27ebfcd6] Primes v0.5.7 [a759f4b9] TimerOutputs v0.5.29 [b77e0a4c] InteractiveUtils [56ddb016] Logging [de0858da] Printf [9a3f8284] Random [8dfed614] Test Status `/tmp/jl_SHK9TH/Manifest.toml` [c3fe647b] AbstractAlgebra v0.48.2 [a9b6321e] Atomix v1.1.2 [6e4b80f9] BenchmarkTools v1.6.3 [861a8166] Combinatorics v1.1.0 [34da2185] Compat v4.18.1 [864edb3b] DataStructures v0.19.3 [7c1d4256] DynamicPolynomials v0.6.4 [e2ba6199] ExprTools v0.1.10 [0b43b601] Groebner v0.10.2 [18e54dd8] IntegerMathUtils v0.1.3 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v1.4.0 [1914dd2f] MacroTools v0.5.16 [102ac46a] MultivariatePolynomials v0.5.13 [d8a4904e] MutableArithmetics v1.6.7 [2edaba10] Nemo v0.54.1 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.5.1 [27ebfcd6] Primes v0.5.7 [fb686558] RandomExtensions v0.4.4 [189a3867] Reexport v1.2.2 [ec057cc2] StructUtils v2.6.2 [a759f4b9] TimerOutputs v0.5.29 [013be700] UnsafeAtomics v0.3.0 [e134572f] FLINT_jll v301.400.1+0 ⌅ [656ef2d0] OpenBLAS32_jll v0.3.24+0 [56f22d72] Artifacts [2a0f44e3] Base64 [ade2ca70] Dates [9fa8497b] Future [b77e0a4c] InteractiveUtils [8f399da3] Libdl [37e2e46d] LinearAlgebra [56ddb016] Logging [d6f4376e] Markdown [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 [781609d7] GMP_jll v6.2.1+6 [3a97d323] MPFR_jll v4.2.0+1 [4536629a] OpenBLAS_jll v0.3.23+5 [bea87d4a] SuiteSparse_jll v7.2.1+1 [8e850b90] libblastrampoline_jll v5.11.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... WARNING: Method definition invariants_enabled() in module Groebner at /home/pkgeval/.julia/packages/Groebner/uED9g/src/Groebner.jl:28 overwritten at /home/pkgeval/.julia/packages/Groebner/uED9g/test/runtests.jl:5. Julia Version 1.10.10 Commit c8be17dcfd* (2026-02-02 12:05 UTC) Platform Info: OS: Linux (x86_64-linux-gnu) CPU: 128 × AMD EPYC 7502 32-Core Processor WORD_SIZE: 64 LIBM: libopenlibm LLVM: libLLVM-15.0.7 (ORCJIT, znver2) Threads: 1 default, 0 interactive, 1 GC (on 1 virtual cores) Environment: JULIA_CPU_THREADS = 1 JULIA_NUM_PRECOMPILE_TASKS = 1 JULIA_PKG_PRECOMPILE_AUTO = 0 JULIA_PKGEVAL = true JULIA_DEPOT_PATH = /home/pkgeval/.julia:/usr/local/share/julia: JULIA_NUM_THREADS = 1 JULIA_LOAD_PATH = @:/tmp/jl_SHK9TH [ Info: Running arithmetic.jl 5.982518 seconds (2.24 M allocations: 145.806 MiB, 4.16% gc time, 97.52% compilation time) [ Info: Running crt.jl 3.740730 seconds (1.39 M allocations: 94.609 MiB, 0.89% gc time, 98.30% compilation time) [ Info: Running ratrec.jl 1.337672 seconds (399.40 k allocations: 27.160 MiB, 96.96% compilation time) [ Info: Running monoms/exponentvector.jl 2.017720 seconds (719.48 k allocations: 49.107 MiB, 2.50% gc time, 98.45% compilation time) [ Info: Running monoms/packedtuples.jl 5.493772 seconds (2.01 M allocations: 130.671 MiB, 0.65% gc time, 97.11% compilation time) [ Info: Running monoms/monom_arithmetic.jl 6.060395 seconds (1.93 M allocations: 131.479 MiB, 0.66% gc time, 97.67% compilation time: <1% of which was recompilation) [ Info: Running monoms/monom_orders.jl 20.026860 seconds (6.47 M allocations: 439.509 MiB, 0.97% gc time, 98.76% compilation time) [ Info: Running groebner.jl ┌ Warning: Groebner.jl does not have a native implementation for the given field: Finite field F_10715086071862673209484250490600018105614048117055336074437503883703510511249361224931983788156958581275946729175531468251871452856923140435984577574698574803934567774824230985421074605062371141877954182153046474983581941267398767559165543946077062914571196477686542167660429831652624386837205668069673. │ Falling back to a generic implementation (may be slow). │ If this is unexpected, please consider submitting a GitHub issue. └ @ Groebner ~/.julia/packages/Groebner/uED9g/src/input_output/AbstractAlgebra.jl:78 ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. ┌ Info: Two blocks of the product ordering intersect by their variables. │ Block 1: Lex(x6,x2,x1,x5) └ Block 2: Lex(x4,x1,x3) ┌ Info: Two blocks of the product ordering intersect by their variables. │ Block 1: Lex(6,2,1,5) └ Block 2: Lex(4,1,3) [ Info: GB contains polynomials of lengths: [548, 3483, 4479, 5686, 8994, 13679, 18299, 25083, 32726, 34372, 43171, 48319, 50564, 63311, 65524, 68275, 80746, 84770, 85648, 85716, 85806, 94069, 95867, 96807, 101516, 101927, 107130, 108327, 113060, 114761, 115734, 127401, 128784, 128908, 130406, 131616, 136583, 139814, 144953, 146338, 147596, 163098, 164511, 165081] [ Info: Variables: 64 [ Info: Variables: 100 [ Info: Variables: 101 [ Info: Variables: 127 [ Info: Variables: 128 [ Info: Variables: 256 [ Info: Variables: 257 ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. ┌ Info: The option `tasks = 128` was provided to Groebner.jl, │ however, multi-threading is disabled globally in Groebner.jl. │ The option `tasks` was ignored. └ See `Groebner.threading_enabled()` for details. [ Info: Testing multi-threading over Zp using 1 threads [ Info: Testing multi-threading over QQ using 1 threads [ Info: Producing 46656 small random tests for groebner. This may take a minute 1302.069457 seconds (771.93 M allocations: 77.952 GiB, 2.33% gc time, 85.22% compilation time) [ Info: Running learn_and_apply.jl Recorded 1 traces. Showing only one. # Trace of F4 recorded in 0.0 s (0.02 MiB). ring : Z[x1,...,x2] mod 2147483647 input : 2 polynomials output: 2 polynomials apply : 1 / 0 (success/fail) # Parameters input order : DegRevLex() output order : DegRevLex() homogenize : false permute : false monom. type : Groebner.PackedTuple1{UInt64, UInt8} coeff. type : UInt32 arithmetic : Groebner.SpecializedArithmeticZp{UInt64, UInt32, true} # F4 statistics iterations : 1 hashtable : 4 / 1024 filled matrix up-rows : 2 (100.0 % useful) matrix low-rows: 0 (NaN % useful) pair degrees : pair count : ┌ Info: Possible overflow of exponent vector detected. └ Restarting with at least 32 bits per exponent. Recorded 1 traces. Showing only one. # Trace of F4 recorded in 0.0 s (0.02 MiB). ring : Z[x1,...,x2] mod 2147483647 input : 2 polynomials output: 3 polynomials apply : 0 / 0 (success/fail) # Parameters input order : DegRevLex() output order : DegRevLex() homogenize : false permute : false monom. type : Vector{UInt64} coeff. type : UInt32 arithmetic : Groebner.SpecializedArithmeticZp{UInt64, UInt32, true} # F4 statistics iterations : 3 hashtable : 13 / 1024 filled matrix up-rows : 6 (66.67 % useful) matrix low-rows: 2 (50.0 % useful) pair degrees : 2000,2000 pair count : 1,1 Recorded 1 traces. Showing only one. # Trace of F4 recorded in 0.0 s (0.02 MiB). ring : Z[x1,...,x2] mod 4611686018427388039 input : 2 polynomials output: 3 polynomials apply : 0 / 0 (success/fail) # Parameters input order : DegRevLex() output order : DegRevLex() homogenize : false permute : false monom. type : Vector{UInt64} coeff. type : UInt64 arithmetic : Groebner.SpecializedArithmeticZp{UInt128, UInt64, false} # F4 statistics iterations : 3 hashtable : 13 / 1024 filled matrix up-rows : 6 (66.67 % useful) matrix low-rows: 2 (50.0 % useful) pair degrees : 2000,2000 pair count : 1,1 [ Info: Trace might be corrupted. Recovering... ┌ Info: Stress testing groebner_apply! on: │ primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 1031, 1048583, 134217689, 134217757] │ boot = 10 │ system = └ AbstractAlgebra.Generic.MPoly{Rational{BigInt}}[x*y + y, x*y + x + y] [ Info: Apply (expectedly) failed in 1052 / 1820 cases. ┌ Info: Stress testing groebner_apply! on: │ primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 1031, 1048583, 134217689, 134217757] │ boot = 10 │ system = └ AbstractAlgebra.Generic.MPoly{Rational{BigInt}}[z1 + z2 + z3 + z4 + z5, z1*z2 + z2*z3 + z3*z4 + z1*z5 + z4*z5, z1*z2*z3 + z2*z3*z4 + z1*z2*z5 + z1*z4*z5 + z3*z4*z5, z1*z2*z3*z4 + z1*z2*z3*z5 + z1*z2*z4*z5 + z1*z3*z4*z5 + z2*z3*z4*z5, z1*z2*z3*z4*z5 - 1] [ Info: Apply (expectedly) failed in 1724 / 1820 cases. 132.692969 seconds (87.15 M allocations: 6.926 GiB, 1.30% gc time, 91.00% compilation time) [ Info: Running isgroebner.jl 5.959350 seconds (1.97 M allocations: 164.951 MiB, 1.23% gc time, 87.94% compilation time) [ Info: Running normalform.jl [ Info: Producing 1728 tests for normal form. This may take a minute 28.135911 seconds (10.60 M allocations: 1016.653 MiB, 5.11% gc time, 32.50% compilation time) [ Info: Running auxiliary.jl 67.360271 seconds (17.37 M allocations: 1.303 GiB, 1.07% gc time, 99.05% compilation time) [ Info: Running output_inferred.jl 0.988672 seconds (552.37 k allocations: 37.442 MiB, 4.85% gc time, 95.06% compilation time) [ Info: Running regressions.jl 20.972147 seconds (1.78 M allocations: 584.044 MiB, 1.42% gc time, 4.87% compilation time) [ Info: Running input_output/GroebnerDynamicPolynomialsExt.jl 43.948654 seconds (19.60 M allocations: 1.307 GiB, 3.20% gc time, 99.57% compilation time: 1% of which was recompilation) [ Info: Running input_output/Nemo.jl 99.126703 seconds (35.94 M allocations: 2.411 GiB, 1.23% gc time, 99.66% compilation time: <1% of which was recompilation) Test Summary: | Pass Total Time All tests | 79118 79118 29m07.9s arithmetic in Zp | 23944 23944 2.7s arithmetic in Zp x 4 | 2000 2000 0.6s crt | 37 37 1.0s crt table | 9 9 2.7s ratrec | 2 2 0.4s ratrec table | 6 6 0.9s exponent vector | 131 131 1.1s packed exponent tuple-1 | 89 89 0.5s packed exponent tuple-2 | 96 96 0.5s packed exponent tuple-3 | 101 101 1.4s packed exponent tuple-4 | 95 95 0.7s monom arithmetic | 171 171 3.1s monom division mask | 96 96 0.9s monom hash linearity | 208 208 0.9s monom orders: Lex, DegLex, DegRevLex | 405 405 3.8s monoms, variable permutation | 72 72 7.4s monom orders: WeightedOrdering | 65 65 3.8s monom orders: ProductOrdering | 36 36 2.6s monom orders: MatrixOrdering | 13 13 1.9s groebner basic | 12 12 25.2s groebner low level | 41 41 2m41.5s groebner generic | 32 32 1m58.6s groebner reduced=false | 6 6 2.4s groebner ground fields | 176 176 1m51.3s groebner modular | 265 265 55.2s groebner output sorted | 15 15 0.1s monomial overflow | 32 32 8.1s groebner reduced=true | 3 3 3.7s groebner certify | 7 7 14.4s groebner orderings | 1850 1850 3m37.4s groebner parent rings | 12 12 16.5s groebner monoms | 24 24 9.1s groebner zeros | 12 12 0.0s isgroebner zeros | 15 15 3.7s normalform zeros | 15 15 1.8s normalform checks | 4 4 0.0s groebner arithmetic | 16 16 26.4s groebner linear algebra | 10 10 0.0s groebner modular-hard problems | 17 17 13.8s groebner strange example | 1 1 37.1s groebner many variables | 52 52 44.3s groebner large exponents | 143 143 3.2s homogenization, basic | 148 148 1m23.8s homogenization, orderings | 352 352 3m10.6s groebner, change matrix | 72 72 9.1s multi-threading, composable | 20 20 17.0s groebner, multi-threading, Zp | 24 24 7.3s groebner, multi-threading, QQ | 24 24 8.0s groebner random stress tests | 41796 41796 1m41.7s learn & apply, same field | 139 139 13.3s learn & apply, different fields | 461 461 36.3s learn & apply, generic | 1 1 0.1s learn & apply, orderings | 88 88 12.3s learn & apply, copy trace | 4 4 0.6s learn & apply, tricky | 31 31 5.1s learn & apply low level | 15 15 11.9s learn & apply, stress | None 12.1s learn & apply, in batches | 17 17 32.1s learn & apply low level, in batches | 7 7 8.6s isgroebner | 22 22 2.2s isgroebner orderings | 5 5 2.3s isgroebner certify | 68 68 0.2s normalform | 19 19 1.1s normalform many variables | 6 6 15.8s normalform orderings | 4 4 2.4s normalform of an array | 24 24 0.5s normalform random stress tests | 4878 4878 7.4s leading term | 8 8 3.0s leading ideal | 8 8 35.2s quotient basis | 17 17 17.9s dimension | 8 8 10.0s output type inferred | 10 10 0.2s regression, SI.jl normalform | 5 5 0.0s regression, ordering of empty | 4 4 0.0s regression, SI.jl cmp | 1 1 0.5s regression, column order in normalform | 1 1 0.1s regression, tracing invariants | 1 1 20.3s regression, basis | 1 1 0.0s DynamicPolynomials.jl input-output | 44 44 26.8s Nemo.jl, univariate | 25 25 9.3s Nemo.jl, generic | 6 6 53.4s Nemo.jl, input-output | 418 418 33.3s 1748.316170 seconds (962.82 M allocations: 92.704 GiB, 2.18% gc time, 85.88% compilation time: <1% of which was recompilation) Testing Groebner tests passed Testing completed after 1766.63s PkgEval succeeded after 1901.09s