NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l12, true>
<l1, l2, (undef11 = undef11), par{head_12^0 -> 0, i_11^0 -> 0, length_19^0 -> undef11}>
<l2, l3, (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef33 = undef33) /\ (undef31 = (0 + undef33)), par{head_12^0 -> (0 + undef31), i_11^0 -> (1 + i_11^0), tmp_13^0 -> undef31, tmp___0_14^0 -> undef33}>
<l2, l4, (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef36 = (0 + head_12^0)) /\ (undef52 = (0 + undef36)) /\ (undef53 = undef53) /\ (undef51 = (0 + a_16^0)) /\ ((0 + undef51) <= 0) /\ (0 <= (0 + undef51)) /\ (undef54 = undef54) /\ (undef35 = undef35), par{Result_4^0 -> undef35, __cil_tmp6_15^0 -> undef36, tmp_20^0 -> (0 + undef52), x_18^0 -> undef51}>
<l3, l5, (0 <= (0 + len_47^0)) /\ (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef70 = undef70) /\ (undef68 = (0 + undef70)), par{head_12^0 -> (0 + undef68), i_11^0 -> (1 + i_11^0), tmp_13^0 -> undef68, tmp___0_14^0 -> undef70}>
<l5, l3, true>
<l3, l6, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef90 = (0 + head_12^0)) /\ (undef106 = (0 + undef90)) /\ (0 <= (0 + len_47^0)) /\ (undef89 = undef89) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)), par{Result_4^0 -> undef89, __cil_tmp6_15^0 -> undef90, tmp_20^0 -> (0 + undef106), x_18^0 -> (0 + a_16^0)}>
<l6, l7, (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109), par{__disjvr_0^0 -> undef109}>
<l7, l8, (undef141 = undef141) /\ (undef135 = undef135), par{lt_21^0 -> undef135, t_17^0 -> (0 + x_18^0), x_18^0 -> (0 + undef141)}>
<l8, l4, (0 <= (0 + a_140^0)) /\ ((0 + x_18^0) <= 0) /\ (0 <= (0 + x_18^0)) /\ (undef159 = undef159) /\ (undef142 = undef142), par{Result_4^0 -> undef142}>
<l8, l9, (0 <= (0 + a_140^0))>
<l9, l10, (undef180 = __disjvr_1^0) /\ (__disjvr_1^0 = undef180), par{__disjvr_1^0 -> undef180}>
<l10, l11, (undef211 = undef211) /\ (undef205 = undef205), par{lt_21^0 -> undef205, t_17^0 -> (0 + x_18^0), x_18^0 -> (0 + undef211)}>
<l11, l8, true>
<l12, l1, true>

Fresh variables:
undef11, undef31, undef33, undef35, undef36, undef51, undef52, undef53, undef54, undef68, undef70, undef89, undef90, undef106, undef109, undef135, undef141, undef142, undef159, undef180, undef205, undef211, 

Undef variables:
undef11, undef31, undef33, undef35, undef36, undef51, undef52, undef53, undef54, undef68, undef70, undef89, undef90, undef106, undef109, undef135, undef141, undef142, undef159, undef180, undef205, undef211, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (undef11 = undef11) /\ (0 <= ((~(2) + (~(1) * 0)) + length_10^0)) /\ (undef33 = undef33) /\ (undef31 = (0 + undef33)), par{head_12^0 -> (0 + undef31), i_11^0 -> (1 + 0)}>
<l0, l4, (undef11 = undef11) /\ (((~(1) + (~(1) * 0)) + length_10^0) <= 0) /\ (undef36 = (0 + 0)) /\ (undef52 = (0 + undef36)) /\ (undef53 = undef53) /\ (undef51 = (0 + a_16^0)) /\ ((0 + undef51) <= 0) /\ (0 <= (0 + undef51)) /\ (undef54 = undef54) /\ (undef35 = undef35), par{head_12^0 -> 0, i_11^0 -> 0, x_18^0 -> undef51}>
<l3, l3, (0 <= (0 + len_47^0)) /\ (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef70 = undef70) /\ (undef68 = (0 + undef70)), par{head_12^0 -> (0 + undef68), i_11^0 -> (1 + i_11^0)}>
<l3, l8, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef90 = (0 + head_12^0)) /\ (undef106 = (0 + undef90)) /\ (0 <= (0 + len_47^0)) /\ (undef89 = undef89) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109) /\ (undef141 = undef141) /\ (undef135 = undef135), par{__disjvr_0^0 -> undef109, x_18^0 -> (0 + undef141)}>
<l8, l4, (0 <= (0 + a_140^0)) /\ ((0 + x_18^0) <= 0) /\ (0 <= (0 + x_18^0)) /\ (undef159 = undef159) /\ (undef142 = undef142)>
<l8, l8, (0 <= (0 + a_140^0)) /\ (undef180 = __disjvr_1^0) /\ (__disjvr_1^0 = undef180) /\ (undef211 = undef211) /\ (undef205 = undef205), par{__disjvr_1^0 -> undef180, x_18^0 -> (0 + undef211)}>

Fresh variables:
undef11, undef31, undef33, undef35, undef36, undef51, undef52, undef53, undef54, undef68, undef70, undef89, undef90, undef106, undef109, undef135, undef141, undef142, undef159, undef180, undef205, undef211, 

Undef variables:
undef11, undef31, undef33, undef35, undef36, undef51, undef52, undef53, undef54, undef68, undef70, undef89, undef90, undef106, undef109, undef135, undef141, undef142, undef159, undef180, undef205, undef211, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef68 = undef70, {head_12^0 -> undef68, i_11^0 -> 1 + i_11^0, rest remain the same}>
Variables:
head_12^0, i_11^0, len_47^0, length_10^0

Graph 2:
Transitions:
<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
Variables:
__disjvr_1^0, a_140^0, x_18^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 2 <= length_10^0 /\ undef31 = undef33, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>

Graph 2
<l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>

Graph 3
<l0, l4, length_10^0 <= 1 /\ a_16^0 = undef51 /\ undef36 = 0 /\ undef36 = undef52 /\ undef51 = 0, {head_12^0 -> 0, i_11^0 -> 0, x_18^0 -> undef51, rest remain the same}>
<l8, l4, 0 <= a_140^0 /\ x_18^0 = 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001027s
Ranking function: -2 - i_11^0 + length_10^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.002056

Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000600s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001735s
Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014135s
Time used: 0.014128

LOG: SAT solveNonLinear - Elapsed time: 0.022397s
Cost: 1; Total time: 0.021928
Failed at location 8: 1 + a_140^0 <= 0
Before Improving: 
Quasi-invariant at l8: 1 + a_140^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002918s
Remaining time after improvement: 0.998475
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l8: 1 + a_140^0 <= 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: 
<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
New Graphs: 
Calling Safety with literal 1 + a_140^0 <= 0 and entry <l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>

LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 1
* Exit transition: <l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>
* Postcondition  : 1 + a_140^0 <= 0
Postcodition moved up: 1 + a_140^0 <= 0

LOG: Try proving POST
Postcondition: 1 + a_140^0 <= 0

LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 2
* Exit transition: <l0, l3, 0 <= len_47^0 /\ 2 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef90 = undef106, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
* Postcondition  : 1 + a_140^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000864s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef68 = undef70, {head_12^0 -> undef68, i_11^0 -> 1 + i_11^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef90 = undef106, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef68 = undef70 /\ undef90 = undef106, {head_12^0 -> undef68, i_11^0 -> 1 + i_11^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>
POST: 1 + a_140^0 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018256s
Time used: 0.018059
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000522s
Time used: 1.00049

LOG: SAT solveNonLinear - Elapsed time: 1.018779s
Cost: 51; Total time: 1.01855
Failed at location 3: len_47^0 + length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: len_47^0 + length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003883s
Remaining time after improvement: 0.998364
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: len_47^0 + length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:len_47^0 + length_10^0 <= 1 + i_11^0 - Process 3
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef90 = undef106, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
* Postcondition  : len_47^0 + length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001166s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.896534s
Time used: 0.896233
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000339s
Time used: 1.00031

LOG: SAT solveNonLinear - Elapsed time: 1.896873s
Cost: 51; Total time: 1.89655
Failed at location 3: a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: 0 <= a_140^0 + len_47^0
Quasi-invariant at l3: a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007931s
Remaining time after improvement: 0.997801
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: 0 <= a_140^0 + len_47^0
Quasi-invariant at l3: a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0 - Process 4
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef90 = undef106, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
* Postcondition  : a_140^0 + len_47^0 + length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001518s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000257s
Time used: 1.00011

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 3.961431s
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: 1 + a_140^0 <= 0 , 
Narrowing transition: 
<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
Variables:
__disjvr_1^0, a_140^0, x_18^0
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000578s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001914s
Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011176s
Time used: 0.006942

Proving non-termination of subgraph 2
Transitions:
<l8, l8, 0 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>
Variables:
__disjvr_1^0, a_140^0, x_18^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001394s
Checking conditional non-termination of SCC {l8}...
EXIT TRANSITIONS:
<l8, end, 1 + a_140^0 <= 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.047647s
Time used: 0.04764

LOG: SAT solveNonLinear - Elapsed time: 0.069230s
Cost: 1; Total time: 0.068937
Failed at location 8: 1 <= a_140^0
Before Improving: 
Quasi-invariant at l8: 1 <= a_140^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009493s
Remaining time after improvement: 0.998313
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.003112s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l8: 1 <= a_140^0

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

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l8, 1 <= a_140^0 /\ __disjvr_1^0 = undef180, {__disjvr_1^0 -> undef180, x_18^0 -> undef211, rest remain the same}>

Calling reachability with...
Transition: <l8, end, true, {all remain the same}>
Conditions: 1 <= a_140^0, 
OPEN EXITS: 
<l8, end, true, {all remain the same}> (condsUp: 1 <= a_140^0)

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

Calling reachability with...
Transition: <l3, l8, 0 <= len_47^0 /\ length_10^0 <= 1 + i_11^0 /\ __disjvr_0^0 = undef109 /\ head_12^0 = undef90 /\ undef90 = undef106, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}>
Conditions: 1 <= a_140^0, 
OPEN EXITS: 
<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef90, {__disjvr_0^0 -> undef109, x_18^0 -> undef141, rest remain the same}> (condsUp: 0 <= len_47^0, __disjvr_0^0 = undef109, undef90 = undef106, 1 <= a_140^0)

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

Calling reachability with...
Transition: <l0, l3, 2 <= length_10^0 /\ undef31 = undef33, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>
Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef90, 0 <= len_47^0, __disjvr_0^0 = undef109, undef90 = undef106, 1 <= a_140^0, 
OPEN EXITS: 
<l0, l3, 0 <= len_47^0 /\ 1 <= a_140^0 /\ __disjvr_0^0 = undef109 /\ undef31 = undef33 /\ undef31 = undef90 /\ undef90 = undef106 /\ length_10^0 = 2, {head_12^0 -> undef31, i_11^0 -> 1, rest remain the same}>

> Conditions are reachable!

Program does NOT terminate