Fix small bug in is_prime speed test

We were testing p instead of p + i as intended.

Also change the loop induction to work around what appears to be
a lgtm false positive.

1 files changed, 2 insertions, 2 deletions

diff --git a/src/cli/speed.cpp b/src/cli/speed.cpp
index 8361243dc..d5a23f08c 100644
--- a/src/cli/speed.cpp
+++ b/src/cli/speed.cpp
@@ -1611,9 +1611,9 @@ class Speed final : public Command
                   }
 
                // Now test p+2, p+4, ... which may or may not be prime
-               for(size_t i = 2; i != 64; i += 2)
+               for(size_t i = 2; i <= 64; i += 2)
                   {
-                  is_prime_timer->run([&]() { Botan::is_prime(p, rng(), 64, true); });
+                  is_prime_timer->run([&]() { Botan::is_prime(p + i, rng(), 64, true); });
                   }
                }