YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l12, true>
<l1, l2, ((0 + a^0) <= 0)>
<l1, l3, (1 <= (0 + a^0)), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0)}>
<l4, l1, true>
<l3, l5, true>
<l6, l7, true, par{i^0 -> (~(1) + i^0)}>
<l7, l8, true>
<l9, l6, true, par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0)}>
<l10, l6, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))>
<l10, l9, (1 <= (0 + tmp^0))>
<l10, l9, ((1 + tmp^0) <= 0)>
<l8, l3, ((0 + i^0) <= 0)>
<l8, l10, (1 <= (0 + i^0)) /\ (undef60 = undef60), par{tmp^0 -> undef60}>
<l5, l4, ((0 + b^0) <= 0)>
<l5, l7, (1 <= (0 + b^0)), par{b^0 -> (~(1) + b^0), i^0 -> (~(1) + a^0)}>
<l11, l4, true, par{a^0 -> (0 + n^0), b^0 -> 0}>
<l12, l11, true>

Fresh variables:
undef60, 

Undef variables:
undef60, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (a^0 = (0 + n^0)) /\ (b^0 = 0)>
<l4, l2, ((0 + a^0) <= 0)>
<l4, l4, (1 <= (0 + a^0)) /\ ((0 + (1 + b^0)) <= 0), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0)}>
<l4, l7, (1 <= (0 + a^0)) /\ (1 <= (0 + (1 + b^0))), par{a^0 -> (~(1) + a^0), b^0 -> (~(1) + (1 + b^0)), i^0 -> (~(1) + (~(1) + a^0))}>
<l7, l4, ((0 + i^0) <= 0) /\ ((0 + b^0) <= 0)>
<l7, l7, ((0 + i^0) <= 0) /\ (1 <= (0 + b^0)), par{b^0 -> (~(1) + b^0), i^0 -> (~(1) + a^0)}>
<l7, l7, (1 <= (0 + i^0)) /\ (undef60 = undef60) /\ ((0 + undef60) <= 0) /\ (0 <= (0 + undef60)), par{i^0 -> (~(1) + i^0)}>
<l7, l7, (1 <= (0 + i^0)) /\ (undef60 = undef60) /\ (1 <= (0 + undef60)), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0), i^0 -> (~(1) + i^0)}>
<l7, l7, (1 <= (0 + i^0)) /\ (undef60 = undef60) /\ ((1 + undef60) <= 0), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0), i^0 -> (~(1) + i^0)}>

Fresh variables:
undef60, 

Undef variables:
undef60, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 1 <= a^0 /\ 1 + b^0 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, rest remain the same}>
<l4, l7, 0 <= b^0 /\ 1 <= a^0, {a^0 -> -1 + a^0, i^0 -> -2 + a^0, rest remain the same}>
<l7, l4, b^0 <= 0 /\ i^0 <= 0, {all remain the same}>
<l7, l7, i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
<l7, l7, 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
<l7, l7, 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
<l7, l7, 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
Variables:
a^0, b^0, i^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, a^0 = n^0 /\ b^0 = 0, {all remain the same}>

Graph 2
<l4, l2, a^0 <= 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 2 )
( 4 , 1 )
( 7 , 1 )

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.041631
Some transition disabled by a set of invariant(s):
Invariant at l4: 0 <= b^0
Invariant at l7: 0 <= b^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l4, l4, 1 <= a^0 /\ 1 + b^0 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l7, 0 <= b^0 /\ 1 <= a^0, {a^0 -> -1 + a^0, i^0 -> -2 + a^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l4, i^0 <= 0 /\ b^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.082781

Checking conditional termination of SCC {l4, l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004525s
Ranking function: -3 + 3*a^0
New Graphs: 
Transitions:
<l7, l7, i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
Variables:
a^0, b^0, i^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001653s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016127s
Trying to remove transition: <l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020699s
Time used: 0.020171
Trying to remove transition: <l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021706s
Time used: 0.020393
Trying to remove transition: <l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013482s
Time used: 0.012149
Trying to remove transition: <l7, l7, i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023613s
Time used: 0.022678
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.118009s
Time used: 0.116638

LOG: SAT solveNonLinear - Elapsed time: 0.118009s
Cost: 0; Total time: 0.116638
Termination implied by a set of invariant(s):
Invariant at l4: 0 <= 1 + b^0
Invariant at l7: i^0 <= a^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l7, 0 <= b^0 /\ 1 <= a^0, {a^0 -> -1 + a^0, i^0 -> -2 + a^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l4, i^0 <= a^0 /\ i^0 <= 0 /\ b^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, i^0 <= a^0 /\ i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, i^0 <= a^0 /\ i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
Ranking function: a^0
New Graphs: 
Transitions:
<l7, l7, i^0 <= a^0 /\ i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
Variables:
a^0, b^0, i^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001741s
Ranking function: -3 + 3*b^0
New Graphs: 
Transitions:
<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
Variables:
a^0, b^0, i^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001081s
Ranking function: -1 + i^0
New Graphs: 
INVARIANTS: 
4: 0 <= 1 + b^0 , 
7: i^0 <= a^0 , 
Quasi-INVARIANTS to narrow Graph: 
4: 
7: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates