details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	0.054333 seconds
cpu usage	0.054496
user time	0.0311
system time	0.023396
max virtual memory	113176.0
max residence set size	49648.0

stage attributes

key	value
starexec-result	NO

output

0.00/0.05 NO 0.00/0.05 0.00/0.05 Solver Timeout: 4 0.00/0.05 Global Timeout: 300 0.00/0.05 No parsing errors! 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 <l0, l11, true> 0.00/0.05 <l1, l2, ((0 + tmp1^0) <= 0) /\ (0 <= (0 + tmp1^0)), par{Stored^0 -> 1}> 0.00/0.05 <l1, l3, (1 <= (0 + tmp1^0))> 0.00/0.05 <l1, l3, ((1 + tmp1^0) <= 0)> 0.00/0.05 <l4, l1, (undef11 = undef11), par{tmp1^0 -> undef11}> 0.00/0.05 <l5, l2, ((0 + tmp___02^0) <= 0) /\ (0 <= (0 + tmp___02^0))> 0.00/0.05 <l5, l4, (1 <= (0 + tmp___02^0))> 0.00/0.05 <l5, l4, ((1 + tmp___02^0) <= 0)> 0.00/0.05 <l6, l7, true> 0.00/0.05 <l8, l5, (undef27 = undef27), par{tmp___02^0 -> undef27}> 0.00/0.05 <l2, l9, true> 0.00/0.05 <l9, l6, (2 <= (0 + Stored^0))> 0.00/0.05 <l9, l6, ((1 + Stored^0) <= 1)> 0.00/0.05 <l9, l6, ((0 + Stored^0) <= 1) /\ (1 <= (0 + Stored^0)), par{Stored^0 -> 0}> 0.00/0.05 <l3, l8, true> 0.00/0.05 <l10, l8, true, par{Stored^0 -> 0}> 0.00/0.05 <l11, l10, true> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef11, undef27, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef11, undef27, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 Preprocessed LLVMGraph 0.00/0.05 Init Location: 0 0.00/0.05 Transitions: 0.00/0.05 <l0, l8, (Stored^0 = 0)> 0.00/0.05 <l8, l7, (undef27 = undef27) /\ ((0 + undef27) <= 0) /\ (0 <= (0 + undef27)) /\ (2 <= (0 + Stored^0))> 0.00/0.05 <l8, l7, (undef27 = undef27) /\ ((0 + undef27) <= 0) /\ (0 <= (0 + undef27)) /\ ((1 + Stored^0) <= 1)> 0.00/0.05 <l8, l7, (undef27 = undef27) /\ ((0 + undef27) <= 0) /\ (0 <= (0 + undef27)) /\ ((0 + Stored^0) <= 1) /\ (1 <= (0 + Stored^0)), par{Stored^0 -> 0}> 0.00/0.05 <l8, l7, (undef27 = undef27) /\ (1 <= (0 + undef27)) /\ (undef11 = undef11) /\ ((0 + undef11) <= 0) /\ (0 <= (0 + undef11)) /\ ((0 + 1) <= 1) /\ (1 <= (0 + 1)), par{Stored^0 -> 0}> 0.00/0.05 <l8, l8, (undef27 = undef27) /\ (1 <= (0 + undef27)) /\ (undef11 = undef11) /\ (1 <= (0 + undef11))> 0.00/0.05 <l8, l8, (undef27 = undef27) /\ (1 <= (0 + undef27)) /\ (undef11 = undef11) /\ ((1 + undef11) <= 0)> 0.00/0.05 <l8, l7, (undef27 = undef27) /\ ((1 + undef27) <= 0) /\ (undef11 = undef11) /\ ((0 + undef11) <= 0) /\ (0 <= (0 + undef11)) /\ ((0 + 1) <= 1) /\ (1 <= (0 + 1)), par{Stored^0 -> 0}> 0.00/0.05 <l8, l8, (undef27 = undef27) /\ ((1 + undef27) <= 0) /\ (undef11 = undef11) /\ (1 <= (0 + undef11))> 0.00/0.05 <l8, l8, (undef27 = undef27) /\ ((1 + undef27) <= 0) /\ (undef11 = undef11) /\ ((1 + undef11) <= 0)> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef11, undef27, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef11, undef27, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 ************************************************************* 0.00/0.05 ******************************************************************************************* 0.00/0.05 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Init Location: 0 0.00/0.05 Graph 0: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 1: 0.00/0.05 Transitions: 0.00/0.05 <l8, l8, 1 <= undef11 /\ 1 <= undef27, {all remain the same}> 0.00/0.05 <l8, l8, 1 + undef11 <= 0 /\ 1 <= undef27, {all remain the same}> 0.00/0.05 <l8, l8, 1 <= undef11 /\ 1 + undef27 <= 0, {all remain the same}> 0.00/0.05 <l8, l8, 1 + undef11 <= 0 /\ 1 + undef27 <= 0, {all remain the same}> 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 2: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Precedence: 0.00/0.05 Graph 0 0.00/0.05 0.00/0.05 Graph 1 0.00/0.05 <l0, l8, Stored^0 = 0, {all remain the same}> 0.00/0.05 0.00/0.05 Graph 2 0.00/0.05 <l8, l7, 2 <= Stored^0 /\ undef27 = 0, {all remain the same}> 0.00/0.05 <l8, l7, Stored^0 <= 0 /\ undef27 = 0, {all remain the same}> 0.00/0.05 <l8, l7, undef27 = 0 /\ Stored^0 = 1, {Stored^0 -> 0, rest remain the same}> 0.00/0.05 <l8, l7, 1 <= undef27 /\ undef11 = 0, {Stored^0 -> 0, rest remain the same}> popout

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

job log

popout

actions

all output return to Integer_Transition_Systems 2019-03-29 01.54