NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, ((1 + n_promoted_1^0) <= 1024) /\ (undef4 = undef4), par{tmp___0^0 -> undef4}>
<l1, l2, (1024 <= (0 + n_promoted_1^0))>
<l2, l3, true, par{i5^0 -> 0}>
<l4, l1, (1 <= (0 + n_promoted_1^0))>
<l4, l2, ((0 + n_promoted_1^0) <= 0)>
<l3, l5, true>
<l5, l6, true>
<l5, l3, true, par{i5^0 -> (1 + i5^0)}>
<l7, l4, (undef35 = undef35), par{n_promoted_1^0 -> (0 + undef35), tmp^0 -> undef35}>
<l8, l7, true>

Fresh variables:
undef4, undef35, 

Undef variables:
undef4, undef35, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i5^0 = 0) /\ (undef35 = undef35) /\ (1 <= (0 + (0 + undef35))) /\ ((1 + (0 + undef35)) <= 1024) /\ (undef4 = undef4)>
<l0, l3, (i5^0 = 0) /\ (undef35 = undef35) /\ (1 <= (0 + (0 + undef35))) /\ (1024 <= (0 + (0 + undef35)))>
<l0, l3, (i5^0 = 0) /\ (undef35 = undef35) /\ ((0 + (0 + undef35)) <= 0)>
<l3, l6, true>
<l3, l3, true, par{i5^0 -> (1 + i5^0)}>

Fresh variables:
undef4, undef35, 

Undef variables:
undef4, undef35, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, true, {i5^0 -> 1 + i5^0, rest remain the same}>
Variables:
i5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 <= undef35 /\ undef35 <= 1023 /\ i5^0 = 0, {all remain the same}>
<l0, l3, 1024 <= undef35 /\ i5^0 = 0, {all remain the same}>
<l0, l3, undef35 <= 0 /\ i5^0 = 0, {all remain the same}>

Graph 2
<l3, l6, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000480s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000878s
Trying to remove transition: <l3, l3, true, {i5^0 -> 1 + i5^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000727s
Time used: 1.00073

LOG: SAT solveNonLinear - Elapsed time: 1.009944s
Cost: 1; Total time: 1.00537
Termination implied by a set of invariant(s):
Invariant at l3: 0 <= 1 + i5^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 <= 1 + i5^0, {i5^0 -> 1 + i5^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 <= 1 + i5^0, {i5^0 -> 1 + i5^0, rest remain the same}>
Quasi-ranking function: 50000 - i5^0
New Graphs: 
Transitions:
<l3, l3, 50001 <= i5^0, {i5^0 -> 1 + i5^0, rest remain the same}>
Variables:
i5^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000434s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006369s
Time used: 4.00165
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l3, 1 <= undef35 /\ undef35 <= 1023 /\ i5^0 = 0, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l3, 1 <= undef35 /\ undef35 <= 1023 /\ i5^0 = 0, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l3, l3, true, {i5^0 -> 1 + i5^0, rest remain the same}>
Variables:
i5^0

Checking conditional non-termination of SCC {l3}...
> No exit transition to close.
Calling reachability with...
Transition: <l3, end, true, {all remain the same}>
Conditions: 
Transition: <l3, end, true, {all remain the same}>
Conditions: 
Transition: <l3, end, true, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l3, end, true, {all remain the same}>
<l3, end, true, {all remain the same}>
<l3, end, true, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l3, 1 <= undef35 /\ undef35 <= 1023 /\ i5^0 = 0, {all remain the same}>
Conditions: 
Transition: <l0, l3, 1024 <= undef35 /\ i5^0 = 0, {all remain the same}>
Conditions: 
Transition: <l0, l3, undef35 <= 0 /\ i5^0 = 0, {all remain the same}>
Conditions: 
Transition: <l0, l3, 1 <= undef35 /\ undef35 <= 1023 /\ i5^0 = 0, {all remain the same}>
Conditions: 
Transition: <l0, l3, 1024 <= undef35 /\ i5^0 = 0, {all remain the same}>
Conditions: 
Transition: <l0, l3, undef35 <= 0 /\ i5^0 = 0, {all remain the same}>
Conditions: 
Transition: <l0, l3, 1 <= undef35 /\ undef35 <= 1023 /\ i5^0 = 0, {all remain the same}>
Conditions: 
Transition: <l0, l3, 1024 <= undef35 /\ i5^0 = 0, {all remain the same}>
Conditions: 
Transition: <l0, l3, undef35 <= 0 /\ i5^0 = 0, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l3, 1 <= undef35 /\ undef35 <= 1023 /\ i5^0 = 0, {all remain the same}>
<l0, l3, 1024 <= undef35 /\ i5^0 = 0, {all remain the same}>
<l0, l3, undef35 <= 0 /\ i5^0 = 0, {all remain the same}>
<l0, l3, 1 <= undef35 /\ undef35 <= 1023 /\ i5^0 = 0, {all remain the same}>
<l0, l3, 1024 <= undef35 /\ i5^0 = 0, {all remain the same}>
<l0, l3, undef35 <= 0 /\ i5^0 = 0, {all remain the same}>
<l0, l3, 1 <= undef35 /\ undef35 <= 1023 /\ i5^0 = 0, {all remain the same}>
<l0, l3, 1024 <= undef35 /\ i5^0 = 0, {all remain the same}>
<l0, l3, undef35 <= 0 /\ i5^0 = 0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate