details

property	value
status	complete
benchmark	Velroyen08-ex08.jar-obl-8.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n147.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	1.1782579422 seconds
cpu usage	1.264469989
max memory	1.384448E7

stage attributes

key	value
output-size	2442
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_Transition /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE DP problem for innermost termination. P = init#(x1, x2) -> f1#(rnd1, rnd2) f2#(I0, I1) -> f2#(0, 9) [10 = I1] f2#(I2, I3) -> f2#(0, I3 - 1) [0 = I2 /\ 10 <= I3 - 1] f2#(I4, I5) -> f2#(1, I5 + 1) [1 = I4 /\ 10 <= I5 - 1] f2#(I6, I7) -> f2#(0, I7 - 1) [0 = I6 /\ 1 <= I7 - 1 /\ I7 <= 9] f2#(I8, I9) -> f2#(1, I9 + 1) [1 = I8 /\ 1 <= I9 - 1 /\ I9 <= 9] f2#(I10, I11) -> f2#(1, 2) [1 = I11] f1#(I12, I13) -> f2#(0, I13) [-1 <= I13 - 1 /\ 0 <= I12 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f2(I0, I1) -> f2(0, 9) [10 = I1] f2(I2, I3) -> f2(0, I3 - 1) [0 = I2 /\ 10 <= I3 - 1] f2(I4, I5) -> f2(1, I5 + 1) [1 = I4 /\ 10 <= I5 - 1] f2(I6, I7) -> f2(0, I7 - 1) [0 = I6 /\ 1 <= I7 - 1 /\ I7 <= 9] f2(I8, I9) -> f2(1, I9 + 1) [1 = I8 /\ 1 <= I9 - 1 /\ I9 <= 9] f2(I10, I11) -> f2(1, 2) [1 = I11] f1(I12, I13) -> f2(0, I13) [-1 <= I13 - 1 /\ 0 <= I12 - 1] The dependency graph for this problem is: 0 -> 7 1 -> 4 2 -> 1, 2 3 -> 3 4 -> 4, 6 5 -> 1, 5 6 -> 5 7 -> 1, 2, 4, 6 Where: 0) init#(x1, x2) -> f1#(rnd1, rnd2) 1) f2#(I0, I1) -> f2#(0, 9) [10 = I1] 2) f2#(I2, I3) -> f2#(0, I3 - 1) [0 = I2 /\ 10 <= I3 - 1] 3) f2#(I4, I5) -> f2#(1, I5 + 1) [1 = I4 /\ 10 <= I5 - 1] 4) f2#(I6, I7) -> f2#(0, I7 - 1) [0 = I6 /\ 1 <= I7 - 1 /\ I7 <= 9] 5) f2#(I8, I9) -> f2#(1, I9 + 1) [1 = I8 /\ 1 <= I9 - 1 /\ I9 <= 9] 6) f2#(I10, I11) -> f2#(1, 2) [1 = I11] 7) f1#(I12, I13) -> f2#(0, I13) [-1 <= I13 - 1 /\ 0 <= I12 - 1] We have the following SCCs. { 3 } { 2 } { 1, 4, 5, 6 } DP problem for innermost termination. P = f2#(I0, I1) -> f2#(0, 9) [10 = I1] f2#(I6, I7) -> f2#(0, I7 - 1) [0 = I6 /\ 1 <= I7 - 1 /\ I7 <= 9] f2#(I8, I9) -> f2#(1, I9 + 1) [1 = I8 /\ 1 <= I9 - 1 /\ I9 <= 9] f2#(I10, I11) -> f2#(1, 2) [1 = I11] R = init(x1, x2) -> f1(rnd1, rnd2) f2(I0, I1) -> f2(0, 9) [10 = I1] f2(I2, I3) -> f2(0, I3 - 1) [0 = I2 /\ 10 <= I3 - 1] f2(I4, I5) -> f2(1, I5 + 1) [1 = I4 /\ 10 <= I5 - 1] f2(I6, I7) -> f2(0, I7 - 1) [0 = I6 /\ 1 <= I7 - 1 /\ I7 <= 9] f2(I8, I9) -> f2(1, I9 + 1) [1 = I8 /\ 1 <= I9 - 1 /\ I9 <= 9] f2(I10, I11) -> f2(1, 2) [1 = I11] f1(I12, I13) -> f2(0, I13) [-1 <= I13 - 1 /\ 0 <= I12 - 1] popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Integer Transition Systems