NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, true, par{arg1 -> 0}>
<l2, l2, (0 = arg1), par{arg1 -> 1}>
<l2, l2, (1 = arg1), par{arg1 -> 0}>
<l3, l1, true, par{arg1 -> undef4}>

Fresh variables:
undef4, 

Undef variables:
undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0)>
<l2, l2, (0 = arg1), par{arg1 -> 1}>
<l2, l2, (1 = arg1), par{arg1 -> 0}>

Fresh variables:
undef4, 

Undef variables:
undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg1 = 0, {arg1 -> 1, rest remain the same}>
<l2, l2, arg1 = 1, {arg1 -> 0, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, arg1 = 0, {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.002379

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000599s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006020s
Time used: 0.004296
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, arg1 = 0, {all remain the same}>

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

LOG: CALL solveLinear

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

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

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

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.003442s
Time used: 0.00344

LOG: SAT solveNonLinear - Elapsed time: 0.005721s
Cost: 1; Total time: 0.005637
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: 1
Strengthening exit transition (result): 
<l2, end, 2 <= 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, arg1 = 0, {arg1 -> 1, 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, {arg1 -> 0, rest remain the same}>

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001689s
Time used: 0.001634

LOG: SAT solveNonLinear - Elapsed time: 0.001689s
Cost: 0; Total time: 0.001634
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: 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 = 0, {arg1 -> 1, 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, {arg1 -> 0, rest remain the same}>

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

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

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

> Conditions are reachable!

Program does NOT terminate