/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l17, true>
<l1, l2, true>
<l3, l4, true>
<l5, l6, true>
<l7, l8, ((0 + __const_20^0) <= (0 + Index15^0)), par{Inner14^0 -> (1 + Inner14^0)}>
<l7, l9, ((1 + Index15^0) <= (0 + __const_20^0)), par{Index15^0 -> (1 + Index15^0)}>
<l10, l11, ((0 + __const_20^0) <= (0 + Inner14^0)), par{Outer13^0 -> (1 + Outer13^0)}>
<l10, l9, ((1 + Inner14^0) <= (0 + __const_20^0)), par{Index15^0 -> 0}>
<l12, l13, ((0 + __const_20^0) <= (0 + Outer13^0))>
<l12, l8, ((1 + Outer13^0) <= (0 + __const_20^0)), par{Inner14^0 -> 0}>
<l14, l15, true>
<l11, l12, true>
<l15, l5, ((0 + __const_20^0) <= (0 + InnerIndex9^0)), par{OuterIndex8^0 -> (1 + OuterIndex8^0)}>
<l15, l14, ((1 + InnerIndex9^0) <= (0 + __const_20^0)) /\ (undef140 = undef140), par{InnerIndex9^0 -> (1 + InnerIndex9^0), Seed^0 -> undef140, ret_RandomInteger17^0 -> (0 + undef140)}>
<l6, l11, ((0 + __const_20^0) <= (0 + OuterIndex8^0)), par{Outer13^0 -> 0}>
<l6, l14, ((1 + OuterIndex8^0) <= (0 + __const_20^0)), par{InnerIndex9^0 -> 0}>
<l8, l10, true>
<l9, l7, true>
<l4, l1, ((0 + __const_20^0) <= (0 + InnerIndex6^0)), par{OuterIndex5^0 -> (1 + OuterIndex5^0)}>
<l4, l3, ((1 + InnerIndex6^0) <= (0 + __const_20^0)) /\ (undef206 = undef206), par{InnerIndex6^0 -> (1 + InnerIndex6^0), Seed^0 -> undef206, ret_RandomInteger16^0 -> (0 + undef206)}>
<l2, l5, ((0 + __const_20^0) <= (0 + OuterIndex5^0)), par{OuterIndex8^0 -> 0}>
<l2, l3, ((1 + OuterIndex5^0) <= (0 + __const_20^0)), par{InnerIndex6^0 -> 0}>
<l16, l1, true, par{OuterIndex5^0 -> 0, Seed^0 -> 0}>
<l17, l16, true>

Fresh variables:
undef140, undef206, 

Undef variables:
undef140, undef206, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l11, (OuterIndex5^0 = 0) /\ ((0 + __const_20^0) <= (0 + 0)) /\ ((0 + __const_20^0) <= (0 + 0)), par{Outer13^0 -> 0, OuterIndex8^0 -> 0}>
<l0, l3, (OuterIndex5^0 = 0) /\ ((1 + 0) <= (0 + __const_20^0)), par{InnerIndex6^0 -> 0}>
<l3, l11, ((0 + __const_20^0) <= (0 + InnerIndex6^0)) /\ ((0 + __const_20^0) <= (0 + (1 + OuterIndex5^0))) /\ ((0 + __const_20^0) <= (0 + 0)), par{Outer13^0 -> 0, OuterIndex5^0 -> (1 + OuterIndex5^0), OuterIndex8^0 -> 0}>
<l3, l14, ((0 + __const_20^0) <= (0 + InnerIndex6^0)) /\ ((0 + __const_20^0) <= (0 + (1 + OuterIndex5^0))) /\ ((1 + 0) <= (0 + __const_20^0)), par{InnerIndex9^0 -> 0, OuterIndex5^0 -> (1 + OuterIndex5^0), OuterIndex8^0 -> 0}>
<l3, l3, ((0 + __const_20^0) <= (0 + InnerIndex6^0)) /\ ((1 + (1 + OuterIndex5^0)) <= (0 + __const_20^0)), par{InnerIndex6^0 -> 0, OuterIndex5^0 -> (1 + OuterIndex5^0)}>
<l3, l3, ((1 + InnerIndex6^0) <= (0 + __const_20^0)) /\ (undef206 = undef206), par{InnerIndex6^0 -> (1 + InnerIndex6^0)}>
<l9, l11, ((0 + __const_20^0) <= (0 + Index15^0)) /\ ((0 + __const_20^0) <= (0 + (1 + Inner14^0))), par{Inner14^0 -> (1 + Inner14^0), Outer13^0 -> (1 + Outer13^0)}>
<l9, l9, ((0 + __const_20^0) <= (0 + Index15^0)) /\ ((1 + (1 + Inner14^0)) <= (0 + __const_20^0)), par{Index15^0 -> 0, Inner14^0 -> (1 + Inner14^0)}>
<l9, l9, ((1 + Index15^0) <= (0 + __const_20^0)), par{Index15^0 -> (1 + Index15^0)}>
<l11, l13, ((0 + __const_20^0) <= (0 + Outer13^0))>
<l11, l11, ((1 + Outer13^0) <= (0 + __const_20^0)) /\ ((0 + __const_20^0) <= (0 + 0)), par{Inner14^0 -> 0, Outer13^0 -> (1 + Outer13^0)}>
<l11, l9, ((1 + Outer13^0) <= (0 + __const_20^0)) /\ ((1 + 0) <= (0 + __const_20^0)), par{Index15^0 -> 0, Inner14^0 -> 0}>
<l14, l11, ((0 + __const_20^0) <= (0 + InnerIndex9^0)) /\ ((0 + __const_20^0) <= (0 + (1 + OuterIndex8^0))), par{Outer13^0 -> 0, OuterIndex8^0 -> (1 + OuterIndex8^0)}>
<l14, l14, ((0 + __const_20^0) <= (0 + InnerIndex9^0)) /\ ((1 + (1 + OuterIndex8^0)) <= (0 + __const_20^0)), par{InnerIndex9^0 -> 0, OuterIndex8^0 -> (1 + OuterIndex8^0)}>
<l14, l14, ((1 + InnerIndex9^0) <= (0 + __const_20^0)) /\ (undef140 = undef140), par{InnerIndex9^0 -> (1 + InnerIndex9^0)}>

Fresh variables:
undef140, undef206, 

Undef variables:
undef140, undef206, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, __const_20^0 <= InnerIndex6^0 /\ 2 + OuterIndex5^0 <= __const_20^0, {InnerIndex6^0 -> 0, OuterIndex5^0 -> 1 + OuterIndex5^0, rest remain the same}>
<l3, l3, 1 + InnerIndex6^0 <= __const_20^0, {InnerIndex6^0 -> 1 + InnerIndex6^0, rest remain the same}>
Variables:
InnerIndex6^0, OuterIndex5^0, __const_20^0

Graph 2:
Transitions:
<l14, l14, __const_20^0 <= InnerIndex9^0 /\ 2 + OuterIndex8^0 <= __const_20^0, {InnerIndex9^0 -> 0, OuterIndex8^0 -> 1 + OuterIndex8^0, rest remain the same}>
<l14, l14, 1 + InnerIndex9^0 <= __const_20^0, {InnerIndex9^0 -> 1 + InnerIndex9^0, rest remain the same}>
Variables:
InnerIndex9^0, OuterIndex8^0, __const_20^0

Graph 3:
Transitions:
<l9, l11, __const_20^0 <= Index15^0 /\ __const_20^0 <= 1 + Inner14^0, {Inner14^0 -> 1 + Inner14^0, Outer13^0 -> 1 + Outer13^0, rest remain the same}>
<l9, l9, __const_20^0 <= Index15^0 /\ 2 + Inner14^0 <= __const_20^0, {Index15^0 -> 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}>
<l9, l9, 1 + Index15^0 <= __const_20^0, {Index15^0 -> 1 + Index15^0, rest remain the same}>
<l11, l11, __const_20^0 <= 0 /\ 1 + Outer13^0 <= __const_20^0, {Inner14^0 -> 0, Outer13^0 -> 1 + Outer13^0, rest remain the same}>
<l11, l9, 1 + Outer13^0 <= __const_20^0 /\ 1 <= __const_20^0, {Index15^0 -> 0, Inner14^0 -> 0, rest remain the same}>
Variables:
Index15^0, Inner14^0, Outer13^0, __const_20^0

Graph 4:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 <= __const_20^0 /\ OuterIndex5^0 = 0, {InnerIndex6^0 -> 0, rest remain the same}>

Graph 2
<l3, l14, __const_20^0 <= InnerIndex6^0 /\ 1 <= __const_20^0 /\ __const_20^0 <= 1 + OuterIndex5^0, {InnerIndex9^0 -> 0, OuterIndex5^0 -> 1 + OuterIndex5^0, OuterIndex8^0 -> 0, rest remain the same}>

Graph 3
<l0, l11, __const_20^0 <= 0 /\ OuterIndex5^0 = 0, {Outer13^0 -> 0, OuterIndex8^0 -> 0, rest remain the same}>
<l3, l11, __const_20^0 <= InnerIndex6^0 /\ __const_20^0 <= 0 /\ __const_20^0 <= 1 + OuterIndex5^0, {Outer13^0 -> 0, OuterIndex5^0 -> 1 + OuterIndex5^0, OuterIndex8^0 -> 0, rest remain the same}>
<l14, l11, __const_20^0 <= InnerIndex9^0 /\ __const_20^0 <= 1 + OuterIndex8^0, {Outer13^0 -> 0, OuterIndex8^0 -> 1 + OuterIndex8^0, rest remain the same}>

Graph 4
<l11, l13, __const_20^0 <= Outer13^0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 3 , 1 )
( 9 , 3 )
( 11 , 3 )
( 13 , 4 )
( 14 , 2 )

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001336s
Ranking function: -OuterIndex5^0 + __const_20^0
New Graphs: 
Transitions:
<l3, l3, 1 + InnerIndex6^0 <= __const_20^0, {InnerIndex6^0 -> 1 + InnerIndex6^0, rest remain the same}>
Variables:
InnerIndex6^0, __const_20^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Checking conditional termination of SCC {l14}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001384s
Ranking function: -OuterIndex8^0 + __const_20^0
New Graphs: 
Transitions:
<l14, l14, 1 + InnerIndex9^0 <= __const_20^0, {InnerIndex9^0 -> 1 + InnerIndex9^0, rest remain the same}>
Variables:
InnerIndex9^0, __const_20^0
Checking conditional termination of SCC {l14}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000838s
Ranking function: -1 - InnerIndex9^0 + __const_20^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.018855
Some transition disabled by a set of invariant(s):
Invariant at l9: 0 <= 1 + Outer13^0
Invariant at l11: 0 <= Outer13^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l11, l11, __const_20^0 <= 0 /\ 1 + Outer13^0 <= __const_20^0, {Inner14^0 -> 0, Outer13^0 -> 1 + Outer13^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l11, __const_20^0 <= Index15^0 /\ __const_20^0 <= 1 + Inner14^0 /\ 0 <= 1 + Outer13^0, {Inner14^0 -> 1 + Inner14^0, Outer13^0 -> 1 + Outer13^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, __const_20^0 <= Index15^0 /\ 0 <= 1 + Outer13^0 /\ 2 + Inner14^0 <= __const_20^0, {Index15^0 -> 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 + Index15^0 <= __const_20^0 /\ 0 <= 1 + Outer13^0, {Index15^0 -> 1 + Index15^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l9, 0 <= Outer13^0 /\ 1 + Outer13^0 <= __const_20^0 /\ 1 <= __const_20^0, {Index15^0 -> 0, Inner14^0 -> 0, rest remain the same}>
Checking unfeasibility...
Time used: 0.013178

Checking conditional termination of SCC {l9, l11}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002519s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013788s
[4661 : 4662]
[4661 : 4663]
Successful child: 4662
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l11, __const_20^0 <= Index15^0 /\ Outer13^0 <= __const_20^0 /\ __const_20^0 <= 1 + Inner14^0 /\ 0 <= 1 + Outer13^0, {Inner14^0 -> 1 + Inner14^0, Outer13^0 -> 1 + Outer13^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, __const_20^0 <= Index15^0 /\ Outer13^0 <= __const_20^0 /\ 0 <= 1 + Outer13^0 /\ 2 + Inner14^0 <= __const_20^0, {Index15^0 -> 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, Outer13^0 <= __const_20^0 /\ 1 + Index15^0 <= __const_20^0 /\ 0 <= 1 + Outer13^0, {Index15^0 -> 1 + Index15^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l11, __const_20^0 <= Index15^0 /\ Outer13^0 <= __const_20^0 /\ __const_20^0 <= 1 + Inner14^0 /\ 0 <= 1 + Outer13^0, {Inner14^0 -> 1 + Inner14^0, Outer13^0 -> 1 + Outer13^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, __const_20^0 <= Index15^0 /\ Outer13^0 <= __const_20^0 /\ 0 <= 1 + Outer13^0 /\ 2 + Inner14^0 <= __const_20^0, {Index15^0 -> 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, Outer13^0 <= __const_20^0 /\ 1 + Index15^0 <= __const_20^0 /\ 0 <= 1 + Outer13^0, {Index15^0 -> 1 + Index15^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Ranking function: -Outer13^0 + __const_20^0
New Graphs: 
Transitions:
<l9, l9, __const_20^0 <= Index15^0 /\ Outer13^0 <= __const_20^0 /\ 0 <= 1 + Outer13^0 /\ 2 + Inner14^0 <= __const_20^0, {Index15^0 -> 0, Inner14^0 -> 1 + Inner14^0, rest remain the same}>
<l9, l9, Outer13^0 <= __const_20^0 /\ 1 + Index15^0 <= __const_20^0 /\ 0 <= 1 + Outer13^0, {Index15^0 -> 1 + Index15^0, rest remain the same}>
Variables:
Index15^0, Inner14^0, Outer13^0, __const_20^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001960s
Ranking function: 1 - Inner14^0 + __const_20^0
New Graphs: 
Transitions:
<l9, l9, Outer13^0 <= __const_20^0 /\ 1 + Index15^0 <= __const_20^0 /\ 0 <= 1 + Outer13^0, {Index15^0 -> 1 + Index15^0, rest remain the same}>
Variables:
Index15^0, Outer13^0, __const_20^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001129s
Ranking function: -1 - Index15^0 + __const_20^0
New Graphs: 
INVARIANTS: 
9: Outer13^0 <= __const_20^0 , 
Quasi-INVARIANTS to narrow Graph: 
9: 
Proving termination of subgraph 4
Analyzing SCC {l13}...
No cycles found.

Program Terminates