details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	0.515617 seconds
cpu usage	0.52523
user time	0.291969
system time	0.233261
max virtual memory	113188.0
max residence set size	8608.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE DP problem for innermost termination. P = init#(x1, x2) -> f1#(rnd1, rnd2) f2#(I0, I1) -> f2#(I0 - 10, I1 - 1) [0 <= I1 - 1 /\ 100 <= I0 - 1] f2#(I2, I3) -> f2#(I2 + 11, I3 + 1) [0 <= I3 - 1 /\ I2 <= 100] f1#(I4, I5) -> f2#(I6, 1) [0 <= I4 - 1 /\ -1 <= I6 - 1 /\ -1 <= I5 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f2(I0, I1) -> f2(I0 - 10, I1 - 1) [0 <= I1 - 1 /\ 100 <= I0 - 1] f2(I2, I3) -> f2(I2 + 11, I3 + 1) [0 <= I3 - 1 /\ I2 <= 100] f1(I4, I5) -> f2(I6, 1) [0 <= I4 - 1 /\ -1 <= I6 - 1 /\ -1 <= I5 - 1] The dependency graph for this problem is: 0 -> 3 1 -> 1, 2 2 -> 1, 2 3 -> 1, 2 Where: 0) init#(x1, x2) -> f1#(rnd1, rnd2) 1) f2#(I0, I1) -> f2#(I0 - 10, I1 - 1) [0 <= I1 - 1 /\ 100 <= I0 - 1] 2) f2#(I2, I3) -> f2#(I2 + 11, I3 + 1) [0 <= I3 - 1 /\ I2 <= 100] 3) f1#(I4, I5) -> f2#(I6, 1) [0 <= I4 - 1 /\ -1 <= I6 - 1 /\ -1 <= I5 - 1] We have the following SCCs. { 1, 2 } DP problem for innermost termination. P = f2#(I0, I1) -> f2#(I0 - 10, I1 - 1) [0 <= I1 - 1 /\ 100 <= I0 - 1] f2#(I2, I3) -> f2#(I2 + 11, I3 + 1) [0 <= I3 - 1 /\ I2 <= 100] R = init(x1, x2) -> f1(rnd1, rnd2) f2(I0, I1) -> f2(I0 - 10, I1 - 1) [0 <= I1 - 1 /\ 100 <= I0 - 1] f2(I2, I3) -> f2(I2 + 11, I3 + 1) [0 <= I3 - 1 /\ I2 <= 100] f1(I4, I5) -> f2(I6, 1) [0 <= I4 - 1 /\ -1 <= I6 - 1 /\ -1 <= I5 - 1] popout

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

job log

popout

actions

all output return to ITS