diff --git a/dependencies/BacktrackKit/gap/constraint.gd b/dependencies/BacktrackKit/gap/constraint.gd
index b7b6915..39fb9a3 100644
--- a/dependencies/BacktrackKit/gap/constraint.gd
+++ b/dependencies/BacktrackKit/gap/constraint.gd
@@ -70,7 +70,6 @@
 #! To perform a search, it is necessary to
 #! (at least implicitly) specify constraints that, in conjunction,
 #! define the permutation(s) that you wish to find.
-#! This is documented in Chapter&nbsp;<Ref Chap="Chapter_Executing_a_search"/>.
 #! A constraint will typically be converted into one or more
 #! **refiners** by that the time that a search takes place.
 #! Refiners are introduced in
diff --git a/tst/vole06.tst b/tst/vole06.tst
index 5106f3c..7d048d5 100644
--- a/tst/vole06.tst
+++ b/tst/vole06.tst
@@ -13,7 +13,8 @@ gap> START_TEST("vole06.tst");
 # doc/_Chapter_Constraints.xml:60-62
 gap> LoadPackage("vole", false);;
 
-# doc/_Chapter_Constraints.xml:157-163
+# doc/_Chapter_Constraints.xml:156-163
+gap> LoadPackage("BacktrackKit", false);;
 gap> Set(RecNames(Constraint));
 [ "Centralise", "Centralize", "Conjugate", "Everything", "InCoset",
   "InGroup", "InLeftCoset", "InRightCoset", "IsEven", "IsOdd", "IsTrivial",