Package evaluation of GraphsInterfaceChecker on Julia 1.13.0-DEV.140 (fac1ce7906*) started at 2025-03-02T09:24:28.077 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 7.89s ################################################################################ # Installation # Installing GraphsInterfaceChecker... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [3bef136c] + GraphsInterfaceChecker v0.1.0 Updating `~/.julia/environments/v1.13/Manifest.toml` [ec485272] + ArnoldiMethod v0.4.0 [34da2185] + Compat v4.16.0 [864edb3b] + DataStructures v0.18.20 [86223c79] + Graphs v1.12.0 [3bef136c] + GraphsInterfaceChecker v0.1.0 [d25df0c9] + Inflate v0.1.5 [85a1e053] + Interfaces v0.3.2 [1914dd2f] + MacroTools v0.5.15 [bac558e1] + OrderedCollections v1.8.0 [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [699a6c99] + SimpleTraits v0.9.4 [90137ffa] + StaticArrays v1.9.13 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed 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 [a63ad114] + Mmap v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [1a1011a3] + SharedArrays v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.12.0 [f489334b] + StyledStrings v1.11.0 [fa267f1f] + TOML v1.0.3 [cf7118a7] + UUIDs v1.11.0 [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.12.0+0 Installation completed after 1.09s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 60.26s ################################################################################ # Testing # Testing GraphsInterfaceChecker Status `/tmp/jl_NMXtBf/Project.toml` [4c88cf16] Aqua v0.8.11 [86223c79] Graphs v1.12.0 [3bef136c] GraphsInterfaceChecker v0.1.0 [85a1e053] Interfaces v0.3.2 [98e50ef6] JuliaFormatter v1.0.62 [626554b9] MetaGraphs v0.8.0 [fa8bd995] MetaGraphsNext v0.7.1 [7ebac608] Multigraphs v0.3.0 [47aef6b3] SimpleWeightedGraphs v1.4.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_NMXtBf/Manifest.toml` [4c88cf16] Aqua v0.8.11 [ec485272] ArnoldiMethod v0.4.0 [00ebfdb7] CSTParser v3.4.3 [a80b9123] CommonMark v0.8.15 [34da2185] Compat v4.16.0 [a8cc5b0e] Crayons v4.1.1 [864edb3b] DataStructures v0.18.20 [5789e2e9] FileIO v1.17.0 [c27321d9] Glob v1.3.1 [86223c79] Graphs v1.12.0 [3bef136c] GraphsInterfaceChecker v0.1.0 [d25df0c9] Inflate v0.1.5 [85a1e053] Interfaces v0.3.2 [033835bb] JLD2 v0.5.11 [98e50ef6] JuliaFormatter v1.0.62 [1914dd2f] MacroTools v0.5.15 [626554b9] MetaGraphs v0.8.0 [fa8bd995] MetaGraphsNext v0.7.1 [7ebac608] Multigraphs v0.3.0 [bac558e1] OrderedCollections v1.8.0 [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [ae029012] Requires v1.3.1 [699a6c99] SimpleTraits v0.9.4 [47aef6b3] SimpleWeightedGraphs v1.4.0 [90137ffa] StaticArrays v1.9.13 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [0796e94c] Tokenize v0.5.29 [3bb67fe8] TranscodingStreams v0.11.3 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed 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.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [1a1011a3] SharedArrays v1.11.0 [6462fe0b] Sockets 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.11.1+1 [e37daf67] LibGit2_jll v1.9.0+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2024.12.31 [4536629a] OpenBLAS_jll v0.3.29+0 [458c3c95] OpenSSL_jll v3.0.16+0 [bea87d4a] SuiteSparse_jll v7.8.3+2 [83775a58] Zlib_jll v1.3.1+2 [8e850b90] libblastrampoline_jll v5.12.0+0 [8e850ede] nghttp2_jll v1.64.0+1 [3f19e933] p7zip_jll v17.5.0+2 Testing Running tests... Precompiling packages... 14069.5 ms ✓ CommonMark 50447.4 ms ✓ JuliaFormatter 2 dependencies successfully precompiled in 65 seconds. 20 already precompiled. 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... 11541.1 ms ✓ MetaGraphs 1 dependency successfully precompiled in 12 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... 9003.0 ms ✓ SimpleWeightedGraphs 1 dependency successfully precompiled in 9 seconds. 32 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]) 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... 4047.1 ms ✓ Multigraphs 1 dependency successfully precompiled in 4 seconds. 32 already precompiled. Testing AbstractGraphInterface is implemented for Multigraph Testing AbstractGraphInterface is implemented for DiMultigraph Test Summary: | Pass Broken Total Time GraphsInterfaceChecker.jl | 19 2 21 3m09.7s Aqua | 11 11 55.6s JuliaFormatter | 1 1 58.1s Graphs.jl | 2 2 13.3s MetaGraphs.jl | 2 2 24.8s SimpleWeightedGraphs.jl | 2 2 20.1s MetaGraphsNext.jl | 1 1 11.1s Multigraphs.jl | 2 2 6.7s Testing GraphsInterfaceChecker tests passed Testing completed after 268.01s PkgEval succeeded after 353.84s