Package evaluation to test LongestPaths on Julia 1.14.0-DEV.2373 (cf67ecc88f*) started at 2026-06-13T17:07:53.407 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 16.01s ################################################################################ # Installation # Installing LongestPaths... Resolving package versions... Installed ForwardDiff ────────── v1.4.1 Installed DiffResults ────────── v1.1.0 Installed ArnoldiMethod ──────── v0.4.0 Installed DataStructures ─────── v0.19.5 Installed MacroTools ─────────── v0.5.16 Installed Clp ────────────────── v1.2.2 Installed Bzip2_jll ──────────── v1.0.9+0 Installed CodecZlib ──────────── v0.7.8 Installed LongestPaths ───────── v0.2.4 Installed TranscodingStreams ─── v0.11.3 Installed OrderedCollections ─── v1.8.2 Installed Statistics ─────────── v1.11.1 Installed ASL_jll ────────────── v0.1.3+0 Installed CommonSubexpressions ─ v0.3.1 Installed Cbc_jll ────────────── v200.1000.800+0 Installed Cgl_jll ────────────── v0.6000.600+0 Installed Clp_jll ────────────── v100.1700.700+1 Installed CoinUtils_jll ──────── v200.1100.600+0 Installed StructUtils ────────── v2.8.2 Installed MUMPS_seq_jll ──────── v500.900.0+0 Installed PrecompileTools ────── v1.3.4 Installed CodecBzip2 ─────────── v0.8.5 Installed NaNMath ────────────── v1.1.4 Installed OpenSpecFun_jll ────── v0.5.6+0 Installed SimpleTraits ───────── v0.9.6 Installed StaticArraysCore ───── v1.4.4 Installed StaticArrays ───────── v1.9.18 Installed LogExpFunctions ────── v1.0.1 Installed IrrationalConstants ── v0.2.6 Installed DiffRules ──────────── v1.16.0 Installed OpenBLAS32_jll ─────── v0.3.33+1 Installed Parsers ────────────── v2.8.5 Installed Cbc ────────────────── v1.2.0 Installed SpecialFunctions ───── v2.8.0 Installed MutableArithmetics ─── v1.8.0 Installed JSON ───────────────── v1.6.1 Installed Preferences ────────── v1.5.2 Installed JLLWrappers ────────── v1.8.0 Installed METIS_jll ──────────── v5.1.3+0 Installed Inflate ────────────── v0.1.5 Installed DocStringExtensions ── v0.9.5 Installed Osi_jll ────────────── v0.10800.700+0 Installed Graphs ─────────────── v1.14.0 Installed MathOptInterface ───── v1.51.1 Installing 11 artifacts Installed artifact OpenSpecFun 194.9 KiB Installed artifact ASL 276.3 KiB Installed artifact CoinUtils 762.1 KiB Installed artifact METIS 1.1 MiB Installed artifact Cgl 609.9 KiB Installed artifact Bzip2 503.5 KiB Installed artifact Cbc 1.1 MiB Installed artifact Clp 1.4 MiB Installed artifact Osi 430.1 KiB Installed artifact MUMPS_seq 9.1 MiB Installed artifact OpenBLAS32 10.2 MiB Updating `~/.julia/environments/v1.14/Project.toml` [3a25c17e] + LongestPaths v0.2.4 Updating `~/.julia/environments/v1.14/Manifest.toml` [ec485272] + ArnoldiMethod v0.4.0 ⌃ [9961bab8] + Cbc v1.2.0 ⌃ [e2554f3b] + Clp v1.2.2 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [bbf7d656] + CommonSubexpressions v0.3.1 [864edb3b] + DataStructures v0.19.5 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.16.0 [ffbed154] + DocStringExtensions v0.9.5 [f6369f11] + ForwardDiff v1.4.1 [86223c79] + Graphs v1.14.0 [d25df0c9] + Inflate v0.1.5 [92d709cd] + IrrationalConstants v0.2.6 [692b3bcd] + JLLWrappers v1.8.0 [682c06a0] + JSON v1.6.1 [2ab3a3ac] + LogExpFunctions v1.0.1 [3a25c17e] + LongestPaths v0.2.4 [1914dd2f] + MacroTools v0.5.16 [b8f27783] + MathOptInterface v1.51.1 [d8a4904e] + MutableArithmetics v1.8.0 [77ba4419] + NaNMath v1.1.4 ⌅ [bac558e1] + OrderedCollections v1.8.2 [69de0a69] + Parsers v2.8.5 [aea7be01] + PrecompileTools v1.3.4 [21216c6a] + Preferences v1.5.2 [699a6c99] + SimpleTraits v0.9.6 [276daf66] + SpecialFunctions v2.8.0 [90137ffa] + StaticArrays v1.9.18 [1e83bf80] + StaticArraysCore v1.4.4 [10745b16] + Statistics v1.11.1 [ec057cc2] + StructUtils v2.8.2 [3bb67fe8] + TranscodingStreams v0.11.3 [ae81ac8f] + ASL_jll v0.1.3+0 [6e34b625] + Bzip2_jll v1.0.9+0 ⌅ [38041ee0] + Cbc_jll v200.1000.800+0 ⌅ [3830e938] + Cgl_jll v0.6000.600+0 ⌅ [06985876] + Clp_jll v100.1700.700+1 ⌅ [be027038] + CoinUtils_jll v200.1100.600+0 [d00139f3] + METIS_jll v5.1.3+0 [d7ed1dd3] + MUMPS_seq_jll v500.900.0+0 [656ef2d0] + OpenBLAS32_jll v0.3.33+1 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 ⌅ [7da25872] + Osi_jll v0.10800.700+0 [0dad84c5] + ArgTools v1.2.0 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.13.0 [b27032c2] + LibCURL v1.0.0 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.14.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.14.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 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.5.2+0 [deac9b47] + LibCURL_jll v8.20.0+1 [e37daf67] + LibGit2_jll v1.9.4+0 [29816b5a] + LibSSH2_jll v1.11.101+0 [14a3606d] + MozillaCACerts_jll v2026.5.14 [4536629a] + OpenBLAS_jll v0.3.33+0 [05823500] + OpenLibm_jll v0.8.7+0 [458c3c95] + OpenSSL_jll v3.5.7+0 [efcefdf7] + PCRE2_jll v10.47.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.2+0 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.15.0+0 [8e850ede] + nghttp2_jll v1.69.0+0 [3f19e933] + p7zip_jll v17.8.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 11.72s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling project... 6.2 s ✓ TestEnv 1 dependency successfully precompiled in 6 seconds. 27 already precompiled. Precompiling package dependencies... Precompiling project... 3.7 s ✓ MacroTools 1.0 s ✓ Statistics 2.2 s ✓ IrrationalConstants 0.9 s ✓ StaticArraysCore 133.1 s ✓ OrderedCollections 1.1 s ✓ DocStringExtensions 0.8 s ✓ Inflate 47.8 s ✓ TranscodingStreams 1.2 s ✓ NaNMath 2.8 s ✓ StructUtils 2.6 s ✓ Preferences 115.9 s ✓ MutableArithmetics 1.6 s ✓ CommonSubexpressions 3.0 s ✓ SimpleTraits 36.8 s ✓ Statistics → SparseArraysExt 0.9 s ✓ DiffResults 149.0 s ✓ DataStructures 1.6 s ✓ LogExpFunctions 17.5 s ✓ CodecZlib 1.6 s ✓ StructUtils → StructUtilsStaticArraysCoreExt 2.9 s ✓ JLLWrappers 2.6 s ✓ PrecompileTools 3.0 s ✓ METIS_jll 3.1 s ✓ OpenBLAS32_jll 3.0 s ✓ Bzip2_jll 3.1 s ✓ ASL_jll 3.1 s ✓ OpenSpecFun_jll 299.4 s ✓ StaticArrays 33.1 s ✓ Parsers 3.0 s ✓ MUMPS_seq_jll 3.1 s ✓ CoinUtils_jll 32.4 s ✓ CodecBzip2 71.0 s ✓ SpecialFunctions 35.7 s ✓ StaticArrays → StaticArraysStatisticsExt 37.7 s ✓ ArnoldiMethod 93.9 s ✓ JSON 3.2 s ✓ Osi_jll 1.4 s ✓ DiffRules ┌ 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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ [macrocall] │ │ @doc :: Identifier │ mod │ :(#= /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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [call] │ │ karger_cut_cost :: Identifier │ scope_layer=1 │ [::] │ │ g :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractGraph :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ cut :: Identifier │ scope_layer=1 │ [curly] │ │ Vector :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [block] │ │ [return] │ │ [call] │ │ count :: Identifier │ scope_layer=1 │ [->] │ │ [::] │ │ e :: Identifier │ scope_layer=1 │ [curly] │ │ Edge :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ != :: Identifier │ scope_layer=1 │ [ref] │ │ cut :: Identifier │ scope_layer=1 │ [call] │ │ src :: Identifier │ scope_layer=1 │ e :: Identifier │ scope_layer=1 │ [ref] │ │ cut :: Identifier │ scope_layer=1 │ [call] │ │ dst :: Identifier │ scope_layer=1 │ e :: Identifier │ scope_layer=1 │ [call] │ │ edges :: Identifier │ scope_layer=1 │ g :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=48 │ Graphs :: Value │ macro_source=48 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=48 │ Graphs :: Value │ │ [inert] │ jl_source=L65 │ karger_cut_cost :: Identifier │ │ [call] │ macro_source=48 │ Base.Docs.docstr :: Value │ macro_source=48 │ [call] │ macro_source=48 │ Core.svec :: Value │ macro_source=48 │ " 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 │ macro_source=48 │ [call] │ macro_source=48 │ Dict{Symbol, Any} :: Value │ macro_source=48 │ :path => "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" :: Value │ macro_source=48 │ :linenumber => 42 :: Value │ macro_source=48 │ :module => Graphs :: Value │ macro_source=48 │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractGraph :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [curly] │ │ Vector :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ 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))))))  └─ @ /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:3296  [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 3.4 s ✓ Clp_jll 91.3 s ✓ ForwardDiff 3.2 s ✓ Cgl_jll 35.6 s ✓ ForwardDiff → ForwardDiffStaticArraysExt 320.6 s ✓ MathOptInterface 3.4 s ✓ Cbc_jll 126.4 s ✓ Clp 63.6 s ✓ Cbc 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:207  [12] top-level scope  @ ~/.julia/packages/LongestPaths/L1FxI/src/longest_path.jl:6  [13] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [14] top-level scope  @ ~/.julia/packages/LongestPaths/L1FxI/src/LongestPaths.jl:16  [15] include(mod::Module, _path::String)  @ Base Base.jl:325  [16] 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:3296  [17] top-level scope  @ stdin:5  [18] eval(m::Module, e::Any)  @ Core boot.jl:522  [19] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [20] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [21] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [22] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/LongestPaths/L1FxI/src/longest_path.jl:6 in expression starting at /home/pkgeval/.julia/packages/LongestPaths/L1FxI/src/LongestPaths.jl:1 in expression starting at stdin:5 ✗ LongestPaths 46 dependencies successfully precompiled in 2031 seconds. 33 already precompiled. Precompilation completed after 2066.39s ################################################################################ # Testing # Testing LongestPaths Status `/tmp/jl_PIqZwy/Project.toml` ⌃ [9961bab8] Cbc v1.2.0 ⌃ [e2554f3b] Clp v1.2.2 [86223c79] Graphs v1.14.0 [3a25c17e] LongestPaths v0.2.4 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [2f01184e] SparseArrays v1.13.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_PIqZwy/Manifest.toml` [ec485272] ArnoldiMethod v0.4.0 ⌃ [9961bab8] Cbc v1.2.0 ⌃ [e2554f3b] Clp v1.2.2 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [bbf7d656] CommonSubexpressions v0.3.1 [864edb3b] DataStructures v0.19.5 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.16.0 [ffbed154] DocStringExtensions v0.9.5 [f6369f11] ForwardDiff v1.4.1 [86223c79] Graphs v1.14.0 [d25df0c9] Inflate v0.1.5 [92d709cd] IrrationalConstants v0.2.6 [692b3bcd] JLLWrappers v1.8.0 [682c06a0] JSON v1.6.1 [2ab3a3ac] LogExpFunctions v1.0.1 [3a25c17e] LongestPaths v0.2.4 [1914dd2f] MacroTools v0.5.16 [b8f27783] MathOptInterface v1.51.1 [d8a4904e] MutableArithmetics v1.8.0 [77ba4419] NaNMath v1.1.4 ⌅ [bac558e1] OrderedCollections v1.8.2 [69de0a69] Parsers v2.8.5 [aea7be01] PrecompileTools v1.3.4 [21216c6a] Preferences v1.5.2 [699a6c99] SimpleTraits v0.9.6 [276daf66] SpecialFunctions v2.8.0 [90137ffa] StaticArrays v1.9.18 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [ec057cc2] StructUtils v2.8.2 [3bb67fe8] TranscodingStreams v0.11.3 [ae81ac8f] ASL_jll v0.1.3+0 [6e34b625] Bzip2_jll v1.0.9+0 ⌅ [38041ee0] Cbc_jll v200.1000.800+0 ⌅ [3830e938] Cgl_jll v0.6000.600+0 ⌅ [06985876] Clp_jll v100.1700.700+1 ⌅ [be027038] CoinUtils_jll v200.1100.600+0 [d00139f3] METIS_jll v5.1.3+0 [d7ed1dd3] MUMPS_seq_jll v500.900.0+0 [656ef2d0] OpenBLAS32_jll v0.3.33+1 [efe28fd5] OpenSpecFun_jll v0.5.6+0 ⌅ [7da25872] Osi_jll v0.10800.700+0 [0dad84c5] ArgTools v1.2.0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [b27032c2] LibCURL v1.0.0 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.14.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.14.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 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.5.2+0 [deac9b47] LibCURL_jll v8.20.0+1 [e37daf67] LibGit2_jll v1.9.4+0 [29816b5a] LibSSH2_jll v1.11.101+0 [14a3606d] MozillaCACerts_jll v2026.5.14 [4536629a] OpenBLAS_jll v0.3.33+0 [05823500] OpenLibm_jll v0.8.7+0 [458c3c95] OpenSSL_jll v3.5.7+0 [efcefdf7] PCRE2_jll v10.47.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.2+0 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.69.0+0 [3f19e933] p7zip_jll v17.8.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. Testing Running tests... ┌ 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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ [macrocall] │ │ @doc :: Identifier │ mod │ :(#= /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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ [block] │ │ [=] │ │ val :: Identifier │ scope_layer=3 │ [function] │ │ [where] │ │ [call] │ │ karger_cut_cost :: Identifier │ scope_layer=1 │ [::] │ │ g :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractGraph :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [::] │ │ cut :: Identifier │ scope_layer=1 │ [curly] │ │ Vector :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [block] │ │ [return] │ │ [call] │ │ count :: Identifier │ scope_layer=1 │ [->] │ │ [::] │ │ e :: Identifier │ scope_layer=1 │ [curly] │ │ Edge :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [block] │ │ [call] │ │ != :: Identifier │ scope_layer=1 │ [ref] │ │ cut :: Identifier │ scope_layer=1 │ [call] │ │ src :: Identifier │ scope_layer=1 │ e :: Identifier │ scope_layer=1 │ [ref] │ │ cut :: Identifier │ scope_layer=1 │ [call] │ │ dst :: Identifier │ scope_layer=1 │ e :: Identifier │ scope_layer=1 │ [call] │ │ edges :: Identifier │ scope_layer=1 │ g :: Identifier │ scope_layer=1 │ [call] │ │ Base.Docs.doc! :: Value │ macro_source=48 │ Graphs :: Value │ macro_source=48 │ [call] │ │ Base.Docs.Binding :: Value │ macro_source=48 │ Graphs :: Value │ │ [inert] │ jl_source=L65 │ karger_cut_cost :: Identifier │ │ [call] │ macro_source=48 │ Base.Docs.docstr :: Value │ macro_source=48 │ [call] │ macro_source=48 │ Core.svec :: Value │ macro_source=48 │ " 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 │ macro_source=48 │ [call] │ macro_source=48 │ Dict{Symbol, Any} :: Value │ macro_source=48 │ :path => "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" :: Value │ macro_source=48 │ :linenumber => 42 :: Value │ macro_source=48 │ :module => Graphs :: Value │ macro_source=48 │ [where] │ │ [curly] │ │ Union :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ [curly] │ │ AbstractGraph :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [curly] │ │ Vector :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ [curly] │ │ Tuple :: Identifier │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ [<:] │ scope_layer=1 │ T :: Identifier │ scope_layer=1 │ Integer :: Identifier │ scope_layer=1 │ val :: Identifier │ scope_layer=3 │ │ 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))))))  └─ @ /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:3296  [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:207  [12] top-level scope  @ ~/.julia/packages/LongestPaths/L1FxI/src/longest_path.jl:6  [13] include(mapexpr::Function, mod::Module, _path::String)  @ Base Base.jl:326  [14] top-level scope  @ ~/.julia/packages/LongestPaths/L1FxI/src/LongestPaths.jl:16  [15] include(mod::Module, _path::String)  @ Base Base.jl:325  [16] 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:3296  [17] top-level scope  @ stdin:5  [18] eval(m::Module, e::Any)  @ Core boot.jl:522  [19] include_string(mapexpr::typeof(identity), mod::Module, code::String, filename::String)  @ Base loading.jl:3132  [20] include_string(m::Module, txt::String, fname::String)  @ Base loading.jl:3142 [inlined]  [21] exec_options(opts::Base.JLOptions)  @ Base client.jl:353  [22] _start()  @ Base client.jl:596 in expression starting at /home/pkgeval/.julia/packages/LongestPaths/L1FxI/src/longest_path.jl:6 in expression starting at /home/pkgeval/.julia/packages/LongestPaths/L1FxI/src/LongestPaths.jl:1 in expression starting at stdin:5 2 dependencies had output during precompilation: ┌ LongestPaths │ [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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source,__macro_ctx__ │ │ [macrocall] │ │ │ @doc :: Identifier │ mod │ │ :(#= /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,macro_source,name_val,syntax_flags,meta,scope_layer,value,jl_source,is_toplevel_thunk,source │ │ [block] │ │ │ [=] │ │ │ val :: Identifier │ scope_layer=3 │ │ [function] │ │ │ [where] │ │ │ [call] │ │ │ karger_cut_cost :: Identifier │ scope_layer=1 │ │ [::] │ │ │ g :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ AbstractGraph :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [::] │ │ │ cut :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Vector :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Integer :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ Integer :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [return] │ │ │ [call] │ │ │ count :: Identifier │ scope_layer=1 │ │ [->] │ │ │ [::] │ │ │ e :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Edge :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [block] │ │ │ [call] │ │ │ != :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ cut :: Identifier │ scope_layer=1 │ │ [call] │ │ │ src :: Identifier │ scope_layer=1 │ │ e :: Identifier │ scope_layer=1 │ │ [ref] │ │ │ cut :: Identifier │ scope_layer=1 │ │ [call] │ │ │ dst :: Identifier │ scope_layer=1 │ │ e :: Identifier │ scope_layer=1 │ │ [call] │ │ │ edges :: Identifier │ scope_layer=1 │ │ g :: Identifier │ scope_layer=1 │ │ [call] │ │ │ Base.Docs.doc! :: Value │ macro_source=48 │ │ Graphs :: Value │ macro_source=48 │ │ [call] │ │ │ Base.Docs.Binding :: Value │ macro_source=48 │ │ Graphs :: Value │ │ │ [inert] │ jl_source=L65 │ │ karger_cut_cost :: Identifier │ │ │ [call] │ macro_source=48 │ │ Base.Docs.docstr :: Value │ macro_source=48 │ │ [call] │ macro_source=48 │ │ Core.svec :: Value │ macro_source=48 │ │ " 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 │ macro_source=48 │ │ [call] │ macro_source=48 │ │ Dict{Symbol, Any} :: Value │ macro_source=48 │ │ :path => "/home/pkgeval/.julia/packages/Graphs/nH2e0/src/graphcut/karger_min_cut.jl" :: Value │ macro_source=48 │ │ :linenumber => 42 :: Value │ macro_source=48 │ │ :module => Graphs :: Value │ macro_source=48 │ │ [where] │ │ │ [curly] │ │ │ Union :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ AbstractGraph :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Vector :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ Integer :: Identifier │ scope_layer=1 │ │ [curly] │ │ │ Tuple :: Identifier │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ [<:] │ scope_layer=1 │ │ T :: Identifier │ scope_layer=1 │ │ Integer :: Identifier │ scope_layer=1 │ │ val :: Identifier │ scope_layer=3 │ │ │ │ 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)))))) │ └─ @ /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:3296 │ [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: The following 2 packages failed to precompile: LongestPaths Failed to precompile LongestPaths [3a25c17e-307c-411a-a047-890a9a5fbb4d] to "/home/pkgeval/.julia/compiled/v1.14/LongestPaths/jl_mwFZiJ" (ProcessExited(1)). Graphs Failed to precompile Graphs [86223c79-3864-5bf0-83f7-82e725a168b6] to "/home/pkgeval/.julia/compiled/v1.14/Graphs/jl_aWrjLi" (ProcessExited(1)). in expression starting at /home/pkgeval/.julia/packages/LongestPaths/L1FxI/test/runtests.jl:2 Testing failed after 349.64s ERROR: LoadError: Package LongestPaths errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.14/Pkg/src/Operations.jl:3247 [3] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:587 [4] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:172 [5] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:160 [6] test(pkg::String; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.14/Pkg/src/API.jl:159 [inlined] [7] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:223 [8] include(mod::Module, _path::String) @ Base Base.jl:325 [9] exec_options(opts::Base.JLOptions) @ Base client.jl:355 [10] _start() @ Base client.jl:596 in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 PkgEval failed after 2465.39s: package fails to precompile