/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, l18, true>
<l1, l2, ((0 + nodecount^0) <= (0 + i^0))>
<l1, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l4, l5, true, par{i^0 -> (1 + i^0)}>
<l4, l2, true>
<l6, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l6, l4, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef53 = undef53) /\ (undef54 = undef54), par{x^0 -> undef53, y^0 -> undef54}>
<l7, l8, true, par{j^0 -> (1 + j^0)}>
<l9, l10, ((0 + edgecount^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l9, l7, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef80 = undef80) /\ (undef81 = undef81), par{x^0 -> undef80, y^0 -> undef81}>
<l11, l5, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l11, l8, ((1 + i^0) <= (0 + nodecount^0)), par{j^0 -> 0}>
<l12, l13, true>
<l14, l15, true>
<l13, l14, true, par{i^0 -> (1 + i^0)}>
<l16, l12, ((1 + source^0) <= (0 + i^0))>
<l16, l12, ((1 + i^0) <= (0 + source^0))>
<l16, l13, ((0 + i^0) <= (0 + source^0)) /\ ((0 + source^0) <= (0 + i^0))>
<l15, l10, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l15, l16, ((1 + i^0) <= (0 + nodecount^0))>
<l10, l11, true>
<l8, l9, true>
<l5, l6, true>
<l3, l1, true>
<l17, l14, true, par{edgecount^0 -> (0 + __const_15^0), i^0 -> 0, nodecount^0 -> (0 + __const_5^0), source^0 -> 0}>
<l18, l17, true>

Fresh variables:
undef53, undef54, undef80, undef81, 

Undef variables:
undef53, undef54, undef80, undef81, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l14, (edgecount^0 = (0 + edgecount^0)) /\ (i^0 = 0) /\ (nodecount^0 = (0 + nodecount^0)) /\ (0 = 0)>
<l3, l2, ((0 + nodecount^0) <= (0 + i^0))>
<l3, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l5, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l5, l5, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef53 = undef53) /\ (undef54 = undef54), par{i^0 -> (1 + i^0)}>
<l5, l2, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef53 = undef53) /\ (undef54 = undef54)>
<l8, l5, ((0 + edgecount^0) <= (0 + j^0)) /\ ((0 + nodecount^0) <= (0 + (1 + i^0))), par{i^0 -> 0}>
<l8, l8, ((0 + edgecount^0) <= (0 + j^0)) /\ ((1 + (1 + i^0)) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0), j^0 -> 0}>
<l8, l8, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef80 = undef80) /\ (undef81 = undef81), par{j^0 -> (1 + j^0)}>
<l14, l5, ((0 + nodecount^0) <= (0 + i^0)) /\ ((0 + nodecount^0) <= (0 + 0)), par{i^0 -> 0}>
<l14, l8, ((0 + nodecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (0 + nodecount^0)), par{i^0 -> 0, j^0 -> 0}>
<l14, l14, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
<l14, l14, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + i^0) <= (0 + 0)), par{i^0 -> (1 + i^0)}>
<l14, l14, ((1 + i^0) <= (0 + nodecount^0)) /\ ((0 + i^0) <= (0 + 0)) /\ ((0 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>

Fresh variables:
undef53, undef54, undef80, undef81, 

Undef variables:
undef53, undef54, undef80, undef81, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l14, l14, 1 + i^0 <= nodecount^0 /\ 1 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l14, 1 + i^0 <= 0 /\ 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l14, 1 + i^0 <= nodecount^0 /\ i^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, nodecount^0

Graph 2:
Transitions:
<l8, l8, edgecount^0 <= j^0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, j^0 -> 0, rest remain the same}>
<l8, l8, 1 + j^0 <= edgecount^0, {j^0 -> 1 + j^0, rest remain the same}>
Variables:
edgecount^0, i^0, j^0, nodecount^0

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

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

Graph 5:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l14, i^0 = 0, {all remain the same}>

Graph 2
<l14, l8, nodecount^0 <= i^0 /\ 1 <= nodecount^0, {i^0 -> 0, j^0 -> 0, rest remain the same}>

Graph 3
<l8, l5, edgecount^0 <= j^0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, rest remain the same}>
<l14, l5, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>

Graph 4
<l5, l3, edgecount^0 <= i^0, {i^0 -> 0, rest remain the same}>

Graph 5
<l3, l2, nodecount^0 <= i^0, {all remain the same}>
<l5, l2, 1 + i^0 <= edgecount^0, {all remain the same}>

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.005285
Some transition disabled by a set of invariant(s):
Invariant at l14: 0 <= i^0

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + i^0 <= nodecount^0 /\ i^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.003256

Checking conditional termination of SCC {l14}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001126s
Ranking function: -i^0
New Graphs: 
Transitions:
<l14, l14, 1 + i^0 <= nodecount^0 /\ 1 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, nodecount^0
Checking conditional termination of SCC {l14}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000696s
Ranking function: -1 - i^0 + nodecount^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.004376

Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001396s
Ranking function: -2 - i^0 + nodecount^0
New Graphs: 
Transitions:
<l8, l8, 1 + j^0 <= edgecount^0, {j^0 -> 1 + j^0, rest remain the same}>
Variables:
edgecount^0, j^0
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000826s
Ranking function: -1 + edgecount^0 - j^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.001684

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000911s
Ranking function: -1 + edgecount^0 - i^0
New Graphs: 
Proving termination of subgraph 4
Checking unfeasibility...
Time used: 0.001615

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000887s
Ranking function: -1 - i^0 + nodecount^0
New Graphs: 
Proving termination of subgraph 5
Analyzing SCC {l2}...
No cycles found.

Program Terminates