diff --git a/testings/CMakeLists.txt b/testings/CMakeLists.txt
index c6c9da9fdd83580109cf72b4a30cbad44f715c71..88d02247ca7db9bc1f68a91e4c65c7b55a09090d 100644
--- a/testings/CMakeLists.txt
+++ b/testings/CMakeLists.txt
@@ -15,6 +15,7 @@ set(TESTINGS
   draw_hqr.c
   draw_systolic.c
   testing_hqr.c
+  testing_systolic.c
   testing_tileinit.c
   )
 
diff --git a/testings/testing_hqr.c b/testings/testing_hqr.c
index dc3e2e1983b275365363537c98edb15eef40b6c9..e13f5529a5675f7e76954b932ff8bb92070c4064 100644
--- a/testings/testing_hqr.c
+++ b/testings/testing_hqr.c
@@ -2,7 +2,7 @@
  *
  * @file testing_hqr.c
  *
- * Testing file for all combinations of trees.
+ * Testing file for all combinations of hierarchical QR trees.
  *
  * @copyright 2010-2017 The University of Tennessee and The University
  *                      of Tennessee Research Foundation.  All rights
@@ -51,9 +51,6 @@ main(int argc, char ** argv)
         int nb_mt   = sizeof( all_mt   ) / sizeof( int );
         int nb_nt   = sizeof( all_nt   ) / sizeof( int );
 
-        int rc, ret = 0;
-        int P       = 1;
-        int nbnodes = P;
         int l, h, p, a, m, n;
         int done, todo;
         todo = 0;
@@ -116,8 +113,6 @@ main(int argc, char ** argv)
             /*
              * Tests w/ high level trees
              */
-            matrix.nodes = nbnodes;
-
             for( domino=0; domino<2; domino++) { /* Domino */
                 if ((domino == 1) && (llvl == LIBHQR_GREEDY1P_TREE))
                     continue;
@@ -199,6 +194,7 @@ main(int argc, char ** argv)
     }
 
     if ( ret == 0 ) {
+        printf("\n");
         return EXIT_SUCCESS;
     }
     else {