YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l16, true>
<l1, l2, (101 <= (0 + Index2^0)), par{Sorted5^0 -> 0, i8^0 -> 1}>
<l1, l3, ((0 + Index2^0) <= 100), par{Index2^0 -> (1 + Index2^0)}>
<l3, l1, true>
<l4, l5, true>
<l6, l4, true>
<l7, l8, true>
<l8, l2, ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)), par{i8^0 -> (1 + i8^0)}>
<l8, l6, (1 <= (0 + Sorted5^0))>
<l8, l6, ((1 + Sorted5^0) <= 0)>
<l9, l10, true, par{Index7^0 -> (1 + Index7^0)}>
<l2, l11, true>
<l12, l9, (undef81 = undef81), par{Sorted5^0 -> 0, Temp6^0 -> undef81}>
<l12, l9, true>
<l13, l12, ((0 + Index7^0) <= (100 + (~(1) * i8^0)))>
<l13, l7, ((101 + (~(1) * i8^0)) <= (0 + Index7^0))>
<l14, l7, (100 <= (0 + Index7^0))>
<l14, l13, ((0 + Index7^0) <= 99)>
<l10, l14, true>
<l11, l4, (100 <= (0 + i8^0))>
<l11, l10, ((0 + i8^0) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1}>
<l15, l3, (undef146 = ~(1)), par{Index2^0 -> 1, fact3^0 -> (0 + undef146), factor^0 -> undef146}>
<l16, l15, true>

Fresh variables:
undef81, undef146, 

Undef variables:
undef81, undef146, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (Index2^0 = 1) /\ (undef146 = ~(1))>
<l3, l10, (101 <= (0 + Index2^0)) /\ ((0 + 1) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> 1}>
<l3, l3, ((0 + Index2^0) <= 100), par{Index2^0 -> (1 + Index2^0)}>
<l10, l5, (100 <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ (100 <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}>
<l10, l10, (100 <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ ((0 + (1 + i8^0)) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> (1 + i8^0)}>
<l10, l5, (100 <= (0 + Index7^0)) /\ (1 <= (0 + Sorted5^0))>
<l10, l5, (100 <= (0 + Index7^0)) /\ ((1 + Sorted5^0) <= 0)>
<l10, l10, ((0 + Index7^0) <= 99) /\ ((0 + Index7^0) <= (100 + (~(1) * i8^0))) /\ (undef81 = undef81), par{Index7^0 -> (1 + Index7^0), Sorted5^0 -> 0}>
<l10, l10, ((0 + Index7^0) <= 99) /\ ((0 + Index7^0) <= (100 + (~(1) * i8^0))), par{Index7^0 -> (1 + Index7^0)}>
<l10, l5, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ (100 <= (0 + (1 + i8^0))), par{i8^0 -> (1 + i8^0)}>
<l10, l10, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ ((0 + Sorted5^0) <= 0) /\ (0 <= (0 + Sorted5^0)) /\ ((0 + (1 + i8^0)) <= 99), par{Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> (1 + i8^0)}>
<l10, l5, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ (1 <= (0 + Sorted5^0))>
<l10, l5, ((0 + Index7^0) <= 99) /\ ((101 + (~(1) * i8^0)) <= (0 + Index7^0)) /\ ((1 + Sorted5^0) <= 0)>

Fresh variables:
undef81, undef146, 

Undef variables:
undef81, undef146, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, Index2^0 <= 100, {Index2^0 -> 1 + Index2^0, rest remain the same}>
Variables:
Index2^0

Graph 2:
Transitions:
<l10, l10, 100 <= Index7^0 /\ i8^0 <= 98 /\ Sorted5^0 = 0, {Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> 1 + i8^0, rest remain the same}>
<l10, l10, Index7^0 + i8^0 <= 100 /\ Index7^0 <= 99, {Index7^0 -> 1 + Index7^0, Sorted5^0 -> 0, rest remain the same}>
<l10, l10, Index7^0 + i8^0 <= 100 /\ Index7^0 <= 99, {Index7^0 -> 1 + Index7^0, rest remain the same}>
<l10, l10, 101 <= Index7^0 + i8^0 /\ i8^0 <= 98 /\ Index7^0 <= 99 /\ Sorted5^0 = 0, {Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> 1 + i8^0, rest remain the same}>
Variables:
Index7^0, Sorted5^0, i8^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 + undef146 = 0 /\ Index2^0 = 1, {all remain the same}>

Graph 2
<l3, l10, 101 <= Index2^0, {Index7^0 -> 1, Sorted5^0 -> 1, i8^0 -> 1, rest remain the same}>

Graph 3
<l10, l5, 100 <= Index7^0 /\ 99 <= i8^0 /\ Sorted5^0 = 0, {i8^0 -> 1 + i8^0, rest remain the same}>
<l10, l5, 1 <= Sorted5^0 /\ 100 <= Index7^0, {all remain the same}>
<l10, l5, 1 + Sorted5^0 <= 0 /\ 100 <= Index7^0, {all remain the same}>
<l10, l5, 101 <= Index7^0 + i8^0 /\ 99 <= i8^0 /\ Index7^0 <= 99 /\ Sorted5^0 = 0, {i8^0 -> 1 + i8^0, rest remain the same}>
<l10, l5, 101 <= Index7^0 + i8^0 /\ 1 <= Sorted5^0 /\ Index7^0 <= 99, {all remain the same}>
<l10, l5, 101 <= Index7^0 + i8^0 /\ 1 + Sorted5^0 <= 0 /\ Index7^0 <= 99, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000386s
Ranking function: 100 - Index2^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.422173

Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006356s
Ranking function: 196 - 2*i8^0
New Graphs: 
Transitions:
<l10, l10, Index7^0 + i8^0 <= 100 /\ Index7^0 <= 99, {Index7^0 -> 1 + Index7^0, Sorted5^0 -> 0, rest remain the same}>
<l10, l10, Index7^0 + i8^0 <= 100 /\ Index7^0 <= 99, {Index7^0 -> 1 + Index7^0, rest remain the same}>
Variables:
Index7^0, Sorted5^0, i8^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000586s
Ranking function: 99 - Index7^0
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l5}...
No cycles found.

Program Terminates