NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, true, par{arg1 -> 1, arg2 -> 2, arg3 -> 3}>
<l2, l2, (arg3 < 5), par{arg1 -> (((arg1 - arg2) + arg2) - (arg1 - arg2)), arg2 -> ((arg1 - arg2) + arg2), arg3 -> ((((arg1 - arg2) + arg2) - (arg1 - arg2)) + ((arg1 - arg2) + arg2))}>
<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}>

Fresh variables:
undef7, undef8, undef9, 

Undef variables:
undef7, undef8, undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Fresh variables:
undef7, undef8, undef9, 

Undef variables:
undef7, undef8, undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg3 <= 4, {arg1 -> arg2, arg2 -> arg1, arg3 -> arg1 + arg2, rest remain the same}>
Variables:
arg1, arg2, arg3

Precedence: 
Graph 0

Graph 1
<l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {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.007325

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000664s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076838s
Time used: 0.06976
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {all remain the same}>

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

LOG: CALL solveLinear

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

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

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

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, 5 <= arg3, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039579s
Time used: 0.039016
Improving Solution with cost 2 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.051579s
Time used: 0.051573

LOG: SAT solveNonLinear - Elapsed time: 0.091158s
Cost: 0; Total time: 0.090589
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg1 + arg2 <= 3
Quasi-invariant at l2: arg3 <= 3

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 <= 3 /\ arg3 <= 3, {arg1 -> arg2, arg2 -> arg1, arg3 -> arg1 + arg2, rest remain the same}>

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

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

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

> Conditions are reachable!

Program does NOT terminate