Package evaluation to load Matroids on Julia 1.14.0-DEV.2593 (15c2b67521*) started at 2026-07-03T21:11:10.139 ################################################################################ # Set-up # Set-up completed after 0.15s ################################################################################ # Installation # Installing Matroids... Resolving package versions... Installed OrderedCollections ─ v1.8.2 Installed DataStructures ───── v0.19.5 Installed ArnoldiMethod ────── v0.4.0 Installed ConstructionBase ─── v1.6.0 Installed Combinatorics ────── v1.1.0 Installed MacroTools ───────── v0.5.16 Installed Hungarian ────────── v0.7.0 Installed Multisets ────────── v0.4.6 Installed LinearAlgebraX ───── v0.2.11 Installed Matroids ─────────── v0.2.3 Installed SimpleTraits ─────── v0.9.6 Installed Statistics ───────── v1.11.1 Installed IntegerMathUtils ─── v0.1.3 Installed StaticArraysCore ─── v1.4.4 Installed Mods ─────────────── v2.2.6 Installed StaticArrays ─────── v1.9.18 Installed Setfield ─────────── v1.1.2 Installed PrecompileTools ──── v1.3.4 Installed Preferences ──────── v1.5.2 Installed SimplePolynomials ── v0.2.18 Installed Primes ───────────── v0.5.7 Installed Inflate ──────────── v0.1.5 Installed Polynomials ──────── v4.1.1 Installed Graphs ───────────── v1.14.0 Updating `~/.julia/environments/v1.14/Project.toml` [f99c5f09] + Matroids v0.2.3 Updating `~/.julia/environments/v1.14/Manifest.toml` [ec485272] + ArnoldiMethod v0.4.0 [861a8166] + Combinatorics v1.1.0 [187b0558] + ConstructionBase v1.6.0 [864edb3b] + DataStructures v0.19.5 [86223c79] + Graphs v1.14.0 [e91730f6] + Hungarian v0.7.0 [d25df0c9] + Inflate v0.1.5 [18e54dd8] + IntegerMathUtils v0.1.3 [9b3f67b0] + LinearAlgebraX v0.2.11 [1914dd2f] + MacroTools v0.5.16 [f99c5f09] + Matroids v0.2.3 [7475f97c] + Mods v2.2.6 [3b2b4ff1] + Multisets v0.4.6 ⌅ [bac558e1] + OrderedCollections v1.8.2 [f27b6e38] + Polynomials v4.1.1 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [27ebfcd6] + Primes v0.5.7 [efcf1570] + Setfield v1.1.2 [cc47b68c] + SimplePolynomials v0.2.18 [699a6c99] + SimpleTraits v0.9.6 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [9fa8497b] + Future v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.13.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.13.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.5+2 [4536629a] + OpenBLAS_jll v0.3.33+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [8e850b90] + libblastrampoline_jll v5.15.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.65s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Project No packages added to or removed from `~/.julia/environments/pkgeval/Project.toml` Manifest No packages added to or removed from `~/.julia/environments/pkgeval/Manifest.toml` Precompiling package dependencies... Precompiling project... 4.0 s ✓ MacroTools 1.2 s ✓ StaticArraysCore 1.4 s ✓ Inflate 1.1 s ✓ IntegerMathUtils 152.5 s ✓ OrderedCollections 1.3 s ✓ Statistics 1.7 s ✓ ConstructionBase 62.3 s ✓ Mods 145.6 s ✓ Multisets 2.6 s ✓ Combinatorics 42.4 s ✓ Hungarian 31.6 s ✓ Preferences 3.6 s ✓ SimpleTraits 57.6 s ✓ Primes 174.5 s ✓ DataStructures 42.7 s ✓ Statistics → SparseArraysExt 0.6 s ✓ ConstructionBase → ConstructionBaseLinearAlgebraExt 31.3 s ✓ PrecompileTools 3.8 s ✓ Setfield 361.2 s ✓ StaticArrays 222.4 s ✓ Polynomials 36.5 s ✓ StaticArrays → StaticArraysStatisticsExt 39.9 s ✓ ArnoldiMethod 36.8 s ✓ ConstructionBase → ConstructionBaseStaticArraysExt 146.8 s ✓ SimplePolynomials ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =# Core.@doc " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" function karger_cut_cost(g::AbstractGraph{T}, cut::Vector{<:Integer}) where T <: Integer │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:48 =# │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ return count((e::Edge{T}->begin │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ cut[src(e)] != cut[dst(e)] │ end), edges(g)) │ end) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) :: Value | │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value | │ [function] | │ [where] | │ [call] | │ karger_cut_cost :: Identifier | │ [::] | │ g :: Identifier | │ [curly] | │ AbstractGraph :: Identifier | │ T :: Identifier | │ [::] | │ cut :: Identifier | │ [curly] | │ Vector :: Identifier | │ [<:] | │ Integer :: Identifier | │ [<:] | │ T :: Identifier | │ Integer :: Identifier | │ [block] | │ [return] | │ [call] | │ count :: Identifier | │ [->] | │ [::] | │ e :: Identifier | │ [curly] | │ Edge :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ != :: Identifier | │ [ref] | │ cut :: Identifier | │ [call] | │ src :: Identifier | │ e :: Identifier | │ [ref] | │ cut :: Identifier | │ [call] | │ dst :: Identifier | │ e :: Identifier | │ [call] | │ edges :: Identifier | │ g :: Identifier | │ │ st1 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [block] | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ [if] | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ true :: Value | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ [=] | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ val :: Identifier | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ [function] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [where] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ karger_cut_cost :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [::] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ g :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [curly] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ AbstractGraph :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ T :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [::] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ cut :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [curly] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Vector :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [<:] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Integer :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [<:] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ T :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Integer :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [block] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [return] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ count :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [->] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [::] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ e :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [curly] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Edge :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ T :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [block] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ != :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [ref] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ cut :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ src :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ e :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [ref] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ cut :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ dst :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ e :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ edges :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ g :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ Base.Docs.doc! :: Value | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ Graphs :: Value | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Base.Docs.Binding :: Value | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Graphs :: Value | [old,SL(DHxEVExwO,Base,SL(KLOjXWurQEc,Graphs,)),(. Base (inert @__MODULE__))], │ [inert] | [old,SL(KLOjXWurQEc,Graphs,),@doc],jl_source=L47 │ karger_cut_cost :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Base.Docs.docstr :: Value | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Core.svec :: Value | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [call] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Dict{Symbol, Any} :: Value | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ :path => "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" :: Value | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ :linenumber => 42 :: Value | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ :module => Graphs :: Value | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [where] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [curly] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Union :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [curly] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Tuple :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [curly] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ AbstractGraph :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ T :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [curly] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Vector :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [<:] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Integer :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [curly] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Tuple :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ T :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [<:] | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ T :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ Integer :: Identifier | [old,SL(KLOjXWurQEc,Graphs,),@doc], │ [if] | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ true :: Value | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ val :: Identifier | [old,SL(8ADReBBLbTO,Base.Docs,SL(KLOjXWurQEc,Graphs,)),@doc], │ │ file = "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" │ line = 42 └ mod = Graphs ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# - Found unexpected binding of kind static_parameter Expression:  #₁₆/T Containing expressions:  (= #₃₆/T #₁₆/T)  (call core.svec (call core.svec #₂₉/#karger_cut_cost##->###0 (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0)  (call core.svec (call core.svec (function_type #₁₇/#->#) (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0)  Detailed provenance:  #₁₆/T  ├─ T  │ ├─ T  │ │ └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  │ └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42  Stacktrace:  [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097  [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1162  [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1257  [4] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1287  [5] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:33  [6] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [7] top-level scope  @ ~/.julia/packages/Graphs/nH2e0/src/Graphs.jl:570  [8] include(mod::Module, _path::String)  @ Base Base.jl:325  [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:522  [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [13] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [14] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [15] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/Graphs.jl:1 in expression starting at stdin:5 ✗ Graphs 49.4 s ✓ LinearAlgebraX ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("86223c79-3864-5bf0-83f7-82e725a168b6"), "Graphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:130  [12] top-level scope  @ ~/.julia/packages/Matroids/KYnTO/src/Matroids.jl:5  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:522  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [18] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [20] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/Matroids/KYnTO/src/Matroids.jl:1 in expression starting at stdin:5 ✗ Matroids 26 dependencies successfully precompiled in 1879 seconds. 13 already precompiled. Precompilation completed after 1905.97s ################################################################################ # Loading # Loading Matroids... ┌ Info: JuliaLowering threw given input: │ code = │ :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =# Core.@doc " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" function karger_cut_cost(g::AbstractGraph{T}, cut::Vector{<:Integer}) where T <: Integer │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:48 =# │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ return count((e::Edge{T}->begin │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ cut[src(e)] != cut[dst(e)] │ end), edges(g)) │ end) │ st0 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [macrocall] | │ @doc :: Identifier | mod=Core │ :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) :: Value | │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value | │ [function] | │ [where] | │ [call] | │ karger_cut_cost :: Identifier | │ [::] | │ g :: Identifier | │ [curly] | │ AbstractGraph :: Identifier | │ T :: Identifier | │ [::] | │ cut :: Identifier | │ [curly] | │ Vector :: Identifier | │ [<:] | │ Integer :: Identifier | │ [<:] | │ T :: Identifier | │ Integer :: Identifier | │ [block] | │ [return] | │ [call] | │ count :: Identifier | │ [->] | │ [::] | │ e :: Identifier | │ [curly] | │ Edge :: Identifier | │ T :: Identifier | │ [block] | │ [call] | │ != :: Identifier | │ [ref] | │ cut :: Identifier | │ [call] | │ src :: Identifier | │ e :: Identifier | │ [ref] | │ cut :: Identifier | │ [call] | │ dst :: Identifier | │ e :: Identifier | │ [call] | │ edges :: Identifier | │ g :: Identifier | │ │ st1 = │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ [block] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ [if] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ true :: Value | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ [=] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ val :: Identifier | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ [function] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [where] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ karger_cut_cost :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [::] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ g :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ AbstractGraph :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [::] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ cut :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Vector :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [<:] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Integer :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [<:] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Integer :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [block] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [return] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ count :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [->] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [::] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ e :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Edge :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [block] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ != :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [ref] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ cut :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ src :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ e :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [ref] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ cut :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ dst :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ e :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ edges :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ g :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ Base.Docs.doc! :: Value | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ Graphs :: Value | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Base.Docs.Binding :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Graphs :: Value | [old,SL(LJcfu4gowFX,Base,SL(LGIEFxKgjTD,Graphs,)),(. Base (inert @__MODULE__))], │ [inert] | [old,SL(LGIEFxKgjTD,Graphs,),@doc],jl_source=L47 │ karger_cut_cost :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Base.Docs.docstr :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Core.svec :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Dict{Symbol, Any} :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ :path => "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ :linenumber => 42 :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ :module => Graphs :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [where] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Union :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Tuple :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ AbstractGraph :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Vector :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [<:] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Integer :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Tuple :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [<:] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ Integer :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ [if] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ true :: Value | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ val :: Identifier | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ file = "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" │ line = 42 └ mod = Graphs ERROR: LoadError: LoweringError: #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# - Found unexpected binding of kind static_parameter Expression:  #₁₆/T Containing expressions:  (= #₃₆/T #₁₆/T)  (call core.svec (call core.svec #₂₉/#karger_cut_cost##->###0 (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0)  (call core.svec (call core.svec (function_type #₁₇/#->#) (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0)  Detailed provenance:  #₁₆/T  ├─ T  │ ├─ T  │ │ └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  │ └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g))))))  └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42  Stacktrace:  [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097  [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1162  [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1257  [4] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}})  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1287  [5] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:33  [6] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [7] top-level scope  @ ~/.julia/packages/Graphs/nH2e0/src/Graphs.jl:570  [8] include(mod::Module, _path::String)  @ Base Base.jl:325  [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [10] top-level scope  @ stdin:5  [11] eval(m::Module, e::Any)  @ Core boot.jl:522  [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [13] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [14] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [15] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/Graphs.jl:1 in expression starting at stdin:5 ERROR: LoadError: Precompiled image Base.PkgId(Base.UUID("86223c79-3864-5bf0-83f7-82e725a168b6"), "Graphs") not available with flags CacheFlags(; use_pkgimages=false, debug_level=1, check_bounds=1, inline=true, opt_level=0) Stacktrace:  [1] error(s::String)  @ Base error.jl:56  [2] __require_prelocked(pkg::Base.PkgId, env::String)  @ Base loading.jl:2837  [3] _require_prelocked(uuidkey::Base.PkgId, env::String)  @ Base loading.jl:2685  [4] macro expansion  @ loading.jl:2599 [inlined]  [5] macro expansion  @ lock.jl:376 [inlined]  [6] __require(into::Module, mod::Symbol)  @ Base loading.jl:2563  [7] require(into::Module, mod::Symbol)  @ Base loading.jl:2539 [inlined]  [8] eval_import_path(at::Module, from::Nothing, path::Expr, keyword::String)  @ Base module.jl:36 [inlined]  [9] eval_import_path_all(at::Module, path::Expr, keyword::String)  @ Base module.jl:60  [10] _eval_using(to::Module, path::Expr, flags::UInt8)  @ Base module.jl:137 [inlined]  [11] eval_using(to::Module, path::Expr)  @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/runtime.jl:130  [12] top-level scope  @ ~/.julia/packages/Matroids/KYnTO/src/Matroids.jl:5  [13] include(mod::Module, _path::String)  @ Base Base.jl:325  [14] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing)  @ Base loading.jl:3303  [15] top-level scope  @ stdin:5  [16] eval(m::Module, e::Any)  @ Core boot.jl:522  [17] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [18] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [19] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [20] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/Matroids/KYnTO/src/Matroids.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ Matroids │ [Output was shown above] └ ┌ Graphs │ ┌ Info: JuliaLowering threw given input: │ │ code = │ │ :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =# Core.@doc " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" function karger_cut_cost(g::AbstractGraph{T}, cut::Vector{<:Integer}) where T <: Integer │ │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:48 =# │ │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ │ return count((e::Edge{T}->begin │ │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# │ │ cut[src(e)] != cut[dst(e)] │ │ end), edges(g)) │ │ end) │ │ st0 = │ │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ │ [macrocall] | │ │ @doc :: Identifier | mod=Core │ │ :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) :: Value | │ │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value | │ │ [function] | │ │ [where] | │ │ [call] | │ │ karger_cut_cost :: Identifier | │ │ [::] | │ │ g :: Identifier | │ │ [curly] | │ │ AbstractGraph :: Identifier | │ │ T :: Identifier | │ │ [::] | │ │ cut :: Identifier | │ │ [curly] | │ │ Vector :: Identifier | │ │ [<:] | │ │ Integer :: Identifier | │ │ [<:] | │ │ T :: Identifier | │ │ Integer :: Identifier | │ │ [block] | │ │ [return] | │ │ [call] | │ │ count :: Identifier | │ │ [->] | │ │ [::] | │ │ e :: Identifier | │ │ [curly] | │ │ Edge :: Identifier | │ │ T :: Identifier | │ │ [block] | │ │ [call] | │ │ != :: Identifier | │ │ [ref] | │ │ cut :: Identifier | │ │ [call] | │ │ src :: Identifier | │ │ e :: Identifier | │ │ [ref] | │ │ cut :: Identifier | │ │ [call] | │ │ dst :: Identifier | │ │ e :: Identifier | │ │ [call] | │ │ edges :: Identifier | │ │ g :: Identifier | │ │ │ │ st1 = │ │ SyntaxTree with attributes mod,kind,var_id,toplevel_pure,scope_type,context,syntax_flags,name_val,meta,value,jl_source,is_toplevel_thunk,source │ │ [block] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ [if] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ true :: Value | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ [=] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ val :: Identifier | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ [function] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [where] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ karger_cut_cost :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [::] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ g :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ AbstractGraph :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [::] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ cut :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Vector :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [<:] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Integer :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [<:] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Integer :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [block] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [return] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ count :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [->] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [::] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ e :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Edge :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [block] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ != :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [ref] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ cut :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ src :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ e :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [ref] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ cut :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ dst :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ e :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ edges :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ g :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ Base.Docs.doc! :: Value | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ Graphs :: Value | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Base.Docs.Binding :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Graphs :: Value | [old,SL(LJcfu4gowFX,Base,SL(LGIEFxKgjTD,Graphs,)),(. Base (inert @__MODULE__))], │ │ [inert] | [old,SL(LGIEFxKgjTD,Graphs,),@doc],jl_source=L47 │ │ karger_cut_cost :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Base.Docs.docstr :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Core.svec :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [call] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Dict{Symbol, Any} :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ :path => "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ :linenumber => 42 :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ :module => Graphs :: Value | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [where] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Union :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Tuple :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ AbstractGraph :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Vector :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [<:] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Integer :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [curly] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Tuple :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [<:] | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ T :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ Integer :: Identifier | [old,SL(LGIEFxKgjTD,Graphs,),@doc], │ │ [if] | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ true :: Value | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ val :: Identifier | [old,SL(FyCY81B0Tsu,Base.Docs,SL(LGIEFxKgjTD,Graphs,)),@doc], │ │ │ │ file = "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" │ │ line = 42 │ └ mod = Graphs │ ERROR: LoadError: LoweringError: │ #= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 =# - Found unexpected binding of kind static_parameter │ Expression: │ #₁₆/T │ Containing expressions: │ (= #₃₆/T #₁₆/T) │ (call core.svec (call core.svec #₂₉/#karger_cut_cost##->###0 (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0) │ (call core.svec (call core.svec (function_type #₁₇/#->#) (call core.apply_type #₁₉/Edge #₁₆/T)) (call core.svec) SourceLocation:/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49:0) │ │ Detailed provenance: │ #₁₆/T │ ├─ T │ │ ├─ T │ │ │ └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:49 │ │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g)))))) │ │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g)))))) │ │ └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g)))))) │ └─ (macrocall @doc :(#= /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 =#) " karger_cut_cost(g, cut)\n\nFind the number of crossing edges in a cut of graph `g` where the cut is represented\nby the integer array, `cut`.\n" (function (where (call karger_cut_cost (:: g (curly AbstractGraph T)) (:: cut (curly Vector (<: Integer)))) (<: T Integer)) (block (return (call count (-> (:: e (curly Edge T)) (block (call != (ref cut (call src e)) (ref cut (call dst e))))) (call edges g)))))) │ └─ @ /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 │ │ Stacktrace: │ [1] _renumber(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ssa_rewrites::Dict{Int64, Int64}, slot_rewrites::Dict{Int64, Int64}, label_table::Dict{Int64, Int64}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1097 │ [2] renumber_body(ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, input_code::Base.JuliaSyntax.SyntaxList{Dict{Symbol, Dict{Int64, Any}}, Vector{Int64}}, slot_rewrites::Dict{Int64, Int64}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1162 │ [3] compile_lambda(outer_ctx::Base.JuliaLowering.LinearIRContext{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1257 │ [4] linearize_ir(ctx::Base.JuliaLowering.ClosureConversionCtx{Dict{Symbol, Dict{Int64, Any}}}, ex::Base.JuliaSyntax.SyntaxTree{Dict{Symbol, Dict{Int64, Any}}}) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/linear_ir.jl:1287 │ [5] core_lowering_hook(code::Any, mod::Module, file::String, line::UInt64, world::UInt64, _warn::Bool) │ @ Base.JuliaLowering /source/usr/share/julia/JuliaLowering/src/hooks.jl:33 │ [6] include(mapexpr::Function, mod::Module, _path::String) │ @ Base Base.jl:326 │ [7] top-level scope │ @ ~/.julia/packages/Graphs/nH2e0/src/Graphs.jl:570 │ [8] include(mod::Module, _path::String) │ @ Base Base.jl:325 │ [9] include_package_for_output(pkg::Base.PkgId, input::String, syntax_version::VersionNumber, depot_path::Vector{String}, dl_load_path::Vector{String}, load_path::Vector{String}, concrete_deps::Vector{Pair{Base.PkgId, UInt128}}, source::Nothing) │ @ Base loading.jl:3303 │ [10] top-level scope │ @ stdin:5 │ [11] eval(m::Module, e::Any) │ @ Core boot.jl:522 │ [12] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String) │ @ Base loading.jl:3132 │ [13] include_string(m::Module, txt::String, fname::String) │ @ Base loading.jl:3142 [inlined] │ [14] exec_options(opts::Base.JLOptions) │ @ Base client.jl:353 │ [15] _start() │ @ Base client.jl:596 │ in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl:42 │ in expression starting at /home/pkgeval/.julia/packages/Graphs/nH2e0/src/Graphs.jl:1 │ in expression starting at stdin:5 └ ERROR: The following 2 packages failed to precompile: Matroids Failed to precompile Matroids [f99c5f09-8689-4482-a891-4b988ec2fc3d] to "/home/pkgeval/.julia/compiled/v1.14/Matroids/jl_vOoo6U" (ProcessExited(1)). Graphs Failed to precompile Graphs [86223c79-3864-5bf0-83f7-82e725a168b6] to "/home/pkgeval/.julia/compiled/v1.14/Graphs/jl_ypgDQG" (ProcessExited(1)). Loading failed after 230.18s ERROR: LoadError: failed process: Process(`/opt/julia/bin/julia -C native -J/opt/julia/lib/julia/sys.so -g1 --check-bounds=yes --inline=yes --check-bounds=yes --pkgimages=existing -e 'using Matroids'`, ProcessExited(1)) [1] Stacktrace: [1] pipeline_error(proc::Base.Process) @ Base process.jl:612 [inlined] [2] run(::Cmd; wait::Bool) @ Base process.jl:525 [3] run(::Cmd) @ Base process.jl:522 [4] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:197 [5] include(mod::Module, _path::String) @ Base Base.jl:325 [6] exec_options(opts::Base.JLOptions) @ Base client.jl:355 [7] _start() @ Base client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:188 PkgEval failed after 2176.05s: package fails to precompile