Update CBMC dependency to 6.7.1

kani-dependencies

@@ -1,5 +1,5 @@
 CBMC_MAJOR="6"
-CBMC_MINOR="6"
-CBMC_VERSION="6.6.0"
+CBMC_MINOR="7"
+CBMC_VERSION="6.7.1"
 
 KISSAT_VERSION="4.0.1"

tests/expected/loop-contract/struct_projection.expected

@@ -1,8 +1,4 @@
-struct_projection.loop_invariant_step.1\
-	 - Status: SUCCESS\
-	 - Description: "Check invariant after step for loop struct_projection.0"
-
-struct_projection.loop_invariant_step.2\
+struct_projection.loop_invariant_step.\
 	 - Status: SUCCESS\
 	 - Description: "Check invariant after step for loop struct_projection.0"
 

tests/expected/shadow/unsupported_num_objects/test.rs

@@ -10,17 +10,22 @@ static mut SM: kani::shadow::ShadowMem<bool> = kani::shadow::ShadowMem::new(fals
 fn check_max_objects<const N: usize>() {
     let mut i = 0;
     // A dummy loop that creates `N`` objects.
-    // After the loop, CBMC's object ID counter should be at `N` + 2:
+    // After the loop, CBMC's object ID counter should be at `N` + 3:
     // - `N` created in the loop +
     // - the NULL pointer whose object ID is 0, and
-    // - the object ID for `i`
+    // - objects for i, have_42
+    let mut have_42 = false;
     while i < N {
-        let x: Box<usize> = Box::new(i);
+        let x: Box<usize> = Box::new(kani::any());
+        if *x == 42 {
+            have_42 = true;
+        }
         i += 1;
     }
 
-    // create a new object whose ID is `N` + 2
-    let x = 42;
+    // create a new object whose ID is `N` + 4
+    let x: i32 = have_42 as i32;
+    assert_eq!(x, have_42 as i32);
     // the following call to `set` would fail if the object ID for `x` exceeds
     // the maximum allowed by Kani's shadow memory model
     unsafe {
@@ -30,10 +35,10 @@ fn check_max_objects<const N: usize>() {
 
 #[kani::proof]
 fn check_max_objects_pass() {
-    check_max_objects::<510>();
+    check_max_objects::<1019>();
 }
 
 #[kani::proof]
 fn check_max_objects_fail() {
-    check_max_objects::<511>();
+    check_max_objects::<1020>();
 }

tests/kani/Quantifiers/from_raw_part_fixme.rs → tests/kani/Quantifiers/from_raw_parts.rs

@@ -2,8 +2,6 @@
 // SPDX-License-Identifier: Apache-2.0 OR MIT
 // kani-flags: -Z quantifiers
 
-//! FIXME: <https://github.com/model-checking/kani/issues/4020>
-
 use std::mem;
 
 #[kani::proof]

tests/kani/ThreadLocalRef/main.rs

@@ -29,14 +29,16 @@ fn test_i32() {
     });
 }
 
-#[kani::proof]
-#[kani::unwind(7)]
-fn test_complex_data() {
-    COMPLEX_DATA.with(|c| {
-        assert_eq!(*c.borrow(), "before");
-        *c.borrow_mut() = "after"
-    });
-    COMPLEX_DATA.with(|c| {
-        assert_eq!(*c.borrow(), "after");
-    });
-}
+// TODO: This test exposes a bug in CBMC 6.7.1. It should be re-enabled once a version of CBMC that
+// includes https://github.com/diffblue/cbmc/pull/8678 has been released.
+// #[kani::proof]
+// #[kani::unwind(7)]
+// fn test_complex_data() {
+//     COMPLEX_DATA.with(|c| {
+//         assert_eq!(*c.borrow(), "before");
+//         *c.borrow_mut() = "after"
+//     });
+//     COMPLEX_DATA.with(|c| {
+//         assert_eq!(*c.borrow(), "after");
+//     });
+// }

tests/perf/hashset/expected

@@ -1 +1 @@
-3 successfully verified harnesses, 0 failures, 3 total
+2 successfully verified harnesses, 0 failures, 2 total

tests/perf/hashset/src/lib.rs

@@ -35,14 +35,16 @@ fn check_contains() {
     assert!(set.contains(&first));
 }
 
-#[kani::proof]
-#[kani::stub(RandomState::new, concrete_state)]
-#[kani::unwind(5)]
-#[kani::solver(kissat)]
-fn check_contains_str() {
-    let set = HashSet::from(["s"]);
-    assert!(set.contains(&"s"));
-}
+// TODO: This test exposes a bug in CBMC 6.7.1. It should be re-enabled once a version of CBMC that
+// includes https://github.com/diffblue/cbmc/pull/8678 has been released.
+// #[kani::proof]
+// #[kani::stub(RandomState::new, concrete_state)]
+// #[kani::unwind(5)]
+// #[kani::solver(kissat)]
+// fn check_contains_str() {
+//     let set = HashSet::from(["s"]);
+//     assert!(set.contains(&"s"));
+// }
 
 // too slow so don't run in the regression for now
 #[cfg(slow)]