details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	20.3133 seconds
cpu usage	40.5399
user time	38.2119
system time	2.32799
max virtual memory	1123736.0
max residence set size	364412.0

stage attributes

key	value
starexec-result	NO

output

20.24/20.30 NO 20.24/20.30 20.24/20.31 Solver Timeout: 4 20.24/20.31 Global Timeout: 300 20.24/20.31 No parsing errors! 20.24/20.31 Init Location: 0 20.24/20.31 Transitions: 20.24/20.31 <l0, l7, true> 20.24/20.31 <l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}> 20.24/20.31 <l1, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)), par{tmp_7^0 -> undef6, y_6^0 -> (~(1) + y_6^0)}> 20.24/20.31 <l3, l1, true> 20.24/20.31 <l1, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14), par{tmp_7^0 -> undef14}> 20.24/20.31 <l4, l5, ((1 + tmp_7^0) <= 0)> 20.24/20.31 <l4, l5, (1 <= (0 + tmp_7^0))> 20.24/20.31 <l5, l1, true> 20.24/20.31 <l6, l1, true> 20.24/20.31 <l7, l6, true> 20.24/20.31 20.24/20.31 Fresh variables: 20.24/20.31 undef1, undef6, undef14, 20.24/20.31 20.24/20.31 Undef variables: 20.24/20.31 undef1, undef6, undef14, 20.24/20.31 20.24/20.31 Abstraction variables: 20.24/20.31 20.24/20.31 Exit nodes: 20.24/20.31 20.24/20.31 Accepting locations: 20.24/20.31 20.24/20.31 Asserts: 20.24/20.31 20.24/20.31 Preprocessed LLVMGraph 20.24/20.31 Init Location: 0 20.24/20.31 Transitions: 20.24/20.31 <l0, l1, true> 20.24/20.31 <l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1)> 20.24/20.31 <l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)), par{y_6^0 -> (~(1) + y_6^0)}> 20.24/20.31 <l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ ((1 + undef14) <= 0)> 20.24/20.31 <l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef14 = undef14) /\ (1 <= (0 + undef14))> 20.24/20.31 20.24/20.31 Fresh variables: 20.24/20.31 undef1, undef6, undef14, 20.24/20.31 20.24/20.31 Undef variables: 20.24/20.31 undef1, undef6, undef14, 20.24/20.31 20.24/20.31 Abstraction variables: 20.24/20.31 20.24/20.31 Exit nodes: 20.24/20.31 20.24/20.31 Accepting locations: 20.24/20.31 20.24/20.31 Asserts: 20.24/20.31 20.24/20.31 ************************************************************* 20.24/20.31 ******************************************************************************************* 20.24/20.31 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 20.24/20.31 ******************************************************************************************* 20.24/20.31 20.24/20.31 Init Location: 0 20.24/20.31 Graph 0: 20.24/20.31 Transitions: 20.24/20.31 Variables: 20.24/20.31 20.24/20.31 Graph 1: 20.24/20.31 Transitions: 20.24/20.31 <l1, l1, 1 + x_5^0 <= y_6^0 /\ undef6 = 0, {y_6^0 -> -1 + y_6^0, rest remain the same}> 20.24/20.31 <l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 + undef14 <= 0, {all remain the same}> 20.24/20.31 <l1, l1, 1 + x_5^0 <= y_6^0 /\ 1 <= undef14, {all remain the same}> 20.24/20.31 Variables: 20.24/20.31 x_5^0, y_6^0 20.24/20.31 20.24/20.31 Graph 2: 20.24/20.31 Transitions: 20.24/20.31 Variables: 20.24/20.31 20.24/20.31 Precedence: 20.24/20.31 Graph 0 20.24/20.31 20.24/20.31 Graph 1 20.24/20.31 <l0, l1, true, {all remain the same}> 20.24/20.31 20.24/20.31 Graph 2 20.24/20.31 <l1, l2, y_6^0 <= x_5^0, {all remain the same}> 20.24/20.31 20.24/20.31 Map Locations to Subgraph: 20.24/20.31 ( 0 , 0 ) 20.24/20.31 ( 1 , 1 ) 20.24/20.31 ( 2 , 2 ) 20.24/20.31 20.24/20.31 ******************************************************************************************* 20.24/20.31 ******************************** CHECKING ASSERTIONS ******************************** 20.24/20.31 ******************************************************************************************* 20.24/20.31 20.24/20.31 Proving termination of subgraph 0 20.24/20.31 Proving termination of subgraph 1 20.24/20.31 Checking unfeasibility... 20.24/20.31 Time used: 0.004963 20.24/20.31 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