Closed paulch42 closed 8 years ago
Again, thanks for describing the problem very well.
I updated the trace interpreter to report stack overflows
Consider a slightly different version of your spec:
module ct
exports all
definitions
functions
f: nat * nat -> nat
f(m,n) == if m=n then m else f(m+1,n)
post RESULT = n;
h: () -> nat
h() == 1;
traces
t_f: (h();f(0,10000);h());
end ct
The test results are now reported as
Thanks for the quick action. This will certainly save time trying to track down why a test run fails.
Consider the module
When run from Combinatorial Testing view produces expected result. If the argument to
f
is increased such that stack overflow occurs due to recursion depth (the exact number will vary depending on JVM parameters), the Resultnull
is reported in the CT Test Case Result tab, and no indication given concerning the error.A more informative message would be useful to assist in tracking down the problem.