Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275219
details
property
value
status
complete
benchmark
n-12.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n118.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
20.3334 seconds
cpu usage
40.6194
user time
38.5838
system time
2.03556
max virtual memory
1290816.0
max residence set size
633676.0
stage attributes
key
value
starexec-result
NO
output
20.29/20.33 NO 20.29/20.33 20.29/20.33 Solver Timeout: 4 20.29/20.33 Global Timeout: 300 20.29/20.33 No parsing errors! 20.29/20.33 Init Location: 0 20.29/20.33 Transitions: 20.29/20.33 <l0, l8, true> 20.29/20.33 <l1, l2, true> 20.29/20.33 <l2, l3, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef5 = undef5), par{Result_4^0 -> undef5}> 20.29/20.33 <l2, l4, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef11 = undef11) /\ ((0 + undef11) <= 0) /\ (0 <= (0 + undef11)), par{tmp_6^0 -> undef11}> 20.29/20.33 <l4, l2, true> 20.29/20.33 <l2, l5, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef19 = undef19), par{tmp_6^0 -> undef19}> 20.29/20.33 <l5, l6, (undef22 = __disjvr_0^0) /\ (__disjvr_0^0 = undef22), par{__disjvr_0^0 -> undef22}> 20.29/20.33 <l6, l7, true, par{x_5^0 -> (~(1) + x_5^0)}> 20.29/20.33 <l7, l2, true> 20.29/20.33 <l8, l1, true> 20.29/20.33 20.29/20.33 Fresh variables: 20.29/20.33 undef5, undef11, undef19, undef22, 20.29/20.33 20.29/20.33 Undef variables: 20.29/20.33 undef5, undef11, undef19, undef22, 20.29/20.33 20.29/20.33 Abstraction variables: 20.29/20.33 20.29/20.33 Exit nodes: 20.29/20.33 20.29/20.33 Accepting locations: 20.29/20.33 20.29/20.33 Asserts: 20.29/20.33 20.29/20.33 Preprocessed LLVMGraph 20.29/20.33 Init Location: 0 20.29/20.33 Transitions: 20.29/20.33 <l0, l2, true> 20.29/20.33 <l2, l3, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef5 = undef5)> 20.29/20.33 <l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef11 = undef11) /\ ((0 + undef11) <= 0) /\ (0 <= (0 + undef11))> 20.29/20.33 <l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef19 = undef19) /\ (undef22 = __disjvr_0^0) /\ (__disjvr_0^0 = undef22), par{__disjvr_0^0 -> undef22, x_5^0 -> (~(1) + x_5^0)}> 20.29/20.33 20.29/20.33 Fresh variables: 20.29/20.33 undef5, undef11, undef19, undef22, 20.29/20.33 20.29/20.33 Undef variables: 20.29/20.33 undef5, undef11, undef19, undef22, 20.29/20.33 20.29/20.33 Abstraction variables: 20.29/20.33 20.29/20.33 Exit nodes: 20.29/20.33 20.29/20.33 Accepting locations: 20.29/20.33 20.29/20.33 Asserts: 20.29/20.33 20.29/20.33 ************************************************************* 20.29/20.33 ******************************************************************************************* 20.29/20.33 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 20.29/20.33 ******************************************************************************************* 20.29/20.33 20.29/20.33 Init Location: 0 20.29/20.33 Graph 0: 20.29/20.33 Transitions: 20.29/20.33 Variables: 20.29/20.33 20.29/20.33 Graph 1: 20.29/20.33 Transitions: 20.29/20.33 <l2, l2, 0 <= x_5^0 /\ undef11 = 0, {all remain the same}> 20.29/20.33 <l2, l2, 0 <= x_5^0 /\ __disjvr_0^0 = undef22, {__disjvr_0^0 -> undef22, x_5^0 -> -1 + x_5^0, rest remain the same}> 20.29/20.33 Variables: 20.29/20.33 x_5^0, __disjvr_0^0 20.29/20.33 20.29/20.33 Graph 2: 20.29/20.33 Transitions: 20.29/20.33 Variables: 20.29/20.33 20.29/20.33 Precedence: 20.29/20.33 Graph 0 20.29/20.33 20.29/20.33 Graph 1 20.29/20.33 <l0, l2, true, {all remain the same}> 20.29/20.33 20.29/20.33 Graph 2 20.29/20.33 <l2, l3, 1 + x_5^0 <= 0, {all remain the same}> 20.29/20.33 20.29/20.33 Map Locations to Subgraph: 20.29/20.33 ( 0 , 0 ) 20.29/20.33 ( 2 , 1 ) 20.29/20.33 ( 3 , 2 ) 20.29/20.33 20.29/20.33 ******************************************************************************************* 20.29/20.33 ******************************** CHECKING ASSERTIONS ******************************** 20.29/20.33 ******************************************************************************************* 20.29/20.33 20.29/20.33 Proving termination of subgraph 0 20.29/20.33 Proving termination of subgraph 1 20.29/20.33 Checking unfeasibility... 20.29/20.33 Time used: 0.003523 20.29/20.33 20.29/20.33 Checking conditional termination of SCC {l2}... 20.29/20.33
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