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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l29, true>
<l1, l2, true>
<l3, l4, true>
<l5, l6, true>
<l7, l8, true, par{k_1^0 -> (1 + k_1^0)}>
<l9, l7, (1 <= (0 + destflag^0))>
<l9, l7, ((1 + destflag^0) <= 0)>
<l9, l7, ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0))>
<l10, l7, (1 <= (0 + sourceflag^0))>
<l10, l7, ((1 + sourceflag^0) <= 0)>
<l10, l9, ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0))>
<l11, l12, true>
<l13, l14, true, par{j^0 -> (1 + j^0)}>
<l15, l13, true>
<l15, l13, true, par{destflag^0 -> 0}>
<l15, l13, true>
<l16, l10, ((0 + nodecount^0) <= (0 + j^0))>
<l16, l15, ((1 + j^0) <= (0 + nodecount^0))>
<l17, l18, true, par{j^0 -> (1 + j^0)}>
<l8, l19, true>
<l20, l17, true>
<l20, l17, true, par{sourceflag^0 -> 1}>
<l20, l17, true>
<l21, l14, ((0 + nodecount^0) <= (0 + j^0)), par{destflag^0 -> 1, j^0 -> 0}>
<l21, l20, ((1 + j^0) <= (0 + nodecount^0))>
<l22, l23, true, par{h^0 -> (1 + h^0)}>
<l24, l22, true, par{min^0 -> (0 + h^0)}>
<l24, l22, true>
<l23, l25, true>
<l25, l18, ((0 + edgecount^0) <= (0 + h^0)), par{j^0 -> 0, sourceflag^0 -> 0}>
<l25, l24, ((1 + h^0) <= (0 + edgecount^0))>
<l19, l5, ((0 + edgecount^0) <= (0 + k_1^0)), par{k^0 -> (1 + k^0)}>
<l19, l23, ((1 + k_1^0) <= (0 + edgecount^0)), par{h^0 -> 0}>
<l12, l8, ((0 + edgecount^0) <= (0 + i^0)), par{k_1^0 -> 0}>
<l12, l11, ((1 + i^0) <= (0 + edgecount^0)), par{i^0 -> (1 + i^0)}>
<l18, l21, true>
<l26, l11, true, par{i^0 -> 0, min^0 -> 0}>
<l6, l27, ((0 + k^0) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + k^0))>
<l6, l26, ((0 + nodecount^0) <= (0 + k^0))>
<l6, l26, ((1 + k^0) <= (~(1) + nodecount^0))>
<l4, l5, ((~(1) + nodecount^0) <= (0 + i^0)), par{k^0 -> 0}>
<l4, l3, ((1 + i^0) <= (~(1) + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l14, l16, true>
<l2, l3, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l2, l1, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l28, l1, true, par{__lengthofvisited^0 -> (0 + edgecount^0), i^0 -> 1}>
<l29, l28, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (i^0 = 1)>
<l1, l3, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
<l1, l1, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l3, l27, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((0 + 0) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + 0)), par{k^0 -> 0}>
<l3, l11, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((0 + nodecount^0) <= (0 + 0)), par{i^0 -> 0, k^0 -> 0}>
<l3, l11, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> 0}>
<l3, l3, ((1 + i^0) <= (~(1) + nodecount^0)), par{i^0 -> (1 + i^0)}>
<l11, l27, ((0 + edgecount^0) <= (0 + i^0)) /\ ((0 + edgecount^0) <= (0 + 0)) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> 0}>
<l11, l11, ((0 + edgecount^0) <= (0 + i^0)) /\ ((0 + edgecount^0) <= (0 + 0)) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> 0}>
<l11, l11, ((0 + edgecount^0) <= (0 + i^0)) /\ ((0 + edgecount^0) <= (0 + 0)) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> 0}>
<l11, l23, ((0 + edgecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> 0}>
<l11, l11, ((1 + i^0) <= (0 + edgecount^0)), par{i^0 -> (1 + i^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ (1 <= (0 + sourceflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ (1 <= (0 + sourceflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ (1 <= (0 + sourceflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ (1 <= (0 + sourceflag^0)) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ ((1 + sourceflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((1 + sourceflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((1 + sourceflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ ((1 + sourceflag^0) <= 0) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ (1 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ (1 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ (1 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ (1 <= (0 + destflag^0)) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((1 + destflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((1 + destflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((1 + destflag^0) <= 0) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((1 + destflag^0) <= 0) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l27, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + (1 + k^0)) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((0 + nodecount^0) <= (0 + (1 + k^0))), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l11, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0)) /\ ((0 + edgecount^0) <= (0 + (1 + k_1^0))) /\ ((1 + (1 + k^0)) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> (1 + k^0), k_1^0 -> (1 + k_1^0)}>
<l14, l23, ((0 + nodecount^0) <= (0 + j^0)) /\ ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0)) /\ ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0)) /\ ((1 + (1 + k_1^0)) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> (1 + k_1^0)}>
<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{destflag^0 -> 0, j^0 -> (1 + j^0)}>
<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
<l18, l14, ((0 + nodecount^0) <= (0 + j^0)), par{destflag^0 -> 1, j^0 -> 0}>
<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0), sourceflag^0 -> 1}>
<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
<l23, l18, ((0 + edgecount^0) <= (0 + h^0)), par{j^0 -> 0, sourceflag^0 -> 0}>
<l23, l23, ((1 + h^0) <= (0 + edgecount^0)), par{h^0 -> (1 + h^0)}>
<l23, l23, ((1 + h^0) <= (0 + edgecount^0)), par{h^0 -> (1 + h^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:
<l1, l1, 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, nodecount^0

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

Graph 3:
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 + sourceflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 + sourceflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 + sourceflag^0 <= 0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, nodecount^0 <= j^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
edgecount^0, i^0, k^0, nodecount^0, j^0, k_1^0, sourceflag^0, destflag^0, h^0

Graph 4:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>

Graph 3
<l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
<l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>

Graph 4
<l3, l27, nodecount^0 <= 1 + i^0 /\ nodecount^0 = 1, {k^0 -> 0, rest remain the same}>
<l11, l27, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l14, l27, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l27, 1 + sourceflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l27, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l27, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l27, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 1 , 1 )
( 3 , 2 )
( 11 , 3 )
( 14 , 3 )
( 18 , 3 )
( 23 , 3 )
( 27 , 4 )

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000880s
Ranking function: -2 - i^0 + nodecount^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.465119
Some transition disabled by a set of invariant(s):
Invariant at l11: 0 <= i^0
Invariant at l14: 0 <= destflag^0
Invariant at l18: 1 + k_1^0 <= h^0
Invariant at l23: 1 + k_1^0 <= edgecount^0

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= 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, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 + sourceflag^0 <= 0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l11, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l23, 1 + destflag^0 <= 0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.852833
Some transition disabled by a set of invariant(s):
Invariant at l14: 0 <= sourceflag^0
Invariant at l18: 0 <= sourceflag^0

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l11, 1 + sourceflag^0 <= 0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l14, l23, 1 + sourceflag^0 <= 0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Checking unfeasibility...
Time used: 2.29027

Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.026058s
Ranking function: -5 - 10*edgecount^0 - 2*k^0 + 2*nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.018369s
Ranking function: -5 - 2*k^0 + 2*nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011853s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.214177s
[35627 : 35628]
[35627 : 35629]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.643442s
Time used: 2.6253
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003675s
Time used: 1.00364

LOG: SAT solveNonLinear - Elapsed time: 3.647117s
Cost: 1; Total time: 3.62895
Termination implied by a set of invariant(s):
Invariant at l14: k_1^0 <= h^0 + j^0 + sourceflag^0
Invariant at l18: k_1^0 + sourceflag^0 <= h^0
Invariant at l23: k_1^0 <= edgecount^0
[ 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): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^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): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Quasi-ranking function: 50000 - k^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.017950s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.289634s
[35627 : 35633]
[35627 : 35634]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.585364s
Time used: 2.55907
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004641s
Time used: 1.00462

LOG: SAT solveNonLinear - Elapsed time: 3.590005s
Cost: 1; Total time: 3.56369
Termination implied by a set of invariant(s):
Invariant at l14: k_1^0 <= 1 + edgecount^0 + h^0
Invariant at l18: 1 + k_1^0 <= edgecount^0 + h^0
Invariant at l23: 1 + k_1^0 <= edgecount^0 + h^0
[ 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): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^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): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ nodecount^0 <= 1 + k^0 /\ 50001 <= k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Quasi-ranking function: 50000 - k^0 + nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.020491s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.297503s
[35627 : 35638]
[35627 : 35639]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.887095s
Time used: 2.8541
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.005098s
Time used: 1.00507

LOG: SAT solveNonLinear - Elapsed time: 3.892193s
Cost: 1; Total time: 3.85917
Termination implied by a set of invariant(s):
Invariant at l14: k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0
Invariant at l18: 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0
Invariant at l23: 1 + k_1^0 <= edgecount^0 + h^0
[ 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): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^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): 
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Quasi-ranking function: 50000 - k^0 - nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.024567s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.274484s
[35627 : 35643]
[35627 : 35644]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.544992s
Time used: 2.53658
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.005438s
Time used: 1.00541

LOG: SAT solveNonLinear - Elapsed time: 3.550430s
Cost: 1; Total time: 3.54199
Termination implied by a set of invariant(s):
Invariant at l18: 1 + k_1^0 <= edgecount^0
Invariant at l23: 1 + k_1^0 <= edgecount^0
[ 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

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^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

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Quasi-ranking function: 50000 - edgecount^0 - k^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.025735s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.342980s
[35627 : 35648]
[35627 : 35649]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.945613s
Time used: 2.93685
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.005846s
Time used: 1.00581

LOG: SAT solveNonLinear - Elapsed time: 3.951459s
Cost: 1; Total time: 3.94266
Termination implied by a set of invariant(s):
Invariant at l14: 1 <= edgecount^0 + k_1^0
Invariant at l18: 1 <= edgecount^0 + k_1^0
Invariant at l23: 1 <= edgecount^0 + k_1^0
[ 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): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0, {h^0 -> 1 + h^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): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0, {h^0 -> 1 + h^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*edgecount^0 - k^0 + nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ edgecount^0 <= 1 + k_1^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.028049s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.510786s
[35627 : 35769]
[35627 : 35770]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.225356s
Time used: 3.21562
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.890934s
Time used: 0.890919

LOG: SAT solveNonLinear - Elapsed time: 4.116290s
Cost: 1; Total time: 4.10653
Termination implied by a set of invariant(s):
Invariant at l14: 1 + k_1^0 <= edgecount^0
Invariant at l18: h^0 <= edgecount^0
Invariant at l23: h^0 <= edgecount^0
[ 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): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ nodecount^0 <= 1 + k^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0, {h^0 -> 1 + h^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): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0, {h^0 -> 1 + h^0, rest remain the same}>
Quasi-ranking function: 50000 + edgecount^0 - k^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.030295s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.426062s
[35627 : 35774]
[35627 : 35775]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.644688s
Time used: 3.6345
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.472026s
Time used: 0.472009

LOG: SAT solveNonLinear - Elapsed time: 4.116714s
Cost: 1; Total time: 4.10651
Termination implied by a set of invariant(s):
Invariant at l14: 1 <= i^0
Invariant at l18: 1 <= i^0
Invariant at l23: 1 <= i^0
[ 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): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ nodecount^0 <= 1 + k^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0, {h^0 -> 1 + h^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): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0, {h^0 -> 1 + h^0, rest remain the same}>
Quasi-ranking function: 50000 + 2*edgecount^0 - k^0 - nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.033596s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 1.337614s
[35627 : 35814]
[35627 : 35815]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.711351s
Time used: 2.69979
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.007146s
Time used: 1.00712

LOG: SAT solveNonLinear - Elapsed time: 3.718497s
Cost: 1; Total time: 3.70691
Termination implied by a set of invariant(s):
Invariant at l14: 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0
Invariant at l18: 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0
Invariant at l23: 0 <= 1 + edgecount^0 + h^0 + i^0
[ 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): 
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ nodecount^0 <= 1 + k^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0, {h^0 -> 1 + h^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): 
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0, {h^0 -> 1 + h^0, rest remain the same}>
Quasi-ranking function: 50000 + edgecount^0 - k^0 + nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.036588s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 1.161423s
[35627 : 36147]
[35627 : 36148]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.931403s
Time used: 2.91945
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.007514s
Time used: 1.0075

LOG: SAT solveNonLinear - Elapsed time: 3.938917s
Cost: 1; Total time: 3.92695
Termination implied by a set of invariant(s):
Invariant at l14: 1 + k_1^0 <= h^0 + j^0
Invariant at l18: edgecount^0 <= 1 + h^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 3 + k^0 <= nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ edgecount^0 <= 1 + h^0, {j^0 -> 1 + j^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): 
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l23, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^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 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Quasi-ranking function: 50000 - edgecount^0 - k^0 - nodecount^0
New Graphs: 
Transitions:
<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= edgecount^0 + k^0 + nodecount^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= edgecount^0 + k^0 + nodecount^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= destflag^0 /\ 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= edgecount^0 + k^0 + nodecount^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= destflag^0 /\ 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l11, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 50001 + edgecount^0 <= k^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= edgecount^0 + k^0 /\ 50001 <= edgecount^0 + k^0 + nodecount^0 /\ 50001 + 2*edgecount^0 <= k^0 + nodecount^0 /\ 50001 + nodecount^0 <= 2*edgecount^0 + k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ edgecount^0 = 1 + k_1^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l23, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0 /\ 2 + k_1^0 <= edgecount^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
<l14, l14, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l14, 1 <= edgecount^0 + j^0 + k_1^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 + j^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ k_1^0 <= 1 + destflag^0 + edgecount^0 + h^0 + sourceflag^0 /\ k_1^0 <= 1 + edgecount^0 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l14, 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ edgecount^0 <= 1 + h^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ edgecount^0 <= 1 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ edgecount^0 <= 1 + h^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
<l18, l18, 1 + k_1^0 <= edgecount^0 + h^0 + i^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 + sourceflag^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 + k_1^0 <= h^0 /\ 1 <= i^0 /\ 1 + j^0 <= nodecount^0 /\ h^0 <= edgecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ edgecount^0 <= 1 + h^0, {j^0 -> 1 + j^0, rest remain the same}>
<l23, l18, 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0 /\ edgecount^0 = h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0, {h^0 -> 1 + h^0, rest remain the same}>
<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 + h^0 /\ 1 + k_1^0 <= edgecount^0 /\ 1 <= edgecount^0 + k_1^0 /\ 1 <= i^0 /\ 0 <= 1 + edgecount^0 + h^0 + i^0, {h^0 -> 1 + h^0, rest remain the same}>
Variables:
destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
Checking conditional termination of SCC {l11, l14, l18, l23}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.039862s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 2.027217s
[35627 : 36152]
[35627 : 36153]
Timeout expired!
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 2
* Exit transition: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 3
* Exit transition: <l0, l1, i^0 = 1, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.008822s

LOG: NarrowEntry size 1
Narrowing transition: 
<l1, l1, 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l1, 0 <= 0 /\ i^0 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
END GRAPH:
EXIT: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[35627 : 36157]
[35627 : 36158]
[35627 : 36159]
Successful child: 36157

LOG: CALL check - Post:1 <= nodecount^0 - Process 4
* Exit transition: <l0, l1, 0 <= 0 /\ i^0 = 1, {all remain the same}>
* Postcondition  : 1 <= nodecount^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.013236s

LOG: NarrowEntry size 1
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 <= nodecount^0 , 
Narrowing transition: 
<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l1, 0 <= 0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>
END ENTRIES:
GRAPH:
<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0 /\ nodecount^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
END GRAPH:
EXIT: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[35627 : 36160]
[35627 : 36161]
[35627 : 36162]
Successful child: 36160
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0 /\ nodecount^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
[35627 : 36163]
[35627 : 36164]
[35627 : 36165]

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

LOG: RETURN check - Elapsed time: 0.450190s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l1, l3, 0 <= 0 /\ nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= 0 /\ nodecount^0 <= 0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[35627 : 36166]
[35627 : 36167]
[35627 : 36168]
Successful child: 36166
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ nodecount^0 <= 0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
[35627 : 36169]
[35627 : 36170]
[35627 : 36171]

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

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

[35627 : 36172]
[35627 : 36198]
Successful child: 36172

Program does NOT terminate