[INFO] updating cached repository kper/complib
[INFO] running `"git" "fetch" "--all"`
[INFO] [stdout] Fetching origin
[INFO] [stderr] From git://github.com/kper/complib
[INFO] [stderr]  * branch            HEAD       -> FETCH_HEAD
[INFO] running `"git" "clone" "work/cache/sources/gh/kper/complib" "work/ex/pr-63376/sources/master#60960a260f7b5c695fd0717311d72ce62dd4eb43/gh/kper/complib"`
[INFO] [stderr] Cloning into 'work/ex/pr-63376/sources/master#60960a260f7b5c695fd0717311d72ce62dd4eb43/gh/kper/complib'...
[INFO] [stderr] done.
[INFO] running `"git" "clone" "work/cache/sources/gh/kper/complib" "work/ex/pr-63376/sources/try#266783e4e09e4e9d5307c1c8e695659c58bbcac7/gh/kper/complib"`
[INFO] [stderr] Cloning into 'work/ex/pr-63376/sources/try#266783e4e09e4e9d5307c1c8e695659c58bbcac7/gh/kper/complib'...
[INFO] [stderr] done.
[INFO] running `"git" "rev-parse" "HEAD"`
[INFO] [stdout] c3a1c128a125a98639e7fc1711c50f135f4f87bf
[INFO] sha for GitHub repo kper/complib: c3a1c128a125a98639e7fc1711c50f135f4f87bf
[INFO] validating manifest of kper/complib on toolchain master#60960a260f7b5c695fd0717311d72ce62dd4eb43
[INFO] running `"/mnt/big/crater/work/local/cargo-home/bin/cargo" "+60960a260f7b5c695fd0717311d72ce62dd4eb43-alt" "read-manifest" "--manifest-path" "Cargo.toml"`
[INFO] validating manifest of kper/complib on toolchain try#266783e4e09e4e9d5307c1c8e695659c58bbcac7
[INFO] running `"/mnt/big/crater/work/local/cargo-home/bin/cargo" "+266783e4e09e4e9d5307c1c8e695659c58bbcac7-alt" "read-manifest" "--manifest-path" "Cargo.toml"`
[INFO] started frobbing kper/complib
[INFO] finished frobbing kper/complib
[INFO] frobbed toml for kper/complib written to work/ex/pr-63376/sources/master#60960a260f7b5c695fd0717311d72ce62dd4eb43/gh/kper/complib/Cargo.toml
[INFO] started frobbing kper/complib
[INFO] finished frobbing kper/complib
[INFO] frobbed toml for kper/complib written to work/ex/pr-63376/sources/try#266783e4e09e4e9d5307c1c8e695659c58bbcac7/gh/kper/complib/Cargo.toml
[INFO] crate kper/complib already has a lockfile, it will not be regenerated
[INFO] running `"/mnt/big/crater/work/local/cargo-home/bin/cargo" "+60960a260f7b5c695fd0717311d72ce62dd4eb43-alt" "fetch" "--locked" "--manifest-path" "Cargo.toml"`
[INFO] running `"/mnt/big/crater/work/local/cargo-home/bin/cargo" "+266783e4e09e4e9d5307c1c8e695659c58bbcac7-alt" "fetch" "--locked" "--manifest-path" "Cargo.toml"`
[INFO] checking kper/complib against try#266783e4e09e4e9d5307c1c8e695659c58bbcac7 for pr-63376
[INFO] running `"docker" "create" "-v" "/mnt/big/crater/work/local/target-dirs/pr-63376/worker-0/try#266783e4e09e4e9d5307c1c8e695659c58bbcac7:/opt/crater/target:rw,Z" "-v" "/mnt/big/crater/work/ex/pr-63376/sources/try#266783e4e09e4e9d5307c1c8e695659c58bbcac7/gh/kper/complib:/opt/crater/workdir:ro,Z" "-v" "/mnt/big/crater/work/local/cargo-home:/opt/crater/cargo-home:ro,Z" "-v" "/mnt/big/crater/work/local/rustup-home:/opt/crater/rustup-home:ro,Z" "-e" "USER_ID=1000" "-e" "SOURCE_DIR=/opt/crater/workdir" "-e" "MAP_USER_ID=1000" "-e" "CARGO_TARGET_DIR=/opt/crater/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/crater/cargo-home" "-e" "RUSTUP_HOME=/opt/crater/rustup-home" "-w" "/opt/crater/workdir" "-m" "1536M" "--network" "none" "rustops/crates-build-env" "/opt/crater/cargo-home/bin/cargo" "+266783e4e09e4e9d5307c1c8e695659c58bbcac7-alt" "check" "--frozen" "--all" "--all-targets"`
[INFO] [stdout] 9c507b551bdcf27b29a297627d72d2659331b134df3eb81b7269c02f262aed9b
[INFO] running `"docker" "start" "-a" "9c507b551bdcf27b29a297627d72d2659331b134df3eb81b7269c02f262aed9b"`
[INFO] [stderr]     Checking approx v0.3.1
[INFO] [stderr]     Checking rand v0.6.5
[INFO] [stderr]     Checking alga v0.8.1
[INFO] [stderr]     Checking nalgebra v0.17.0
[INFO] [stderr] warning[E0502]: cannot borrow `*self` as immutable because it is also borrowed as mutable
[INFO] [stderr]    --> /opt/crater/cargo-home/registry/src/github.com-1ecc6299db9ec823/nalgebra-0.17.0/src/base/cg.rs:297:44
[INFO] [stderr]     |
[INFO] [stderr] 297 |                 self[(j, i)] += shift[j] * self[(D::dim() - 1, i)];
[INFO] [stderr]     |                 ---------------------------^^^^-------------------
[INFO] [stderr]     |                 |                          |
[INFO] [stderr]     |                 |                          immutable borrow occurs here
[INFO] [stderr]     |                 mutable borrow occurs here
[INFO] [stderr]     |                 mutable borrow later used here
[INFO] [stderr]     |
[INFO] [stderr]     = warning: this error has been downgraded to a warning for backwards compatibility with previous releases
[INFO] [stderr]     = warning: this represents potential undefined behavior in your code and this warning will become a hard error in the future
[INFO] [stderr]     = note: for more information, try `rustc --explain E0729`
[INFO] [stderr] 
[INFO] [stderr]     Checking complib v0.1.0 (/opt/crater/workdir)
[INFO] [stderr] warning: unused import: `crate::btree::BinaryTree`
[INFO] [stderr]  --> src/segtree.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use crate::btree::BinaryTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::cmp::Ordering`
[INFO] [stderr]  --> src/segtree.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::cmp::Ordering;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around pattern
[INFO] [stderr]   --> src/segtree.rs:12:45
[INFO] [stderr]    |
[INFO] [stderr] 12 |         let leafs = values.into_iter().map(|(w)| SegmentTree::Leaf(w)).enumerate().collect::<Vec<_>>();
[INFO] [stderr]    |                                             ^^^ help: remove these parentheses
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::*`
[INFO] [stderr]  --> src/btree2.rs:8:9
[INFO] [stderr]   |
[INFO] [stderr] 8 |     use super::*;
[INFO] [stderr]   |         ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `crate::btree::BinaryTree`
[INFO] [stderr]  --> src/segtree.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use crate::btree::BinaryTree;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::cmp::Ordering`
[INFO] [stderr]  --> src/segtree.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::cmp::Ordering;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unnecessary parentheses around pattern
[INFO] [stderr]   --> src/segtree.rs:12:45
[INFO] [stderr]    |
[INFO] [stderr] 12 |         let leafs = values.into_iter().map(|(w)| SegmentTree::Leaf(w)).enumerate().collect::<Vec<_>>();
[INFO] [stderr]    |                                             ^^^ help: remove these parentheses
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::iter::Iterator`
[INFO] [stderr]  --> src/btree.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::iter::Iterator;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `i`
[INFO] [stderr]   --> src/graph.rs:58:46
[INFO] [stderr]    |
[INFO] [stderr] 58 |         included.iter().enumerate().filter(|(i, w)| **w == false)
[INFO] [stderr]    |                                              ^ help: consider prefixing with an underscore: `_i`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `shortest_distance`
[INFO] [stderr]   --> src/graph.rs:57:20
[INFO] [stderr]    |
[INFO] [stderr] 57 |     fn minDistance(shortest_distance: &Vec<isize>, included: &Vec<bool>) -> usize {
[INFO] [stderr]    |                    ^^^^^^^^^^^^^^^^^ help: consider prefixing with an underscore: `_shortest_distance`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `i`
[INFO] [stderr]   --> src/graph.rs:74:13
[INFO] [stderr]    |
[INFO] [stderr] 74 |         for i in 0..size {
[INFO] [stderr]    |             ^ help: consider prefixing with an underscore: `_i`
[INFO] [stderr] 
[INFO] [stderr] warning: associated constant `capacity` should have an upper case name
[INFO] [stderr]   --> src/adj.rs:12:11
[INFO] [stderr]    |
[INFO] [stderr] 12 |     const capacity: usize = 1;
[INFO] [stderr]    |           ^^^^^^^^ help: convert the identifier to upper case: `CAPACITY`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(non_upper_case_globals)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method `minDistance` should have a snake case name
[INFO] [stderr]   --> src/graph.rs:57:8
[INFO] [stderr]    |
[INFO] [stderr] 57 |     fn minDistance(shortest_distance: &Vec<isize>, included: &Vec<bool>) -> usize {
[INFO] [stderr]    |        ^^^^^^^^^^^ help: convert the identifier to snake case: `min_distance`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(non_snake_case)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable `isIncluded` should have a snake case name
[INFO] [stderr]   --> src/graph.rs:80:21
[INFO] [stderr]    |
[INFO] [stderr] 80 |                 let isIncluded = *included.get(j).unwrap() == true;
[INFO] [stderr]    |                     ^^^^^^^^^^ help: convert the identifier to snake case: `is_included`
[INFO] [stderr] 
[INFO] [stderr] warning: structure field `isEnd` should have a snake case name
[INFO] [stderr]  --> src/trie.rs:8:5
[INFO] [stderr]   |
[INFO] [stderr] 8 |     isEnd: bool
[INFO] [stderr]   |     ^^^^^ help: convert the identifier to snake case: `is_end`
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::iter::Iterator`
[INFO] [stderr]  --> src/btree.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::iter::Iterator;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `i`
[INFO] [stderr]   --> src/graph.rs:58:46
[INFO] [stderr]    |
[INFO] [stderr] 58 |         included.iter().enumerate().filter(|(i, w)| **w == false)
[INFO] [stderr]    |                                              ^ help: consider prefixing with an underscore: `_i`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `shortest_distance`
[INFO] [stderr]   --> src/graph.rs:57:20
[INFO] [stderr]    |
[INFO] [stderr] 57 |     fn minDistance(shortest_distance: &Vec<isize>, included: &Vec<bool>) -> usize {
[INFO] [stderr]    |                    ^^^^^^^^^^^^^^^^^ help: consider prefixing with an underscore: `_shortest_distance`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `i`
[INFO] [stderr]   --> src/graph.rs:74:13
[INFO] [stderr]    |
[INFO] [stderr] 74 |         for i in 0..size {
[INFO] [stderr]    |             ^ help: consider prefixing with an underscore: `_i`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `r`
[INFO] [stderr]    --> src/btree.rs:113:17
[INFO] [stderr]     |
[INFO] [stderr] 113 |             let r = tree.root.clone().unwrap();
[INFO] [stderr]     |                 ^ help: consider prefixing with an underscore: `_r`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]    --> src/map.rs:280:13
[INFO] [stderr]     |
[INFO] [stderr] 280 |         let mut map = setup();
[INFO] [stderr]     |             ----^^^
[INFO] [stderr]     |             |
[INFO] [stderr]     |             help: remove this `mut`
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(unused_mut)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: constant `height` should have an upper case name
[INFO] [stderr]    --> src/map.rs:271:11
[INFO] [stderr]     |
[INFO] [stderr] 271 |     const height : usize = 10;
[INFO] [stderr]     |           ^^^^^^ help: convert the identifier to upper case: `HEIGHT`
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(non_upper_case_globals)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: constant `width` should have an upper case name
[INFO] [stderr]    --> src/map.rs:272:11
[INFO] [stderr]     |
[INFO] [stderr] 272 |     const width: usize = 10;
[INFO] [stderr]     |           ^^^^^ help: convert the identifier to upper case: `WIDTH`
[INFO] [stderr] 
[INFO] [stderr] warning: associated constant `capacity` should have an upper case name
[INFO] [stderr]   --> src/adj.rs:12:11
[INFO] [stderr]    |
[INFO] [stderr] 12 |     const capacity: usize = 1;
[INFO] [stderr]    |           ^^^^^^^^ help: convert the identifier to upper case: `CAPACITY`
[INFO] [stderr] 
[INFO] [stderr] warning: method `minDistance` should have a snake case name
[INFO] [stderr]   --> src/graph.rs:57:8
[INFO] [stderr]    |
[INFO] [stderr] 57 |     fn minDistance(shortest_distance: &Vec<isize>, included: &Vec<bool>) -> usize {
[INFO] [stderr]    |        ^^^^^^^^^^^ help: convert the identifier to snake case: `min_distance`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(non_snake_case)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable `isIncluded` should have a snake case name
[INFO] [stderr]   --> src/graph.rs:80:21
[INFO] [stderr]    |
[INFO] [stderr] 80 |                 let isIncluded = *included.get(j).unwrap() == true;
[INFO] [stderr]    |                     ^^^^^^^^^^ help: convert the identifier to snake case: `is_included`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `A` should have a snake case name
[INFO] [stderr]    --> src/graph.rs:103:13
[INFO] [stderr]     |
[INFO] [stderr] 103 |         let A = Node(0);
[INFO] [stderr]     |             ^ help: convert the identifier to snake case: `a`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `B` should have a snake case name
[INFO] [stderr]    --> src/graph.rs:104:13
[INFO] [stderr]     |
[INFO] [stderr] 104 |         let B = Node(2);
[INFO] [stderr]     |             ^ help: convert the identifier to snake case: `b`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `C` should have a snake case name
[INFO] [stderr]    --> src/graph.rs:105:13
[INFO] [stderr]     |
[INFO] [stderr] 105 |         let C = Node(3);
[INFO] [stderr]     |             ^ help: convert the identifier to snake case: `c`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `D` should have a snake case name
[INFO] [stderr]    --> src/graph.rs:106:13
[INFO] [stderr]     |
[INFO] [stderr] 106 |         let D = Node(2);
[INFO] [stderr]     |             ^ help: convert the identifier to snake case: `d`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `Ai` should have a snake case name
[INFO] [stderr]    --> src/graph.rs:109:13
[INFO] [stderr]     |
[INFO] [stderr] 109 |         let Ai = graph.add_node(A);
[INFO] [stderr]     |             ^^ help: convert the identifier to snake case: `ai`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `Bi` should have a snake case name
[INFO] [stderr]    --> src/graph.rs:110:13
[INFO] [stderr]     |
[INFO] [stderr] 110 |         let Bi = graph.add_node(B);
[INFO] [stderr]     |             ^^ help: convert the identifier to snake case: `bi`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `Ci` should have a snake case name
[INFO] [stderr]    --> src/graph.rs:111:13
[INFO] [stderr]     |
[INFO] [stderr] 111 |         let Ci = graph.add_node(C);
[INFO] [stderr]     |             ^^ help: convert the identifier to snake case: `ci`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `Di` should have a snake case name
[INFO] [stderr]    --> src/graph.rs:112:13
[INFO] [stderr]     |
[INFO] [stderr] 112 |         let Di = graph.add_node(D);
[INFO] [stderr]     |             ^^ help: convert the identifier to snake case: `di`
[INFO] [stderr] 
[INFO] [stderr] warning: structure field `isEnd` should have a snake case name
[INFO] [stderr]  --> src/trie.rs:8:5
[INFO] [stderr]   |
[INFO] [stderr] 8 |     isEnd: bool
[INFO] [stderr]   |     ^^^^^ help: convert the identifier to snake case: `is_end`
[INFO] [stderr] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 41.30s
[INFO] running `"docker" "inspect" "9c507b551bdcf27b29a297627d72d2659331b134df3eb81b7269c02f262aed9b"`
[INFO] running `"docker" "rm" "-f" "9c507b551bdcf27b29a297627d72d2659331b134df3eb81b7269c02f262aed9b"`
[INFO] [stdout] 9c507b551bdcf27b29a297627d72d2659331b134df3eb81b7269c02f262aed9b