YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, ((0 + op2^0) <= 0) /\ (0 <= (0 + op2^0)) /\ (0 <= (0 + op1^0))>
<l3, l4, (1 <= (0 + op2^0)), par{op1^0 -> (1 + op1^0), op2^0 -> (~(1) + op2^0)}>
<l4, l3, true>
<l3, l5, (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>
<l5, l3, (1 <= (0 + op2^0)), par{op2^0 -> (~(1) + op2^0)}>
<l5, l2, true>
<l2, l5, (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>
<l6, l1, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, ((0 + op2^0) <= 0) /\ (0 <= (0 + op2^0)) /\ (0 <= (0 + op1^0)) /\ (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>
<l3, l3, (1 <= (0 + op2^0)), par{op1^0 -> (1 + op1^0), op2^0 -> (~(1) + op2^0)}>
<l3, l5, (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>
<l5, l3, (1 <= (0 + op2^0)), par{op2^0 -> (~(1) + op2^0)}>
<l5, l5, (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 <= op2^0, {op1^0 -> 1 + op1^0, op2^0 -> -1 + op2^0, rest remain the same}>
<l3, l5, 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
<l5, l3, 1 <= op2^0, {op2^0 -> -1 + op2^0, rest remain the same}>
<l5, l5, 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
Variables:
op1^0, op2^0

Precedence: 
Graph 0

Graph 1
<l0, l5, 1 <= op1^0 /\ op2^0 = 0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3, l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001349s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010621s
Trying to remove transition: <l5, l5, 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020112s
Time used: 0.019843
Trying to remove transition: <l5, l3, 1 <= op2^0, {op2^0 -> -1 + op2^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010942s
Time used: 0.010062
Trying to remove transition: <l3, l5, 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016157s
Time used: 0.015592
Trying to remove transition: <l3, l3, 1 <= op2^0, {op1^0 -> 1 + op1^0, op2^0 -> -1 + op2^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001885s
Time used: 4.00082
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014968s
Time used: 4.00023
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.353210s
Time used: 0.326599

LOG: SAT solveNonLinear - Elapsed time: 0.353210s
Cost: 0; Total time: 0.326599
Termination implied by a set of invariant(s):
Invariant at l3: 0 <= op2^0
Invariant at l3: 0 <= 1 + op1^0 + op2^0
Invariant at l3: 0 <= op1^0 + op2^0
Invariant at l5: 1 <= op1^0 + op2^0
Invariant at l5: 0 <= 1 + op1^0 + op2^0
Invariant at l5: 1 <= op2^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l5, 0 <= op1^0 + op2^0 /\ 0 <= op2^0 /\ 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l3, 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op2^0 -> -1 + op2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 <= op1^0 /\ 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^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): 
<l3, l3, 0 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> 1 + op1^0, op2^0 -> -1 + op2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l5, 0 <= op1^0 + op2^0 /\ 0 <= op2^0 /\ 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l3, 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op2^0 -> -1 + op2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 <= op1^0 /\ 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
Ranking function: 2 + 2*op1^0 + 2*op2^0
New Graphs: 
Transitions:
<l3, l3, 0 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> 1 + op1^0, op2^0 -> -1 + op2^0, rest remain the same}>
Variables:
op1^0, op2^0
Transitions:
<l5, l5, 1 <= op1^0 /\ 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
Variables:
op1^0, op2^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000921s
Ranking function: -1 + op2^0
New Graphs: 
Transitions:
<l5, l5, 1 <= op1^0 /\ 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
Variables:
op1^0, op2^0
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001022s
Ranking function: -1 + op1^0
New Graphs: 
INVARIANTS: 
3: 0 <= op1^0 + op2^0 , 0 <= op2^0 , 0 <= 1 + op1^0 + op2^0 , 
5: 1 <= op1^0 + op2^0 , 1 <= op2^0 , 0 <= 1 + op1^0 + op2^0 , 
Quasi-INVARIANTS to narrow Graph: 
3: 
5: 
Program Terminates