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