121.92/122.02	NO
121.92/122.02	
121.92/122.02	Solver Timeout: 4
121.92/122.02	Global Timeout: 300
121.92/122.02	No parsing errors!
121.92/122.02	Init Location: 0
121.92/122.02	Transitions:
121.92/122.02	<l0, l29, true>
121.92/122.02	<l1, l2, true>
121.92/122.02	<l3, l4, true>
121.92/122.02	<l5, l6, true>
121.92/122.02	<l7, l8, true, par{k_1^0 -> (1 + k_1^0)}>
121.92/122.02	<l9, l7, (1 <= (0 + destflag^0))>
121.92/122.02	<l9, l7, ((1 + destflag^0) <= 0)>
121.92/122.02	<l9, l7, ((0 + destflag^0) <= 0) /\ (0 <= (0 + destflag^0))>
121.92/122.02	<l10, l7, (1 <= (0 + sourceflag^0))>
121.92/122.02	<l10, l7, ((1 + sourceflag^0) <= 0)>
121.92/122.02	<l10, l9, ((0 + sourceflag^0) <= 0) /\ (0 <= (0 + sourceflag^0))>
121.92/122.02	<l11, l12, true>
121.92/122.02	<l13, l14, true, par{j^0 -> (1 + j^0)}>
121.92/122.02	<l15, l13, true>
121.92/122.02	<l15, l13, true, par{destflag^0 -> 0}>
121.92/122.02	<l15, l13, true>
121.92/122.02	<l16, l10, ((0 + nodecount^0) <= (0 + j^0))>
121.92/122.02	<l16, l15, ((1 + j^0) <= (0 + nodecount^0))>
121.92/122.02	<l17, l18, true, par{j^0 -> (1 + j^0)}>
121.92/122.02	<l8, l19, true>
121.92/122.02	<l20, l17, true>
121.92/122.02	<l20, l17, true, par{sourceflag^0 -> 1}>
121.92/122.02	<l20, l17, true>
121.92/122.02	<l21, l14, ((0 + nodecount^0) <= (0 + j^0)), par{destflag^0 -> 1, j^0 -> 0}>
121.92/122.02	<l21, l20, ((1 + j^0) <= (0 + nodecount^0))>
121.92/122.02	<l22, l23, true, par{h^0 -> (1 + h^0)}>
121.92/122.02	<l24, l22, true, par{min^0 -> (0 + h^0)}>
121.92/122.02	<l24, l22, true>
121.92/122.02	<l23, l25, true>
121.92/122.02	<l25, l18, ((0 + edgecount^0) <= (0 + h^0)), par{j^0 -> 0, sourceflag^0 -> 0}>
121.92/122.02	<l25, l24, ((1 + h^0) <= (0 + edgecount^0))>
121.92/122.02	<l19, l5, ((0 + edgecount^0) <= (0 + k_1^0)), par{k^0 -> (1 + k^0)}>
121.92/122.02	<l19, l23, ((1 + k_1^0) <= (0 + edgecount^0)), par{h^0 -> 0}>
121.92/122.02	<l12, l8, ((0 + edgecount^0) <= (0 + i^0)), par{k_1^0 -> 0}>
121.92/122.02	<l12, l11, ((1 + i^0) <= (0 + edgecount^0)), par{i^0 -> (1 + i^0)}>
121.92/122.02	<l18, l21, true>
121.92/122.02	<l26, l11, true, par{i^0 -> 0, min^0 -> 0}>
121.92/122.02	<l6, l27, ((0 + k^0) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + k^0))>
121.92/122.02	<l6, l26, ((0 + nodecount^0) <= (0 + k^0))>
121.92/122.02	<l6, l26, ((1 + k^0) <= (~(1) + nodecount^0))>
121.92/122.02	<l4, l5, ((~(1) + nodecount^0) <= (0 + i^0)), par{k^0 -> 0}>
121.92/122.02	<l4, l3, ((1 + i^0) <= (~(1) + nodecount^0)), par{i^0 -> (1 + i^0)}>
121.92/122.02	<l14, l16, true>
121.92/122.02	<l2, l3, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
121.92/122.02	<l2, l1, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
121.92/122.02	<l28, l1, true, par{___lengthofvisited^0 -> (0 + edgecount^0), i^0 -> 1}>
121.92/122.02	<l29, l28, true>
121.92/122.02	
121.92/122.02	Fresh variables:
121.92/122.02	
121.92/122.02	Undef variables:
121.92/122.02	
121.92/122.02	Abstraction variables:
121.92/122.02	
121.92/122.02	Exit nodes:
121.92/122.02	
121.92/122.02	Accepting locations:
121.92/122.02	
121.92/122.02	Asserts:
121.92/122.02	
121.92/122.02	Preprocessed LLVMGraph
121.92/122.02	Init Location: 0
121.92/122.02	Transitions:
121.92/122.02	<l0, l1, (i^0 = 1)>
121.92/122.02	<l1, l3, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
121.92/122.02	<l1, l1, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
121.92/122.02	<l3, l27, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((0 + 0) <= (~(1) + nodecount^0)) /\ ((~(1) + nodecount^0) <= (0 + 0)), par{k^0 -> 0}>
121.92/122.02	<l3, l11, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((0 + nodecount^0) <= (0 + 0)), par{i^0 -> 0, k^0 -> 0}>
121.92/122.02	<l3, l11, ((~(1) + nodecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (~(1) + nodecount^0)), par{i^0 -> 0, k^0 -> 0}>
121.92/122.02	<l3, l3, ((1 + i^0) <= (~(1) + nodecount^0)), par{i^0 -> (1 + i^0)}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<l11, l23, ((0 + edgecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (0 + edgecount^0)), par{h^0 -> 0, k_1^0 -> 0}>
121.92/122.02	<l11, l11, ((1 + i^0) <= (0 + edgecount^0)), par{i^0 -> (1 + i^0)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<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)}>
121.92/122.02	<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
121.92/122.02	<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{destflag^0 -> 0, j^0 -> (1 + j^0)}>
121.92/122.02	<l14, l14, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
121.92/122.02	<l18, l14, ((0 + nodecount^0) <= (0 + j^0)), par{destflag^0 -> 1, j^0 -> 0}>
121.92/122.02	<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
121.92/122.02	<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0), sourceflag^0 -> 1}>
121.92/122.02	<l18, l18, ((1 + j^0) <= (0 + nodecount^0)), par{j^0 -> (1 + j^0)}>
121.92/122.02	<l23, l18, ((0 + edgecount^0) <= (0 + h^0)), par{j^0 -> 0, sourceflag^0 -> 0}>
121.92/122.02	<l23, l23, ((1 + h^0) <= (0 + edgecount^0)), par{h^0 -> (1 + h^0)}>
121.92/122.02	<l23, l23, ((1 + h^0) <= (0 + edgecount^0)), par{h^0 -> (1 + h^0)}>
121.92/122.02	
121.92/122.02	Fresh variables:
121.92/122.02	
121.92/122.02	Undef variables:
121.92/122.02	
121.92/122.02	Abstraction variables:
121.92/122.02	
121.92/122.02	Exit nodes:
121.92/122.02	
121.92/122.02	Accepting locations:
121.92/122.02	
121.92/122.02	Asserts:
121.92/122.02	
121.92/122.02	*************************************************************
121.92/122.02	*******************************************************************************************
121.92/122.02	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
121.92/122.02	*******************************************************************************************
121.92/122.02	
121.92/122.02	Init Location: 0
121.92/122.02	Graph 0:
121.92/122.02	Transitions:
121.92/122.02	Variables:
121.92/122.02	
121.92/122.02	Graph 1:
121.92/122.02	Transitions:
121.92/122.02	<l1, l1, 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.02	Variables:
121.92/122.02	i^0, nodecount^0
121.92/122.02	
121.92/122.02	Graph 2:
121.92/122.02	Transitions:
121.92/122.02	<l3, l3, 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.02	Variables:
121.92/122.02	i^0, nodecount^0
121.92/122.02	
121.92/122.02	Graph 3:
121.92/122.02	Transitions:
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.02	<l11, l11, 1 + i^0 <= edgecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<l14, l14, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.02	<l14, l14, 1 + j^0 <= nodecount^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.02	<l14, l14, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.02	<l18, l14, nodecount^0 <= j^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.02	<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.02	<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.02	<l18, l18, 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.02	<l23, l18, edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.02	<l23, l23, 1 + h^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.02	<l23, l23, 1 + h^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.02	Variables:
121.92/122.02	edgecount^0, i^0, k^0, nodecount^0, j^0, k_1^0, sourceflag^0, destflag^0, h^0
121.92/122.02	
121.92/122.02	Graph 4:
121.92/122.02	Transitions:
121.92/122.02	Variables:
121.92/122.02	
121.92/122.02	Precedence: 
121.92/122.02	Graph 0
121.92/122.02	
121.92/122.02	Graph 1
121.92/122.02	<l0, l1, i^0 = 1, {all remain the same}>
121.92/122.02	
121.92/122.02	Graph 2
121.92/122.02	<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>
121.92/122.02	
121.92/122.02	Graph 3
121.92/122.02	<l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.92/122.02	<l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.92/122.02	
121.92/122.02	Graph 4
121.92/122.02	<l3, l27, nodecount^0 <= 1 + i^0 /\ nodecount^0 = 1, {k^0 -> 0, rest remain the same}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.02	<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}>
121.92/122.03	
121.92/122.03	Map Locations to Subgraph:
121.92/122.03	( 0 , 0 )
121.92/122.03	( 1 , 1 )
121.92/122.03	( 3 , 2 )
121.92/122.03	( 11 , 3 )
121.92/122.03	( 14 , 3 )
121.92/122.03	( 18 , 3 )
121.92/122.03	( 23 , 3 )
121.92/122.03	( 27 , 4 )
121.92/122.03	
121.92/122.03	*******************************************************************************************
121.92/122.03	********************************    CHECKING ASSERTIONS    ********************************
121.92/122.03	*******************************************************************************************
121.92/122.03	
121.92/122.03	Proving termination of subgraph 0
121.92/122.03	Proving termination of subgraph 1
121.92/122.03	Checking unfeasibility...
121.92/122.03	Time used: 0.00191
121.92/122.03	
121.92/122.03	Checking conditional termination of SCC {l1}...
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.001028s
121.92/122.03	Ranking function: -1 - i^0 + nodecount^0
121.92/122.03	New Graphs: 
121.92/122.03	Proving termination of subgraph 2
121.92/122.03	Checking unfeasibility...
121.92/122.03	Time used: 0.001733
121.92/122.03	
121.92/122.03	Checking conditional termination of SCC {l3}...
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.000902s
121.92/122.03	Ranking function: -2 - i^0 + nodecount^0
121.92/122.03	New Graphs: 
121.92/122.03	Proving termination of subgraph 3
121.92/122.03	Checking unfeasibility...
121.92/122.03	Time used: 0.503401
121.92/122.03	Some transition disabled by a set of invariant(s):
121.92/122.03	Invariant at l11: 0 <= i^0
121.92/122.03	Invariant at l14: 0 <= destflag^0
121.92/122.03	Invariant at l18: 1 + k_1^0 <= h^0
121.92/122.03	Invariant at l23: 1 + k_1^0 <= edgecount^0
121.92/122.03	
121.92/122.03	Strengthening and disabling transitions...
121.92/122.03	> It's unfeasible. Removing transition: 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	It's unfeasible. Removing transition: 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	It's unfeasible. Removing transition: 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Checking unfeasibility...
121.92/122.03	Time used: 0.916892
121.92/122.03	Some transition disabled by a set of invariant(s):
121.92/122.03	Invariant at l14: 0 <= sourceflag^0
121.92/122.03	Invariant at l18: 0 <= sourceflag^0
121.92/122.03	
121.92/122.03	Strengthening and disabling transitions...
121.92/122.03	> It's unfeasible. Removing transition: 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	It's unfeasible. Removing transition: 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	It's unfeasible. Removing transition: 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Checking unfeasibility...
121.92/122.03	Time used: 2.41417
121.92/122.03	
121.92/122.03	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.027239s
121.92/122.03	Ranking function: -5 - 10*edgecount^0 - 2*k^0 + 2*nodecount^0
121.92/122.03	New Graphs: 
121.92/122.03	Transitions:
121.92/122.03	<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}>
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<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}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Variables:
121.92/122.03	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.92/122.03	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.019128s
121.92/122.03	Ranking function: -5 - 2*k^0 + 2*nodecount^0
121.92/122.03	New Graphs: 
121.92/122.03	Transitions:
121.92/122.03	<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}>
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<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}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Variables:
121.92/122.03	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.92/122.03	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.012156s
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.250679s
121.92/122.03	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.189676s
121.92/122.03	Time used: 0.176775
121.92/122.03	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.185659s
121.92/122.03	Time used: 0.169316
121.92/122.03	Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080132s
121.92/122.03	Time used: 0.065086
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084420s
121.92/122.03	Time used: 0.082012
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.100241s
121.92/122.03	Time used: 0.097929
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.109038s
121.92/122.03	Time used: 0.106673
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076453s
121.92/122.03	Time used: 0.074082
121.92/122.03	Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.171468s
121.92/122.03	Time used: 0.168914
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.165893s
121.92/122.03	Time used: 0.144564
121.92/122.03	Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.126437s
121.92/122.03	Time used: 0.105108
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.581127s
121.92/122.03	Time used: 0.559829
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.146911s
121.92/122.03	Time used: 0.143022
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.928328s
121.92/122.03	Time used: 0.924588
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.156527s
121.92/122.03	Time used: 0.152617
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.874739s
121.92/122.03	Time used: 0.870919
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.186658s
121.92/122.03	Time used: 0.182477
121.92/122.03	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134015s
121.92/122.03	Time used: 0.129756
121.92/122.03	Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.235596s
121.92/122.03	Time used: 0.225706
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.097754s
121.92/122.03	Time used: 0.077201
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003338s
121.92/122.03	Time used: 4.00002
121.92/122.03	Solving with 2 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009981s
121.92/122.03	Time used: 4.00053
121.92/122.03	Solving with 3 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.076630s
121.92/122.03	Time used: 1.03862
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.046170s
121.92/122.03	Time used: 2.98945
121.92/122.03	Improving Solution with cost 1 ...
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetNextSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.005464s
121.92/122.03	Time used: 1.0054
121.92/122.03	
121.92/122.03	LOG: SAT solveNonLinear - Elapsed time: 4.051634s
121.92/122.03	Cost: 1; Total time: 3.99485
121.92/122.03	Termination implied by a set of invariant(s):
121.92/122.03	Invariant at l14: k_1^0 <= h^0 + j^0 + sourceflag^0
121.92/122.03	Invariant at l18: k_1^0 + sourceflag^0 <= h^0
121.92/122.03	Invariant at l23: k_1^0 <= edgecount^0
121.92/122.03	[ Invariant Graph ]
121.92/122.03	Strengthening and disabling transitions...
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	[ Termination Graph ]
121.92/122.03	Strengthening and disabling transitions...
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Quasi-ranking function: 50000 - k^0
121.92/122.03	New Graphs: 
121.92/122.03	Transitions:
121.92/122.03	<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}>
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<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}>
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Variables:
121.92/122.03	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.92/122.03	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.019639s
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.282220s
121.92/122.03	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.165048s
121.92/122.03	Time used: 0.143163
121.92/122.03	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.171976s
121.92/122.03	Time used: 0.15228
121.92/122.03	Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.108085s
121.92/122.03	Time used: 0.088216
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.120624s
121.92/122.03	Time used: 0.116565
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.146420s
121.92/122.03	Time used: 0.14235
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.127610s
121.92/122.03	Time used: 0.123421
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.106107s
121.92/122.03	Time used: 0.102133
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.143974s
121.92/122.03	Time used: 0.139907
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.153615s
121.92/122.03	Time used: 0.149273
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.147926s
121.92/122.03	Time used: 0.143753
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.936605s
121.92/122.03	Time used: 0.932678
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.523787s
121.92/122.03	Time used: 0.51924
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.960171s
121.92/122.03	Time used: 0.955047
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.573495s
121.92/122.03	Time used: 0.568713
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.200048s
121.92/122.03	Time used: 1.19501
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.432796s
121.92/122.03	Time used: 0.427975
121.92/122.03	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.165171s
121.92/122.03	Time used: 0.160166
121.92/122.03	Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.284051s
121.92/122.03	Time used: 0.271687
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.125298s
121.92/122.03	Time used: 0.095961
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003484s
121.92/122.03	Time used: 4.00003
121.92/122.03	Solving with 2 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010149s
121.92/122.03	Time used: 4.00003
121.92/122.03	Solving with 3 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.119431s
121.92/122.03	Time used: 1.08816
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.843699s
121.92/122.03	Time used: 2.78691
121.92/122.03	Improving Solution with cost 1 ...
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetNextSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.006644s
121.92/122.03	Time used: 1.00656
121.92/122.03	
121.92/122.03	LOG: SAT solveNonLinear - Elapsed time: 3.850343s
121.92/122.03	Cost: 1; Total time: 3.79347
121.92/122.03	Termination implied by a set of invariant(s):
121.92/122.03	Invariant at l11: 0 <= 1 + k^0
121.92/122.03	Invariant at l14: 0 <= 1 + k^0
121.92/122.03	Invariant at l18: 0 <= 1 + k^0
121.92/122.03	Invariant at l23: 0 <= 1 + k^0
121.92/122.03	[ Invariant Graph ]
121.92/122.03	Strengthening and disabling transitions...
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	[ Termination Graph ]
121.92/122.03	Strengthening and disabling transitions...
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Quasi-ranking function: 50000 - k^0 + nodecount^0
121.92/122.03	New Graphs: 
121.92/122.03	Transitions:
121.92/122.03	<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}>
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	<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 /\ 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}>
121.92/122.03	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	<l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	<l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.03	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Variables:
121.92/122.03	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.92/122.03	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.022851s
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.314217s
121.92/122.03	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.306156s
121.92/122.03	Time used: 0.301749
121.92/122.03	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.312895s
121.92/122.03	Time used: 0.277373
121.92/122.03	Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.150902s
121.92/122.03	Time used: 0.115213
121.92/122.03	Trying to remove transition: <l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.144136s
121.92/122.03	Time used: 0.140274
121.92/122.03	Trying to remove transition: <l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.156228s
121.92/122.03	Time used: 0.152057
121.92/122.03	Trying to remove transition: <l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.151524s
121.92/122.03	Time used: 0.147588
121.92/122.03	Trying to remove transition: <l18, l14, 1 + k_1^0 <= h^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134760s
121.92/122.03	Time used: 0.130796
121.92/122.03	Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.180657s
121.92/122.03	Time used: 0.176681
121.92/122.03	Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.162243s
121.92/122.03	Time used: 0.158027
121.92/122.03	Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.215117s
121.92/122.03	Time used: 0.211133
121.92/122.03	Trying to remove transition: <l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.275200s
121.92/122.03	Time used: 1.27112
121.92/122.03	Trying to remove transition: <l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.482536s
121.92/122.03	Time used: 0.4776
121.92/122.03	Trying to remove transition: <l14, l23, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.334624s
121.92/122.03	Time used: 1.32956
121.92/122.03	Trying to remove transition: <l14, l11, 1 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.660846s
121.92/122.03	Time used: 0.655652
121.92/122.03	Trying to remove transition: <l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.331178s
121.92/122.03	Time used: 1.32588
121.92/122.03	Trying to remove transition: <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 /\ 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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.470835s
121.92/122.03	Time used: 0.465561
121.92/122.03	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.281309s
121.92/122.03	Time used: 0.276206
121.92/122.03	Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= 1 + k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.187902s
121.92/122.03	Time used: 0.163768
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.205101s
121.92/122.03	Time used: 0.201365
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003754s
121.92/122.03	Time used: 4.00002
121.92/122.03	Solving with 2 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010121s
121.92/122.03	Time used: 4.00038
121.92/122.03	Solving with 3 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.176434s
121.92/122.03	Time used: 1.14434
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.170802s
121.92/122.03	Time used: 3.11363
121.92/122.03	Improving Solution with cost 1 ...
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetNextSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.892066s
121.92/122.03	Time used: 0.891962
121.92/122.03	
121.92/122.03	LOG: SAT solveNonLinear - Elapsed time: 4.062868s
121.92/122.03	Cost: 1; Total time: 4.00559
121.92/122.03	Termination implied by a set of invariant(s):
121.92/122.03	Invariant at l11: 0 <= k^0
121.92/122.03	Invariant at l14: destflag^0 <= 1
121.92/122.03	Invariant at l18: 1 + k_1^0 <= edgecount^0
121.92/122.03	Invariant at l23: k_1^0 <= edgecount^0 + k^0
121.92/122.03	[ Invariant Graph ]
121.92/122.03	Strengthening and disabling transitions...
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0 /\ nodecount^0 <= 1 + k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0 /\ 3 + k^0 <= nodecount^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l14, 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 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	[ Termination Graph ]
121.92/122.03	Strengthening and disabling transitions...
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l14, 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 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Quasi-ranking function: 50000 - k^0 - nodecount^0
121.92/122.03	New Graphs: 
121.92/122.03	Transitions:
121.92/122.03	<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}>
121.92/122.03	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	<l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	<l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	<l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l18, l14, 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 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	<l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.03	<l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Variables:
121.92/122.03	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.92/122.03	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.026372s
121.92/122.03	
121.92/122.03	LOG: CALL solveLinear
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear - Elapsed time: 0.469092s
121.92/122.03	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.185134s
121.92/122.03	Time used: 0.179723
121.92/122.03	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.168299s
121.92/122.03	Time used: 0.164375
121.92/122.03	Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.137997s
121.92/122.03	Time used: 0.133994
121.92/122.03	Trying to remove transition: <l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.175710s
121.92/122.03	Time used: 0.171549
121.92/122.03	Trying to remove transition: <l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.201304s
121.92/122.03	Time used: 0.196782
121.92/122.03	Trying to remove transition: <l18, l18, 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 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.178669s
121.92/122.03	Time used: 0.174086
121.92/122.03	Trying to remove transition: <l18, l14, 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 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.168454s
121.92/122.03	Time used: 0.164242
121.92/122.03	Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.192386s
121.92/122.03	Time used: 0.188176
121.92/122.03	Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.220477s
121.92/122.03	Time used: 0.216521
121.92/122.03	Trying to remove transition: <l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.199085s
121.92/122.03	Time used: 0.195127
121.92/122.03	Trying to remove transition: <l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.135747s
121.92/122.03	Time used: 1.13165
121.92/122.03	Trying to remove transition: <l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.704919s
121.92/122.03	Time used: 0.700186
121.92/122.03	Trying to remove transition: <l14, l23, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.184827s
121.92/122.03	Time used: 2.17917
121.92/122.03	Trying to remove transition: <l14, l11, k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.641690s
121.92/122.03	Time used: 0.635937
121.92/122.03	Trying to remove transition: <l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.535122s
121.92/122.03	Time used: 1.52958
121.92/122.03	Trying to remove transition: <l14, l11, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.639231s
121.92/122.03	Time used: 0.633881
121.92/122.03	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.395282s
121.92/122.03	Time used: 0.389848
121.92/122.03	Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.337689s
121.92/122.03	Time used: 0.30684
121.92/122.03	Trying to remove transition: <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}>
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.139400s
121.92/122.03	Time used: 0.135552
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003561s
121.92/122.03	Time used: 4.00007
121.92/122.03	Solving with 2 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009631s
121.92/122.03	Time used: 4.0002
121.92/122.03	Solving with 3 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.236891s
121.92/122.03	Time used: 1.20501
121.92/122.03	Solving with 1 template(s).
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.834677s
121.92/122.03	Time used: 3.77746
121.92/122.03	Improving Solution with cost 1 ...
121.92/122.03	
121.92/122.03	LOG: CALL solveNonLinearGetNextSolution
121.92/122.03	
121.92/122.03	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.279777s
121.92/122.03	Time used: 0.279756
121.92/122.03	
121.92/122.03	LOG: SAT solveNonLinear - Elapsed time: 4.114454s
121.92/122.03	Cost: 1; Total time: 4.05722
121.92/122.03	Termination implied by a set of invariant(s):
121.92/122.03	Invariant at l14: 1 + k_1^0 <= h^0 + sourceflag^0
121.92/122.03	Invariant at l18: 0 <= h^0 + j^0
121.92/122.03	Invariant at l23: 0 <= h^0
121.92/122.03	[ Invariant Graph ]
121.92/122.03	Strengthening and disabling transitions...
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^0 /\ nodecount^0 <= 1 + k^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^0 /\ 3 + k^0 <= nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.03	
121.92/122.03	LOG: CALL solverLinear in Graph for feasibility
121.92/122.03	
121.92/122.03	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.03	Strengthening transition (result): 
121.92/122.03	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	[ Termination Graph ]
121.92/122.04	Strengthening and disabling transitions...
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	Quasi-ranking function: 50000 + edgecount^0 - k^0 + nodecount^0
121.92/122.04	New Graphs: 
121.92/122.04	Transitions:
121.92/122.04	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 + edgecount^0 + nodecount^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}>
121.92/122.04	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.04	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^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}>
121.92/122.04	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	<l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^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}>
121.92/122.04	<l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.04	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	<l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	<l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.04	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.04	<l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	Variables:
121.92/122.04	destflag^0, edgecount^0, h^0, i^0, j^0, k^0, k_1^0, nodecount^0, sourceflag^0
121.92/122.04	Checking conditional termination of SCC {l11, l14, l18, l23}...
121.92/122.04	
121.92/122.04	LOG: CALL solveLinear
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear - Elapsed time: 0.039078s
121.92/122.04	
121.92/122.04	LOG: CALL solveLinear
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear - Elapsed time: 0.715644s
121.92/122.04	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.254777s
121.92/122.04	Time used: 0.249413
121.92/122.04	Trying to remove transition: <l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.268566s
121.92/122.04	Time used: 0.264258
121.92/122.04	Trying to remove transition: <l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ k_1^0 <= edgecount^0 + k^0 /\ 0 <= h^0 /\ 0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.160803s
121.92/122.04	Time used: 0.156532
121.92/122.04	Trying to remove transition: <l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.243843s
121.92/122.04	Time used: 0.239492
121.92/122.04	Trying to remove transition: <l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.251806s
121.92/122.04	Time used: 0.247083
121.92/122.04	Trying to remove transition: <l18, l18, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.227068s
121.92/122.04	Time used: 0.222492
121.92/122.04	Trying to remove transition: <l18, l14, 1 + k_1^0 <= edgecount^0 /\ 1 + k_1^0 <= h^0 /\ 0 <= h^0 + j^0 /\ k_1^0 + sourceflag^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ 0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.218884s
121.92/122.04	Time used: 0.21447
121.92/122.04	Trying to remove transition: <l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.246896s
121.92/122.04	Time used: 0.242398
121.92/122.04	Trying to remove transition: <l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.341321s
121.92/122.04	Time used: 0.337155
121.92/122.04	Trying to remove transition: <l14, l14, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ 0 <= sourceflag^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.236784s
121.92/122.04	Time used: 0.232576
121.92/122.04	Trying to remove transition: <l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^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}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.531346s
121.92/122.04	Time used: 1.52723
121.92/122.04	Trying to remove transition: <l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^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}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.507643s
121.92/122.04	Time used: 0.502698
121.92/122.04	Trying to remove transition: <l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.349744s
121.92/122.04	Time used: 2.34454
121.92/122.04	Trying to remove transition: <l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^0 <= k^0 /\ 50001 <= k^0 /\ 50001 + nodecount^0 <= k^0 /\ 50001 <= k^0 + nodecount^0 /\ sourceflag^0 = 0 /\ destflag^0 = 1, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.491343s
121.92/122.04	Time used: 0.485498
121.92/122.04	Trying to remove transition: <l14, l23, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ 0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.443873s
121.92/122.04	Time used: 1.43831
121.92/122.04	Trying to remove transition: <l14, l11, 1 + k_1^0 <= h^0 + sourceflag^0 /\ 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ k_1^0 <= h^0 + j^0 + sourceflag^0 /\ nodecount^0 <= j^0 /\ destflag^0 <= 1 /\ edgecount^0 <= 1 + k_1^0 /\ 50001 + edgecount^0 + nodecount^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}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.672003s
121.92/122.04	Time used: 0.666532
121.92/122.04	Trying to remove transition: <l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ 0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.392623s
121.92/122.04	Time used: 0.387181
121.92/122.04	Trying to remove transition: <l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.242976s
121.92/122.04	Time used: 0.209722
121.92/122.04	Trying to remove transition: <l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 50001 + edgecount^0 + nodecount^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}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.166027s
121.92/122.04	Time used: 0.162066
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003931s
121.92/122.04	Time used: 4.00008
121.92/122.04	Solving with 2 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009680s
121.92/122.04	Time used: 4.00003
121.92/122.04	Solving with 3 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.297830s
121.92/122.04	Time used: 1.26461
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.054913s
121.92/122.04	Time used: 4.00002
121.92/122.04	Termination failed. Trying to show unreachability...
121.92/122.04	Proving unreachability of entry: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL check - Post:1 <= 0 - Process 1
121.92/122.04	* Exit transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.92/122.04	* Postcondition  : 1 <= 0
121.92/122.04	Postcodition moved up: 1 <= 0
121.92/122.04	
121.92/122.04	LOG: Try proving POST
121.92/122.04	Postcondition: 1 <= 0
121.92/122.04	
121.92/122.04	LOG: CALL check - Post:1 <= 0 - Process 2
121.92/122.04	* Exit transition: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
121.92/122.04	* Postcondition  : 1 <= 0
121.92/122.04	Postcodition moved up: 1 <= 0
121.92/122.04	
121.92/122.04	LOG: Try proving POST
121.92/122.04	Postcondition: 1 <= 0
121.92/122.04	
121.92/122.04	LOG: CALL check - Post:1 <= 0 - Process 3
121.92/122.04	* Exit transition: <l0, l1, i^0 = 1, {all remain the same}>
121.92/122.04	* Postcondition  : 1 <= 0
121.92/122.04	
121.92/122.04	LOG: CALL solveLinear
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear - Elapsed time: 0.016444s
121.92/122.04	> Postcondition is not implied!
121.92/122.04	
121.92/122.04	LOG: RETURN check - Elapsed time: 0.016571s
121.92/122.04	
121.92/122.04	LOG: NarrowEntry size 1
121.92/122.04	Narrowing transition: 
121.92/122.04	<l1, l1, 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: Narrow transition size 1
121.92/122.04	ENTRIES:
121.92/122.04	<l0, l1, 0 <= 0 /\ i^0 = 1, {all remain the same}>
121.92/122.04	END ENTRIES:
121.92/122.04	GRAPH:
121.92/122.04	<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	END GRAPH:
121.92/122.04	EXIT: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
121.92/122.04	POST: 1 <= 0
121.92/122.04	
121.92/122.04	
121.92/122.04	LOG: Try proving POST
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089082s
121.92/122.04	Time used: 0.088786
121.92/122.04	Improving Solution with cost 1 ...
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetNextSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.038344s
121.92/122.04	Time used: 0.038217
121.92/122.04	
121.92/122.04	LOG: SAT solveNonLinear - Elapsed time: 0.127426s
121.92/122.04	Cost: 1; Total time: 0.127003
121.92/122.04	Failed at location 1: 1 <= nodecount^0
121.92/122.04	Before Improving: 
121.92/122.04	Quasi-invariant at l1: 1 <= nodecount^0
121.92/122.04	Optimizing invariants...
121.92/122.04	
121.92/122.04	LOG: CALL solveLinear
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear - Elapsed time: 0.004325s
121.92/122.04	Remaining time after improvement: 0.996809
121.92/122.04	Postcondition implied by a set of quasi-invariant(s):
121.92/122.04	Quasi-invariant at l1: 1 <= nodecount^0
121.92/122.04	Postcondition: 1 <= nodecount^0
121.92/122.04	
121.92/122.04	LOG: CALL check - Post:1 <= nodecount^0 - Process 4
121.92/122.04	* Exit transition: <l0, l1, 0 <= 0 /\ i^0 = 1, {all remain the same}>
121.92/122.04	* Postcondition  : 1 <= nodecount^0
121.92/122.04	
121.92/122.04	LOG: CALL solveLinear
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear - Elapsed time: 0.017826s
121.92/122.04	> Postcondition is not implied!
121.92/122.04	
121.92/122.04	LOG: RETURN check - Elapsed time: 0.017986s
121.92/122.04	
121.92/122.04	LOG: NarrowEntry size 1
121.92/122.04	INVARIANTS: 
121.92/122.04	1: 
121.92/122.04	Quasi-INVARIANTS to narrow Graph: 
121.92/122.04	1: 1 <= nodecount^0 , 
121.92/122.04	Narrowing transition: 
121.92/122.04	<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: Narrow transition size 1
121.92/122.04	ENTRIES:
121.92/122.04	<l0, l1, 0 <= 0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>
121.92/122.04	END ENTRIES:
121.92/122.04	GRAPH:
121.92/122.04	<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0 /\ nodecount^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	END GRAPH:
121.92/122.04	EXIT: <l1, l3, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
121.92/122.04	POST: 1 <= 0
121.92/122.04	
121.92/122.04	
121.92/122.04	LOG: Try proving POST
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.090164s
121.92/122.04	Time used: 0.089884
121.92/122.04	Improving Solution with cost 50 ...
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetNextSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.039416s
121.92/122.04	Time used: 0.039403
121.92/122.04	
121.92/122.04	LOG: SAT solveNonLinear - Elapsed time: 0.129580s
121.92/122.04	Cost: 50; Total time: 0.129287
121.92/122.04	Some transition disabled by a set of invariant(s):
121.92/122.04	Invariant at l1: 1 + nodecount^0 <= i^0
121.92/122.04	Strengthening and disabling transitions...
121.92/122.04	> It's unfeasible. Removing transition: 
121.92/122.04	<l1, l1, 1 + i^0 <= nodecount^0 /\ 0 <= 0 /\ nodecount^0 <= 0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005464s
121.92/122.04	Time used: 0.003268
121.92/122.04	Solving with 2 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.071618s
121.92/122.04	Time used: 0.071505
121.92/122.04	Solving with 3 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.034592s
121.92/122.04	Time used: 1.03414
121.92/122.04	
121.92/122.04	LOG: Postcondition is not implied - no solution
121.92/122.04	> Postcondition is not implied!
121.92/122.04	
121.92/122.04	LOG: RETURN check - Elapsed time: 1.561769s
121.92/122.04	
121.92/122.04	LOG: NarrowEntry size 1
121.92/122.04	Narrowing transition: 
121.92/122.04	<l3, l3, 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: Narrow transition size 1
121.92/122.04	ENTRIES:
121.92/122.04	<l1, l3, 0 <= 0 /\ nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
121.92/122.04	END ENTRIES:
121.92/122.04	GRAPH:
121.92/122.04	<l3, l3, 0 <= 0 /\ nodecount^0 <= 0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	END GRAPH:
121.92/122.04	EXIT: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.92/122.04	POST: 1 <= 0
121.92/122.04	
121.92/122.04	
121.92/122.04	LOG: Try proving POST
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.090049s
121.92/122.04	Time used: 0.089773
121.92/122.04	Improving Solution with cost 50 ...
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetNextSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035868s
121.92/122.04	Time used: 0.035855
121.92/122.04	
121.92/122.04	LOG: SAT solveNonLinear - Elapsed time: 0.125917s
121.92/122.04	Cost: 50; Total time: 0.125628
121.92/122.04	Some transition disabled by a set of invariant(s):
121.92/122.04	Invariant at l3: nodecount^0 <= 1 + i^0
121.92/122.04	Strengthening and disabling transitions...
121.92/122.04	> It's unfeasible. Removing transition: 
121.92/122.04	<l3, l3, 0 <= 0 /\ nodecount^0 <= 0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005611s
121.92/122.04	Time used: 0.003295
121.92/122.04	Solving with 2 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070343s
121.92/122.04	Time used: 0.07023
121.92/122.04	Solving with 3 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021316s
121.92/122.04	Time used: 1.02106
121.92/122.04	
121.92/122.04	LOG: Postcondition is not implied - no solution
121.92/122.04	> Postcondition is not implied!
121.92/122.04	
121.92/122.04	LOG: RETURN check - Elapsed time: 2.921964s
121.92/122.04	Cannot prove unreachability
121.92/122.04	
121.92/122.04	Proving non-termination of subgraph 3
121.92/122.04	Transitions:
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.04	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	<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}>
121.92/122.04	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<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}>
121.92/122.04	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	Variables:
121.92/122.04	edgecount^0, i^0, k^0, nodecount^0, j^0, k_1^0, sourceflag^0, destflag^0, h^0
121.92/122.04	
121.92/122.04	Checking conditional non-termination of SCC {l11, l14, l18, l23}...
121.92/122.04	EXIT TRANSITIONS:
121.92/122.04	<l11, end, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
121.92/122.04	<l14, end, 1 <= destflag^0 /\ 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
121.92/122.04	<l14, end, 1 <= sourceflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ destflag^0 = 0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
121.92/122.04	<l14, end, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
121.92/122.04	<l14, end, nodecount^0 <= j^0 /\ edgecount^0 <= 1 + k_1^0 /\ destflag^0 = 0 /\ sourceflag^0 = 0 /\ 2 + k^0 = nodecount^0, {all remain the same}>
121.92/122.04	
121.92/122.04	Solving with 1 template(s).
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetFirstSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.538549s
121.92/122.04	Time used: 0.53666
121.92/122.04	Improving Solution with cost 1 ...
121.92/122.04	
121.92/122.04	LOG: CALL solveNonLinearGetNextSolution
121.92/122.04	
121.92/122.04	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.118012s
121.92/122.04	Time used: 0.117996
121.92/122.04	
121.92/122.04	LOG: SAT solveNonLinear - Elapsed time: 0.656561s
121.92/122.04	Cost: 1; Total time: 0.654656
121.92/122.04	Failed at location 11: nodecount^0 <= k^0
121.92/122.04	Before Improving: 
121.92/122.04	Quasi-invariant at l11: nodecount^0 <= k^0
121.92/122.04	Quasi-invariant at l14: nodecount^0 <= 1 + k^0
121.92/122.04	Quasi-invariant at l18: nodecount^0 <= 1 + k^0
121.92/122.04	Quasi-invariant at l23: nodecount^0 <= 1 + k^0
121.92/122.04	Optimizing invariants...
121.92/122.04	
121.92/122.04	LOG: CALL solveLinear
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear - Elapsed time: 0.021398s
121.92/122.04	Remaining time after improvement: 0.985044
121.92/122.04	Non-termination implied by a set of quasi-invariant(s):
121.92/122.04	Quasi-invariant at l11: nodecount^0 <= k^0
121.92/122.04	Quasi-invariant at l14: nodecount^0 <= 1 + k^0
121.92/122.04	Quasi-invariant at l18: nodecount^0 <= 1 + k^0
121.92/122.04	Quasi-invariant at l23: nodecount^0 <= 1 + k^0
121.92/122.04	
121.92/122.04	Strengthening and disabling EXIT transitions...
121.92/122.04	Closed exits from l11: 1
121.92/122.04	Closed exits from l14: 4
121.92/122.04	
121.92/122.04	Strengthening and disabling transitions...
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l11, l11, edgecount^0 <= 0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= k^0, {i^0 -> 0, k^0 -> 1 + k^0, k_1^0 -> 0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	It's unfeasible. Removing transition: 
121.92/122.04	<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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l11, l23, 1 <= edgecount^0 /\ edgecount^0 <= i^0 /\ 0 <= i^0 /\ nodecount^0 <= k^0, {h^0 -> 0, k_1^0 -> 0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l11, l11, 1 + i^0 <= edgecount^0 /\ 0 <= i^0 /\ nodecount^0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	It's unfeasible. Removing transition: 
121.92/122.04	<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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l23, 1 <= sourceflag^0 /\ 0 <= destflag^0 /\ nodecount^0 <= j^0 /\ nodecount^0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	It's unfeasible. Removing transition: 
121.92/122.04	<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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l23, 1 <= destflag^0 /\ nodecount^0 <= j^0 /\ nodecount^0 <= 1 + k^0 /\ 2 + k_1^0 <= edgecount^0 /\ sourceflag^0 = 0, {h^0 -> 0, k_1^0 -> 1 + k_1^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	It's unfeasible. Removing transition: 
121.92/122.04	<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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l23, nodecount^0 <= j^0 /\ nodecount^0 <= 1 + k^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}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {destflag^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l14, l14, 1 + j^0 <= nodecount^0 /\ 0 <= destflag^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l18, l14, 1 + k_1^0 <= h^0 /\ nodecount^0 <= j^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {destflag^0 -> 1, j^0 -> 0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, sourceflag^0 -> 1, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l18, l18, 1 + k_1^0 <= h^0 /\ 1 + j^0 <= nodecount^0 /\ 0 <= sourceflag^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l23, l18, 1 + k_1^0 <= edgecount^0 /\ edgecount^0 <= h^0 /\ nodecount^0 <= 1 + k^0, {j^0 -> 0, sourceflag^0 -> 0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ nodecount^0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	
121.92/122.04	LOG: CALL solverLinear in Graph for feasibility
121.92/122.04	
121.92/122.04	LOG: RETURN solveLinear in Graph for feasibility
121.92/122.04	Strengthening transition (result): 
121.92/122.04	<l23, l23, 1 + h^0 <= edgecount^0 /\ 1 + k_1^0 <= edgecount^0 /\ nodecount^0 <= 1 + k^0, {h^0 -> 1 + h^0, rest remain the same}>
121.92/122.04	
121.92/122.04	Calling reachability with...
121.92/122.04	Transition: <l11, end, true, {all remain the same}>
121.92/122.04	Conditions: nodecount^0 <= k^0, 
121.92/122.04	Transition: <l11, end, true, {all remain the same}>
121.92/122.04	Conditions: nodecount^0 <= k^0, 
121.92/122.04	OPEN EXITS: 
121.92/122.04	<l11, end, nodecount^0 <= k^0, {all remain the same}>
121.92/122.04	<l11, end, nodecount^0 <= k^0, {all remain the same}>
121.92/122.04	
121.92/122.04	--- Reachability graph ---
121.92/122.04	> Graph without transitions.
121.92/122.04	
121.92/122.04	Calling reachability with...
121.92/122.04	Transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.92/122.04	Conditions: nodecount^0 <= k^0, 
121.92/122.04	Transition: <l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.92/122.04	Conditions: nodecount^0 <= k^0, 
121.92/122.04	Transition: <l3, l11, nodecount^0 <= 0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.92/122.04	Conditions: nodecount^0 <= k^0, 
121.92/122.04	Transition: <l3, l11, nodecount^0 <= 1 + i^0 /\ 2 <= nodecount^0, {i^0 -> 0, k^0 -> 0, rest remain the same}>
121.92/122.04	Conditions: nodecount^0 <= k^0, 
121.92/122.04	OPEN EXITS: 
121.92/122.04	<l3, l11, nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 0, nodecount^0 <= 0)
121.92/122.04	<l3, l11, nodecount^0 <= 1 + i^0, {i^0 -> 0, k^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 0, nodecount^0 <= 0)
121.92/122.04	
121.92/122.04	--- Reachability graph ---
121.92/122.04	> Graph without transitions.
121.92/122.04	
121.92/122.04	Calling reachability with...
121.92/122.04	Transition: <l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>
121.92/122.04	Conditions: nodecount^0 <= 1 + i^0, nodecount^0 <= 0, nodecount^0 <= 0, 
121.92/122.04	Transition: <l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}>
121.92/122.04	Conditions: nodecount^0 <= 1 + i^0, nodecount^0 <= 0, nodecount^0 <= 0, 
121.92/122.04	OPEN EXITS: 
121.92/122.04	<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0)
121.92/122.04	<l1, l3, nodecount^0 <= i^0, {i^0 -> 0, rest remain the same}> (condsUp: nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0)
121.92/122.04	
121.92/122.04	--- Reachability graph ---
121.92/122.04	> Graph without transitions.
121.92/122.04	
121.92/122.04	Calling reachability with...
121.92/122.04	Transition: <l0, l1, i^0 = 1, {all remain the same}>
121.92/122.04	Conditions: nodecount^0 <= i^0, nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0, 
121.92/122.04	Transition: <l0, l1, i^0 = 1, {all remain the same}>
121.92/122.04	Conditions: nodecount^0 <= i^0, nodecount^0 <= 1, nodecount^0 <= 0, nodecount^0 <= 0, 
121.92/122.04	OPEN EXITS: 
121.92/122.04	<l0, l1, nodecount^0 <= i^0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>
121.92/122.04	<l0, l1, nodecount^0 <= i^0 /\ nodecount^0 <= 0 /\ i^0 = 1, {all remain the same}>
121.92/122.04	
121.92/122.04	> Conditions are reachable!
121.92/122.04	
121.92/122.04	Program does NOT terminate
121.92/122.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
121.92/122.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
121.92/122.04	EOF