test harder number with 2 threads

Author: TilmanNeumann

src/test/java/de/tilman_neumann/jml/factor/CombinedFactorAlgorithmTest.java

@@ -35,7 +35,7 @@ public class CombinedFactorAlgorithmTest {
 	@BeforeClass
 	public static void setup() {
 		ConfigUtil.initProject();
-		int numThreads = 4; // be cautious regarding what github CI supports
+		int numThreads = 2; // be cautious regarding what github CI supports
 		factorizer = new CombinedFactorAlgorithm(numThreads, null, true);
 	}
 
@@ -47,9 +47,9 @@ public void testSomeNumbers() {
 		assertFactorizationSuccess("874186654300294020965320730991996026550891341278308", "2^2 * 3 * 471997 * 654743 * 2855761 * 79833227 * 982552477 * 1052328969055591"); // 170 bit
 		assertFactorizationSuccess("11111111111111111111111111155555555555111111111111111", "67 * 157 * 1056289676880987842105819104055096069503860738769"); // 173 bit
 		assertFactorizationSuccess("1388091470446411094380555803943760956023126025054082930201628998364642", "2 * 3 * 1907 * 1948073 * 1239974331653 * 50222487570895420624194712095309533522213376829"); // 230 bit
+		// 236 bit, takes ~ 8 seconds with 2 threads
+		assertFactorizationSuccess("99999999999999999999999999999999999999999999999999999999999999999999999", "3^2 * 241573142393627673576957439049 * 45994811347886846310221728895223034301839");
 		if (RUN_SLOW_TESTS_TOO) {
-			// 236 bit, takes ~ 8 seconds with 2 threads
-			assertFactorizationSuccess("99999999999999999999999999999999999999999999999999999999999999999999999", "3^2 * 241573142393627673576957439049 * 45994811347886846310221728895223034301839");
 			 // 263 bit bit, takes ~ 52 seconds with 2 threads
 			assertFactorizationSuccess("10000000000000000000000000000000000000000000000000000000000000000000000000005923", "1333322076518899001350381760807974795003 * 7500063320115780212377802894180923803641");
 			 // 280 bit bit, takes ~ 158 seconds with 2 threads