[INFO] cloning repository https://github.com/globalbusinessadvisors/networkx-rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/globalbusinessadvisors/networkx-rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fglobalbusinessadvisors%2Fnetworkx-rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fglobalbusinessadvisors%2Fnetworkx-rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 378d0f8cc8964ae84b3c8268845ba9c3cb55956b
[INFO] testing globalbusinessadvisors/networkx-rs against master#0d162b25edd5bf0dba9a22e83b614f1113e90474 for pr-150681
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fglobalbusinessadvisors%2Fnetworkx-rs" "/workspace/builds/worker-6-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/globalbusinessadvisors/networkx-rs
[INFO] finished tweaking git repo https://github.com/globalbusinessadvisors/networkx-rs
[INFO] tweaked toml for git repo https://github.com/globalbusinessadvisors/networkx-rs written to /workspace/builds/worker-6-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/globalbusinessadvisors/networkx-rs on toolchain 0d162b25edd5bf0dba9a22e83b614f1113e90474
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr]      Locking 232 packages to latest compatible versions
[INFO] [stderr]       Adding bincode v1.3.3 (available: v3.0.0)
[INFO] [stderr]       Adding blas-src v0.10.0 (available: v0.14.0)
[INFO] [stderr]       Adding criterion v0.5.1 (available: v0.8.1)
[INFO] [stderr]       Adding ndarray v0.15.6 (available: v0.17.1)
[INFO] [stderr]       Adding numpy v0.22.1 (available: v0.27.1)
[INFO] [stderr]       Adding petgraph v0.6.5 (available: v0.8.3)
[INFO] [stderr]       Adding prost v0.12.6 (available: v0.14.1)
[INFO] [stderr]       Adding pyo3 v0.22.6 (available: v0.27.2)
[INFO] [stderr]       Adding rand v0.8.5 (available: v0.9.2)
[INFO] [stderr]       Adding rand_chacha v0.3.1 (available: v0.9.0)
[INFO] [stderr]       Adding tonic v0.11.0 (available: v0.14.2)
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded prost v0.12.6
[INFO] [stderr]   Downloaded tokio-io-timeout v1.2.1
[INFO] [stderr]   Downloaded pyo3-macros v0.22.6
[INFO] [stderr]   Downloaded pyo3-build-config v0.22.6
[INFO] [stderr]   Downloaded blas-src v0.10.0
[INFO] [stderr]   Downloaded cust_core v0.1.1
[INFO] [stderr]   Downloaded cust_derive v0.2.0
[INFO] [stderr]   Downloaded find_cuda_helper v0.2.0
[INFO] [stderr]   Downloaded prost-derive v0.12.6
[INFO] [stderr]   Downloaded cust_raw v0.11.3
[INFO] [stderr]   Downloaded cuda-sys v0.2.0
[INFO] [stderr]   Downloaded pyo3-macros-backend v0.22.6
[INFO] [stderr]   Downloaded priority-queue v2.7.0
[INFO] [stderr]   Downloaded sprs v0.11.4
[INFO] [stderr]   Downloaded vek v0.15.10
[INFO] [stderr]   Downloaded cust v0.3.2
[INFO] [stderr]   Downloaded numpy v0.22.1
[INFO] [stderr]   Downloaded pyo3-ffi v0.22.6
[INFO] [stderr]   Downloaded arrayfire v3.8.0
[INFO] [stderr]   Downloaded ndarray v0.16.1
[INFO] [stderr]   Downloaded ndarray v0.17.1
[INFO] [stderr]   Downloaded pyo3 v0.22.6
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 39848ac538f011b0addcf2438e39090e524fe2016f8caa4509bbe6a5d8d8e097
[INFO] running `Command { std: "docker" "start" "-a" "39848ac538f011b0addcf2438e39090e524fe2016f8caa4509bbe6a5d8d8e097", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "39848ac538f011b0addcf2438e39090e524fe2016f8caa4509bbe6a5d8d8e097", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "39848ac538f011b0addcf2438e39090e524fe2016f8caa4509bbe6a5d8d8e097", kill_on_drop: false }`
[INFO] [stdout] 39848ac538f011b0addcf2438e39090e524fe2016f8caa4509bbe6a5d8d8e097
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] f81f5399b71376cbb5c62afe1bb5e9fdf1642daec48d9a7b3240f716597b5aea
[INFO] running `Command { std: "docker" "start" "-a" "f81f5399b71376cbb5c62afe1bb5e9fdf1642daec48d9a7b3240f716597b5aea", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.105
[INFO] [stderr]    Compiling matrixmultiply v0.3.10
[INFO] [stderr]    Compiling indoc v2.0.7
[INFO] [stderr]    Compiling unindent v0.2.4
[INFO] [stderr]    Compiling pyo3-build-config v0.22.6
[INFO] [stderr]    Compiling getrandom v0.2.16
[INFO] [stderr]    Compiling getrandom v0.3.4
[INFO] [stderr]    Compiling priority-queue v2.7.0
[INFO] [stderr]    Compiling num-complex v0.4.6
[INFO] [stderr]    Compiling num-integer v0.1.46
[INFO] [stderr]    Compiling rayon v1.11.0
[INFO] [stderr]    Compiling ahash v0.8.12
[INFO] [stderr]    Compiling rand_core v0.6.4
[INFO] [stderr]    Compiling rand_chacha v0.3.1
[INFO] [stderr]    Compiling ndarray v0.16.1
[INFO] [stderr]    Compiling rand v0.8.5
[INFO] [stderr]    Compiling quote v1.0.43
[INFO] [stderr]    Compiling syn v2.0.113
[INFO] [stderr]    Compiling pyo3-macros-backend v0.22.6
[INFO] [stderr]    Compiling pyo3-ffi v0.22.6
[INFO] [stderr]    Compiling pyo3 v0.22.6
[INFO] [stderr]    Compiling pyo3-macros v0.22.6
[INFO] [stderr]    Compiling numpy v0.22.1
[INFO] [stderr]    Compiling networkx-rs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque`
[INFO] [stdout]   --> src/algorithms/connectivity/paths.rs:53:37
[INFO] [stdout]    |
[INFO] [stdout] 53 |     use std::collections::{HashSet, VecDeque, HashMap};
[INFO] [stdout]    |                                     ^^^^^^^^  ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque`
[INFO] [stdout]    --> src/algorithms/connectivity/paths.rs:143:37
[INFO] [stdout]     |
[INFO] [stdout] 143 |     use std::collections::{HashSet, VecDeque, HashMap};
[INFO] [stdout]     |                                     ^^^^^^^^  ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]  --> src/algorithms/mst/prim.rs:6:45
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::{BinaryHeap, HashSet, HashMap};
[INFO] [stdout]   |                                             ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/algorithms/mst/boruvka.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VecDeque`
[INFO] [stdout]   --> src/algorithms/flow/dinic.rs:18:37
[INFO] [stdout]    |
[INFO] [stdout] 18 |     use std::collections::{HashMap, VecDeque};
[INFO] [stdout]    |                                     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]    --> src/algorithms/flow/dinic.rs:112:9
[INFO] [stdout]     |
[INFO] [stdout] 112 |     use std::collections::HashMap;
[INFO] [stdout]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BinaryHeap`
[INFO] [stdout]  --> src/algorithms/coloring/dsatur.rs:6:42
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::{HashMap, HashSet, BinaryHeap};
[INFO] [stdout]   |                                          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::Isomorphism`
[INFO] [stdout]  --> src/algorithms/isomorphism/vf2.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use super::Isomorphism;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::errors::Result`
[INFO] [stdout]  --> src/algorithms/isomorphism/vf2.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use crate::errors::Result;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]   --> src/algorithms/isomorphism/canonical.rs:13:9
[INFO] [stdout]    |
[INFO] [stdout] 13 |     use std::collections::HashMap;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `iteration`
[INFO] [stdout]    --> src/algorithms/centrality/pagerank.rs:238:9
[INFO] [stdout]     |
[INFO] [stdout] 238 |     for iteration in 0..max_iter {
[INFO] [stdout]     |         ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_iteration`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/algorithms/community/louvain.rs:156:9
[INFO] [stdout]     |
[INFO] [stdout] 156 |     let mut current_partition = first_level;
[INFO] [stdout]     |         ----^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/algorithms/community/louvain.rs:157:9
[INFO] [stdout]     |
[INFO] [stdout] 157 |     let mut level = 0;
[INFO] [stdout]     |         ----^^^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `current_modularity`
[INFO] [stdout]    --> src/algorithms/community/louvain.rs:162:13
[INFO] [stdout]     |
[INFO] [stdout] 162 |         let current_modularity = modularity(graph, &current_partition)?;
[INFO] [stdout]     |             ^^^^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_current_modularity`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `cut_value`
[INFO] [stdout]   --> src/algorithms/connectivity/cuts.rs:33:10
[INFO] [stdout]    |
[INFO] [stdout] 33 |     let (cut_value, left_set, right_set) = minimum_cut(graph)?;
[INFO] [stdout]    |          ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cut_value`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `graph`
[INFO] [stdout]   --> src/algorithms/mst/boruvka.rs:10:26
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn boruvka_mst<G, N>(graph: &G) -> Result<Vec<MSTEdge<N>>>
[INFO] [stdout]    |                          ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `best` is never read
[INFO] [stdout]    --> src/algorithms/coloring/dsatur.rs:156:13
[INFO] [stdout]     |
[INFO] [stdout] 156 |             best = k;
[INFO] [stdout]     |             ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout]     = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]   --> src/algorithms/clique/enumerate.rs:37:21
[INFO] [stdout]    |
[INFO] [stdout] 37 |                 for k in min..size.min(max + 1) {
[INFO] [stdout]    |                     ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SaturatedNode` is never constructed
[INFO] [stdout]   --> src/algorithms/coloring/dsatur.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct SaturatedNode<N> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/algorithms/coloring/dsatur.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl<N: Clone> SaturatedNode<N> {
[INFO] [stdout]    | ------------------------------- associated function in this implementation
[INFO] [stdout] 19 |     fn new(node: N, saturation: usize, degree: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `in_1` and `in_2` are never read
[INFO] [stdout]   --> src/algorithms/isomorphism/vf2.rs:16:5
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct VF2State<N1, N2> {
[INFO] [stdout]    |            -------- fields in this struct
[INFO] [stdout] ...
[INFO] [stdout] 16 |     in_1: HashSet<N1>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 17 |     /// Nodes in G2 that are neighbors of mapped nodes
[INFO] [stdout] 18 |     in_2: HashSet<N2>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 20.61s
[INFO] running `Command { std: "docker" "inspect" "f81f5399b71376cbb5c62afe1bb5e9fdf1642daec48d9a7b3240f716597b5aea", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f81f5399b71376cbb5c62afe1bb5e9fdf1642daec48d9a7b3240f716597b5aea", kill_on_drop: false }`
[INFO] [stdout] f81f5399b71376cbb5c62afe1bb5e9fdf1642daec48d9a7b3240f716597b5aea
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 12231f47333aee40ba5962f021dac4fe8119ae2c852aecb6b725e3071f04fc4b
[INFO] running `Command { std: "docker" "start" "-a" "12231f47333aee40ba5962f021dac4fe8119ae2c852aecb6b725e3071f04fc4b", kill_on_drop: false }`
[INFO] [stderr]    Compiling serde v1.0.228
[INFO] [stderr]    Compiling either v1.15.0
[INFO] [stderr]    Compiling rustix v1.1.3
[INFO] [stderr]    Compiling syn v2.0.113
[INFO] [stderr]    Compiling getrandom v0.3.4
[INFO] [stderr]    Compiling plotters-backend v0.3.7
[INFO] [stderr]    Compiling ciborium-io v0.2.2
[INFO] [stderr]    Compiling clap_builder v4.5.54
[INFO] [stderr]    Compiling serde_json v1.0.149
[INFO] [stderr]    Compiling wait-timeout v0.2.1
[INFO] [stderr]    Compiling regex-automata v0.4.13
[INFO] [stderr]    Compiling is-terminal v0.4.17
[INFO] [stderr]    Compiling anes v0.1.6
[INFO] [stderr]    Compiling approx v0.5.1
[INFO] [stderr]    Compiling plotters-svg v0.3.7
[INFO] [stderr]    Compiling rand_core v0.9.3
[INFO] [stderr]    Compiling itertools v0.10.5
[INFO] [stderr]    Compiling rayon v1.11.0
[INFO] [stderr]    Compiling plotters v0.3.7
[INFO] [stderr]    Compiling rand v0.9.2
[INFO] [stderr]    Compiling rand_xorshift v0.4.0
[INFO] [stderr]    Compiling criterion-plot v0.5.0
[INFO] [stderr]    Compiling regex v1.12.2
[INFO] [stderr]    Compiling clap v4.5.54
[INFO] [stderr]    Compiling tempfile v3.24.0
[INFO] [stderr]    Compiling rusty-fork v0.3.1
[INFO] [stderr]    Compiling pyo3-macros-backend v0.22.6
[INFO] [stderr]    Compiling zerocopy-derive v0.8.31
[INFO] [stderr]    Compiling serde_derive v1.0.228
[INFO] [stderr]    Compiling zerocopy v0.8.31
[INFO] [stderr]    Compiling pyo3-macros v0.22.6
[INFO] [stderr]    Compiling pyo3 v0.22.6
[INFO] [stderr]    Compiling ppv-lite86 v0.2.21
[INFO] [stderr]    Compiling half v2.7.1
[INFO] [stderr]    Compiling ahash v0.8.12
[INFO] [stderr]    Compiling ciborium-ll v0.2.2
[INFO] [stderr]    Compiling rand_chacha v0.3.1
[INFO] [stderr]    Compiling rand_chacha v0.9.0
[INFO] [stderr]    Compiling ciborium v0.2.2
[INFO] [stderr]    Compiling tinytemplate v1.2.1
[INFO] [stderr]    Compiling proptest v1.9.0
[INFO] [stderr]    Compiling rand v0.8.5
[INFO] [stderr]    Compiling criterion v0.5.1
[INFO] [stderr]    Compiling numpy v0.22.1
[INFO] [stderr]    Compiling networkx-rs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque`
[INFO] [stdout]   --> src/algorithms/connectivity/paths.rs:53:37
[INFO] [stdout]    |
[INFO] [stdout] 53 |     use std::collections::{HashSet, VecDeque, HashMap};
[INFO] [stdout]    |                                     ^^^^^^^^  ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque`
[INFO] [stdout]    --> src/algorithms/connectivity/paths.rs:143:37
[INFO] [stdout]     |
[INFO] [stdout] 143 |     use std::collections::{HashSet, VecDeque, HashMap};
[INFO] [stdout]     |                                     ^^^^^^^^  ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]  --> src/algorithms/mst/prim.rs:6:45
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::{BinaryHeap, HashSet, HashMap};
[INFO] [stdout]   |                                             ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/algorithms/mst/boruvka.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VecDeque`
[INFO] [stdout]   --> src/algorithms/flow/dinic.rs:18:37
[INFO] [stdout]    |
[INFO] [stdout] 18 |     use std::collections::{HashMap, VecDeque};
[INFO] [stdout]    |                                     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]    --> src/algorithms/flow/dinic.rs:112:9
[INFO] [stdout]     |
[INFO] [stdout] 112 |     use std::collections::HashMap;
[INFO] [stdout]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BinaryHeap`
[INFO] [stdout]  --> src/algorithms/coloring/dsatur.rs:6:42
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::{HashMap, HashSet, BinaryHeap};
[INFO] [stdout]   |                                          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::Isomorphism`
[INFO] [stdout]  --> src/algorithms/isomorphism/vf2.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use super::Isomorphism;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::errors::Result`
[INFO] [stdout]  --> src/algorithms/isomorphism/vf2.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use crate::errors::Result;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]   --> src/algorithms/isomorphism/canonical.rs:13:9
[INFO] [stdout]    |
[INFO] [stdout] 13 |     use std::collections::HashMap;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `iteration`
[INFO] [stdout]    --> src/algorithms/centrality/pagerank.rs:238:9
[INFO] [stdout]     |
[INFO] [stdout] 238 |     for iteration in 0..max_iter {
[INFO] [stdout]     |         ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_iteration`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/algorithms/community/louvain.rs:156:9
[INFO] [stdout]     |
[INFO] [stdout] 156 |     let mut current_partition = first_level;
[INFO] [stdout]     |         ----^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/algorithms/community/louvain.rs:157:9
[INFO] [stdout]     |
[INFO] [stdout] 157 |     let mut level = 0;
[INFO] [stdout]     |         ----^^^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `current_modularity`
[INFO] [stdout]    --> src/algorithms/community/louvain.rs:162:13
[INFO] [stdout]     |
[INFO] [stdout] 162 |         let current_modularity = modularity(graph, &current_partition)?;
[INFO] [stdout]     |             ^^^^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_current_modularity`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `cut_value`
[INFO] [stdout]   --> src/algorithms/connectivity/cuts.rs:33:10
[INFO] [stdout]    |
[INFO] [stdout] 33 |     let (cut_value, left_set, right_set) = minimum_cut(graph)?;
[INFO] [stdout]    |          ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cut_value`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `graph`
[INFO] [stdout]   --> src/algorithms/mst/boruvka.rs:10:26
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn boruvka_mst<G, N>(graph: &G) -> Result<Vec<MSTEdge<N>>>
[INFO] [stdout]    |                          ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `best` is never read
[INFO] [stdout]    --> src/algorithms/coloring/dsatur.rs:156:13
[INFO] [stdout]     |
[INFO] [stdout] 156 |             best = k;
[INFO] [stdout]     |             ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout]     = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]   --> src/algorithms/clique/enumerate.rs:37:21
[INFO] [stdout]    |
[INFO] [stdout] 37 |                 for k in min..size.min(max + 1) {
[INFO] [stdout]    |                     ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SaturatedNode` is never constructed
[INFO] [stdout]   --> src/algorithms/coloring/dsatur.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct SaturatedNode<N> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/algorithms/coloring/dsatur.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl<N: Clone> SaturatedNode<N> {
[INFO] [stdout]    | ------------------------------- associated function in this implementation
[INFO] [stdout] 19 |     fn new(node: N, saturation: usize, degree: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `in_1` and `in_2` are never read
[INFO] [stdout]   --> src/algorithms/isomorphism/vf2.rs:16:5
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct VF2State<N1, N2> {
[INFO] [stdout]    |            -------- fields in this struct
[INFO] [stdout] ...
[INFO] [stdout] 16 |     in_1: HashSet<N1>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 17 |     /// Nodes in G2 that are neighbors of mapped nodes
[INFO] [stdout] 18 |     in_2: HashSet<N2>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque`
[INFO] [stdout]   --> src/algorithms/connectivity/paths.rs:53:37
[INFO] [stdout]    |
[INFO] [stdout] 53 |     use std::collections::{HashSet, VecDeque, HashMap};
[INFO] [stdout]    |                                     ^^^^^^^^  ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap` and `VecDeque`
[INFO] [stdout]    --> src/algorithms/connectivity/paths.rs:143:37
[INFO] [stdout]     |
[INFO] [stdout] 143 |     use std::collections::{HashSet, VecDeque, HashMap};
[INFO] [stdout]     |                                     ^^^^^^^^  ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]  --> src/algorithms/mst/prim.rs:6:45
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::{BinaryHeap, HashSet, HashMap};
[INFO] [stdout]   |                                             ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::graph::traits::GraphBase`
[INFO] [stdout]    --> src/algorithms/mst/prim.rs:213:9
[INFO] [stdout]     |
[INFO] [stdout] 213 |     use crate::graph::traits::GraphBase;
[INFO] [stdout]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/algorithms/mst/boruvka.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::graph::traits::GraphBase`
[INFO] [stdout]    --> src/algorithms/flow/edmonds_karp.rs:191:9
[INFO] [stdout]     |
[INFO] [stdout] 191 |     use crate::graph::traits::GraphBase;
[INFO] [stdout]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `VecDeque`
[INFO] [stdout]   --> src/algorithms/flow/dinic.rs:18:37
[INFO] [stdout]    |
[INFO] [stdout] 18 |     use std::collections::{HashMap, VecDeque};
[INFO] [stdout]    |                                     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]    --> src/algorithms/flow/dinic.rs:112:9
[INFO] [stdout]     |
[INFO] [stdout] 112 |     use std::collections::HashMap;
[INFO] [stdout]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BinaryHeap`
[INFO] [stdout]  --> src/algorithms/coloring/dsatur.rs:6:42
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::collections::{HashMap, HashSet, BinaryHeap};
[INFO] [stdout]   |                                          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::Isomorphism`
[INFO] [stdout]  --> src/algorithms/isomorphism/vf2.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 | use super::Isomorphism;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::errors::Result`
[INFO] [stdout]  --> src/algorithms/isomorphism/vf2.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use crate::errors::Result;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]   --> src/algorithms/isomorphism/canonical.rs:13:9
[INFO] [stdout]    |
[INFO] [stdout] 13 |     use std::collections::HashMap;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `iteration`
[INFO] [stdout]    --> src/algorithms/centrality/pagerank.rs:238:9
[INFO] [stdout]     |
[INFO] [stdout] 238 |     for iteration in 0..max_iter {
[INFO] [stdout]     |         ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_iteration`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/algorithms/community/louvain.rs:156:9
[INFO] [stdout]     |
[INFO] [stdout] 156 |     let mut current_partition = first_level;
[INFO] [stdout]     |         ----^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/algorithms/community/louvain.rs:157:9
[INFO] [stdout]     |
[INFO] [stdout] 157 |     let mut level = 0;
[INFO] [stdout]     |         ----^^^^^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `current_modularity`
[INFO] [stdout]    --> src/algorithms/community/louvain.rs:162:13
[INFO] [stdout]     |
[INFO] [stdout] 162 |         let current_modularity = modularity(graph, &current_partition)?;
[INFO] [stdout]     |             ^^^^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_current_modularity`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `cut_value`
[INFO] [stdout]   --> src/algorithms/connectivity/cuts.rs:33:10
[INFO] [stdout]    |
[INFO] [stdout] 33 |     let (cut_value, left_set, right_set) = minimum_cut(graph)?;
[INFO] [stdout]    |          ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cut_value`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `graph`
[INFO] [stdout]   --> src/algorithms/mst/boruvka.rs:10:26
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn boruvka_mst<G, N>(graph: &G) -> Result<Vec<MSTEdge<N>>>
[INFO] [stdout]    |                          ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `best` is never read
[INFO] [stdout]    --> src/algorithms/coloring/dsatur.rs:156:13
[INFO] [stdout]     |
[INFO] [stdout] 156 |             best = k;
[INFO] [stdout]     |             ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout]     = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]   --> src/algorithms/clique/enumerate.rs:37:21
[INFO] [stdout]    |
[INFO] [stdout] 37 |                 for k in min..size.min(max + 1) {
[INFO] [stdout]    |                     ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SaturatedNode` is never constructed
[INFO] [stdout]   --> src/algorithms/coloring/dsatur.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct SaturatedNode<N> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/algorithms/coloring/dsatur.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl<N: Clone> SaturatedNode<N> {
[INFO] [stdout]    | ------------------------------- associated function in this implementation
[INFO] [stdout] 19 |     fn new(node: N, saturation: usize, degree: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `in_1` and `in_2` are never read
[INFO] [stdout]   --> src/algorithms/isomorphism/vf2.rs:16:5
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub struct VF2State<N1, N2> {
[INFO] [stdout]    |            -------- fields in this struct
[INFO] [stdout] ...
[INFO] [stdout] 16 |     in_1: HashSet<N1>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 17 |     /// Nodes in G2 that are neighbors of mapped nodes
[INFO] [stdout] 18 |     in_2: HashSet<N2>,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 26.21s
[INFO] running `Command { std: "docker" "inspect" "12231f47333aee40ba5962f021dac4fe8119ae2c852aecb6b725e3071f04fc4b", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "12231f47333aee40ba5962f021dac4fe8119ae2c852aecb6b725e3071f04fc4b", kill_on_drop: false }`
[INFO] [stdout] 12231f47333aee40ba5962f021dac4fe8119ae2c852aecb6b725e3071f04fc4b
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:845e597a41426bbf2703be69acdb67d10b6de511142d05cba7bbe119c898b2c7" "/opt/rustwide/cargo-home/bin/cargo" "+0d162b25edd5bf0dba9a22e83b614f1113e90474" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 0a745509541921b05069164626e7d3f51970850820cb3f6564d84de9c924a668
[INFO] running `Command { std: "docker" "start" "-a" "0a745509541921b05069164626e7d3f51970850820cb3f6564d84de9c924a668", kill_on_drop: false }`
[INFO] [stderr] warning: unused imports: `HashMap` and `VecDeque`
[INFO] [stderr]   --> src/algorithms/connectivity/paths.rs:53:37
[INFO] [stderr]    |
[INFO] [stderr] 53 |     use std::collections::{HashSet, VecDeque, HashMap};
[INFO] [stderr]    |                                     ^^^^^^^^  ^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `HashMap` and `VecDeque`
[INFO] [stderr]    --> src/algorithms/connectivity/paths.rs:143:37
[INFO] [stderr]     |
[INFO] [stderr] 143 |     use std::collections::{HashSet, VecDeque, HashMap};
[INFO] [stderr]     |                                     ^^^^^^^^  ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `HashMap`
[INFO] [stderr]  --> src/algorithms/mst/prim.rs:6:45
[INFO] [stderr]   |
[INFO] [stderr] 6 | use std::collections::{BinaryHeap, HashSet, HashMap};
[INFO] [stderr]   |                                             ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::collections::HashMap`
[INFO] [stderr]  --> src/algorithms/mst/boruvka.rs:6:5
[INFO] [stderr]   |
[INFO] [stderr] 6 | use std::collections::HashMap;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `VecDeque`
[INFO] [stderr]   --> src/algorithms/flow/dinic.rs:18:37
[INFO] [stderr]    |
[INFO] [stderr] 18 |     use std::collections::{HashMap, VecDeque};
[INFO] [stderr]    |                                     ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::collections::HashMap`
[INFO] [stderr]    --> src/algorithms/flow/dinic.rs:112:9
[INFO] [stderr]     |
[INFO] [stderr] 112 |     use std::collections::HashMap;
[INFO] [stderr]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `BinaryHeap`
[INFO] [stderr]  --> src/algorithms/coloring/dsatur.rs:6:42
[INFO] [stderr]   |
[INFO] [stderr] 6 | use std::collections::{HashMap, HashSet, BinaryHeap};
[INFO] [stderr]   |                                          ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::Isomorphism`
[INFO] [stderr]  --> src/algorithms/isomorphism/vf2.rs:3:5
[INFO] [stderr]   |
[INFO] [stderr] 3 | use super::Isomorphism;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::errors::Result`
[INFO] [stderr]  --> src/algorithms/isomorphism/vf2.rs:5:5
[INFO] [stderr]   |
[INFO] [stderr] 5 | use crate::errors::Result;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::collections::HashMap`
[INFO] [stderr]   --> src/algorithms/isomorphism/canonical.rs:13:9
[INFO] [stderr]    |
[INFO] [stderr] 13 |     use std::collections::HashMap;
[INFO] [stderr]    |         ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `iteration`
[INFO] [stderr]    --> src/algorithms/centrality/pagerank.rs:238:9
[INFO] [stderr]     |
[INFO] [stderr] 238 |     for iteration in 0..max_iter {
[INFO] [stderr]     |         ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_iteration`
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/algorithms/community/louvain.rs:156:9
[INFO] [stderr]     |
[INFO] [stderr] 156 |     let mut current_partition = first_level;
[INFO] [stderr]     |         ----^^^^^^^^^^^^^^^^^
[INFO] [stderr]     |         |
[INFO] [stderr]     |         help: remove this `mut`
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/algorithms/community/louvain.rs:157:9
[INFO] [stderr]     |
[INFO] [stderr] 157 |     let mut level = 0;
[INFO] [stderr]     |         ----^^^^^
[INFO] [stderr]     |         |
[INFO] [stderr]     |         help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `current_modularity`
[INFO] [stderr]    --> src/algorithms/community/louvain.rs:162:13
[INFO] [stderr]     |
[INFO] [stderr] 162 |         let current_modularity = modularity(graph, &current_partition)?;
[INFO] [stderr]     |             ^^^^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_current_modularity`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `cut_value`
[INFO] [stderr]   --> src/algorithms/connectivity/cuts.rs:33:10
[INFO] [stderr]    |
[INFO] [stderr] 33 |     let (cut_value, left_set, right_set) = minimum_cut(graph)?;
[INFO] [stderr]    |          ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cut_value`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `graph`
[INFO] [stderr]   --> src/algorithms/mst/boruvka.rs:10:26
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn boruvka_mst<G, N>(graph: &G) -> Result<Vec<MSTEdge<N>>>
[INFO] [stderr]    |                          ^^^^^ help: if this is intentional, prefix it with an underscore: `_graph`
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `best` is never read
[INFO] [stderr]    --> src/algorithms/coloring/dsatur.rs:156:13
[INFO] [stderr]     |
[INFO] [stderr] 156 |             best = k;
[INFO] [stderr]     |             ^^^^^^^^
[INFO] [stderr]     |
[INFO] [stderr]     = help: maybe it is overwritten before being read?
[INFO] [stderr]     = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `k`
[INFO] [stderr]   --> src/algorithms/clique/enumerate.rs:37:21
[INFO] [stderr]    |
[INFO] [stderr] 37 |                 for k in min..size.min(max + 1) {
[INFO] [stderr]    |                     ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stderr] 
[INFO] [stderr] warning: struct `SaturatedNode` is never constructed
[INFO] [stderr]   --> src/algorithms/coloring/dsatur.rs:12:8
[INFO] [stderr]    |
[INFO] [stderr] 12 | struct SaturatedNode<N> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/algorithms/coloring/dsatur.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 18 | impl<N: Clone> SaturatedNode<N> {
[INFO] [stderr]    | ------------------------------- associated function in this implementation
[INFO] [stderr] 19 |     fn new(node: N, saturation: usize, degree: usize) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: fields `in_1` and `in_2` are never read
[INFO] [stderr]   --> src/algorithms/isomorphism/vf2.rs:16:5
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub struct VF2State<N1, N2> {
[INFO] [stderr]    |            -------- fields in this struct
[INFO] [stderr] ...
[INFO] [stderr] 16 |     in_1: HashSet<N1>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr] 17 |     /// Nodes in G2 that are neighbors of mapped nodes
[INFO] [stderr] 18 |     in_2: HashSet<N2>,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::graph::traits::GraphBase`
[INFO] [stderr]    --> src/algorithms/mst/prim.rs:213:9
[INFO] [stderr]     |
[INFO] [stderr] 213 |     use crate::graph::traits::GraphBase;
[INFO] [stderr]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::graph::traits::GraphBase`
[INFO] [stderr]    --> src/algorithms/flow/edmonds_karp.rs:191:9
[INFO] [stderr]     |
[INFO] [stderr] 191 |     use crate::graph::traits::GraphBase;
[INFO] [stderr]     |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `networkx-rs` (lib) generated 21 warnings (run `cargo fix --lib -p networkx-rs` to apply 17 suggestions)
[INFO] [stderr] warning: `networkx-rs` (lib test) generated 23 warnings (21 duplicates) (run `cargo fix --lib -p networkx-rs --tests` to apply 2 suggestions)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.25s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/networkx_rs_core-827c33266d32c62d)
[INFO] [stdout] 
[INFO] [stdout] running 99 tests
[INFO] [stdout] test algorithms::centrality::eigenvector::tests::test_katz_centrality ... ok
[INFO] [stdout] test algorithms::centrality::eigenvector::tests::test_eigenvector_centrality_path ... ok
[INFO] [stdout] test algorithms::centrality::hits::tests::test_hits_simple ... ok
[INFO] [stdout] test algorithms::centrality::hits::tests::test_hub_and_authority_scores ... ok
[INFO] [stdout] test algorithms::centrality::katz::tests::test_katz_centrality_simple ... ok
[INFO] [stdout] test algorithms::centrality::closeness::tests::test_harmonic_centrality ... ok
[INFO] [stdout] test algorithms::centrality::betweenness::tests::test_betweenness_centrality_simple ... ok
[INFO] [stdout] test algorithms::centrality::closeness::tests::test_closeness_centrality_star ... ok
[INFO] [stdout] test algorithms::centrality::betweenness::tests::test_betweenness_centrality_star ... ok
[INFO] [stdout] test algorithms::centrality::closeness::tests::test_closeness_centrality_path ... ok
[INFO] [stdout] test algorithms::clique::max_clique::tests::test_greedy_max_clique ... ok
[INFO] [stdout] test algorithms::clique::bron_kerbosch::tests::test_find_cliques_disconnected ... ok
[INFO] [stdout] test algorithms::clique::max_clique::tests::test_degeneracy ... ok
[INFO] [stdout] test algorithms::centrality::pagerank::tests::test_hits_algorithm ... ok
[INFO] [stdout] test algorithms::clique::max_clique::tests::test_max_clique ... ok
[INFO] [stdout] test algorithms::clique::bron_kerbosch::tests::test_find_cliques_triangle ... ok
[INFO] [stdout] test algorithms::clique::max_clique::tests::test_k_core ... ok
[INFO] [stdout] test algorithms::coloring::dsatur::tests::test_dsatur_bipartite ... ok
[INFO] [stdout] test algorithms::coloring::dsatur::tests::test_dsatur_petersen ... ok
[INFO] [stdout] test algorithms::coloring::greedy::tests::test_greedy_color_bipartite ... ok
[INFO] [stdout] test algorithms::clique::bron_kerbosch::tests::test_bron_kerbosch_with_pivot ... ok
[INFO] [stdout] test algorithms::centrality::hits::tests::test_hits_normalized ... ok
[INFO] [stdout] test algorithms::coloring::dsatur::tests::test_dsatur_triangle ... ok
[INFO] [stdout] test algorithms::coloring::greedy::tests::test_coloring_strategies ... ok
[INFO] [stdout] test algorithms::centrality::katz::tests::test_katz_centrality_normalized ... ok
[INFO] [stdout] test algorithms::coloring::greedy::tests::test_greedy_color_simple ... ok
[INFO] [stdout] test algorithms::centrality::pagerank::tests::test_pagerank_simple ... ok
[INFO] [stdout] test algorithms::community::label_propagation::tests::test_label_propagation_disconnected ... ok
[INFO] [stdout] test algorithms::community::label_propagation::tests::test_semi_sync_label_propagation ... ok
[INFO] [stdout] test algorithms::community::label_propagation::tests::test_label_propagation_simple ... ok
[INFO] [stdout] test algorithms::community::louvain::tests::test_louvain_disconnected ... ok
[INFO] [stdout] test algorithms::community::louvain::tests::test_louvain_simple ... ok
[INFO] [stdout] test algorithms::community::modularity::tests::test_modularity_two_communities ... ok
[INFO] [stdout] test algorithms::connectivity::bipartite::tests::test_bipartite_color ... ok
[INFO] [stdout] test algorithms::connectivity::bipartite::tests::test_bipartite_sets ... ok
[INFO] [stdout] test algorithms::connectivity::bipartite::tests::test_is_bipartite ... ok
[INFO] [stdout] test algorithms::connectivity::components::tests::test_is_connected ... ok
[INFO] [stdout] test algorithms::connectivity::components::tests::test_strongly_connected_components ... ok
[INFO] [stdout] test algorithms::flow::edmonds_karp::tests::test_edmonds_karp_bottleneck ... ok
[INFO] [stdout] test algorithms::flow::edmonds_karp::tests::test_edmonds_karp_disconnected ... ok
[INFO] [stdout] test algorithms::generators::classic::tests::test_complete_graph ... ok
[INFO] [stdout] test algorithms::generators::classic::tests::test_hypercube_graph ... ok
[INFO] [stdout] test algorithms::generators::classic::tests::test_star_graph ... ok
[INFO] [stdout] test algorithms::generators::random::tests::test_erdos_renyi_complete ... ok
[INFO] [stdout] test algorithms::generators::random::tests::test_erdos_renyi_empty ... ok
[INFO] [stdout] test algorithms::generators::random::tests::test_gnm_invalid ... ok
[INFO] [stdout] test algorithms::community::label_propagation::tests::test_async_label_propagation ... ok
[INFO] [stdout] test algorithms::generators::random::tests::test_gnm_random ... ok
[INFO] [stdout] test algorithms::generators::classic::tests::test_grid_graph ... ok
[INFO] [stdout] test algorithms::generators::classic::tests::test_cycle_graph ... ok
[INFO] [stdout] test algorithms::generators::classic::tests::test_path_graph ... ok
[INFO] [stdout] test algorithms::generators::random::tests::test_random_regular ... ok
[INFO] [stdout] test algorithms::generators::scale_free::tests::test_barabasi_albert_invalid ... ok
[INFO] [stdout] test algorithms::flow::edmonds_karp::tests::test_edmonds_karp_simple ... ok
[INFO] [stdout] test algorithms::generators::scale_free::tests::test_powerlaw_cluster ... ok
[INFO] [stdout] test algorithms::generators::small_world::tests::test_newman_watts_strogatz ... ok
[INFO] [stdout] test algorithms::generators::small_world::tests::test_connected_watts_strogatz ... ok
[INFO] [stdout] test algorithms::generators::scale_free::tests::test_extended_barabasi_albert ... ok
[INFO] [stdout] test algorithms::generators::small_world::tests::test_watts_strogatz_invalid ... ok
[INFO] [stdout] test algorithms::generators::small_world::tests::test_watts_strogatz_ring ... ok
[INFO] [stdout] test algorithms::generators::small_world::tests::test_navigable_small_world ... ok
[INFO] [stdout] test algorithms::generators::small_world::tests::test_watts_strogatz_rewired ... ok
[INFO] [stdout] test algorithms::mst::kruskal::tests::test_kruskal_disconnected ... ok
[INFO] [stdout] test algorithms::mst::kruskal::tests::test_union_find ... ok
[INFO] [stdout] test algorithms::mst::kruskal::tests::test_kruskal_mst ... ok
[INFO] [stdout] test algorithms::mst::prim::tests::test_prim_mst_from ... ok
[INFO] [stdout] test algorithms::mst::prim::tests::test_prim_mst ... ok
[INFO] [stdout] test algorithms::paths::astar::tests::test_astar_no_path ... ok
[INFO] [stdout] test algorithms::paths::astar::tests::test_astar_simple ... ok
[INFO] [stdout] test algorithms::paths::bellman_ford::tests::test_bellman_ford_positive_weights ... ok
[INFO] [stdout] test algorithms::paths::bellman_ford::tests::test_bellman_ford_negative_weights ... ok
[INFO] [stdout] test algorithms::paths::bellman_ford::tests::test_negative_cycle_detection ... ok
[INFO] [stdout] test algorithms::paths::dijkstra::tests::test_dijkstra_distances ... ok
[INFO] [stdout] test algorithms::paths::dijkstra::tests::test_dijkstra_no_path ... ok
[INFO] [stdout] test algorithms::paths::dijkstra::tests::test_dijkstra_simple_path ... ok
[INFO] [stdout] test algorithms::centrality::pagerank::tests::test_pagerank_star ... ok
[INFO] [stdout] test algorithms::mst::prim::tests::test_prim_mst_forest ... ok
[INFO] [stdout] test algorithms::paths::floyd_warshall::tests::test_floyd_warshall_disconnected ... ok
[INFO] [stdout] test algorithms::paths::floyd_warshall::tests::test_path_reconstruction ... ok
[INFO] [stdout] test algorithms::paths::johnson::tests::test_johnson_negative_weights ... ok
[INFO] [stdout] test algorithms::generators::classic::tests::test_wheel_graph ... ok
[INFO] [stdout] test algorithms::paths::k_shortest::tests::test_k_shortest_no_path ... ok
[INFO] [stdout] test algorithms::paths::k_shortest::tests::test_k_shortest_paths_simple ... ok
[INFO] [stdout] test algorithms::paths::johnson::tests::test_johnson_simple ... ok
[INFO] [stdout] test algorithms::paths::floyd_warshall::tests::test_floyd_warshall_simple ... ok
[INFO] [stdout] test algorithms::paths::k_shortest::tests::test_k_shortest_single_path ... ok
[INFO] [stdout] test algorithms::traversal::bfs::tests::test_bfs_tree ... ok
[INFO] [stdout] test algorithms::traversal::dfs::tests::test_dfs_tree ... ok
[INFO] [stdout] test algorithms::traversal::bfs::tests::test_bfs_edges ... ok
[INFO] [stdout] test graph::generic::tests::test_digraph_creation ... ok
[INFO] [stdout] test graph::generic::tests::test_graph_creation ... ok
[INFO] [stdout] test algorithms::clique::bron_kerbosch::tests::test_find_k_cliques ... FAILED
[INFO] [stdout] test algorithms::centrality::eigenvector::tests::test_eigenvector_centrality_star ... FAILED
[INFO] [stdout] test algorithms::community::louvain::tests::test_louvain_single_community ... FAILED
[INFO] [stdout] test algorithms::community::modularity::tests::test_modularity_single_community ... FAILED
[INFO] [stdout] test algorithms::connectivity::components::tests::test_connected_components ... FAILED
[INFO] [stdout] test algorithms::generators::scale_free::tests::test_barabasi_albert ... FAILED
[INFO] [stdout] test algorithms::centrality::pagerank::tests::test_pagerank_with_personalization ... FAILED
[INFO] [stdout] test algorithms::generators::random::tests::test_fast_gnp has been running for over 60 seconds
[ERROR] error running command: no output for 300 seconds
[INFO] running `Command { std: "docker" "inspect" "0a745509541921b05069164626e7d3f51970850820cb3f6564d84de9c924a668", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0a745509541921b05069164626e7d3f51970850820cb3f6564d84de9c924a668", kill_on_drop: false }`
[INFO] [stdout] 0a745509541921b05069164626e7d3f51970850820cb3f6564d84de9c924a668
