details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	12.2987 seconds
cpu usage	12.2975
user time	11.696
system time	0.601515
max virtual memory	815452.0
max residence set size	133128.0

stage attributes

key	value
starexec-result	NO

output

12.25/12.29 NO 12.25/12.29 12.25/12.29 Solver Timeout: 4 12.25/12.29 Global Timeout: 300 12.25/12.29 No parsing errors! 12.25/12.29 Init Location: 0 12.25/12.29 Transitions: 12.25/12.29 <l0, l9, true> 12.25/12.29 <l1, l2, true> 12.25/12.29 <l3, l4, true> 12.25/12.29 <l5, l6, true> 12.25/12.29 <l6, l5, true> 12.25/12.29 <l7, l1, ((0 + ___rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}> 12.25/12.29 <l7, l1, (1 <= (0 + ___rho_1_^0)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.25/12.29 <l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef31 = undef31), par{___rho_1_^0 -> undef31}> 12.25/12.29 <l2, l5, ((0 + curr_serv^0) <= 0)> 12.25/12.29 <l8, l1, (undef42 = undef42) /\ (1 <= (0 + undef42)) /\ (undef45 = 4), par{c^0 -> undef42, curr_serv^0 -> (0 + undef45), resp^0 -> 0, servers^0 -> undef45}> 12.25/12.29 <l9, l8, true> 12.25/12.29 12.25/12.29 Fresh variables: 12.25/12.29 undef31, undef42, undef45, 12.25/12.29 12.25/12.29 Undef variables: 12.25/12.29 undef31, undef42, undef45, 12.25/12.29 12.25/12.29 Abstraction variables: 12.25/12.29 12.25/12.29 Exit nodes: 12.25/12.29 12.25/12.29 Accepting locations: 12.25/12.29 12.25/12.29 Asserts: 12.25/12.29 12.25/12.29 Preprocessed LLVMGraph 12.25/12.29 Init Location: 0 12.25/12.29 Transitions: 12.25/12.29 <l0, l1, (c^0 = undef42) /\ (curr_serv^0 = (0 + undef45)) /\ (resp^0 = 0) /\ (undef42 = undef42) /\ (1 <= (0 + undef42)) /\ (undef45 = 4)> 12.25/12.29 <l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef31 = undef31) /\ ((0 + undef31) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}> 12.25/12.29 <l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef31 = undef31) /\ (1 <= (0 + undef31)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.25/12.29 <l1, l5, ((0 + curr_serv^0) <= 0)> 12.25/12.29 <l5, l5, true> 12.25/12.29 12.25/12.29 Fresh variables: 12.25/12.29 undef31, undef42, undef45, 12.25/12.29 12.25/12.29 Undef variables: 12.25/12.29 undef31, undef42, undef45, 12.25/12.29 12.25/12.29 Abstraction variables: 12.25/12.29 12.25/12.29 Exit nodes: 12.25/12.29 12.25/12.29 Accepting locations: 12.25/12.29 12.25/12.29 Asserts: 12.25/12.29 12.25/12.29 ************************************************************* 12.25/12.29 ******************************************************************************************* 12.25/12.29 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.25/12.29 ******************************************************************************************* 12.25/12.29 12.25/12.29 Init Location: 0 12.25/12.29 Graph 0: 12.25/12.29 Transitions: 12.25/12.29 Variables: 12.25/12.29 12.25/12.29 Graph 1: 12.25/12.29 Transitions: 12.25/12.29 <l1, l1, undef31 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}> 12.25/12.29 <l1, l1, 1 <= curr_serv^0 /\ 1 <= undef31, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.25/12.29 Variables: 12.25/12.29 c^0, curr_serv^0, resp^0 12.25/12.29 12.25/12.29 Graph 2: 12.25/12.29 Transitions: 12.25/12.29 <l5, l5, true, {all remain the same}> 12.25/12.29 Variables: 12.25/12.29 12.25/12.29 Precedence: 12.25/12.29 Graph 0 12.25/12.29 12.25/12.29 Graph 1 12.25/12.29 <l0, l1, 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 4, {all remain the same}> 12.25/12.29 12.25/12.29 Graph 2 12.25/12.29 <l1, l5, curr_serv^0 <= 0, {all remain the same}> 12.25/12.29 12.25/12.29 Map Locations to Subgraph: 12.25/12.29 ( 0 , 0 ) 12.25/12.29 ( 1 , 1 ) 12.25/12.29 ( 5 , 2 ) 12.25/12.29 12.25/12.29 ******************************************************************************************* 12.25/12.29 ******************************** CHECKING ASSERTIONS ******************************** 12.25/12.29 ******************************************************************************************* 12.25/12.29 12.25/12.29 Proving termination of subgraph 0 12.25/12.29 Proving termination of subgraph 1 12.25/12.29 Checking unfeasibility... 12.25/12.29 Time used: 0.005372 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