[INFO] cloning repository https://github.com/elamaranae/grind-rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/elamaranae/grind-rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Felamaranae%2Fgrind-rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Felamaranae%2Fgrind-rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] ba6e693c3916c9609d6e1e39d7e702cf849f7a51
[INFO] testing elamaranae/grind-rs against try#0936b3db0ae648ba2d5b60eb08cf4faf2ddab0c6 for pr-137122-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Felamaranae%2Fgrind-rs" "/workspace/builds/worker-6-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/elamaranae/grind-rs
[INFO] finished tweaking git repo https://github.com/elamaranae/grind-rs
[INFO] tweaked toml for git repo https://github.com/elamaranae/grind-rs written to /workspace/builds/worker-6-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/elamaranae/grind-rs on toolchain 0936b3db0ae648ba2d5b60eb08cf4faf2ddab0c6
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0936b3db0ae648ba2d5b60eb08cf4faf2ddab0c6" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/elamaranae/grind-rs 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" "+0936b3db0ae648ba2d5b60eb08cf4faf2ddab0c6" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+0936b3db0ae648ba2d5b60eb08cf4faf2ddab0c6" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] cb07289784f9f233512224a66089021366f0017c6fbfff7aefdc8abf09648b3e
[INFO] running `Command { std: "docker" "start" "-a" "cb07289784f9f233512224a66089021366f0017c6fbfff7aefdc8abf09648b3e", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "cb07289784f9f233512224a66089021366f0017c6fbfff7aefdc8abf09648b3e", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "cb07289784f9f233512224a66089021366f0017c6fbfff7aefdc8abf09648b3e", kill_on_drop: false }`
[INFO] [stdout] cb07289784f9f233512224a66089021366f0017c6fbfff7aefdc8abf09648b3e
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-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" "-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+0936b3db0ae648ba2d5b60eb08cf4faf2ddab0c6" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 751482c39f460d4ed46d456d1215fa6f228597d76900483b5ae4ca1c22f3309b
[INFO] running `Command { std: "docker" "start" "-a" "751482c39f460d4ed46d456d1215fa6f228597d76900483b5ae4ca1c22f3309b", kill_on_drop: false }`
[INFO] [stderr]    Compiling grind v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unreachable statement
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:71:9
[INFO] [stdout]    |
[INFO] [stdout] 53 | /         loop {
[INFO] [stdout] 54 | |             let next_p = current_node.next_step_to_find(p);
[INFO] [stdout] 55 | |             let next_q = current_node.next_step_to_find(q);
[INFO] [stdout] ...  |
[INFO] [stdout] 69 | |         }
[INFO] [stdout]    | |_________- any code following this expression is unreachable
[INFO] [stdout] 70 |
[INFO] [stdout] 71 |           return 0;
[INFO] [stdout]    |           ^^^^^^^^^ unreachable statement
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unreachable_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `from_array` is never used
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl List {
[INFO] [stdout]    | --------- associated function in this implementation
[INFO] [stdout] 22 |     fn from_array(arr: &[i32]) -> Self {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Node {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:19:6
[INFO] [stdout]    |
[INFO] [stdout] 19 | type Link = Option<Rc<RefCell<Node>>>;
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `List` is never constructed
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct List {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `has_cycle` are never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl List {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 27 |     fn new(arr: &[i32], close: Option<u32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn has_cycle(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/tree/invert_binary.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct TreeNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Link` is never constructed
[INFO] [stdout]   --> src/tree/invert_binary.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Link(Option<Rc<RefCell<TreeNode>>>);
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryTree` is never constructed
[INFO] [stdout]   --> src/tree/invert_binary.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct BinaryTree {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `create_node`, and `invert` are never used
[INFO] [stdout]   --> src/tree/invert_binary.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl BinaryTree {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 21 |     fn new(arr: &[i32]) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn create_node(position: usize, arr: &[i32]) -> Link {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn invert(&mut self) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `invert` is never used
[INFO] [stdout]   --> src/tree/invert_binary.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | impl Link {
[INFO] [stdout]    | --------- method in this implementation
[INFO] [stdout] 45 |     fn invert(&mut self) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct TreeNode {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Link` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Link(Option<Rc<RefCell<TreeNode>>>);
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryTree` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct BinaryTree {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Direction` is never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:25:6
[INFO] [stdout]    |
[INFO] [stdout] 25 | enum Direction {
[INFO] [stdout]    |      ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `create_node`, and `run` are never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl BinaryTree {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 32 |     fn new(arr: &[Option<i32>]) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn create_node(position: usize, arr: &[Option<i32>]) -> Link {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn run(&self, p: i32, q: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `next_step_to_find` is never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:76:8
[INFO] [stdout]    |
[INFO] [stdout] 75 | impl Link {
[INFO] [stdout]    | --------- method in this implementation
[INFO] [stdout] 76 |     fn next_step_to_find(&self, p: i32) -> Direction {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.26s
[INFO] running `Command { std: "docker" "inspect" "751482c39f460d4ed46d456d1215fa6f228597d76900483b5ae4ca1c22f3309b", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "751482c39f460d4ed46d456d1215fa6f228597d76900483b5ae4ca1c22f3309b", kill_on_drop: false }`
[INFO] [stdout] 751482c39f460d4ed46d456d1215fa6f228597d76900483b5ae4ca1c22f3309b
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-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" "-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+0936b3db0ae648ba2d5b60eb08cf4faf2ddab0c6" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] f59de6a3709a05e25a01a5b031dd26c13421427c06a54becf7a31d6b178806bf
[INFO] running `Command { std: "docker" "start" "-a" "f59de6a3709a05e25a01a5b031dd26c13421427c06a54becf7a31d6b178806bf", kill_on_drop: false }`
[INFO] [stderr]    Compiling grind v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unreachable statement
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:71:9
[INFO] [stdout]    |
[INFO] [stdout] 53 | /         loop {
[INFO] [stdout] 54 | |             let next_p = current_node.next_step_to_find(p);
[INFO] [stdout] 55 | |             let next_q = current_node.next_step_to_find(q);
[INFO] [stdout] ...  |
[INFO] [stdout] 69 | |         }
[INFO] [stdout]    | |_________- any code following this expression is unreachable
[INFO] [stdout] 70 |
[INFO] [stdout] 71 |           return 0;
[INFO] [stdout]    |           ^^^^^^^^^ unreachable statement
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unreachable_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `from_array` is never used
[INFO] [stdout]   --> src/linked_list/merge_two_sorted_lists.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl List {
[INFO] [stdout]    | --------- associated function in this implementation
[INFO] [stdout] 22 |     fn from_array(arr: &[i32]) -> Self {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Node {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:19:6
[INFO] [stdout]    |
[INFO] [stdout] 19 | type Link = Option<Rc<RefCell<Node>>>;
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `List` is never constructed
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct List {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `has_cycle` are never used
[INFO] [stdout]   --> src/linked_list/linked_list_cycle.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl List {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 27 |     fn new(arr: &[i32], close: Option<u32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn has_cycle(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/tree/invert_binary.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct TreeNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Link` is never constructed
[INFO] [stdout]   --> src/tree/invert_binary.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Link(Option<Rc<RefCell<TreeNode>>>);
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryTree` is never constructed
[INFO] [stdout]   --> src/tree/invert_binary.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct BinaryTree {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `create_node`, and `invert` are never used
[INFO] [stdout]   --> src/tree/invert_binary.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl BinaryTree {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 21 |     fn new(arr: &[i32]) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn create_node(position: usize, arr: &[i32]) -> Link {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn invert(&mut self) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `invert` is never used
[INFO] [stdout]   --> src/tree/invert_binary.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | impl Link {
[INFO] [stdout]    | --------- method in this implementation
[INFO] [stdout] 45 |     fn invert(&mut self) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct TreeNode {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Link` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | struct Link(Option<Rc<RefCell<TreeNode>>>);
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinaryTree` is never constructed
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct BinaryTree {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Direction` is never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:25:6
[INFO] [stdout]    |
[INFO] [stdout] 25 | enum Direction {
[INFO] [stdout]    |      ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `create_node`, and `run` are never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl BinaryTree {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 32 |     fn new(arr: &[Option<i32>]) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn create_node(position: usize, arr: &[Option<i32>]) -> Link {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn run(&self, p: i32, q: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `next_step_to_find` is never used
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:76:8
[INFO] [stdout]    |
[INFO] [stdout] 75 | impl Link {
[INFO] [stdout]    | --------- method in this implementation
[INFO] [stdout] 76 |     fn next_step_to_find(&self, p: i32) -> Direction {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable statement
[INFO] [stdout]   --> src/tree/lowest_common_ancestor.rs:71:9
[INFO] [stdout]    |
[INFO] [stdout] 53 | /         loop {
[INFO] [stdout] 54 | |             let next_p = current_node.next_step_to_find(p);
[INFO] [stdout] 55 | |             let next_q = current_node.next_step_to_find(q);
[INFO] [stdout] ...  |
[INFO] [stdout] 69 | |         }
[INFO] [stdout]    | |_________- any code following this expression is unreachable
[INFO] [stdout] 70 |
[INFO] [stdout] 71 |           return 0;
[INFO] [stdout]    |           ^^^^^^^^^ unreachable statement
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unreachable_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `arr_2`
[INFO] [stdout]    --> src/tree/lowest_common_ancestor.rs:122:9
[INFO] [stdout]     |
[INFO] [stdout] 122 |     let arr_2 = [
[INFO] [stdout]     |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_arr_2`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.48s
[INFO] running `Command { std: "docker" "inspect" "f59de6a3709a05e25a01a5b031dd26c13421427c06a54becf7a31d6b178806bf", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f59de6a3709a05e25a01a5b031dd26c13421427c06a54becf7a31d6b178806bf", kill_on_drop: false }`
[INFO] [stdout] f59de6a3709a05e25a01a5b031dd26c13421427c06a54becf7a31d6b178806bf
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-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" "-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+0936b3db0ae648ba2d5b60eb08cf4faf2ddab0c6" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] ac868c5d4698b704019f1ecd644dc02ed254deaf03366ed51dc67e258171817a
[INFO] running `Command { std: "docker" "start" "-a" "ac868c5d4698b704019f1ecd644dc02ed254deaf03366ed51dc67e258171817a", kill_on_drop: false }`
[INFO] [stderr] warning: unreachable statement
[INFO] [stderr]   --> src/tree/lowest_common_ancestor.rs:71:9
[INFO] [stderr]    |
[INFO] [stderr] 53 | /         loop {
[INFO] [stderr] 54 | |             let next_p = current_node.next_step_to_find(p);
[INFO] [stderr] 55 | |             let next_q = current_node.next_step_to_find(q);
[INFO] [stderr] ...  |
[INFO] [stderr] 69 | |         }
[INFO] [stderr]    | |_________- any code following this expression is unreachable
[INFO] [stderr] 70 |
[INFO] [stderr] 71 |           return 0;
[INFO] [stderr]    |           ^^^^^^^^^ unreachable statement
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unreachable_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `from_array` is never used
[INFO] [stderr]   --> src/linked_list/merge_two_sorted_lists.rs:22:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | impl List {
[INFO] [stderr]    | --------- associated function in this implementation
[INFO] [stderr] 22 |     fn from_array(arr: &[i32]) -> Self {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Node` is never constructed
[INFO] [stderr]   --> src/linked_list/linked_list_cycle.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | struct Node {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Link` is never used
[INFO] [stderr]   --> src/linked_list/linked_list_cycle.rs:19:6
[INFO] [stderr]    |
[INFO] [stderr] 19 | type Link = Option<Rc<RefCell<Node>>>;
[INFO] [stderr]    |      ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `List` is never constructed
[INFO] [stderr]   --> src/linked_list/linked_list_cycle.rs:22:8
[INFO] [stderr]    |
[INFO] [stderr] 22 | struct List {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new` and `has_cycle` are never used
[INFO] [stderr]   --> src/linked_list/linked_list_cycle.rs:27:8
[INFO] [stderr]    |
[INFO] [stderr] 26 | impl List {
[INFO] [stderr]    | --------- associated items in this implementation
[INFO] [stderr] 27 |     fn new(arr: &[i32], close: Option<u32>) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 54 |     fn has_cycle(&self) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/tree/invert_binary.rs:6:8
[INFO] [stderr]   |
[INFO] [stderr] 6 | struct TreeNode {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Link` is never constructed
[INFO] [stderr]   --> src/tree/invert_binary.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | struct Link(Option<Rc<RefCell<TreeNode>>>);
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `BinaryTree` is never constructed
[INFO] [stderr]   --> src/tree/invert_binary.rs:16:8
[INFO] [stderr]    |
[INFO] [stderr] 16 | struct BinaryTree {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `create_node`, and `invert` are never used
[INFO] [stderr]   --> src/tree/invert_binary.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 20 | impl BinaryTree {
[INFO] [stderr]    | --------------- associated items in this implementation
[INFO] [stderr] 21 |     fn new(arr: &[i32]) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 27 |     fn create_node(position: usize, arr: &[i32]) -> Link {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 39 |     fn invert(&mut self) {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `invert` is never used
[INFO] [stderr]   --> src/tree/invert_binary.rs:45:8
[INFO] [stderr]    |
[INFO] [stderr] 44 | impl Link {
[INFO] [stderr]    | --------- method in this implementation
[INFO] [stderr] 45 |     fn invert(&mut self) {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]   --> src/tree/lowest_common_ancestor.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | struct TreeNode {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Link` is never constructed
[INFO] [stderr]   --> src/tree/lowest_common_ancestor.rs:17:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | struct Link(Option<Rc<RefCell<TreeNode>>>);
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `BinaryTree` is never constructed
[INFO] [stderr]   --> src/tree/lowest_common_ancestor.rs:20:8
[INFO] [stderr]    |
[INFO] [stderr] 20 | struct BinaryTree {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: enum `Direction` is never used
[INFO] [stderr]   --> src/tree/lowest_common_ancestor.rs:25:6
[INFO] [stderr]    |
[INFO] [stderr] 25 | enum Direction {
[INFO] [stderr]    |      ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `create_node`, and `run` are never used
[INFO] [stderr]   --> src/tree/lowest_common_ancestor.rs:32:8
[INFO] [stderr]    |
[INFO] [stderr] 31 | impl BinaryTree {
[INFO] [stderr]    | --------------- associated items in this implementation
[INFO] [stderr] 32 |     fn new(arr: &[Option<i32>]) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 38 |     fn create_node(position: usize, arr: &[Option<i32>]) -> Link {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 50 |     fn run(&self, p: i32, q: i32) -> i32 {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `next_step_to_find` is never used
[INFO] [stderr]   --> src/tree/lowest_common_ancestor.rs:76:8
[INFO] [stderr]    |
[INFO] [stderr] 75 | impl Link {
[INFO] [stderr]    | --------- method in this implementation
[INFO] [stderr] 76 |     fn next_step_to_find(&self, p: i32) -> Direction {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `grind` (lib) generated 17 warnings
[INFO] [stderr] warning: unused variable: `arr_2`
[INFO] [stderr]    --> src/tree/lowest_common_ancestor.rs:122:9
[INFO] [stderr]     |
[INFO] [stderr] 122 |     let arr_2 = [
[INFO] [stderr]     |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_arr_2`
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: `grind` (lib test) generated 2 warnings (1 duplicate)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.03s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/grind-76c17849b095e34f)
[INFO] [stdout] 
[INFO] [stdout] running 54 tests
[INFO] [stdout] test array::binary_search::case_0 ... ok
[INFO] [stdout] test array::best_time_to_buy_and_sell_stock::case_0 ... ok
[INFO] [stdout] test array::binary_search::case_2 ... ok
[INFO] [stdout] test array::best_time_to_buy_and_sell_stock::case_1 ... ok
[INFO] [stdout] test array::flood_fill::case_1 ... ok
[INFO] [stdout] test array::flood_fill::case_0 ... ok
[INFO] [stdout] test array::binary_search::case_1 ... ok
[INFO] [stdout] test array::insert_interval::case_0 ... ok
[INFO] [stdout] test array::insert_interval::case_1 ... ok
[INFO] [stdout] test array::insert_interval::case_2 ... ok
[INFO] [stdout] test array::maximum_subarray::case_0 ... ok
[INFO] [stdout] test array::maximum_subarray::case_1 ... ok
[INFO] [stdout] test array::maximum_subarray::case_2 ... ok
[INFO] [stdout] test array::maximum_subarray::case_3 ... ok
[INFO] [stdout] test array::two_sum::case_0 ... ok
[INFO] [stdout] test array::two_sum::case_1 ... ok
[INFO] [stdout] test array::two_sum::case_2 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_0 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_1 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_10 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_11 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_12 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_14 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_13 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_2 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_8 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_3 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_5 ... ok
[INFO] [stdout] test linked_list::merge_two_sorted_lists::case_1 ... ok
[INFO] [stdout] test linked_list::merge_two_sorted_lists::case_2 ... ok
[INFO] [stdout] test string::anagram::case_1 ... ok
[INFO] [stdout] test string::anagram::case_3 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_7 ... ok
[INFO] [stdout] test string::valid_palindrome::case_0 ... ok
[INFO] [stdout] test string::valid_palindrome::case_1 ... ok
[INFO] [stdout] test string::valid_palindrome::case_2 ... ok
[INFO] [stdout] test string::valid_palindrome::case_3 ... ok
[INFO] [stdout] test stack::valid_parentheses::case_1 ... ok
[INFO] [stdout] test stack::valid_parentheses::case_0 ... ok
[INFO] [stdout] test linked_list::merge_two_sorted_lists::case_3 ... ok
[INFO] [stdout] test string::anagram::case_0 ... ok
[INFO] [stdout] test tree::invert_binary::case_1 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_6 ... ok
[INFO] [stdout] test tree::invert_binary::case_0 ... ok
[INFO] [stdout] test tree::invert_binary::case_3 ... ok
[INFO] [stdout] test tree::invert_binary::case_4 ... ok
[INFO] [stdout] test tree::lowest_common_ancestor::case_0 ... ok
[INFO] [stdout] test tree::lowest_common_ancestor::case_1 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_4 ... ok
[INFO] [stdout] test linked_list::linked_list_cycle::case_9 ... ok
[INFO] [stdout] test linked_list::merge_two_sorted_lists::case_0 ... ok
[INFO] [stdout] test tree::lowest_common_ancestor::case_3 ... ok
[INFO] [stderr]    Doc-tests grind
[INFO] [stdout] test tree::invert_binary::case_2 ... ok
[INFO] [stdout] test tree::lowest_common_ancestor::case_2 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 54 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "ac868c5d4698b704019f1ecd644dc02ed254deaf03366ed51dc67e258171817a", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "ac868c5d4698b704019f1ecd644dc02ed254deaf03366ed51dc67e258171817a", kill_on_drop: false }`
[INFO] [stdout] ac868c5d4698b704019f1ecd644dc02ed254deaf03366ed51dc67e258171817a