details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	5.09015 seconds
cpu usage	5.09009
user time	4.77975
system time	0.310342
max virtual memory	853964.0
max residence set size	155176.0

stage attributes

key	value
starexec-result	NO

output

5.01/5.08 NO 5.01/5.08 5.01/5.08 Solver Timeout: 4 5.01/5.08 Global Timeout: 300 5.01/5.08 No parsing errors! 5.01/5.08 Init Location: 0 5.01/5.08 Transitions: 5.01/5.08 <l0, l10, true> 5.01/5.08 <l1, l2, ((0 + dobreak^0) <= 0) /\ (undef5 = 1) /\ (undef4 = undef4) /\ (1 <= (0 + undef4)), par{A^0 -> 0, n^0 -> undef4}> 5.01/5.08 <l1, l3, (1 <= (0 + dobreak^0))> 5.01/5.08 <l4, l1, true> 5.01/5.08 <l2, l5, true> 5.01/5.08 <l6, l7, true> 5.01/5.08 <l3, l8, true> 5.01/5.08 <l8, l3, true> 5.01/5.08 <l5, l2, (1 <= (0 + n^0))> 5.01/5.08 <l5, l4, ((0 + n^0) <= 0) /\ (undef38 = 1) /\ (undef36 = undef36), par{R^0 -> 0, dobreak^0 -> undef36}> 5.01/5.08 <l9, l4, (undef41 = undef41), par{A^0 -> 0, R^0 -> 0, dobreak^0 -> undef41}> 5.01/5.08 <l10, l9, true> 5.01/5.08 5.01/5.08 Fresh variables: 5.01/5.08 undef4, undef5, undef36, undef38, undef41, 5.01/5.08 5.01/5.08 Undef variables: 5.01/5.08 undef4, undef5, undef36, undef38, undef41, 5.01/5.08 5.01/5.08 Abstraction variables: 5.01/5.08 5.01/5.08 Exit nodes: 5.01/5.08 5.01/5.08 Accepting locations: 5.01/5.08 5.01/5.08 Asserts: 5.01/5.08 5.01/5.08 Preprocessed LLVMGraph 5.01/5.08 Init Location: 0 5.01/5.08 Transitions: 5.01/5.08 <l0, l2, (undef41 = undef41) /\ ((0 + undef41) <= 0) /\ (undef5 = 1) /\ (undef4 = undef4) /\ (1 <= (0 + undef4)), par{n^0 -> undef4}> 5.01/5.08 <l0, l3, (undef41 = undef41) /\ (1 <= (0 + undef41))> 5.01/5.08 <l2, l2, (1 <= (0 + n^0))> 5.01/5.08 <l2, l2, ((0 + n^0) <= 0) /\ (undef38 = 1) /\ (undef36 = undef36) /\ ((0 + undef36) <= 0) /\ (undef5 = 1) /\ (undef4 = undef4) /\ (1 <= (0 + undef4)), par{n^0 -> undef4}> 5.01/5.08 <l2, l3, ((0 + n^0) <= 0) /\ (undef38 = 1) /\ (undef36 = undef36) /\ (1 <= (0 + undef36))> 5.01/5.08 <l3, l3, true> 5.01/5.08 5.01/5.08 Fresh variables: 5.01/5.08 undef4, undef5, undef36, undef38, undef41, 5.01/5.08 5.01/5.08 Undef variables: 5.01/5.08 undef4, undef5, undef36, undef38, undef41, 5.01/5.08 5.01/5.08 Abstraction variables: 5.01/5.08 5.01/5.08 Exit nodes: 5.01/5.08 5.01/5.08 Accepting locations: 5.01/5.08 5.01/5.08 Asserts: 5.01/5.08 5.01/5.08 ************************************************************* 5.01/5.08 ******************************************************************************************* 5.01/5.08 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.01/5.08 ******************************************************************************************* 5.01/5.08 5.01/5.08 Init Location: 0 5.01/5.08 Graph 0: 5.01/5.08 Transitions: 5.01/5.08 Variables: 5.01/5.08 5.01/5.08 Graph 1: 5.01/5.08 Transitions: 5.01/5.08 <l2, l2, 1 <= n^0, {all remain the same}> 5.01/5.08 <l2, l2, n^0 <= 0 /\ undef36 <= 0 /\ 1 <= undef4 /\ undef5 = 1 /\ undef38 = 1, {n^0 -> undef4, rest remain the same}> 5.01/5.08 Variables: 5.01/5.08 n^0 5.01/5.08 5.01/5.08 Graph 2: 5.01/5.08 Transitions: 5.01/5.08 <l3, l3, true, {all remain the same}> 5.01/5.08 Variables: 5.01/5.08 5.01/5.08 Precedence: 5.01/5.08 Graph 0 5.01/5.08 5.01/5.08 Graph 1 5.01/5.08 <l0, l2, undef41 <= 0 /\ 1 <= undef4 /\ undef5 = 1, {n^0 -> undef4, rest remain the same}> 5.01/5.08 5.01/5.08 Graph 2 5.01/5.08 <l0, l3, 1 <= undef41, {all remain the same}> 5.01/5.08 <l2, l3, n^0 <= 0 /\ 1 <= undef36 /\ undef38 = 1, {all remain the same}> 5.01/5.08 5.01/5.08 Map Locations to Subgraph: 5.01/5.08 ( 0 , 0 ) 5.01/5.08 ( 2 , 1 ) 5.01/5.08 ( 3 , 2 ) 5.01/5.08 5.01/5.08 ******************************************************************************************* 5.01/5.08 ******************************** CHECKING ASSERTIONS ******************************** 5.01/5.08 ******************************************************************************************* 5.01/5.08 5.01/5.08 Proving termination of subgraph 0 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