NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l14, true>
<l1, l2, true>
<l3, l1, true>
<l3, l4, true>
<l3, l1, true>
<l5, l6, true>
<l7, l8, true>
<l9, l7, true>
<l9, l7, true>
<l9, l2, true>
<l10, l11, true>
<l8, l9, true>
<l12, l10, (undef70 = undef70), par{tmp15^0 -> undef70}>
<l11, l12, true>
<l11, l8, true>
<l11, l12, true>
<l2, l3, true>
<l6, l10, ((0 + length5^0) <= (0 + i6^0))>
<l6, l5, ((1 + i6^0) <= (0 + length5^0)) /\ (undef108 = undef108), par{i6^0 -> (1 + i6^0), tmp___09^0 -> undef108}>
<l13, l5, (undef113 = undef113) /\ (undef111 = (0 + undef113)), par{i6^0 -> 0, length5^0 -> (0 + undef111), s^0 -> undef111, tmp^0 -> undef113}>
<l14, l13, true>

Fresh variables:
undef70, undef108, undef111, undef113, 

Undef variables:
undef70, undef108, undef111, undef113, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (i6^0 = 0) /\ (length5^0 = (0 + undef111)) /\ (undef113 = undef113) /\ (undef111 = (0 + undef113))>
<l2, l2, true>
<l2, l4, true>
<l2, l2, true>
<l5, l10, ((0 + length5^0) <= (0 + i6^0))>
<l5, l5, ((1 + i6^0) <= (0 + length5^0)) /\ (undef108 = undef108), par{i6^0 -> (1 + i6^0)}>
<l8, l8, true>
<l8, l8, true>
<l8, l2, true>
<l10, l10, (undef70 = undef70)>
<l10, l8, true>
<l10, l10, (undef70 = undef70)>

Fresh variables:
undef70, undef108, undef111, undef113, 

Undef variables:
undef70, undef108, undef111, undef113, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l5, 1 + i6^0 <= length5^0, {i6^0 -> 1 + i6^0, rest remain the same}>
Variables:
i6^0, length5^0

Graph 2:
Transitions:
<l10, l10, true, {all remain the same}>
<l10, l10, true, {all remain the same}>
Variables:

Graph 3:
Transitions:
<l8, l8, true, {all remain the same}>
<l8, l8, true, {all remain the same}>
Variables:

Graph 4:
Transitions:
<l2, l2, true, {all remain the same}>
<l2, l2, true, {all remain the same}>
Variables:

Graph 5:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>

Graph 2
<l5, l10, length5^0 <= i6^0, {all remain the same}>

Graph 3
<l10, l8, true, {all remain the same}>

Graph 4
<l8, l2, true, {all remain the same}>

Graph 5
<l2, l4, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000809s
Ranking function: -1 - i6^0 + length5^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001798

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l5, l10, length5^0 <= i6^0, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l5, l10, length5^0 <= i6^0, {all remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST
Postcondition: 1 <= 0

LOG: CALL check - Post:1 <= 0 - Process 2
* Exit transition: <l0, l5, i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000547s

LOG: NarrowEntry size 1
Narrowing transition: 
<l5, l5, 1 + i6^0 <= length5^0, {i6^0 -> 1 + i6^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l5, 0 <= 0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
END ENTRIES:
GRAPH:
<l5, l5, 0 <= 0 /\ 1 + i6^0 <= length5^0, {i6^0 -> 1 + i6^0, rest remain the same}>
END GRAPH:
EXIT: <l5, l10, length5^0 <= i6^0, {all remain the same}>
POST: 1 <= 0


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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.016216s
Time used: 1.01616

LOG: SAT solveNonLinear - Elapsed time: 1.023227s
Cost: 51; Total time: 1.02303
Failed at location 5: 1 + length5^0 <= i6^0
Before Improving: 
Quasi-invariant at l5: 1 + length5^0 <= i6^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004341s
Remaining time after improvement: 0.998864
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l5: 1 + length5^0 <= i6^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:1 + length5^0 <= i6^0 - Process 3
* Exit transition: <l0, l5, 0 <= 0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
* Postcondition  : 1 + length5^0 <= i6^0

LOG: CALL solveLinear

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

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

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

LOG: SAT solveNonLinear - Elapsed time: 1.029759s
Cost: 51; Total time: 1.02953
Failed at location 5: length5^0 <= i6^0
Before Improving: 
Quasi-invariant at l5: length5^0 <= i6^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006178s
Remaining time after improvement: 0.998759
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l5: length5^0 <= i6^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length5^0 <= i6^0 - Process 4
* Exit transition: <l0, l5, 0 <= 0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
* Postcondition  : length5^0 <= i6^0

LOG: CALL solveLinear

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

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.886315s
Time used: 0.886273

LOG: SAT solveNonLinear - Elapsed time: 1.000568s
Cost: 51; Total time: 1.0003
Failed at location 5: length5^0 <= 0
Before Improving: 
Quasi-invariant at l5: 0 <= 1 + i6^0
Quasi-invariant at l5: 0 <= i6^0
Quasi-invariant at l5: length5^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008171s
Remaining time after improvement: 0.998466
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l5: 0 <= 1 + i6^0
Quasi-invariant at l5: 0 <= i6^0
Quasi-invariant at l5: length5^0 <= 0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length5^0 <= 0 - Process 5
* Exit transition: <l0, l5, 0 <= 0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
* Postcondition  : length5^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000884s

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

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

Proving non-termination of subgraph 2
Transitions:
<l10, l10, true, {all remain the same}>
<l10, l10, true, {all remain the same}>
Variables:

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

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

Calling reachability with...
Transition: <l5, l10, length5^0 <= i6^0, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l5, l10, length5^0 <= i6^0, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l5, i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>
Conditions: length5^0 <= i6^0, 
OPEN EXITS: 
<l0, l5, length5^0 <= i6^0 /\ i6^0 = 0 /\ length5^0 = undef111 /\ undef111 = undef113, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate