details

property	value
status	complete
benchmark	randomFullUpDown.itrs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n141.star.cs.uiowa.edu
space	Mixed_ITRS_2014

run statistics

property	value
solver	Ctrl
configuration	Itrs
runtime (wallclock)	0.341916 seconds
cpu usage	0.34816
user time	0.175183
system time	0.172977
max virtual memory	113188.0
max residence set size	7780.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE DP problem for innermost termination. P = rand#(I3, y) -> rand#(0 - I3 - 1, id_dec(y)) [0 > I3] rand#(I3, y) -> id_dec#(y) [0 > I3] rand#(I4, I5) -> rand#(0 - I4 + 1, id_inc(I5)) [I4 > 0] rand#(I4, I5) -> id_inc#(I5) [I4 > 0] random#(I8) -> rand#(I8, 0) R = id_dec(x) -> x - 1 id_dec(I0) -> I0 id_inc(I1) -> I1 + 1 id_inc(I2) -> I2 rand(I3, y) -> rand(0 - I3 - 1, id_dec(y)) [0 > I3] rand(I4, I5) -> rand(0 - I4 + 1, id_inc(I5)) [I4 > 0] rand(I6, I7) -> I7 [I6 = 0] random(I8) -> rand(I8, 0) The dependency graph for this problem is: 0 -> 2, 3 1 -> 2 -> 0, 1 3 -> 4 -> 0, 1, 2, 3 Where: 0) rand#(I3, y) -> rand#(0 - I3 - 1, id_dec(y)) [0 > I3] 1) rand#(I3, y) -> id_dec#(y) [0 > I3] 2) rand#(I4, I5) -> rand#(0 - I4 + 1, id_inc(I5)) [I4 > 0] 3) rand#(I4, I5) -> id_inc#(I5) [I4 > 0] 4) random#(I8) -> rand#(I8, 0) We have the following SCCs. { 0, 2 } DP problem for innermost termination. P = rand#(I3, y) -> rand#(0 - I3 - 1, id_dec(y)) [0 > I3] rand#(I4, I5) -> rand#(0 - I4 + 1, id_inc(I5)) [I4 > 0] R = id_dec(x) -> x - 1 id_dec(I0) -> I0 id_inc(I1) -> I1 + 1 id_inc(I2) -> I2 rand(I3, y) -> rand(0 - I3 - 1, id_dec(y)) [0 > I3] rand(I4, I5) -> rand(0 - I4 + 1, id_inc(I5)) [I4 > 0] rand(I6, I7) -> I7 [I6 = 0] random(I8) -> rand(I8, 0) popout

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

job log

popout

actions

all output return to Integer TRS Innermost