[INFO] cloning repository https://github.com/CodingInGreen/algorithms
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/CodingInGreen/algorithms" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FCodingInGreen%2Falgorithms", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FCodingInGreen%2Falgorithms'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 564c150ffa60f9af7cc7d5e43a3e3403ac96480d
[INFO] testing CodingInGreen/algorithms against try#9f93af291970322f4f1c6315ccde4d7078201159 for pr-146098-6
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FCodingInGreen%2Falgorithms" "/workspace/builds/worker-7-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/CodingInGreen/algorithms
[INFO] finished tweaking git repo https://github.com/CodingInGreen/algorithms
[INFO] tweaked toml for git repo https://github.com/CodingInGreen/algorithms written to /workspace/builds/worker-7-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/CodingInGreen/algorithms on toolchain 9f93af291970322f4f1c6315ccde4d7078201159
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+9f93af291970322f4f1c6315ccde4d7078201159" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/CodingInGreen/algorithms 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" "+9f93af291970322f4f1c6315ccde4d7078201159" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+9f93af291970322f4f1c6315ccde4d7078201159" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 67f97aada05e7207c4a1cab27bbdf0dd7acf0666f49775b5271014d626c2e115
[INFO] running `Command { std: "docker" "start" "-a" "67f97aada05e7207c4a1cab27bbdf0dd7acf0666f49775b5271014d626c2e115", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "67f97aada05e7207c4a1cab27bbdf0dd7acf0666f49775b5271014d626c2e115", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "67f97aada05e7207c4a1cab27bbdf0dd7acf0666f49775b5271014d626c2e115", kill_on_drop: false }`
[INFO] [stdout] 67f97aada05e7207c4a1cab27bbdf0dd7acf0666f49775b5271014d626c2e115
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+9f93af291970322f4f1c6315ccde4d7078201159" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 9712e839648a753c335f0c1dfec3ea053929a05676f75d9fa35fb63439a398f8
[INFO] running `Command { std: "docker" "start" "-a" "9712e839648a753c335f0c1dfec3ea053929a05676f75d9fa35fb63439a398f8", kill_on_drop: false }`
[INFO] [stderr]    Compiling algorithms v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::collections::VecDeque`
[INFO] [stdout]   --> bin/100_same_tree.rs:10:5
[INFO] [stdout]    |
[INFO] [stdout] 10 | use std::collections::VecDeque;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0601]: `main` function not found in crate `100_same_tree`
[INFO] [stdout]    --> bin/100_same_tree.rs:104:2
[INFO] [stdout]     |
[INFO] [stdout] 104 | }
[INFO] [stdout]     |  ^ consider adding a `main` function to `bin/100_same_tree.rs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0601`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `algorithms` (bin "100_same_tree") due to 1 previous error; 1 warning emitted
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stdout] error[E0601]: `main` function not found in crate `269_alien_dictionary`
[INFO] [stdout]    --> bin/269_alien_dictionary.rs:116:2
[INFO] [stdout]     |
[INFO] [stdout] 116 | }
[INFO] [stdout]     |  ^ consider adding a `main` function to `bin/269_alien_dictionary.rs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0601`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `algorithms` (bin "269_alien_dictionary") due to 1 previous error
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]   --> bin/155_min_stack.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct MinStack {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/102_binary_tree_level_order_traversal.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | struct Solution;
[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 `level_order` is never used
[INFO] [stdout]   --> bin/102_binary_tree_level_order_traversal.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_tree` is never used
[INFO] [stdout]   --> bin/102_binary_tree_level_order_traversal.rs:65:4
[INFO] [stdout]    |
[INFO] [stdout] 65 | fn build_tree(values: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/153_find_minimum_in_rotated_sorted_array.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | struct Solution;
[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 `find_min` is never used
[INFO] [stdout]   --> bin/153_find_minimum_in_rotated_sorted_array.rs:21:12
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> bin/155_min_stack.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 26 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn top(&self) -> Option<i32> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn get_min(&self) -> Option<i32> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/424_longest_repeating_character_replacement.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Solution;
[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 `character_replacement` is never used
[INFO] [stdout]   --> bin/424_longest_repeating_character_replacement.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn character_replacement(s: String, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> bin/3_longest_substring_without_repeating_characters.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Solution;
[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 `length_of_longest_substring` is never used
[INFO] [stdout]  --> bin/3_longest_substring_without_repeating_characters.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> bin/19_remove_node_from_end_of_linked_list.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 17 |     fn new(val: i32) -> ListLink {
[INFO] [stdout]    |        ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/19_remove_node_from_end_of_linked_list.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]   --> bin/19_remove_node_from_end_of_linked_list.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     fn remove_nth_from_end(mut head: ListLink, n: i32) -> ListLink {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0601]: `main` function not found in crate `141_linked_list_cycles`
[INFO] [stdout]   --> bin/141_linked_list_cycles.rs:87:2
[INFO] [stdout]    |
[INFO] [stdout] 87 | }
[INFO] [stdout]    |  ^ consider adding a `main` function to `bin/141_linked_list_cycles.rs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> bin/15_3sum.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Solution;
[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 `three_sum` is never used
[INFO] [stdout]   --> bin/15_3sum.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0601]: `main` function not found in crate `235_lowest_common_ancestor_of_a_binary_search_tree`
[INFO] [stdout]    --> bin/235_lowest_common_ancestor_of_a_binary_search_tree.rs:130:2
[INFO] [stdout]     |
[INFO] [stdout] 130 | }
[INFO] [stdout]     |  ^ consider adding a `main` function to `bin/235_lowest_common_ancestor_of_a_binary_search_tree.rs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0601`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `algorithms` (bin "141_linked_list_cycles") due to 1 previous error
[INFO] [stdout] warning: function `is_alphanumeric` is never used
[INFO] [stdout]   --> bin/125_valid_palindrome.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn is_alphanumeric(c: char) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `to_lowercase` is never used
[INFO] [stdout]   --> bin/125_valid_palindrome.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn to_lowercase(c: char) -> char {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]   --> bin/125_valid_palindrome.rs:32:4
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn is_palindrome(s: &str) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> bin/11_container_with_most_water.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Solution;
[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 `max_area` is never used
[INFO] [stdout]   --> bin/11_container_with_most_water.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_tree` is never used
[INFO] [stdout]   --> bin/124_binary_tree_maximum_path_sum.rs:62:4
[INFO] [stdout]    |
[INFO] [stdout] 62 | fn build_tree(values: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] For more information about this error, try `rustc --explain E0601`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `algorithms` (bin "235_lowest_common_ancestor_of_a_binary_search_tree") due to 1 previous error
[INFO] running `Command { std: "docker" "inspect" "9712e839648a753c335f0c1dfec3ea053929a05676f75d9fa35fb63439a398f8", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "9712e839648a753c335f0c1dfec3ea053929a05676f75d9fa35fb63439a398f8", kill_on_drop: false }`
[INFO] [stdout] 9712e839648a753c335f0c1dfec3ea053929a05676f75d9fa35fb63439a398f8
