Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274403
details
property
value
status
complete
benchmark
s2.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n009.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0303659 seconds
cpu usage
0.030521
user time
0.022218
system time
0.008303
max virtual memory
113176.0
max residence set size
6052.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.02 YES 0.00/0.02 0.00/0.02 Solver Timeout: 4 0.00/0.02 Global Timeout: 300 0.00/0.02 No parsing errors! 0.00/0.02 Init Location: 0 0.00/0.02 Transitions: 0.00/0.02 <l0, l5, true> 0.00/0.02 <l1, l2, (undef6 = 0) /\ (0 <= (0 + undef6)) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)) /\ ((0 + undef6) <= 0) /\ ((1 + undef6) <= (0 + __const_10^0)) /\ (undef7 = (1 + undef6)) /\ (1 <= (0 + undef7)) /\ ((0 + undef7) <= 1) /\ (1 <= (0 + undef7)) /\ ((0 + undef7) <= 1) /\ ((1 + undef7) <= (0 + __const_10^0)) /\ (undef2 = (1 + undef7)) /\ (2 <= (0 + undef2)) /\ ((0 + undef2) <= 2), par{i!14^0 -> undef2}> 0.00/0.02 <l2, l3, ((0 + __const_10^0) <= (0 + i!14^0)), par{result!12^0 -> (0 + temp0!15^0)}> 0.00/0.02 <l2, l4, ((1 + i!14^0) <= (0 + __const_10^0)) /\ (undef14 = (1 + i!14^0)) /\ ((0 + undef14) <= (1 + i!22^0)) /\ ((1 + i!22^0) <= (0 + undef14)) /\ ((1 + i!22^0) <= (0 + __const_10^0)), par{i!14^0 -> undef14}> 0.00/0.02 <l4, l2, true> 0.00/0.02 <l5, l1, true> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef2, undef6, undef7, undef14, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef2, undef6, undef7, undef14, 0.00/0.02 0.00/0.02 Abstraction variables: 0.00/0.02 0.00/0.02 Exit nodes: 0.00/0.02 0.00/0.02 Accepting locations: 0.00/0.02 0.00/0.02 Asserts: 0.00/0.02 0.00/0.02 Preprocessed LLVMGraph 0.00/0.02 Init Location: 0 0.00/0.02 Transitions: 0.00/0.02 <l0, l2, (i!14^0 = undef2) /\ (undef6 = 0) /\ (0 <= (0 + undef6)) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6)) /\ ((0 + undef6) <= 0) /\ ((1 + undef6) <= (0 + __const_10^0)) /\ (undef7 = (1 + undef6)) /\ (1 <= (0 + undef7)) /\ ((0 + undef7) <= 1) /\ (1 <= (0 + undef7)) /\ ((0 + undef7) <= 1) /\ ((1 + undef7) <= (0 + __const_10^0)) /\ (undef2 = (1 + undef7)) /\ (2 <= (0 + undef2)) /\ ((0 + undef2) <= 2)> 0.00/0.02 <l2, l3, ((0 + __const_10^0) <= (0 + i!14^0))> 0.00/0.02 <l2, l2, ((1 + i!14^0) <= (0 + __const_10^0)) /\ (undef14 = (1 + i!14^0)) /\ ((0 + undef14) <= (1 + i!22^0)) /\ ((1 + i!22^0) <= (0 + undef14)) /\ ((1 + i!22^0) <= (0 + __const_10^0)), par{i!14^0 -> undef14}> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef2, undef6, undef7, undef14, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef2, undef6, undef7, undef14, 0.00/0.02 0.00/0.02 Abstraction variables: 0.00/0.02 0.00/0.02 Exit nodes: 0.00/0.02 0.00/0.02 Accepting locations: 0.00/0.02 0.00/0.02 Asserts: 0.00/0.02 0.00/0.02 ************************************************************* 0.00/0.02 ******************************************************************************************* 0.00/0.02 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.02 ******************************************************************************************* 0.00/0.02 0.00/0.02 Init Location: 0 0.00/0.02 Graph 0: 0.00/0.02 Transitions: 0.00/0.02 Variables: 0.00/0.02 0.00/0.02 Graph 1: 0.00/0.02 Transitions: 0.00/0.02 <l2, l2, 1 + i!14^0 <= __const_10^0 /\ 1 + i!22^0 <= __const_10^0 /\ 1 + i!14^0 = undef14 /\ 1 + i!22^0 = undef14, {i!14^0 -> undef14, rest remain the same}> 0.00/0.02 Variables: 0.00/0.02 __const_10^0, i!14^0, i!22^0 0.00/0.02 0.00/0.02 Graph 2: 0.00/0.02 Transitions: 0.00/0.02 Variables: 0.00/0.02 0.00/0.02 Precedence: 0.00/0.02 Graph 0 0.00/0.02 0.00/0.02 Graph 1 0.00/0.02 <l0, l2, 1 + undef6 <= __const_10^0 /\ 1 + undef7 <= __const_10^0 /\ i!14^0 = undef2 /\ undef6 = 0 /\ 1 + undef6 = undef7 /\ undef2 = 1 + undef7 /\ undef7 = 1 /\ undef2 = 2, {all remain the same}> 0.00/0.02 0.00/0.02 Graph 2 0.00/0.02 <l2, l3, __const_10^0 <= i!14^0, {all remain the same}> 0.00/0.02 0.00/0.02 Map Locations to Subgraph: 0.00/0.02 ( 0 , 0 ) 0.00/0.02 ( 2 , 1 ) 0.00/0.02 ( 3 , 2 ) 0.00/0.02 0.00/0.02 ******************************************************************************************* 0.00/0.02 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.02 ******************************************************************************************* 0.00/0.02 0.00/0.02 Proving termination of subgraph 0 0.00/0.02 Proving termination of subgraph 1 0.00/0.02 Checking unfeasibility... 0.00/0.02 Time used: 0.00309 0.00/0.02 0.00/0.02 Checking conditional termination of SCC {l2}... 0.00/0.02 0.00/0.02 LOG: CALL solveLinear 0.00/0.02 0.00/0.02 LOG: RETURN solveLinear - Elapsed time: 0.000948s 0.00/0.02 �[33mRanking function: �[36m-i!14^0 + i!22^0�[0m 0.00/0.02 New Graphs: 0.00/0.02 Proving termination of subgraph 2
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