details

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

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	4.83626 seconds
cpu usage	4.80539
user time	2.38359
system time	2.4218
max virtual memory	720680.0
max residence set size	8668.0

stage attributes

key	value
starexec-result	YES

output

YES DP problem for innermost termination. P = init#(x1, x2, x3, x4) -> f1#(rnd1, rnd2, rnd3, rnd4) f3#(I0, I1, I2, I3) -> f3#(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] f3#(I4, I5, I6, I7) -> f3#(I4, I5 + 1, I6 + 1, I6 + 1) [I6 = I7 /\ I6 <= 0 /\ 0 <= I6 - 1] f3#(I8, I9, I10, I11) -> f3#(I8, I9 + 1, I10 + 1, I10 + 1) [I10 = I11 /\ I10 <= 0 /\ I10 <= -1] f3#(I12, I13, I14, I15) -> f2#(I13, I12, I16, I17) [0 = I15 /\ 0 = I14] f2#(I18, I19, I20, I21) -> f3#(I19, I18, I19, I19) [0 <= I19 - 1 /\ I19 <= I18] f1#(I22, I23, I24, I25) -> f2#(I26, I27, I28, I29) [0 <= I22 - 1 /\ -1 <= I26 - 1 /\ 1 <= I23 - 1 /\ -1 <= I27 - 1] R = init(x1, x2, x3, x4) -> f1(rnd1, rnd2, rnd3, rnd4) f3(I0, I1, I2, I3) -> f3(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] f3(I4, I5, I6, I7) -> f3(I4, I5 + 1, I6 + 1, I6 + 1) [I6 = I7 /\ I6 <= 0 /\ 0 <= I6 - 1] f3(I8, I9, I10, I11) -> f3(I8, I9 + 1, I10 + 1, I10 + 1) [I10 = I11 /\ I10 <= 0 /\ I10 <= -1] f3(I12, I13, I14, I15) -> f2(I13, I12, I16, I17) [0 = I15 /\ 0 = I14] f2(I18, I19, I20, I21) -> f3(I19, I18, I19, I19) [0 <= I19 - 1 /\ I19 <= I18] f1(I22, I23, I24, I25) -> f2(I26, I27, I28, I29) [0 <= I22 - 1 /\ -1 <= I26 - 1 /\ 1 <= I23 - 1 /\ -1 <= I27 - 1] The dependency graph for this problem is: 0 -> 6 1 -> 1, 4 2 -> 3 -> 3, 4 4 -> 5 5 -> 1 6 -> 5 Where: 0) init#(x1, x2, x3, x4) -> f1#(rnd1, rnd2, rnd3, rnd4) 1) f3#(I0, I1, I2, I3) -> f3#(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] 2) f3#(I4, I5, I6, I7) -> f3#(I4, I5 + 1, I6 + 1, I6 + 1) [I6 = I7 /\ I6 <= 0 /\ 0 <= I6 - 1] 3) f3#(I8, I9, I10, I11) -> f3#(I8, I9 + 1, I10 + 1, I10 + 1) [I10 = I11 /\ I10 <= 0 /\ I10 <= -1] 4) f3#(I12, I13, I14, I15) -> f2#(I13, I12, I16, I17) [0 = I15 /\ 0 = I14] 5) f2#(I18, I19, I20, I21) -> f3#(I19, I18, I19, I19) [0 <= I19 - 1 /\ I19 <= I18] 6) f1#(I22, I23, I24, I25) -> f2#(I26, I27, I28, I29) [0 <= I22 - 1 /\ -1 <= I26 - 1 /\ 1 <= I23 - 1 /\ -1 <= I27 - 1] We have the following SCCs. { 3 } { 1, 4, 5 } DP problem for innermost termination. P = f3#(I0, I1, I2, I3) -> f3#(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] f3#(I12, I13, I14, I15) -> f2#(I13, I12, I16, I17) [0 = I15 /\ 0 = I14] f2#(I18, I19, I20, I21) -> f3#(I19, I18, I19, I19) [0 <= I19 - 1 /\ I19 <= I18] R = init(x1, x2, x3, x4) -> f1(rnd1, rnd2, rnd3, rnd4) f3(I0, I1, I2, I3) -> f3(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] f3(I4, I5, I6, I7) -> f3(I4, I5 + 1, I6 + 1, I6 + 1) [I6 = I7 /\ I6 <= 0 /\ 0 <= I6 - 1] f3(I8, I9, I10, I11) -> f3(I8, I9 + 1, I10 + 1, I10 + 1) [I10 = I11 /\ I10 <= 0 /\ I10 <= -1] f3(I12, I13, I14, I15) -> f2(I13, I12, I16, I17) [0 = I15 /\ 0 = I14] f2(I18, I19, I20, I21) -> f3(I19, I18, I19, I19) [0 <= I19 - 1 /\ I19 <= I18] f1(I22, I23, I24, I25) -> f2(I26, I27, I28, I29) [0 <= I22 - 1 /\ -1 <= I26 - 1 /\ 1 <= I23 - 1 /\ -1 <= I27 - 1] We use the extended value criterion with the projection function NU: NU[f2#(x0,x1,x2,x3)] = x0 - x1 NU[f3#(x0,x1,x2,x3)] = -x0 + x1 - x2 This gives the following inequalities: I2 = I3 /\ 0 <= I2 - 1 ==> -I0 + I1 - I2 >= -I0 + (I1 - 1) - (I2 - 1) 0 = I15 /\ 0 = I14 ==> -I12 + I13 - I14 >= I13 - I12 0 <= I19 - 1 /\ I19 <= I18 ==> I18 - I19 > -I19 + I18 - I19 with I18 - I19 >= 0 We remove all the strictly oriented dependency pairs. DP problem for innermost termination. P = f3#(I0, I1, I2, I3) -> f3#(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] f3#(I12, I13, I14, I15) -> f2#(I13, I12, I16, I17) [0 = I15 /\ 0 = I14] R = init(x1, x2, x3, x4) -> f1(rnd1, rnd2, rnd3, rnd4) f3(I0, I1, I2, I3) -> f3(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] f3(I4, I5, I6, I7) -> f3(I4, I5 + 1, I6 + 1, I6 + 1) [I6 = I7 /\ I6 <= 0 /\ 0 <= I6 - 1] f3(I8, I9, I10, I11) -> f3(I8, I9 + 1, I10 + 1, I10 + 1) [I10 = I11 /\ I10 <= 0 /\ I10 <= -1] f3(I12, I13, I14, I15) -> f2(I13, I12, I16, I17) [0 = I15 /\ 0 = I14] f2(I18, I19, I20, I21) -> f3(I19, I18, I19, I19) [0 <= I19 - 1 /\ I19 <= I18] f1(I22, I23, I24, I25) -> f2(I26, I27, I28, I29) [0 <= I22 - 1 /\ -1 <= I26 - 1 /\ 1 <= I23 - 1 /\ -1 <= I27 - 1] The dependency graph for this problem is: 1 -> 1, 4 4 -> Where: 1) f3#(I0, I1, I2, I3) -> f3#(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] 4) f3#(I12, I13, I14, I15) -> f2#(I13, I12, I16, I17) [0 = I15 /\ 0 = I14] We have the following SCCs. { 1 } DP problem for innermost termination. P = f3#(I0, I1, I2, I3) -> f3#(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] R = init(x1, x2, x3, x4) -> f1(rnd1, rnd2, rnd3, rnd4) f3(I0, I1, I2, I3) -> f3(I0, I1 - 1, I2 - 1, I2 - 1) [I2 = I3 /\ 0 <= I2 - 1] f3(I4, I5, I6, I7) -> f3(I4, I5 + 1, I6 + 1, I6 + 1) [I6 = I7 /\ I6 <= 0 /\ 0 <= I6 - 1] f3(I8, I9, I10, I11) -> f3(I8, I9 + 1, I10 + 1, I10 + 1) [I10 = I11 /\ I10 <= 0 /\ I10 <= -1] f3(I12, I13, I14, I15) -> f2(I13, I12, I16, I17) [0 = I15 /\ 0 = I14] f2(I18, I19, I20, I21) -> f3(I19, I18, I19, I19) [0 <= I19 - 1 /\ I19 <= I18] f1(I22, I23, I24, I25) -> f2(I26, I27, I28, I29) [0 <= I22 - 1 /\ -1 <= I26 - 1 /\ 1 <= I23 - 1 /\ -1 <= I27 - 1] popout

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

job log

popout

actions

all output return to ITS