details

property	value
status	complete
benchmark	array_init.t2_fixed.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n150.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	Ctrl
configuration	Transition
runtime (wallclock)	0.754487 seconds
cpu usage	0.764684
user time	0.410615
system time	0.354069
max virtual memory	123792.0
max residence set size	7996.0

stage attributes

key	value
starexec-result	YES

output

YES DP problem for innermost termination. P = f7#(x1) -> f6#(x1) f6#(I0) -> f4#(0) f4#(I2) -> f3#(I2) f3#(I3) -> f4#(1 + I3) [1 + I3 <= 10] f3#(I4) -> f1#(I4) [10 <= I4] f1#(I5) -> f2#(I5) f1#(I6) -> f2#(I6) R = f7(x1) -> f6(x1) f6(I0) -> f4(0) f2(I1) -> f5(I1) f4(I2) -> f3(I2) f3(I3) -> f4(1 + I3) [1 + I3 <= 10] f3(I4) -> f1(I4) [10 <= I4] f1(I5) -> f2(I5) f1(I6) -> f2(I6) The dependency graph for this problem is: 0 -> 1 1 -> 2 2 -> 3, 4 3 -> 2 4 -> 5, 6 5 -> 6 -> Where: 0) f7#(x1) -> f6#(x1) 1) f6#(I0) -> f4#(0) 2) f4#(I2) -> f3#(I2) 3) f3#(I3) -> f4#(1 + I3) [1 + I3 <= 10] 4) f3#(I4) -> f1#(I4) [10 <= I4] 5) f1#(I5) -> f2#(I5) 6) f1#(I6) -> f2#(I6) We have the following SCCs. { 2, 3 } DP problem for innermost termination. P = f4#(I2) -> f3#(I2) f3#(I3) -> f4#(1 + I3) [1 + I3 <= 10] R = f7(x1) -> f6(x1) f6(I0) -> f4(0) f2(I1) -> f5(I1) f4(I2) -> f3(I2) f3(I3) -> f4(1 + I3) [1 + I3 <= 10] f3(I4) -> f1(I4) [10 <= I4] f1(I5) -> f2(I5) f1(I6) -> f2(I6) We use the reverse value criterion with the projection function NU: NU[f3#(z1)] = 10 + -1 * (1 + z1) NU[f4#(z1)] = 10 + -1 * (1 + z1) This gives the following inequalities: ==> 10 + -1 * (1 + I2) >= 10 + -1 * (1 + I2) 1 + I3 <= 10 ==> 10 + -1 * (1 + I3) > 10 + -1 * (1 + (1 + I3)) with 10 + -1 * (1 + I3) >= 0 We remove all the strictly oriented dependency pairs. DP problem for innermost termination. P = f4#(I2) -> f3#(I2) R = f7(x1) -> f6(x1) f6(I0) -> f4(0) f2(I1) -> f5(I1) f4(I2) -> f3(I2) f3(I3) -> f4(1 + I3) [1 + I3 <= 10] f3(I4) -> f1(I4) [10 <= I4] f1(I5) -> f2(I5) f1(I6) -> f2(I6) The dependency graph for this problem is: 2 -> Where: 2) f4#(I2) -> f3#(I2) We have the following SCCs. popout

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

job log

popout

actions

all output return to ITS