/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, (undef3 = 0) /\ (0 <= (0 + undef3)) /\ ((0 + undef3) <= 0), par{i_13^0 -> undef3}>
<l3, l2, ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef13 = (1 + i_13^0)) /\ (undef9 = undef9) /\ (2 <= (0 + undef9)) /\ ((0 + undef9) <= 2) /\ (undef8 = undef8) /\ ((0 + undef8) <= (0 + undef9)) /\ ((0 + undef9) <= (0 + undef8)), par{a_20^0 -> undef8, i_13^0 -> undef9}>
<l4, l2, ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef16 = (1 + i_13^0)) /\ (1 <= (0 + undef16)) /\ ((0 + undef16) <= 1), par{i_13^0 -> undef16}>
<l2, l5, ((0 + __const_10^0) <= (0 + i_13^0)), par{rt_11^0 -> (0 + st_14^0)}>
<l2, l6, (undef29 = undef29) /\ ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef28 = (1 + i_13^0)) /\ ((0 + undef28) <= (1 + undef29)) /\ ((1 + undef29) <= (0 + undef28)) /\ ((1 + undef29) <= (0 + __const_10^0)), par{i_13^0 -> undef28, i_21^0 -> undef29}>
<l6, l2, true>
<l7, l1, true>

Fresh variables:
undef3, undef8, undef9, undef13, undef16, undef28, undef29, 

Undef variables:
undef3, undef8, undef9, undef13, undef16, undef28, undef29, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (i_13^0 = undef3) /\ (undef3 = 0) /\ (0 <= (0 + undef3)) /\ ((0 + undef3) <= 0)>
<l2, l5, ((0 + __const_10^0) <= (0 + i_13^0))>
<l2, l2, (undef29 = undef29) /\ ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef28 = (1 + i_13^0)) /\ ((0 + undef28) <= (1 + undef29)) /\ ((1 + undef29) <= (0 + undef28)) /\ ((1 + undef29) <= (0 + __const_10^0)), par{i_13^0 -> undef28}>

Fresh variables:
undef3, undef8, undef9, undef13, undef16, undef28, undef29, 

Undef variables:
undef3, undef8, undef9, undef13, undef16, undef28, undef29, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef29 <= __const_10^0 /\ 1 + i_13^0 = undef28 /\ undef28 = 1 + undef29, {i_13^0 -> undef28, rest remain the same}>
Variables:
__const_10^0, i_13^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, i_13^0 = undef3 /\ undef3 = 0, {all remain the same}>

Graph 2
<l2, l5, __const_10^0 <= i_13^0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 5 , 2 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.002186

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000912s
Ranking function: -1 + __const_10^0 - i_13^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l5}...
No cycles found.

Program Terminates