Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274064
details
property
value
status
complete
benchmark
smagillc-fail.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n159.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
12.5089 seconds
cpu usage
12.5078
user time
11.8831
system time
0.624647
max virtual memory
866648.0
max residence set size
171212.0
stage attributes
key
value
starexec-result
NO
output
12.49/12.50 NO 12.49/12.50 12.49/12.50 Solver Timeout: 4 12.49/12.50 Global Timeout: 300 12.49/12.50 No parsing errors! 12.49/12.50 Init Location: 0 12.49/12.50 Transitions: 12.49/12.50 <l0, l9, true> 12.49/12.50 <l1, l2, true> 12.49/12.50 <l3, l4, true> 12.49/12.50 <l5, l6, true> 12.49/12.50 <l6, l5, true> 12.49/12.50 <l7, l1, ((0 + __rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(2) + curr_serv^0)}> 12.49/12.50 <l7, l1, (1 <= (0 + __rho_1_^0)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(2) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.49/12.50 <l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37), par{__rho_1_^0 -> undef37}> 12.49/12.50 <l2, l5, ((0 + curr_serv^0) <= 0)> 12.49/12.50 <l8, l1, (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4), par{__rho_2_^0 -> undef50, c^0 -> undef51, curr_serv^0 -> (0 + undef54), resp^0 -> 0, servers^0 -> undef54}> 12.49/12.50 <l9, l8, true> 12.49/12.50 12.49/12.50 Fresh variables: 12.49/12.50 undef37, undef50, undef51, undef54, 12.49/12.50 12.49/12.50 Undef variables: 12.49/12.50 undef37, undef50, undef51, undef54, 12.49/12.50 12.49/12.50 Abstraction variables: 12.49/12.50 12.49/12.50 Exit nodes: 12.49/12.50 12.49/12.50 Accepting locations: 12.49/12.50 12.49/12.50 Asserts: 12.49/12.50 12.49/12.50 Preprocessed LLVMGraph 12.49/12.50 Init Location: 0 12.49/12.50 Transitions: 12.49/12.50 <l0, l1, (c^0 = undef51) /\ (curr_serv^0 = (0 + undef54)) /\ (resp^0 = 0) /\ (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4)> 12.49/12.50 <l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(2) + curr_serv^0)}> 12.49/12.50 <l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ (1 <= (0 + undef37)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(2) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.49/12.50 <l1, l5, ((0 + curr_serv^0) <= 0)> 12.49/12.50 <l5, l5, true> 12.49/12.50 12.49/12.50 Fresh variables: 12.49/12.50 undef37, undef50, undef51, undef54, 12.49/12.50 12.49/12.50 Undef variables: 12.49/12.50 undef37, undef50, undef51, undef54, 12.49/12.50 12.49/12.50 Abstraction variables: 12.49/12.50 12.49/12.50 Exit nodes: 12.49/12.50 12.49/12.50 Accepting locations: 12.49/12.50 12.49/12.50 Asserts: 12.49/12.50 12.49/12.50 ************************************************************* 12.49/12.50 ******************************************************************************************* 12.49/12.50 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.49/12.50 ******************************************************************************************* 12.49/12.50 12.49/12.50 Init Location: 0 12.49/12.50 Graph 0: 12.49/12.50 Transitions: 12.49/12.50 Variables: 12.49/12.50 12.49/12.50 Graph 1: 12.49/12.50 Transitions: 12.49/12.50 <l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -2 + curr_serv^0, rest remain the same}> 12.49/12.50 <l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.49/12.50 Variables: 12.49/12.50 c^0, curr_serv^0, resp^0 12.49/12.50 12.49/12.50 Graph 2: 12.49/12.50 Transitions: 12.49/12.50 <l5, l5, true, {all remain the same}> 12.49/12.50 Variables: 12.49/12.50 12.49/12.50 Precedence: 12.49/12.50 Graph 0 12.49/12.50 12.49/12.50 Graph 1 12.49/12.50 <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}> 12.49/12.50 12.49/12.50 Graph 2 12.49/12.50 <l1, l5, curr_serv^0 <= 0, {all remain the same}> 12.49/12.50 12.49/12.50 Map Locations to Subgraph: 12.49/12.50 ( 0 , 0 ) 12.49/12.50 ( 1 , 1 ) 12.49/12.50 ( 5 , 2 ) 12.49/12.50 12.49/12.50 ******************************************************************************************* 12.49/12.50 ******************************** CHECKING ASSERTIONS ******************************** 12.49/12.50 ******************************************************************************************* 12.49/12.50 12.49/12.50 Proving termination of subgraph 0 12.49/12.50 Proving termination of subgraph 1 12.49/12.50 Checking unfeasibility... 12.49/12.50 Time used: 0.024633
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