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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l13, true>
<l1, l2, true>
<l3, l4, true>
<l5, l6, true>
<l7, l8, true>
<l9, l7, (6 <= (0 + k6^0)), par{j5^0 -> (1 + j5^0)}>
<l9, l10, ((0 + k6^0) <= 5), par{k6^0 -> (1 + k6^0)}>
<l8, l5, (6 <= (0 + j5^0)), par{i4^0 -> (1 + i4^0)}>
<l8, l10, ((0 + j5^0) <= 5), par{k6^0 -> 1}>
<l6, l11, (6 <= (0 + i4^0))>
<l6, l7, ((0 + i4^0) <= 5), par{j5^0 -> 1}>
<l10, l9, true>
<l4, l1, (6 <= (0 + j5^0)), par{i4^0 -> (1 + i4^0)}>
<l4, l3, ((0 + j5^0) <= 5), par{j5^0 -> (1 + j5^0)}>
<l2, l5, (6 <= (0 + i4^0)), par{i4^0 -> 1}>
<l2, l3, ((0 + i4^0) <= 5), par{j5^0 -> 1}>
<l12, l1, true, par{i4^0 -> 1}>
<l13, l12, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i4^0 = 1) /\ ((0 + 1) <= 5), par{j5^0 -> 1}>
<l3, l7, (6 <= (0 + j5^0)) /\ (6 <= (0 + (1 + i4^0))) /\ ((0 + 1) <= 5), par{i4^0 -> 1, j5^0 -> 1}>
<l3, l3, (6 <= (0 + j5^0)) /\ ((0 + (1 + i4^0)) <= 5), par{i4^0 -> (1 + i4^0), j5^0 -> 1}>
<l3, l3, ((0 + j5^0) <= 5), par{j5^0 -> (1 + j5^0)}>
<l7, l11, (6 <= (0 + j5^0)) /\ (6 <= (0 + (1 + i4^0))), par{i4^0 -> (1 + i4^0)}>
<l7, l7, (6 <= (0 + j5^0)) /\ ((0 + (1 + i4^0)) <= 5), par{i4^0 -> (1 + i4^0), j5^0 -> 1}>
<l7, l10, ((0 + j5^0) <= 5), par{k6^0 -> 1}>
<l10, l7, (6 <= (0 + k6^0)), par{j5^0 -> (1 + j5^0)}>
<l10, l10, ((0 + k6^0) <= 5), par{k6^0 -> (1 + k6^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 6 <= j5^0 /\ i4^0 <= 4, {i4^0 -> 1 + i4^0, j5^0 -> 1, rest remain the same}>
<l3, l3, j5^0 <= 5, {j5^0 -> 1 + j5^0, rest remain the same}>
Variables:
i4^0, j5^0

Graph 2:
Transitions:
<l7, l7, 6 <= j5^0 /\ i4^0 <= 4, {i4^0 -> 1 + i4^0, j5^0 -> 1, rest remain the same}>
<l7, l10, j5^0 <= 5, {k6^0 -> 1, rest remain the same}>
<l10, l7, 6 <= k6^0, {j5^0 -> 1 + j5^0, rest remain the same}>
<l10, l10, k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
Variables:
i4^0, j5^0, k6^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, i4^0 = 1, {j5^0 -> 1, rest remain the same}>

Graph 2
<l3, l7, 6 <= j5^0 /\ 5 <= i4^0, {i4^0 -> 1, j5^0 -> 1, rest remain the same}>

Graph 3
<l7, l11, 6 <= j5^0 /\ 5 <= i4^0, {i4^0 -> 1 + i4^0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001147s
Ranking function: 4 - i4^0
New Graphs: 
Transitions:
<l3, l3, j5^0 <= 5, {j5^0 -> 1 + j5^0, rest remain the same}>
Variables:
j5^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000487s
Ranking function: 5 - j5^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.143769

Checking conditional termination of SCC {l7, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002302s
Ranking function: 4 - i4^0
New Graphs: 
Transitions:
<l7, l10, j5^0 <= 5, {k6^0 -> 1, rest remain the same}>
<l10, l7, 6 <= k6^0, {j5^0 -> 1 + j5^0, rest remain the same}>
<l10, l10, k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
Variables:
j5^0, k6^0
Checking conditional termination of SCC {l7, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000804s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004142s
[63516 : 63582]
[63516 : 63583]
Successful child: 63582
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l7, 6 <= k6^0 /\ j5^0 <= 5, {j5^0 -> 1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, j5^0 <= 5 /\ k6^0 <= 5, {k6^0 -> 1 + k6^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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l7, 6 <= k6^0 /\ j5^0 <= 5, {j5^0 -> 1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, j5^0 <= 5 /\ k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
Ranking function: 5 - j5^0
New Graphs: 
Transitions:
<l10, l10, j5^0 <= 5 /\ k6^0 <= 5, {k6^0 -> 1 + k6^0, rest remain the same}>
Variables:
j5^0, k6^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000918s
Ranking function: 5 - k6^0
New Graphs: 
INVARIANTS: 
10: j5^0 <= 5 , 
Quasi-INVARIANTS to narrow Graph: 
10: 
Proving termination of subgraph 3
Analyzing SCC {l11}...
No cycles found.

Program Terminates