Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432275987
details
property
value
status
complete
benchmark
s2.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0311691 seconds
cpu usage
0.031305
user time
0.020643
system time
0.010662
max virtual memory
113176.0
max residence set size
5996.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, (undef5 = 0) /\ (0 <= (0 + undef5)) /\ ((0 + undef5) <= 0) /\ (0 <= (0 + undef5)) /\ ((0 + undef5) <= 0) /\ ((1 + undef5) <= 10) /\ (undef6 = (1 + undef5)) /\ (1 <= (0 + undef6)) /\ ((0 + undef6) <= 1) /\ (1 <= (0 + undef6)) /\ ((0 + undef6) <= 1) /\ ((1 + undef6) <= 10) /\ (undef1 = (1 + undef6)) /\ (2 <= (0 + undef1)) /\ ((0 + undef1) <= 2), par{i!14^0 -> undef1}> 0.00/0.02 <l2, l3, (10 <= (0 + i!14^0)), par{result!12^0 -> (0 + temp0!15^0)}> 0.00/0.02 <l2, l4, ((1 + i!14^0) <= 10) /\ (undef11 = (1 + i!14^0)) /\ ((0 + undef11) <= (1 + i!22^0)) /\ ((1 + i!22^0) <= (0 + undef11)) /\ ((1 + i!22^0) <= 10), par{i!14^0 -> undef11}> 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 undef1, undef5, undef6, undef11, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef1, undef5, undef6, undef11, 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 = undef1) /\ (undef5 = 0) /\ (0 <= (0 + undef5)) /\ ((0 + undef5) <= 0) /\ (0 <= (0 + undef5)) /\ ((0 + undef5) <= 0) /\ ((1 + undef5) <= 10) /\ (undef6 = (1 + undef5)) /\ (1 <= (0 + undef6)) /\ ((0 + undef6) <= 1) /\ (1 <= (0 + undef6)) /\ ((0 + undef6) <= 1) /\ ((1 + undef6) <= 10) /\ (undef1 = (1 + undef6)) /\ (2 <= (0 + undef1)) /\ ((0 + undef1) <= 2)> 0.00/0.02 <l2, l3, (10 <= (0 + i!14^0))> 0.00/0.02 <l2, l2, ((1 + i!14^0) <= 10) /\ (undef11 = (1 + i!14^0)) /\ ((0 + undef11) <= (1 + i!22^0)) /\ ((1 + i!22^0) <= (0 + undef11)) /\ ((1 + i!22^0) <= 10), par{i!14^0 -> undef11}> 0.00/0.02 0.00/0.02 Fresh variables: 0.00/0.02 undef1, undef5, undef6, undef11, 0.00/0.02 0.00/0.02 Undef variables: 0.00/0.02 undef1, undef5, undef6, undef11, 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, i!14^0 <= 9 /\ i!22^0 <= 9 /\ 1 + i!14^0 = undef11 /\ 1 + i!22^0 = undef11, {i!14^0 -> undef11, rest remain the same}> 0.00/0.02 Variables: 0.00/0.02 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, i!14^0 = undef1 /\ undef5 = 0 /\ 1 + undef5 = undef6 /\ undef1 = 1 + undef6 /\ undef6 = 1 /\ undef1 = 2, {all remain the same}> 0.00/0.02 0.00/0.02 Graph 2 0.00/0.02 <l2, l3, 10 <= 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.004418 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.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.000892s 0.00/0.03 �[33mRanking function: �[36m-i!14^0 + i!22^0�[0m 0.00/0.03 New Graphs: 0.00/0.03 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