NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, true, par{arg1 -> 13, arg2 -> 17}>
<l2, l2, (arg2 > 2) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> 2, arg2 -> (arg1 + 1)}>
<l3, l1, true, par{arg1 -> undef5, arg2 -> undef6}>

Fresh variables:
undef5, undef6, 

Undef variables:
undef5, undef6, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 13) /\ (arg2 = 17)>
<l2, l2, (arg2 > 2) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> 2, arg2 -> (arg1 + 1)}>

Fresh variables:
undef5, undef6, 

Undef variables:
undef5, undef6, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

Graph 1
<l0, l2, arg1 = 13 /\ arg2 = 17, {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.036128

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000949s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002125s
Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 3 <= arg2, {arg1 -> 2, arg2 -> 1 + arg1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.567338s
Time used: 0.562466
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, arg1 = 13 /\ arg2 = 17, {all remain the same}>

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.004265s
Cannot prove unreachability

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

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018488s
Time used: 0.018272
Improving Solution with cost 3 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021656s
Time used: 0.021649
Improving Solution with cost 2 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029435s
Time used: 0.029427

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

Strengthening and disabling EXIT transitions...
Closed exits from l2: 3
Strengthening exit transition (result): 
<l2, end, 2 <= arg1 /\ arg2 <= arg1, {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, 2 <= arg1 /\ 1 + arg1 <= arg2 /\ 3 <= arg2, {arg1 -> 2, arg2 -> 1 + arg1, rest remain the same}>

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005038s
Time used: 0.004935

LOG: SAT solveNonLinear - Elapsed time: 0.005038s
Cost: 0; Total time: 0.004935
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 + arg1 <= 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, 2 <= arg1 /\ 1 + arg1 <= arg2 /\ 3 <= arg2, {arg1 -> 2, arg2 -> 1 + arg1, rest remain the same}>

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

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

Calling reachability with...
Transition: <l0, l2, arg1 = 13 /\ arg2 = 17, {all remain the same}>
Conditions: 2 <= arg1, 1 + arg1 <= arg2, 
OPEN EXITS: 
<l0, l2, 1 + arg1 <= arg2 /\ arg1 = 13 /\ arg2 = 17, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate