diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
index 918d44283da..aee119e3398 100644
--- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
+++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
@@ -33,6 +33,7 @@
 #include "_test_remove_cluster.h"
 
 #include <CGAL/Random.h>
+#include <CGAL/Testsuite/use.h>
 
 // Accessory set of functions to differentiate between
 // Delaunay::nearest_vertex[_in_cell] and
@@ -1074,6 +1075,7 @@ _test_cls_delaunay_3(const Triangulation &)
   assert(TM_0.dimension() == 1);
 
   Vertex_handle tmv5 = TM_0.insert(Point(0,2,0));
+  CGAL_USE(tmv5);
   Vertex_handle tmv6 = TM_0.insert(Point(1,0,0));
   assert(TM_0.dimension() == 3);
 
diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_triangulation_3.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_triangulation_3.h
index cc6d7c8d1e1..515964a4e9c 100644
--- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_triangulation_3.h
+++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_triangulation_3.h
@@ -28,6 +28,7 @@
 #include "_test_cls_circulator.h"
 
 #include <CGAL/Random.h>
+#include <CGAL/Testsuite/use.h>
 
 template <class Triangulation, class Container>
 bool check_all_are_finite(Triangulation* tr, const Container& cont) 
@@ -639,6 +640,7 @@ _test_cls_triangulation_3(const Triangulation &)
       TAI1.insert_and_give_new_cells(
                                      Point(x, x, x), 
                                      std::back_inserter(lis_tai1));
+    CGAL_USE(taiv);
     assert(TAI1.is_valid());
     assert(TAI1.dimension() == 1);
     assert(lis_tai1.size() == 2);
@@ -668,6 +670,7 @@ _test_cls_triangulation_3(const Triangulation &)
       TAI1.insert_and_give_new_cells(
                                      Point(x, y, 0), 
                                      std::back_inserter(lis_tai1));
+    CGAL_USE(taiv);
     assert(TAI1.is_valid());
     assert(TAI1.dimension() == 2);
     while(!lis_tai1.empty())
@@ -697,6 +700,7 @@ _test_cls_triangulation_3(const Triangulation &)
       TAI1.insert_and_give_new_cells(
                                      Point(x, y, z), 
                                      std::back_inserter(lis_tai1));
+    CGAL_USE(taiv);
     assert(TAI1.is_valid());
     assert(TAI1.dimension() == 3);
     while(!lis_tai1.empty())
diff --git a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_vda.h b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_vda.h
index 90c268a7fcc..8ac77b36b5f 100644
--- a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_vda.h
+++ b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_vda.h
@@ -25,6 +25,7 @@
 #include <CGAL/Voronoi_diagram_2/Accessor.h>
 #include <cassert>
 #include "helper_functions.h"
+#include <CGAL/Testsuite/use.h>
 
 //==========================================================================
 //==========================================================================
@@ -607,11 +608,13 @@ void test_vda(const VDA& vda)
   Site_iterator sit;
   for (sit = vda.sites_begin(); sit != vda.sites_end(); ++sit) {
     typename AT::Site_2 s = *sit;
+    CGAL_USE(s);
   }
 
   if ( vda.sites_begin() != vda.sites_end() ) {
     for (sit = --vda.sites_end(); sit != vda.sites_begin(); --sit) {
       typename AT::Site_2 s = *sit;
+      CGAL_USE(s);
     }
   }
 }