Package evaluation to test GraphsInterfaceChecker on Julia 1.12.4 (0f21d93eaa*) started at 2026-01-26T18:38:35.108 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.12` Set-up completed after 8.36s ################################################################################ # Installation # Installing GraphsInterfaceChecker... Resolving package versions... Updating `~/.julia/environments/v1.12/Project.toml` [3bef136c] + GraphsInterfaceChecker v0.1.0 Updating `~/.julia/environments/v1.12/Manifest.toml` [ec485272] + ArnoldiMethod v0.4.0 [864edb3b] + DataStructures v0.19.3 [86223c79] + Graphs v1.13.4 [3bef136c] + GraphsInterfaceChecker v0.1.0 [d25df0c9] + Inflate v0.1.5 [85a1e053] + Interfaces v0.3.2 [1914dd2f] + MacroTools v0.5.16 [bac558e1] + OrderedCollections v1.8.1 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [699a6c99] + SimpleTraits v0.9.5 [90137ffa] + StaticArrays v1.9.16 [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 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.12.0 [d6f4376e] + Markdown v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [4536629a] + OpenBLAS_jll v0.3.29+0 [bea87d4a] + SuiteSparse_jll v7.8.3+2 [8e850b90] + libblastrampoline_jll v5.15.0+0 Installation completed after 1.32s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 10071.9 ms ✓ MetaGraphsNext 4021.3 ms ✓ GraphsInterfaceChecker 2 dependencies successfully precompiled in 15 seconds. 67 already precompiled. Precompilation completed after 32.85s ################################################################################ # Testing # Testing GraphsInterfaceChecker Status `/tmp/jl_CPQr83/Project.toml` [4c88cf16] Aqua v0.8.14 [86223c79] Graphs v1.13.4 [3bef136c] GraphsInterfaceChecker v0.1.0 [85a1e053] Interfaces v0.3.2 [98e50ef6] JuliaFormatter v2.2.0 [626554b9] MetaGraphs v0.8.1 [fa8bd995] MetaGraphsNext v0.7.5 [7ebac608] Multigraphs v0.3.0 [47aef6b3] SimpleWeightedGraphs v1.5.1 [8dfed614] Test v1.11.0 Status `/tmp/jl_CPQr83/Manifest.toml` [4c88cf16] Aqua v0.8.14 [ec485272] ArnoldiMethod v0.4.0 [0b6fb165] ChunkCodecCore v1.0.1 [4c0bbee4] ChunkCodecLibZlib v1.0.0 [55437552] ChunkCodecLibZstd v1.0.0 ⌅ [a80b9123] CommonMark v0.9.1 [34da2185] Compat v4.18.1 [864edb3b] DataStructures v0.19.3 [5789e2e9] FileIO v1.17.1 [c27321d9] Glob v1.4.0 [86223c79] Graphs v1.13.4 [3bef136c] GraphsInterfaceChecker v0.1.0 [076d061b] HashArrayMappedTries v0.2.0 [d25df0c9] Inflate v0.1.5 [85a1e053] Interfaces v0.3.2 [033835bb] JLD2 v0.6.3 [692b3bcd] JLLWrappers v1.7.1 [98e50ef6] JuliaFormatter v2.2.0 ⌅ [70703baa] JuliaSyntax v0.4.10 [1914dd2f] MacroTools v0.5.16 [626554b9] MetaGraphs v0.8.1 [fa8bd995] MetaGraphsNext v0.7.5 [7ebac608] Multigraphs v0.3.0 [bac558e1] OrderedCollections v1.8.1 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [ae029012] Requires v1.3.1 [7e506255] ScopedValues v1.5.0 [699a6c99] SimpleTraits v0.9.5 [47aef6b3] SimpleWeightedGraphs v1.5.1 [90137ffa] StaticArrays v1.9.16 [1e83bf80] StaticArraysCore v1.4.4 [10745b16] Statistics v1.11.1 [3161d3a3] Zstd_jll v1.5.7+1 [0dad84c5] ArgTools v1.1.2 [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.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.12.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.12.1 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.12.0 [f489334b] StyledStrings v1.11.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.3.0+1 [deac9b47] LibCURL_jll v8.15.0+0 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.11.4 [4536629a] OpenBLAS_jll v0.3.29+0 [458c3c95] OpenSSL_jll v3.5.4+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.15.0+0 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.7.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... Precompiling packages... 13327.8 ms ✓ Graphs 3957.8 ms ✓ GraphsInterfaceChecker 2 dependencies successfully precompiled in 18 seconds. 26 already precompiled. Precompiling packages... 18342.1 ms ✓ CommonMark 74760.2 ms ✓ JuliaFormatter 2 dependencies successfully precompiled in 93 seconds. 8 already precompiled. JuliaFormatter: Test Failed at /home/pkgeval/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:11 Expression: JuliaFormatter.format(GraphsInterfaceChecker; overwrite = false) Stacktrace: [1] top-level scope @ ~/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:7 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [3] macro expansion @ ~/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:11 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:1776 [inlined] [5] macro expansion @ ~/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:11 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.12/Test/src/Test.jl:680 [inlined] Testing AbstractGraphInterface is implemented for SimpleGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Optional components mutation: (`add_vertex!` increases `nv` by one [true, true, true], `rem_vertex!` decreases `nv` by one [true, true, true]) Testing AbstractGraphInterface is implemented for SimpleDiGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Optional components mutation: (`add_vertex!` increases `nv` by one [true, true, true], `rem_vertex!` decreases `nv` by one [true, true, true]) Precompiling packages... 9654.3 ms ✓ FileIO 1418.4 ms ✓ ChunkCodecLibZstd 55354.6 ms ✓ JLD2 8677.7 ms ✓ MetaGraphs 4 dependencies successfully precompiled in 76 seconds. 52 already precompiled. Testing AbstractGraphInterface is implemented for MetaGraphs.MetaGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Testing AbstractGraphInterface is implemented for MetaGraphs.MetaDiGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Precompiling packages... 10447.3 ms ✓ SimpleWeightedGraphs 1 dependency successfully precompiled in 11 seconds. 26 already precompiled. Testing AbstractGraphInterface is implemented for SimpleWeightedGraphs.SimpleWeightedGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Testing AbstractGraphInterface is implemented for SimpleWeightedGraphs.SimpleWeightedDiGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true], every vertex in `vertices(g)` exists [true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true], every edge in `edges` exists [true, true, true], `edges` are symmetric for undirected graphs [true, true, true]) nv: (`nv` outputs an integer` [true, true, true], `nv` is coherent with `vertices` [true, true, true]) ne: (`ne` outputs an integer` [true, true, true], `ne` is coherent with `edges` [true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true], `weights` has the right size [true, true, true], `weights` are symmetric for undirected graphs [true, true, true]) Precompiling packages... 9792.3 ms ✓ MetaGraphsNext 1 dependency successfully precompiled in 10 seconds. 55 already precompiled. Testing AbstractGraphInterface is implemented for MetaGraphsNext.MetaGraph Mandatory components is_directed: (`is_directed` outputs a boolean [true, true, true, true, true, true]) edgetype: (`edgetype` outputs a type [true, true, true, true, true, true]) vertices: (`vertices` is coherent with `eltype` [true, true, true, true, true, true], every vertex in `vertices(g)` exists [true, true, true, true, true, true], vertices beyond `vertices(g)` don't exist [true, true, true, true, true, true]) edges: (`edges` is coherent with `edgetype` [true, true, true, true, true, true], every edge in `edges` exists [true, true, true, true, true, true], `edges` are symmetric for undirected graphs [true, true, true, true, true, true]) nv: (`nv` outputs an integer` [true, true, true, true, true, true], `nv` is coherent with `vertices` [true, true, true, true, true, true]) ne: (`ne` outputs an integer` [true, true, true, true, true, true], `ne` is coherent with `edges` [true, true, true, true, true, true]) neighbors: (`inneighbors` is coherent with `has_edge` [true, true, true, true, true, true], `outneighbors` is coherent with `has_edge` [true, true, true, true, true, true], `inneighbors` and `outneighbors` coincide for undirected graphs [true, true, true, true, true, true]) weights: (`weights` outputs a matrix of real numbers [true, true, true, true, true, true], `weights` has the right size [true, true, true, true, true, true], `weights` are symmetric for undirected graphs [true, true, true, true, true, true]) Precompiling packages... 3240.0 ms ✓ Multigraphs 1 dependency successfully precompiled in 3 seconds. 26 already precompiled. Testing AbstractGraphInterface is implemented for Multigraph Testing AbstractGraphInterface is implemented for DiMultigraph Test Summary: | Pass Fail Broken Total Time GraphsInterfaceChecker.jl | 18 1 2 21 7m04.4s Aqua | 11 11 3m15.6s JuliaFormatter | 1 1 1m14.2s Graphs.jl | 2 2 14.5s MetaGraphs.jl | 2 2 1m29.3s SimpleWeightedGraphs.jl | 2 2 22.7s MetaGraphsNext.jl | 1 1 21.8s Multigraphs.jl | 2 2 6.3s RNG of the outermost testset: Random.Xoshiro(0x2180d4c3c5b49b19, 0xd96fa54b4d49ec46, 0xa2560fea229e303c, 0xfc9ebb0a10a1cebd, 0xc1d5317ecf15f842) ERROR: LoadError: Some tests did not pass: 18 passed, 1 failed, 0 errored, 2 broken. in expression starting at /home/pkgeval/.julia/packages/GraphsInterfaceChecker/CmHOu/test/runtests.jl:6 Testing failed after 553.99s ERROR: LoadError: Package GraphsInterfaceChecker errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.12/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.12/Pkg/src/Operations.jl:2535 [3] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/Operations.jl:2384 [inlined] [4] 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.12/Pkg/src/API.jl:538 [5] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:169 [6] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:157 [7] test @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:157 [inlined] [8] #test#81 @ /opt/julia/share/julia/stdlib/v1.12/Pkg/src/API.jl:156 [inlined] [9] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:223 [10] include(mod::Module, _path::String) @ Base ./Base.jl:306 [11] exec_options(opts::Base.JLOptions) @ Base ./client.jl:317 [12] _start() @ Base ./client.jl:550 in expression starting at /PkgEval.jl/scripts/evaluate.jl:214 PkgEval failed after 614.07s: package has test failures