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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l11, true>
<l1, l2, ((1 + n^0) <= (0 + i^0))>
<l1, l3, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0), j^0 -> (2 + j^0)}>
<l4, l3, true, par{i^0 -> 0}>
<l5, l4, true, par{n^0 -> 0}>
<l6, l4, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0)), par{n^0 -> (0 + __const_1023^0)}>
<l6, l5, (1 <= (0 + tmp^0))>
<l6, l5, ((1 + tmp^0) <= 0)>
<l3, l1, true>
<l7, l8, true>
<l9, l7, ((0 + __const_1023^0) <= (0 + b^0))>
<l9, l7, ((1 + b^0) <= (0 + __const_1023^0))>
<l2, l7, ((1 + b^0) <= 0)>
<l2, l9, (0 <= (0 + b^0))>
<l10, l6, (undef84 = undef84), par{tmp^0 -> undef84}>
<l11, l10, true>

Fresh variables:
undef84, 

Undef variables:
undef84, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i^0 = 0) /\ (undef84 = undef84) /\ ((0 + undef84) <= 0) /\ (0 <= (0 + undef84)), par{n^0 -> (0 + __const_1023^0)}>
<l0, l3, (i^0 = 0) /\ (undef84 = undef84) /\ (1 <= (0 + undef84)), par{n^0 -> 0}>
<l0, l3, (i^0 = 0) /\ (undef84 = undef84) /\ ((1 + undef84) <= 0), par{n^0 -> 0}>
<l3, l8, ((1 + n^0) <= (0 + i^0)) /\ ((1 + b^0) <= 0)>
<l3, l8, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + b^0)) /\ ((0 + __const_1023^0) <= (0 + b^0))>
<l3, l8, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + b^0)) /\ ((1 + b^0) <= (0 + __const_1023^0))>
<l3, l3, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0), j^0 -> (2 + j^0)}>

Fresh variables:
undef84, 

Undef variables:
undef84, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, i^0 <= n^0, {i^0 -> 1 + i^0, j^0 -> 2 + j^0, rest remain the same}>
Variables:
i^0, j^0, n^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, i^0 = 0 /\ undef84 = 0, {n^0 -> __const_1023^0, rest remain the same}>
<l0, l3, 1 <= undef84 /\ i^0 = 0, {n^0 -> 0, rest remain the same}>
<l0, l3, 1 + undef84 <= 0 /\ i^0 = 0, {n^0 -> 0, rest remain the same}>

Graph 2
<l3, l8, 1 + b^0 <= 0 /\ 1 + n^0 <= i^0, {all remain the same}>
<l3, l8, 1 + n^0 <= i^0 /\ __const_1023^0 <= b^0 /\ 0 <= b^0, {all remain the same}>
<l3, l8, 1 + b^0 <= __const_1023^0 /\ 1 + n^0 <= i^0 /\ 0 <= b^0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 3 , 1 )
( 8 , 2 )

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000704s
Ranking function: -i^0 + n^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l8}...
No cycles found.

Program Terminates