For long runs CBC_MANY_NODE_COUNTS needs to be used in a few more mes…

…sages. \n

So after running for some time on a 60 variable, 7 row problem we got \n
Cbc0010I After 22804279000 nodes, 194461 on tree, -10508 best solution, best possible -10512 (1529584.38 seconds) \n
^CCbc0027I Exiting on user event\n
Cbc0005I Partial search - best objective -10508 (best possible -10512), took -1198651437 iterations and -718104570 nodes (1529587.90 seconds)\n
which is not correct - although the final messages were correct\n
Enumerated nodes:               42231568390\n
Total iterations:               110470498259\n
and I am sure the search would not have taken the 2**60 nodes that one
pessimist suggested! (maybe 2**40)\n

src/CbcMessage.cpp

@@ -17,10 +17,17 @@ typedef struct {
   const char *message;
 } Cbc_message;
 static Cbc_message us_english[] = {
+#ifndef CBC_MANY_NODE_COUNTS
   { CBC_END_GOOD, 1, 1, "Search completed - best objective %.16g, took %d iterations and %d nodes (%.2f seconds)" },
   { CBC_MAXNODES, 3, 1, "Exiting on maximum nodes" },
   { CBC_SOLUTION, 4, 1, "Integer solution of %g found after %d iterations and %d nodes (%.2f seconds)" },
   { CBC_END, 5, 1, "Partial search - best objective %g (best possible %g), took %d iterations and %d nodes (%.2f seconds)" },
+#else
+  { CBC_END_GOOD, 1, 1, "Search completed - best objective %.16g, took %ld iterations and %ld nodes (%.2f seconds)" },
+  { CBC_MAXNODES, 3, 1, "Exiting on maximum nodes" },
+  { CBC_SOLUTION, 4, 1, "Integer solution of %g found after %ld iterations and %ld nodes (%.2f seconds)" },
+  { CBC_END, 5, 1, "Partial search - best objective %g (best possible %g), took %ld iterations and %ld nodes (%.2f seconds)" },
+#endif
   { CBC_INFEAS, 6, 1, "The LP relaxation is infeasible or too expensive" },
   { CBC_STRONG, 7, 4, "Strong branching on %d (%d), down %g (%d) up %g (%d) value %g" },
   { CBC_SOLINDIVIDUAL, 8, 2, "%d has value %g" },