NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0}>
<l2, l2, (1 = arg2), par{arg1 -> 1, arg2 -> 2}>
<l2, l2, (arg2 < 10) /\ (arg2 > 1) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
<l2, l2, (arg2 < 10) /\ (arg2 > 1) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
<l2, l2, (arg2 > 10) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
<l2, l2, (arg2 > 10) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>
<l3, l1, true, par{arg1 -> undef15, arg2 -> undef16}>

Fresh variables:
undef15, undef16, 

Undef variables:
undef15, undef16, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0) /\ (arg2 = undef16) /\ (undef15 > 0) /\ (undef16 > ~(1))>
<l2, l2, (1 = arg2), par{arg1 -> 1, arg2 -> 2}>
<l2, l2, (arg2 < 10) /\ (arg2 > 1) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
<l2, l2, (arg2 < 10) /\ (arg2 > 1) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
<l2, l2, (arg2 > 10) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
<l2, l2, (arg2 > 10) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>

Fresh variables:
undef15, undef16, 

Undef variables:
undef15, undef16, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
Variables:
arg2, arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004948s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.074490s
Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009882s
Time used: 4.00858
Trying to remove transition: <l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.588261s
Time used: 0.583693
Trying to remove transition: <l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.389367s
Time used: 0.382389
Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008958s
Time used: 4.00155
Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012928s
Time used: 4.00717
Trying to remove transition: <l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.121879s
Time used: 0.103096
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.669380s
Time used: 0.66933

LOG: SAT solveNonLinear - Elapsed time: 0.791259s
Cost: 1; Total time: 0.772426
Failed at location 2: arg2 <= 0
Before Improving: 
Quasi-invariant at l2: arg2 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009921s
Remaining time after improvement: 0.99538
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg2 <= 0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
New Graphs: 
Calling Safety with literal arg2 <= 0 and entry <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>

LOG: CALL check - Post:arg2 <= 0 - Process 1
* Exit transition: <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>
* Postcondition  : arg2 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001014s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001117s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: arg2 <= 0 , 
Narrowing transition: 
<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
Variables:
arg2, arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002214s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.076253s
Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004144s
Time used: 4.00271
Trying to remove transition: <l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.605839s
Time used: 0.599264
Trying to remove transition: <l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.406094s
Time used: 0.397908
Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011133s
Time used: 4.00288
Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.336304s
Time used: 3.32971
Trying to remove transition: <l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.999425s
Time used: 0.992765

Proving non-termination of subgraph 1
Transitions:
<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
Variables:
arg2, arg1

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, 2 <= arg1 /\ 11 <= arg2, {all remain the same}>
<l2, end, 1 + arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
<l2, end, 2 <= arg1 /\ 2 <= arg2 /\ arg2 <= 9, {all remain the same}>
<l2, end, 1 + arg1 <= 0 /\ 2 <= arg2 /\ arg2 <= 9, {all remain the same}>
<l2, end, arg2 <= 0 /\ 2 <= arg1, {all remain the same}>
<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
<l2, end, arg1 <= 0 /\ arg2 <= 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038183s
Time used: 0.037859
Improving Solution with cost 7 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.021339s
Time used: 1.01682

LOG: SAT solveNonLinear - Elapsed time: 1.059522s
Cost: 7; Total time: 1.05468
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg1 <= 1

Strengthening and disabling EXIT transitions...
Closed exits from l2: 3
Strengthening exit transition (result): 
<l2, end, 1 + arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, 1 + arg1 <= 0 /\ 2 <= arg2 /\ arg2 <= 9, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg1 <= 0 /\ arg2 <= 0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= 1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, 1 + arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
<l2, end, 1 + arg1 <= 0 /\ 2 <= arg2 /\ arg2 <= 9, {all remain the same}>
<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
<l2, end, arg1 <= 0 /\ arg2 <= 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033857s
Time used: 0.033529
Improving Solution with cost 4 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001371s
Time used: 1.0013

LOG: SAT solveNonLinear - Elapsed time: 1.035228s
Cost: 4; Total time: 1.03483
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 0 <= arg1

Strengthening and disabling EXIT transitions...
Closed exits from l2: 2
Strengthening exit transition (result): 
<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
Strengthening exit transition (result): 
<l2, end, arg2 <= 0 /\ arg1 = 0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
<l2, end, arg2 <= 0 /\ arg1 = 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025564s
Time used: 0.02525
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040608s
Time used: 0.0406

LOG: SAT solveNonLinear - Elapsed time: 0.066172s
Cost: 1; Total time: 0.06585
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg1 <= arg2

Strengthening and disabling EXIT transitions...
Closed exits from l2: 1
Strengthening exit transition (result): 
<l2, end, arg1 <= arg2 /\ arg2 <= 0 /\ arg1 = 0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, arg1 <= arg2 /\ arg2 <= 0 /\ arg1 = 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019572s
Time used: 0.019238
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.038730s
Time used: 0.037681

LOG: SAT solveNonLinear - Elapsed time: 0.058302s
Cost: 1; Total time: 0.056919
Failed at location 2: 1 <= arg2
Before Improving: 
Quasi-invariant at l2: 1 <= arg2
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015130s
Remaining time after improvement: 0.997274
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 <= arg2

Strengthening and disabling EXIT transitions...
Closed exits from l2: 1

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: arg1 <= 1, 0 <= arg1, arg1 <= arg2, 1 <= arg2, 
OPEN EXITS: 
<l2, end, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>
Conditions: arg1 <= arg2, 0 <= arg1, 1 <= arg2, arg1 <= 1, 
OPEN EXITS: 
<l0, l2, arg1 <= arg2 /\ 0 <= undef16 /\ 1 <= arg2 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate