[INFO] cloning repository https://github.com/Logarithmus/min-spanning-tree-and-shortest-path
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Logarithmus/min-spanning-tree-and-shortest-path" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLogarithmus%2Fmin-spanning-tree-and-shortest-path", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLogarithmus%2Fmin-spanning-tree-and-shortest-path'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] b900196767a24bf6e11c8d4783bd8ce7c3fedb94
[INFO] checking Logarithmus/min-spanning-tree-and-shortest-path/b900196767a24bf6e11c8d4783bd8ce7c3fedb94 against try#4d98531622e1718ae0bc3c7a1ab9cd8938428452+rustflags=-Dtail_expr_drop_order for pr-129604
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLogarithmus%2Fmin-spanning-tree-and-shortest-path" "/workspace/builds/worker-2-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/Logarithmus/min-spanning-tree-and-shortest-path on toolchain 4d98531622e1718ae0bc3c7a1ab9cd8938428452
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+4d98531622e1718ae0bc3c7a1ab9cd8938428452" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/Logarithmus/min-spanning-tree-and-shortest-path
[INFO] finished tweaking git repo https://github.com/Logarithmus/min-spanning-tree-and-shortest-path
[INFO] tweaked toml for git repo https://github.com/Logarithmus/min-spanning-tree-and-shortest-path written to /workspace/builds/worker-2-tc2/source/Cargo.toml
[INFO] crate git repo https://github.com/Logarithmus/min-spanning-tree-and-shortest-path already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+4d98531622e1718ae0bc3c7a1ab9cd8938428452" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+4d98531622e1718ae0bc3c7a1ab9cd8938428452" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 20d2000d30e8a35ef6b60858a6da1d3b12bf73bb7add530e6755f729bdd091a3
[INFO] running `Command { std: "docker" "start" "-a" "20d2000d30e8a35ef6b60858a6da1d3b12bf73bb7add530e6755f729bdd091a3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "20d2000d30e8a35ef6b60858a6da1d3b12bf73bb7add530e6755f729bdd091a3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "20d2000d30e8a35ef6b60858a6da1d3b12bf73bb7add530e6755f729bdd091a3", kill_on_drop: false }`
[INFO] [stdout] 20d2000d30e8a35ef6b60858a6da1d3b12bf73bb7add530e6755f729bdd091a3
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/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 -Dtail_expr_drop_order" "-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+4d98531622e1718ae0bc3c7a1ab9cd8938428452" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 43d0f1e10914d59ac0c2cedd5dc3e87e15dcad0508ff4b805096bd98a1f79af1
[INFO] running `Command { std: "docker" "start" "-a" "43d0f1e10914d59ac0c2cedd5dc3e87e15dcad0508ff4b805096bd98a1f79af1", kill_on_drop: false }`
[INFO] [stderr]     Checking spanning_tree_and_shortest_path v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused variable: `start`
[INFO] [stdout]    --> src/graph.rs:147:28
[INFO] [stdout]     |
[INFO] [stdout] 147 |     pub fn dijkstra(&self, start: usize) -> Vec<Vec<HalfEdge>> {
[INFO] [stdout]     |                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_start`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `start`
[INFO] [stdout]    --> src/graph.rs:147:28
[INFO] [stdout]     |
[INFO] [stdout] 147 |     pub fn dijkstra(&self, start: usize) -> Vec<Vec<HalfEdge>> {
[INFO] [stdout]     |                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_start`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DisjointSubsets` is never constructed
[INFO] [stdout]  --> src/disjoint_subsets.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct DisjointSubsets {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find_set`, and `union_sets` are never used
[INFO] [stdout]   --> src/disjoint_subsets.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl DisjointSubsets {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout] 9  |     pub fn new(size: usize) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     pub fn find_set(&mut self, elem: usize) -> usize {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     pub fn union_sets(&mut self, elem1: usize, elem2: usize) {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `total_weight`, `min_span_tree_kruskal`, and `dijkstra` are never used
[INFO] [stdout]    --> src/graph.rs:93:12
[INFO] [stdout]     |
[INFO] [stdout] 69  | impl Graph {
[INFO] [stdout]     | ---------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 93  |     pub fn total_weight(&self) -> usize {
[INFO] [stdout]     |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 130 |     pub fn min_span_tree_kruskal(&self) -> Self {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 147 |     pub fn dijkstra(&self, start: usize) -> Vec<Vec<HalfEdge>> {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `is_empty` are never used
[INFO] [stdout]   --> src/heap.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl<T, F: Fn(&T, &T) -> Ordering> MinHeap<T, F> {
[INFO] [stdout]    | ------------------------------------------------ associated items in this implementation
[INFO] [stdout] 10 |     pub fn new(cmp: F) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph1` is never used
[INFO] [stdout]  --> src/test.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn graph1() -> Graph {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph1_mst` is never used
[INFO] [stdout]   --> src/test.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn graph1_mst() -> Graph {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph_a` is never used
[INFO] [stdout]   --> src/test.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | pub fn graph_a() -> Graph {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph_b` is never used
[INFO] [stdout]   --> src/test.rs:76:8
[INFO] [stdout]    |
[INFO] [stdout] 76 | pub fn graph_b() -> Graph {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph_c` is never used
[INFO] [stdout]   --> src/test.rs:92:8
[INFO] [stdout]    |
[INFO] [stdout] 92 | pub fn graph_c() -> Graph {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph_d` is never used
[INFO] [stdout]    --> src/test.rs:107:8
[INFO] [stdout]     |
[INFO] [stdout] 107 | pub fn graph_d() -> Graph {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021
[INFO] [stdout]   --> src/heap.rs:12:19
[INFO] [stdout]    |
[INFO] [stdout] 10 |     pub fn new(cmp: F) -> Self {
[INFO] [stdout]    |                ------ these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 11 |         MinHeap {
[INFO] [stdout] 12 |             data: Vec::new(),
[INFO] [stdout]    |                   ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see issue #123739 <https://github.com/rust-lang/rust/issues/123739>
[INFO] [stdout]    = note: requested on the command line with `-D tail-expr-drop-order`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `dijkstra` is never used
[INFO] [stdout]    --> src/graph.rs:147:12
[INFO] [stdout]     |
[INFO] [stdout] 69  | impl Graph {
[INFO] [stdout]     | ---------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 147 |     pub fn dijkstra(&self, start: usize) -> Vec<Vec<HalfEdge>> {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `is_empty` are never used
[INFO] [stdout]   --> src/heap.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl<T, F: Fn(&T, &T) -> Ordering> MinHeap<T, F> {
[INFO] [stdout]    | ------------------------------------------------ associated items in this implementation
[INFO] [stdout] 10 |     pub fn new(cmp: F) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph1_mst` is never used
[INFO] [stdout]   --> src/test.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn graph1_mst() -> Graph {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph_a` is never used
[INFO] [stdout]   --> src/test.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | pub fn graph_a() -> Graph {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph_b` is never used
[INFO] [stdout]   --> src/test.rs:76:8
[INFO] [stdout]    |
[INFO] [stdout] 76 | pub fn graph_b() -> Graph {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: aborting due to 1 previous error; 11 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph_c` is never used
[INFO] [stdout]   --> src/test.rs:92:8
[INFO] [stdout]    |
[INFO] [stdout] 92 | pub fn graph_c() -> Graph {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `graph_d` is never used
[INFO] [stdout]    --> src/test.rs:107:8
[INFO] [stdout]     |
[INFO] [stdout] 107 | pub fn graph_d() -> Graph {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021
[INFO] [stdout]   --> src/heap.rs:12:19
[INFO] [stdout]    |
[INFO] [stdout] 10 |     pub fn new(cmp: F) -> Self {
[INFO] [stdout]    |                ------ these values have significant drop implementation and will observe changes in drop order under Edition 2024
[INFO] [stdout] 11 |         MinHeap {
[INFO] [stdout] 12 |             data: Vec::new(),
[INFO] [stdout]    |                   ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see issue #123739 <https://github.com/rust-lang/rust/issues/123739>
[INFO] [stdout]    = note: requested on the command line with `-D tail-expr-drop-order`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: aborting due to 1 previous error; 8 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `spanning_tree_and_shortest_path` (bin "spanning_tree_and_shortest_path") due to 2 previous errors; 11 warnings emitted
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stderr] error: could not compile `spanning_tree_and_shortest_path` (bin "spanning_tree_and_shortest_path" test) due to 2 previous errors; 8 warnings emitted
[INFO] running `Command { std: "docker" "inspect" "43d0f1e10914d59ac0c2cedd5dc3e87e15dcad0508ff4b805096bd98a1f79af1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "43d0f1e10914d59ac0c2cedd5dc3e87e15dcad0508ff4b805096bd98a1f79af1", kill_on_drop: false }`
[INFO] [stdout] 43d0f1e10914d59ac0c2cedd5dc3e87e15dcad0508ff4b805096bd98a1f79af1