Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275945
details
property
value
status
complete
benchmark
wrong_loop.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n082.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
9.60443 seconds
cpu usage
19.1122
user time
17.6006
system time
1.51163
max virtual memory
983540.0
max residence set size
252992.0
stage attributes
key
value
starexec-result
NO
output
9.51/9.60 NO 9.51/9.60 9.51/9.60 Solver Timeout: 4 9.51/9.60 Global Timeout: 300 9.51/9.60 No parsing errors! 9.51/9.60 Init Location: 0 9.51/9.60 Transitions: 9.51/9.60 <l0, l8, true> 9.51/9.60 <l1, l2, true, par{j^0 -> (0 + i^0)}> 9.51/9.60 <l2, l3, true, par{i^0 -> (1 + i^0)}> 9.51/9.60 <l4, l1, ((1 + __const_5^0) <= (0 + i^0))> 9.51/9.60 <l4, l1, ((1 + i^0) <= (0 + __const_5^0))> 9.51/9.60 <l4, l2, ((0 + i^0) <= (0 + __const_5^0)) /\ ((0 + __const_5^0) <= (0 + i^0)) /\ (undef19 = undef19), par{i^0 -> undef19}> 9.51/9.60 <l5, l6, ((0 + __const_10^0) <= (0 + i^0))> 9.51/9.60 <l5, l4, ((1 + i^0) <= (0 + __const_10^0))> 9.51/9.60 <l3, l5, true> 9.51/9.60 <l7, l3, true, par{i^0 -> 0}> 9.51/9.60 <l8, l7, true> 9.51/9.60 9.51/9.60 Fresh variables: 9.51/9.60 undef19, 9.51/9.60 9.51/9.60 Undef variables: 9.51/9.60 undef19, 9.51/9.60 9.51/9.60 Abstraction variables: 9.51/9.60 9.51/9.60 Exit nodes: 9.51/9.60 9.51/9.60 Accepting locations: 9.51/9.60 9.51/9.60 Asserts: 9.51/9.60 9.51/9.60 Preprocessed LLVMGraph 9.51/9.60 Init Location: 0 9.51/9.60 Transitions: 9.51/9.60 <l0, l3, (i^0 = 0)> 9.51/9.60 <l3, l6, ((0 + __const_10^0) <= (0 + i^0))> 9.51/9.60 <l3, l3, ((1 + i^0) <= (0 + __const_10^0)) /\ ((1 + __const_5^0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}> 9.51/9.60 <l3, l3, ((1 + i^0) <= (0 + __const_10^0)) /\ ((1 + i^0) <= (0 + __const_5^0)), par{i^0 -> (1 + i^0)}> 9.51/9.60 <l3, l3, ((1 + i^0) <= (0 + __const_10^0)) /\ ((0 + i^0) <= (0 + __const_5^0)) /\ ((0 + __const_5^0) <= (0 + i^0)) /\ (undef19 = undef19), par{i^0 -> (1 + undef19)}> 9.51/9.60 9.51/9.60 Fresh variables: 9.51/9.60 undef19, 9.51/9.60 9.51/9.60 Undef variables: 9.51/9.60 undef19, 9.51/9.60 9.51/9.60 Abstraction variables: 9.51/9.60 9.51/9.60 Exit nodes: 9.51/9.60 9.51/9.60 Accepting locations: 9.51/9.60 9.51/9.60 Asserts: 9.51/9.60 9.51/9.60 ************************************************************* 9.51/9.60 ******************************************************************************************* 9.51/9.60 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 9.51/9.60 ******************************************************************************************* 9.51/9.60 9.51/9.60 Init Location: 0 9.51/9.60 Graph 0: 9.51/9.60 Transitions: 9.51/9.60 Variables: 9.51/9.60 9.51/9.60 Graph 1: 9.51/9.60 Transitions: 9.51/9.60 <l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + __const_5^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}> 9.51/9.60 <l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}> 9.51/9.60 <l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}> 9.51/9.60 Variables: 9.51/9.60 __const_10^0, __const_5^0, i^0 9.51/9.60 9.51/9.60 Graph 2: 9.51/9.60 Transitions: 9.51/9.60 Variables: 9.51/9.60 9.51/9.60 Precedence: 9.51/9.60 Graph 0 9.51/9.60 9.51/9.60 Graph 1 9.51/9.60 <l0, l3, i^0 = 0, {all remain the same}> 9.51/9.60 9.51/9.60 Graph 2 9.51/9.60 <l3, l6, __const_10^0 <= i^0, {all remain the same}> 9.51/9.60 9.51/9.60 Map Locations to Subgraph: 9.51/9.60 ( 0 , 0 ) 9.51/9.60 ( 3 , 1 ) 9.51/9.60 ( 6 , 2 ) 9.51/9.60 9.51/9.60 ******************************************************************************************* 9.51/9.60 ******************************** CHECKING ASSERTIONS ******************************** 9.51/9.60 ******************************************************************************************* 9.51/9.60 9.51/9.60 Proving termination of subgraph 0 9.51/9.60 Proving termination of subgraph 1 9.51/9.60 Checking unfeasibility... 9.51/9.60 Time used: 0.007229
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