6.33/6.34	YES
6.33/6.34	
6.33/6.34	Solver Timeout: 4
6.33/6.34	Global Timeout: 300
6.33/6.34	No parsing errors!
6.33/6.34	Init Location: 0
6.33/6.34	Transitions:
6.33/6.34	<l0, l88, true>
6.33/6.34	<l1, l2, true>
6.33/6.34	<l3, l4, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l3, l5, ((0 + j^0) <= (0 + n^0)) /\ (undef74 = undef74), par{j^0 -> (1 + j^0), sum^0 -> undef74}>
6.33/6.34	<l6, l7, true, par{i^0 -> (1 + i^0)}>
6.33/6.34	<l5, l3, true>
6.33/6.34	<l8, l1, ((1 + n^0) <= (0 + i^0)), par{skip^0 -> 1}>
6.33/6.34	<l8, l5, ((0 + i^0) <= (0 + n^0))>
6.33/6.34	<l4, l8, true>
6.33/6.34	<l9, l4, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l9, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l10, l9, true>
6.33/6.34	<l11, l12, true>
6.33/6.34	<l13, l14, ((0 + i^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l13, l15, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
6.33/6.34	<l15, l13, true>
6.33/6.34	<l16, l11, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l16, l15, ((0 + i^0) <= (0 + n^0))>
6.33/6.34	<l14, l16, true>
6.33/6.34	<l17, l18, true, par{k^0 -> (1 + k^0)}>
6.33/6.34	<l19, l6, ((0 + tmp___0^0) <= (0 + test^0))>
6.33/6.34	<l19, l6, ((1 + test^0) <= (0 + tmp___0^0)) /\ (undef617 = undef617), par{test^0 -> (0 + undef617), tmp^0 -> undef617}>
6.33/6.34	<l20, l21, ((1 + n^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
6.33/6.34	<l20, l22, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l22, l20, true>
6.33/6.34	<l23, l22, ((1 + n^0) <= (0 + i^0)) /\ (undef734 = undef734), par{sum^0 -> undef734}>
6.33/6.34	<l23, l24, ((0 + i^0) <= (0 + n^0)) /\ (undef764 = undef764), par{i^0 -> (1 + i^0), sum^0 -> undef764}>
6.33/6.34	<l24, l23, true>
6.33/6.34	<l25, l17, ((1 + n^0) <= (0 + j^0))>
6.33/6.34	<l25, l24, ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}>
6.33/6.34	<l21, l25, true>
6.33/6.34	<l26, l17, ((0 + tmp___2^0) <= 0) /\ (0 <= (0 + tmp___2^0))>
6.33/6.34	<l26, l21, (1 <= (0 + tmp___2^0))>
6.33/6.34	<l26, l21, ((1 + tmp___2^0) <= 0)>
6.33/6.34	<l27, l14, ((0 + n^0) <= (0 + k^0))>
6.33/6.34	<l27, l26, ((1 + k^0) <= (0 + n^0)) /\ (undef1043 = undef1043), par{tmp___2^0 -> undef1043}>
6.33/6.34	<l18, l27, true>
6.33/6.34	<l28, l29, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l28, l30, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}>
6.33/6.34	<l30, l28, true>
6.33/6.34	<l31, l18, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l31, l30, ((0 + i^0) <= (0 + n^0))>
6.33/6.34	<l32, l33, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l32, l19, ((0 + i^0) <= (0 + n^0)) /\ (undef1278 = undef1278), par{tmp___0^0 -> undef1278}>
6.33/6.34	<l29, l31, true>
6.33/6.34	<l34, l10, ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0))>
6.33/6.34	<l34, l29, (1 <= (0 + restrt^0))>
6.33/6.34	<l34, l29, ((1 + restrt^0) <= 0)>
6.33/6.34	<l35, l36, (201 <= (0 + its^0))>
6.33/6.34	<l35, l34, ((0 + its^0) <= 200)>
6.33/6.34	<l37, l35, true>
6.33/6.34	<l38, l39, (0 <= (0 + test^0))>
6.33/6.34	<l38, l36, ((1 + test^0) <= 0)>
6.33/6.34	<l40, l41, true, par{i^0 -> (1 + i^0)}>
6.33/6.34	<l42, l40, ((0 + temp^0) <= (0 + test^0))>
6.33/6.34	<l42, l40, ((1 + test^0) <= (0 + temp^0)), par{test^0 -> (0 + temp^0)}>
6.33/6.34	<l43, l42, (undef1665 = undef1665), par{temp^0 -> undef1665}>
6.33/6.34	<l44, l43, ((0 + maxarg1^0) <= (0 + maxarg2^0)), par{tmp___11^0 -> (0 + maxarg2^0)}>
6.33/6.34	<l44, l43, ((1 + maxarg2^0) <= (0 + maxarg1^0)), par{tmp___11^0 -> (0 + maxarg1^0)}>
6.33/6.34	<l45, l38, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l45, l44, ((0 + i^0) <= (0 + n^0)) /\ (undef1800 = undef1800) /\ (undef1789 = undef1789), par{maxarg1^0 -> (0 + undef1789), maxarg2^0 -> 1, tmp___10^0 -> undef1789, tmp___9^0 -> undef1800}>
6.33/6.34	<l41, l45, true>
6.33/6.34	<l39, l37, true, par{its^0 -> (1 + its^0)}>
6.33/6.34	<l46, l39, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l46, l47, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l48, l49, (undef1942 = undef1942), par{tmp___1^0 -> undef1942}>
6.33/6.34	<l47, l46, true>
6.33/6.34	<l50, l41, ((0 + tmp___12^0) <= 0) /\ (0 <= (0 + tmp___12^0)), par{restrt^0 -> 0, test^0 -> 0}>
6.33/6.34	<l50, l47, (1 <= (0 + tmp___12^0))>
6.33/6.34	<l50, l47, ((1 + tmp___12^0) <= 0)>
6.33/6.34	<l51, l52, true, par{i^0 -> (1 + i^0)}>
6.33/6.34	<l53, l51, ((0 + tmp___8^0) <= (0 + test^0))>
6.33/6.34	<l53, l51, ((1 + test^0) <= (0 + tmp___8^0)) /\ (undef2158 = undef2158), par{test^0 -> (0 + undef2158), tmp___7^0 -> undef2158}>
6.33/6.34	<l49, l54, true, par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}>
6.33/6.34	<l7, l32, true>
6.33/6.34	<l55, l50, ((1 + n^0) <= (0 + i^0)) /\ (undef2241 = undef2241), par{tmp___12^0 -> undef2241}>
6.33/6.34	<l55, l53, ((0 + i^0) <= (0 + n^0)) /\ (undef2279 = undef2279), par{tmp___8^0 -> undef2279}>
6.33/6.34	<l52, l55, true>
6.33/6.34	<l56, l57, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l56, l58, ((0 + j^0) <= (0 + n^0)) /\ (undef2354 = undef2354), par{j^0 -> (1 + j^0), sum^0 -> undef2354}>
6.33/6.34	<l58, l56, true>
6.33/6.34	<l59, l52, ((1 + n^0) <= (0 + i^0)), par{test^0 -> 0}>
6.33/6.34	<l59, l58, ((0 + i^0) <= (0 + n^0))>
6.33/6.34	<l57, l59, true>
6.33/6.34	<l60, l48, (1 <= (0 + sqrarg^0))>
6.33/6.34	<l60, l48, ((1 + sqrarg^0) <= 0)>
6.33/6.34	<l60, l49, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___1^0 -> 0}>
6.33/6.34	<l61, l57, ((1 + n^0) <= (0 + i^0)), par{fold^0 -> (0 + f^0)}>
6.33/6.34	<l61, l62, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l62, l61, true>
6.33/6.34	<l63, l64, ((1 + i^0) <= (0 + j^0)), par{i^0 -> (~(1) + i^0)}>
6.33/6.34	<l63, l65, ((0 + j^0) <= (0 + i^0)) /\ (undef2714 = undef2714), par{j^0 -> (1 + j^0), sum^0 -> undef2714}>
6.33/6.34	<l65, l63, true>
6.33/6.34	<l66, l62, ((1 + i^0) <= 1)>
6.33/6.34	<l66, l65, (1 <= (0 + i^0))>
6.33/6.34	<l64, l66, true>
6.33/6.34	<l67, l11, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l67, l68, ((0 + j^0) <= (0 + n^0)) /\ (undef2894 = undef2894), par{j^0 -> (1 + j^0), sum^0 -> undef2894}>
6.33/6.34	<l68, l67, true>
6.33/6.34	<l12, l64, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l12, l68, ((0 + i^0) <= (0 + n^0))>
6.33/6.34	<l69, l37, ((1 + n^0) <= (0 + i^0)), par{restrt^0 -> 1}>
6.33/6.34	<l69, l60, ((0 + i^0) <= (0 + n^0)) /\ (undef3043 = undef3043), par{sqrarg^0 -> undef3043}>
6.33/6.34	<l70, l11, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l70, l71, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l71, l70, true>
6.33/6.34	<l72, l71, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l72, l73, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l73, l72, true>
6.33/6.34	<l54, l69, true>
6.33/6.34	<l74, l75, (undef3297 = undef3297), par{tmp___6^0 -> undef3297}>
6.33/6.34	<l75, l76, true, par{den^0 -> ((0 + den^0) + tmp___6^0), i^0 -> (1 + i^0)}>
6.33/6.34	<l77, l74, (1 <= (0 + sqrarg^0))>
6.33/6.34	<l77, l74, ((1 + sqrarg^0) <= 0)>
6.33/6.34	<l77, l75, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___6^0 -> 0}>
6.33/6.34	<l78, l73, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l78, l77, ((0 + i^0) <= (0 + n^0)) /\ (undef3463 = undef3463), par{sqrarg^0 -> undef3463}>
6.33/6.34	<l76, l78, true>
6.33/6.34	<l79, l80, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l79, l81, ((0 + j^0) <= (0 + n^0)) /\ (undef3554 = undef3554), par{j^0 -> (1 + j^0), sum^0 -> undef3554}>
6.33/6.34	<l81, l79, true>
6.33/6.34	<l82, l76, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l82, l81, ((0 + i^0) <= (0 + n^0))>
6.33/6.34	<l80, l82, true>
6.33/6.34	<l83, l11, (1 <= (0 + skip^0))>
6.33/6.34	<l83, l11, ((1 + skip^0) <= 0)>
6.33/6.34	<l83, l80, ((0 + skip^0) <= 0) /\ (0 <= (0 + skip^0))>
6.33/6.34	<l84, l1, true, par{i^0 -> (1 + i^0)}>
6.33/6.34	<l85, l84, ((1 + tmp___3^0) <= ((0 + tmp___4^0) + tmp___5^0))>
6.33/6.34	<l85, l84, (((0 + tmp___4^0) + tmp___5^0) <= (0 + tmp___3^0)), par{skip^0 -> 0}>
6.33/6.34	<l33, l54, (0 <= (0 + test^0))>
6.33/6.34	<l33, l36, ((1 + test^0) <= 0)>
6.33/6.34	<l86, l85, ((1 + n^0) <= (0 + j^0)) /\ (undef3954 = undef3954) /\ (undef3955 = undef3955) /\ (undef3956 = undef3956), par{tmp___3^0 -> undef3954, tmp___4^0 -> undef3955, tmp___5^0 -> undef3956}>
6.33/6.34	<l86, l87, ((0 + j^0) <= (0 + n^0)) /\ (undef3974 = undef3974), par{j^0 -> (1 + j^0), sum^0 -> undef3974}>
6.33/6.34	<l87, l86, true>
6.33/6.34	<l2, l83, ((1 + n^0) <= (0 + i^0))>
6.33/6.34	<l2, l87, ((0 + i^0) <= (0 + n^0))>
6.33/6.34	<l88, l7, true>
6.33/6.34	
6.33/6.34	Fresh variables:
6.33/6.34	undef74, undef617, undef734, undef764, undef1043, undef1278, undef1665, undef1789, undef1800, undef1942, undef2158, undef2241, undef2279, undef2354, undef2714, undef2894, undef3043, undef3297, undef3463, undef3554, undef3954, undef3955, undef3956, undef3974, 
6.33/6.34	
6.33/6.34	Undef variables:
6.33/6.34	undef74, undef617, undef734, undef764, undef1043, undef1278, undef1665, undef1789, undef1800, undef1942, undef2158, undef2241, undef2279, undef2354, undef2714, undef2894, undef3043, undef3297, undef3463, undef3554, undef3954, undef3955, undef3956, undef3974, 
6.33/6.34	
6.33/6.34	Abstraction variables:
6.33/6.34	
6.33/6.34	Exit nodes:
6.33/6.34	
6.33/6.34	Accepting locations:
6.33/6.34	
6.33/6.34	Asserts:
6.33/6.34	
6.33/6.34	Preprocessed LLVMGraph
6.33/6.34	Init Location: 0
6.33/6.34	Transitions:
6.33/6.34	<l0, l7, true>
6.33/6.34	<l7, l54, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0))>
6.33/6.34	<l7, l36, ((1 + n^0) <= (0 + i^0)) /\ ((1 + test^0) <= 0)>
6.33/6.34	<l7, l7, ((0 + i^0) <= (0 + n^0)) /\ (undef1278 = undef1278) /\ ((0 + undef1278) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l7, l7, ((0 + i^0) <= (0 + n^0)) /\ (undef1278 = undef1278) /\ ((1 + test^0) <= (0 + undef1278)) /\ (undef617 = undef617), par{i^0 -> (1 + i^0), test^0 -> (0 + undef617)}>
6.33/6.34	<l10, l62, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + 1)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + i^0) <= 1), par{skip^0 -> 1}>
6.33/6.34	<l10, l65, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + 1)) /\ ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + i^0)), par{skip^0 -> 1}>
6.33/6.34	<l10, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l15, l62, ((0 + i^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + (1 + i^0)) <= 1), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l15, l65, ((0 + i^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ (1 <= (0 + (1 + i^0))), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l15, l15, ((0 + i^0) <= (0 + j^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l15, l15, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
6.33/6.34	<l18, l62, ((0 + n^0) <= (0 + k^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + i^0) <= 1)>
6.33/6.34	<l18, l65, ((0 + n^0) <= (0 + k^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + i^0))>
6.33/6.34	<l18, l15, ((0 + n^0) <= (0 + k^0)) /\ ((0 + i^0) <= (0 + n^0))>
6.33/6.34	<l18, l18, ((1 + k^0) <= (0 + n^0)) /\ (undef1043 = undef1043) /\ ((0 + undef1043) <= 0) /\ (0 <= (0 + undef1043)), par{k^0 -> (1 + k^0)}>
6.33/6.34	<l18, l18, ((1 + k^0) <= (0 + n^0)) /\ (undef1043 = undef1043) /\ (1 <= (0 + undef1043)) /\ ((1 + n^0) <= (0 + j^0)), par{k^0 -> (1 + k^0)}>
6.33/6.34	<l18, l24, ((1 + k^0) <= (0 + n^0)) /\ (undef1043 = undef1043) /\ (1 <= (0 + undef1043)) /\ ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}>
6.33/6.34	<l18, l18, ((1 + k^0) <= (0 + n^0)) /\ (undef1043 = undef1043) /\ ((1 + undef1043) <= 0) /\ ((1 + n^0) <= (0 + j^0)), par{k^0 -> (1 + k^0)}>
6.33/6.34	<l18, l24, ((1 + k^0) <= (0 + n^0)) /\ (undef1043 = undef1043) /\ ((1 + undef1043) <= 0) /\ ((0 + j^0) <= (0 + n^0)), par{sum^0 -> 0}>
6.33/6.34	<l22, l18, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}>
6.33/6.34	<l22, l24, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0), sum^0 -> 0}>
6.33/6.34	<l22, l22, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l24, l22, ((1 + n^0) <= (0 + i^0)) /\ (undef734 = undef734), par{sum^0 -> undef734}>
6.33/6.34	<l24, l24, ((0 + i^0) <= (0 + n^0)) /\ (undef764 = undef764), par{i^0 -> (1 + i^0), sum^0 -> undef764}>
6.33/6.34	<l41, l36, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ (201 <= (0 + (1 + its^0))), par{its^0 -> (1 + its^0)}>
6.33/6.34	<l41, l10, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((0 + (1 + its^0)) <= 200) /\ ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0)), par{its^0 -> (1 + its^0)}>
6.33/6.34	<l41, l18, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((0 + (1 + its^0)) <= 200) /\ (1 <= (0 + restrt^0)) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
6.33/6.34	<l41, l18, ((1 + n^0) <= (0 + i^0)) /\ (0 <= (0 + test^0)) /\ ((0 + (1 + its^0)) <= 200) /\ ((1 + restrt^0) <= 0) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
6.33/6.34	<l41, l36, ((1 + n^0) <= (0 + i^0)) /\ ((1 + test^0) <= 0)>
6.33/6.34	<l41, l41, ((0 + i^0) <= (0 + n^0)) /\ (undef1800 = undef1800) /\ (undef1789 = undef1789) /\ ((0 + (0 + undef1789)) <= (0 + 1)) /\ (undef1665 = undef1665) /\ ((0 + undef1665) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l41, l41, ((0 + i^0) <= (0 + n^0)) /\ (undef1800 = undef1800) /\ (undef1789 = undef1789) /\ ((0 + (0 + undef1789)) <= (0 + 1)) /\ (undef1665 = undef1665) /\ ((1 + test^0) <= (0 + undef1665)), par{i^0 -> (1 + i^0), test^0 -> (0 + undef1665)}>
6.33/6.34	<l41, l41, ((0 + i^0) <= (0 + n^0)) /\ (undef1800 = undef1800) /\ (undef1789 = undef1789) /\ ((1 + 1) <= (0 + (0 + undef1789))) /\ (undef1665 = undef1665) /\ ((0 + undef1665) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l41, l41, ((0 + i^0) <= (0 + n^0)) /\ (undef1800 = undef1800) /\ (undef1789 = undef1789) /\ ((1 + 1) <= (0 + (0 + undef1789))) /\ (undef1665 = undef1665) /\ ((1 + test^0) <= (0 + undef1665)), par{i^0 -> (1 + i^0), test^0 -> (0 + undef1665)}>
6.33/6.34	<l47, l36, ((1 + n^0) <= (0 + i^0)) /\ (201 <= (0 + (1 + its^0))), par{its^0 -> (1 + its^0)}>
6.33/6.34	<l47, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + its^0)) <= 200) /\ ((0 + restrt^0) <= 0) /\ (0 <= (0 + restrt^0)), par{its^0 -> (1 + its^0)}>
6.33/6.34	<l47, l18, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + its^0)) <= 200) /\ (1 <= (0 + restrt^0)) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
6.33/6.34	<l47, l18, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + its^0)) <= 200) /\ ((1 + restrt^0) <= 0) /\ ((1 + n^0) <= (0 + i^0)), par{its^0 -> (1 + its^0)}>
6.33/6.34	<l47, l47, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l52, l41, ((1 + n^0) <= (0 + i^0)) /\ (undef2241 = undef2241) /\ ((0 + undef2241) <= 0) /\ (0 <= (0 + undef2241)), par{restrt^0 -> 0, test^0 -> 0}>
6.33/6.34	<l52, l47, ((1 + n^0) <= (0 + i^0)) /\ (undef2241 = undef2241) /\ (1 <= (0 + undef2241))>
6.33/6.34	<l52, l47, ((1 + n^0) <= (0 + i^0)) /\ (undef2241 = undef2241) /\ ((1 + undef2241) <= 0)>
6.33/6.34	<l52, l52, ((0 + i^0) <= (0 + n^0)) /\ (undef2279 = undef2279) /\ ((0 + undef2279) <= (0 + test^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l52, l52, ((0 + i^0) <= (0 + n^0)) /\ (undef2279 = undef2279) /\ ((1 + test^0) <= (0 + undef2279)) /\ (undef2158 = undef2158), par{i^0 -> (1 + i^0), test^0 -> (0 + undef2158)}>
6.33/6.34	<l54, l36, ((1 + n^0) <= (0 + i^0)) /\ (201 <= (0 + its^0)), par{restrt^0 -> 1}>
6.33/6.34	<l54, l18, ((1 + n^0) <= (0 + i^0)) /\ ((0 + its^0) <= 200) /\ (1 <= (0 + 1)) /\ ((1 + n^0) <= (0 + i^0)), par{restrt^0 -> 1}>
6.33/6.34	<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef3043 = undef3043) /\ (1 <= (0 + undef3043)) /\ (undef1942 = undef1942), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef1942)}>
6.33/6.34	<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef3043 = undef3043) /\ ((1 + undef3043) <= 0) /\ (undef1942 = undef1942), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef1942)}>
6.33/6.34	<l54, l54, ((0 + i^0) <= (0 + n^0)) /\ (undef3043 = undef3043) /\ ((0 + undef3043) <= 0) /\ (0 <= (0 + undef3043)), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + 0)}>
6.33/6.34	<l62, l52, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)), par{test^0 -> 0}>
6.33/6.34	<l62, l62, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
6.33/6.34	<l65, l62, ((1 + i^0) <= (0 + j^0)) /\ ((1 + (~(1) + i^0)) <= 1), par{i^0 -> (~(1) + i^0)}>
6.33/6.34	<l65, l65, ((1 + i^0) <= (0 + j^0)) /\ (1 <= (0 + (~(1) + i^0))), par{i^0 -> (~(1) + i^0)}>
6.33/6.34	<l65, l65, ((0 + j^0) <= (0 + i^0)) /\ (undef2714 = undef2714), par{j^0 -> (1 + j^0), sum^0 -> undef2714}>
6.33/6.34	
6.33/6.34	Fresh variables:
6.33/6.34	undef74, undef617, undef734, undef764, undef1043, undef1278, undef1665, undef1789, undef1800, undef1942, undef2158, undef2241, undef2279, undef2354, undef2714, undef2894, undef3043, undef3297, undef3463, undef3554, undef3954, undef3955, undef3956, undef3974, 
6.33/6.34	
6.33/6.34	Undef variables:
6.33/6.34	undef74, undef617, undef734, undef764, undef1043, undef1278, undef1665, undef1789, undef1800, undef1942, undef2158, undef2241, undef2279, undef2354, undef2714, undef2894, undef3043, undef3297, undef3463, undef3554, undef3954, undef3955, undef3956, undef3974, 
6.33/6.34	
6.33/6.34	Abstraction variables:
6.33/6.34	
6.33/6.34	Exit nodes:
6.33/6.34	
6.33/6.34	Accepting locations:
6.33/6.34	
6.33/6.34	Asserts:
6.33/6.34	
6.33/6.34	*************************************************************
6.33/6.34	*******************************************************************************************
6.33/6.34	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
6.33/6.34	*******************************************************************************************
6.33/6.34	
6.33/6.34	Init Location: 0
6.33/6.34	Graph 0:
6.33/6.34	Transitions:
6.33/6.34	Variables:
6.33/6.34	
6.33/6.34	Graph 1:
6.33/6.34	Transitions:
6.33/6.34	<l7, l7, i^0 <= n^0 /\ undef1278 <= test^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l7, l7, 1 + test^0 <= undef1278 /\ i^0 <= n^0, {i^0 -> 1 + i^0, test^0 -> undef617, rest remain the same}>
6.33/6.34	Variables:
6.33/6.34	i^0, n^0, test^0
6.33/6.34	
6.33/6.34	Graph 2:
6.33/6.34	Transitions:
6.33/6.34	<l54, l54, 1 <= undef3043 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef1942, rest remain the same}>
6.33/6.34	<l54, l54, 1 + undef3043 <= 0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef1942, rest remain the same}>
6.33/6.34	<l54, l54, i^0 <= n^0 /\ undef3043 = 0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	Variables:
6.33/6.34	i^0, n^0, sum^0
6.33/6.34	
6.33/6.34	Graph 3:
6.33/6.34	Transitions:
6.33/6.34	<l10, l62, 1 + n^0 <= i^0 /\ i^0 <= 0, {skip^0 -> 1, rest remain the same}>
6.33/6.34	<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0, {skip^0 -> 1, rest remain the same}>
6.33/6.34	<l10, l10, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l15, l62, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l15, l65, i^0 <= j^0 /\ 0 <= i^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l15, l15, 1 + i^0 <= n^0 /\ i^0 <= j^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l15, l15, 1 + j^0 <= i^0, {j^0 -> 1 + j^0, rest remain the same}>
6.33/6.34	<l18, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.34	<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.34	<l18, l15, i^0 <= n^0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.34	<l18, l18, 1 + k^0 <= n^0 /\ undef1043 = 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	<l18, l18, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1043, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	<l18, l24, 1 + k^0 <= n^0 /\ 1 <= undef1043 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.34	<l18, l18, 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	<l18, l24, 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.34	<l22, l18, 1 + n^0 <= i^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	<l22, l24, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
6.33/6.34	<l22, l22, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l24, l22, 1 + n^0 <= i^0, {sum^0 -> undef734, rest remain the same}>
6.33/6.34	<l24, l24, i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> undef764, rest remain the same}>
6.33/6.34	<l41, l10, 1 + n^0 <= i^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	<l41, l18, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	<l41, l18, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	<l41, l41, i^0 <= n^0 /\ undef1665 <= test^0 /\ undef1789 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l41, l41, 1 + test^0 <= undef1665 /\ i^0 <= n^0 /\ undef1789 <= 1, {i^0 -> 1 + i^0, test^0 -> undef1665, rest remain the same}>
6.33/6.34	<l41, l41, i^0 <= n^0 /\ undef1665 <= test^0 /\ 2 <= undef1789, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l41, l41, 1 + test^0 <= undef1665 /\ i^0 <= n^0 /\ 2 <= undef1789, {i^0 -> 1 + i^0, test^0 -> undef1665, rest remain the same}>
6.33/6.34	<l47, l10, 1 + n^0 <= i^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	<l47, l18, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	<l47, l18, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	<l47, l47, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l52, l41, 1 + n^0 <= i^0 /\ undef2241 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>
6.33/6.34	<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2241, {all remain the same}>
6.33/6.34	<l52, l47, 1 + n^0 <= i^0 /\ 1 + undef2241 <= 0, {all remain the same}>
6.33/6.34	<l52, l52, i^0 <= n^0 /\ undef2279 <= test^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l52, l52, 1 + test^0 <= undef2279 /\ i^0 <= n^0, {i^0 -> 1 + i^0, test^0 -> undef2158, rest remain the same}>
6.33/6.34	<l62, l52, 1 + n^0 <= i^0, {test^0 -> 0, rest remain the same}>
6.33/6.34	<l62, l62, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	<l65, l62, 1 + i^0 <= j^0 /\ i^0 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.34	<l65, l65, 1 + i^0 <= j^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.34	<l65, l65, j^0 <= i^0, {j^0 -> 1 + j^0, sum^0 -> undef2714, rest remain the same}>
6.33/6.34	Variables:
6.33/6.34	i^0, n^0, j^0, k^0, sum^0, its^0, restrt^0, test^0
6.33/6.34	
6.33/6.34	Graph 4:
6.33/6.34	Transitions:
6.33/6.34	Variables:
6.33/6.34	
6.33/6.34	Precedence: 
6.33/6.34	Graph 0
6.33/6.34	
6.33/6.34	Graph 1
6.33/6.34	<l0, l7, true, {all remain the same}>
6.33/6.34	
6.33/6.34	Graph 2
6.33/6.34	<l7, l54, 1 + n^0 <= i^0 /\ 0 <= test^0, {all remain the same}>
6.33/6.34	
6.33/6.34	Graph 3
6.33/6.34	<l54, l18, 1 + n^0 <= i^0 /\ its^0 <= 200, {restrt^0 -> 1, rest remain the same}>
6.33/6.34	
6.33/6.34	Graph 4
6.33/6.34	<l7, l36, 1 + n^0 <= i^0 /\ 1 + test^0 <= 0, {all remain the same}>
6.33/6.34	<l41, l36, 1 + n^0 <= i^0 /\ 0 <= test^0 /\ 200 <= its^0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	<l41, l36, 1 + n^0 <= i^0 /\ 1 + test^0 <= 0, {all remain the same}>
6.33/6.34	<l47, l36, 1 + n^0 <= i^0 /\ 200 <= its^0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	<l54, l36, 1 + n^0 <= i^0 /\ 201 <= its^0, {restrt^0 -> 1, rest remain the same}>
6.33/6.34	
6.33/6.34	Map Locations to Subgraph:
6.33/6.34	( 0 , 0 )
6.33/6.34	( 7 , 1 )
6.33/6.34	( 10 , 3 )
6.33/6.34	( 15 , 3 )
6.33/6.34	( 18 , 3 )
6.33/6.34	( 22 , 3 )
6.33/6.34	( 24 , 3 )
6.33/6.34	( 36 , 4 )
6.33/6.34	( 41 , 3 )
6.33/6.34	( 47 , 3 )
6.33/6.34	( 52 , 3 )
6.33/6.34	( 54 , 2 )
6.33/6.34	( 62 , 3 )
6.33/6.34	( 65 , 3 )
6.33/6.34	
6.33/6.34	*******************************************************************************************
6.33/6.34	********************************    CHECKING ASSERTIONS    ********************************
6.33/6.34	*******************************************************************************************
6.33/6.34	
6.33/6.34	Proving termination of subgraph 0
6.33/6.34	Proving termination of subgraph 1
6.33/6.34	Checking unfeasibility...
6.33/6.34	Time used: 0.003967
6.33/6.34	
6.33/6.34	Checking conditional termination of SCC {l7}...
6.33/6.34	
6.33/6.34	LOG: CALL solveLinear
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear - Elapsed time: 0.003560s
6.33/6.34	Ranking function: -i^0 + n^0
6.33/6.34	New Graphs: 
6.33/6.34	Proving termination of subgraph 2
6.33/6.34	Checking unfeasibility...
6.33/6.34	Time used: 0.009414
6.33/6.34	Some transition disabled by a set of invariant(s):
6.33/6.34	Invariant at l54: 1 + n^0 <= i^0
6.33/6.34	
6.33/6.34	Strengthening and disabling transitions...
6.33/6.34	> It's unfeasible. Removing transition: 
6.33/6.34	<l54, l54, i^0 <= n^0 /\ undef3043 = 0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	It's unfeasible. Removing transition: 
6.33/6.34	<l54, l54, 1 <= undef3043 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef1942, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	It's unfeasible. Removing transition: 
6.33/6.34	<l54, l54, 1 + undef3043 <= 0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef1942, rest remain the same}>
6.33/6.34	Checking unfeasibility...
6.33/6.34	Time used: 0.00013
6.33/6.34	
6.33/6.34	Analyzing SCC {l54}...
6.33/6.34	No cycles found.
6.33/6.34	
6.33/6.34	Proving termination of subgraph 3
6.33/6.34	Checking unfeasibility...
6.33/6.34	Time used: 0.602935
6.33/6.34	Some transition disabled by a set of invariant(s):
6.33/6.34	Invariant at l22: 1 + k^0 <= n^0
6.33/6.34	Invariant at l24: 1 + k^0 <= n^0
6.33/6.34	Invariant at l41: 1 + n^0 <= i^0
6.33/6.34	Invariant at l47: n^0 <= i^0
6.33/6.34	Invariant at l52: 1 + n^0 <= i^0
6.33/6.34	
6.33/6.34	Strengthening and disabling transitions...
6.33/6.34	> It's unfeasible. Removing transition: 
6.33/6.34	<l41, l41, i^0 <= n^0 /\ undef1665 <= test^0 /\ 2 <= undef1789, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l22, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l22, l24, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l22, l22, 1 + k^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0, {sum^0 -> undef734, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l24, l24, 1 + k^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> undef764, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l41, l10, 1 + n^0 <= i^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l41, l18, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l41, l18, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	It's unfeasible. Removing transition: 
6.33/6.34	<l41, l41, i^0 <= n^0 /\ undef1665 <= test^0 /\ undef1789 <= 1, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	It's unfeasible. Removing transition: 
6.33/6.34	<l41, l41, 1 + test^0 <= undef1665 /\ i^0 <= n^0 /\ undef1789 <= 1, {i^0 -> 1 + i^0, test^0 -> undef1665, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	It's unfeasible. Removing transition: 
6.33/6.34	<l41, l41, 1 + test^0 <= undef1665 /\ i^0 <= n^0 /\ 2 <= undef1789, {i^0 -> 1 + i^0, test^0 -> undef1665, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l10, 1 + n^0 <= i^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l18, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l18, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l47, i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l52, l41, 1 + n^0 <= i^0 /\ undef2241 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2241, {all remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l52, l47, 1 + n^0 <= i^0 /\ 1 + undef2241 <= 0, {all remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	It's unfeasible. Removing transition: 
6.33/6.34	<l52, l52, i^0 <= n^0 /\ undef2279 <= test^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	It's unfeasible. Removing transition: 
6.33/6.34	<l52, l52, 1 + test^0 <= undef2279 /\ i^0 <= n^0, {i^0 -> 1 + i^0, test^0 -> undef2158, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Checking unfeasibility...
6.33/6.34	Time used: 0.546337
6.33/6.34	Some transition disabled by a set of invariant(s):
6.33/6.34	Invariant at l10: 1 + n^0 <= i^0
6.33/6.34	Invariant at l15: n^0 + test^0 <= 1 + k^0
6.33/6.34	Invariant at l18: 1 + n^0 <= i^0
6.33/6.34	Invariant at l22: k^0 <= n^0
6.33/6.34	Invariant at l24: 1 + k^0 <= n^0
6.33/6.34	Invariant at l41: 1 + n^0 + restrt^0 <= i^0
6.33/6.34	Invariant at l47: 1 + n^0 <= i^0
6.33/6.34	
6.33/6.34	Strengthening and disabling transitions...
6.33/6.34	> It's unfeasible. Removing transition: 
6.33/6.34	<l18, l15, i^0 <= n^0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l10, l62, 1 + n^0 <= i^0 /\ i^0 <= 0, {skip^0 -> 1, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0, {skip^0 -> 1, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	It's unfeasible. Removing transition: 
6.33/6.34	<l10, l10, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l15, l62, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ n^0 <= i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l15, l65, i^0 <= j^0 /\ 0 <= i^0 /\ n^0 <= i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l15, l15, 1 + i^0 <= n^0 /\ i^0 <= j^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l15, l15, 1 + j^0 <= i^0 /\ n^0 + test^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ undef1043 = 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1043, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1043 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l22, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l22, l24, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l22, l22, 1 + k^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0, {sum^0 -> undef734, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l24, l24, 1 + k^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> undef764, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l41, l10, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l41, l18, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l41, l18, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l10, 1 + n^0 <= i^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l18, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l18, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	It's unfeasible. Removing transition: 
6.33/6.34	<l47, l47, i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Checking unfeasibility...
6.33/6.34	Time used: 0.479102
6.33/6.34	Some transition disabled by a set of invariant(s):
6.33/6.34	Invariant at l22: 1 + k^0 <= i^0
6.33/6.34	Invariant at l24: 1 + n^0 <= i^0
6.33/6.34	Invariant at l47: n^0 <= i^0
6.33/6.34	
6.33/6.34	Strengthening and disabling transitions...
6.33/6.34	> It's unfeasible. Removing transition: 
6.33/6.34	<l24, l24, 1 + k^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> undef764, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l22, l18, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l22, l24, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l22, l22, 1 + k^0 <= i^0 /\ 1 + k^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0, {sum^0 -> undef734, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l10, 1 + n^0 <= i^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l18, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l47, l18, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Checking unfeasibility...
6.33/6.34	Time used: 0.433779
6.33/6.34	Some transition disabled by a set of invariant(s):
6.33/6.34	Invariant at l15: j^0 <= 1 + i^0
6.33/6.34	Invariant at l18: n^0 <= i^0
6.33/6.34	Invariant at l22: n^0 <= i^0
6.33/6.34	Invariant at l24: 1 + k^0 <= n^0
6.33/6.34	Invariant at l41: 0 <= restrt^0
6.33/6.34	
6.33/6.34	Strengthening and disabling transitions...
6.33/6.34	> It's unfeasible. Removing transition: 
6.33/6.34	<l41, l18, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l15, l62, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ n^0 <= i^0 /\ j^0 <= 1 + i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l15, l65, i^0 <= j^0 /\ 0 <= i^0 /\ n^0 <= i^0 /\ j^0 <= 1 + i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l15, l15, 1 + i^0 <= n^0 /\ i^0 <= j^0 /\ j^0 <= 1 + i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l15, l15, 1 + j^0 <= i^0 /\ n^0 + test^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ undef1043 = 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1043, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.34	
6.33/6.34	LOG: CALL solverLinear in Graph for feasibility
6.33/6.34	
6.33/6.34	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.34	Strengthening transition (result): 
6.33/6.34	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1043 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l18, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l24, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l22, 1 + k^0 <= i^0 /\ 1 + k^0 <= n^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0, {sum^0 -> undef734, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l41, l10, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l41, l18, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Checking unfeasibility...
6.33/6.35	Time used: 0.355002
6.33/6.35	Some transition disabled by a set of invariant(s):
6.33/6.35	Invariant at l10: n^0 <= i^0
6.33/6.35	Invariant at l15: its^0 + k^0 + test^0 <= j^0 + n^0 + restrt^0 + sum^0
6.33/6.35	Invariant at l18: 1 + n^0 <= i^0
6.33/6.35	Invariant at l41: restrt^0 <= 0
6.33/6.35	Invariant at l52: 1 + n^0 <= i^0
6.33/6.35	
6.33/6.35	Strengthening and disabling transitions...
6.33/6.35	> It's unfeasible. Removing transition: 
6.33/6.35	<l41, l18, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 1 <= restrt^0 /\ 0 <= test^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l10, l62, 1 + n^0 <= i^0 /\ i^0 <= 0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l15, l62, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ n^0 <= i^0 /\ its^0 + k^0 + test^0 <= j^0 + n^0 + restrt^0 + sum^0 /\ j^0 <= 1 + i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l15, l65, i^0 <= j^0 /\ 0 <= i^0 /\ n^0 <= i^0 /\ its^0 + k^0 + test^0 <= j^0 + n^0 + restrt^0 + sum^0 /\ j^0 <= 1 + i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l15, l15, 1 + i^0 <= n^0 /\ i^0 <= j^0 /\ its^0 + k^0 + test^0 <= j^0 + n^0 + restrt^0 + sum^0 /\ j^0 <= 1 + i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l15, l15, 1 + j^0 <= i^0 /\ its^0 + k^0 + test^0 <= j^0 + n^0 + restrt^0 + sum^0 /\ n^0 + test^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ undef1043 = 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1043, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1043 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l41, l10, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l41, 1 + n^0 <= i^0 /\ undef2241 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2241, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l47, 1 + n^0 <= i^0 /\ 1 + undef2241 <= 0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Checking unfeasibility...
6.33/6.35	Time used: 0.453626
6.33/6.35	Some transition disabled by a set of invariant(s):
6.33/6.35	Invariant at l10: n^0 <= k^0
6.33/6.35	Invariant at l15: 1 <= 0
6.33/6.35	Invariant at l22: n^0 <= i^0
6.33/6.35	Invariant at l24: j^0 + k^0 <= 1 + i^0 + n^0
6.33/6.35	Invariant at l41: n^0 + restrt^0 + test^0 <= k^0
6.33/6.35	Invariant at l47: n^0 <= k^0
6.33/6.35	Invariant at l52: n^0 <= k^0
6.33/6.35	Invariant at l62: n^0 <= k^0
6.33/6.35	Invariant at l65: n^0 <= k^0
6.33/6.35	
6.33/6.35	Strengthening and disabling transitions...
6.33/6.35	> It's unfeasible. Removing transition: 
6.33/6.35	<l15, l62, 1 + i^0 <= 0 /\ i^0 <= j^0 /\ n^0 <= i^0 /\ its^0 + k^0 + test^0 <= j^0 + n^0 + restrt^0 + sum^0 /\ j^0 <= 1 + i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	> It's unfeasible. Removing transition: 
6.33/6.35	<l15, l65, i^0 <= j^0 /\ 0 <= i^0 /\ n^0 <= i^0 /\ its^0 + k^0 + test^0 <= j^0 + n^0 + restrt^0 + sum^0 /\ j^0 <= 1 + i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l10, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	It's unfeasible. Removing transition: 
6.33/6.35	<l15, l15, 1 + i^0 <= n^0 /\ i^0 <= j^0 /\ its^0 + k^0 + test^0 <= j^0 + n^0 + restrt^0 + sum^0 /\ j^0 <= 1 + i^0 /\ n^0 + test^0 <= 1 + k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	It's unfeasible. Removing transition: 
6.33/6.35	<l15, l15, 1 + j^0 <= i^0 /\ its^0 + k^0 + test^0 <= j^0 + n^0 + restrt^0 + sum^0 /\ n^0 + test^0 <= 1 + k^0, {j^0 -> 1 + j^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l18, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l24, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l22, 1 + k^0 <= i^0 /\ 1 + k^0 <= n^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ j^0 + k^0 <= 1 + i^0 + n^0, {sum^0 -> undef734, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l41, l10, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ n^0 + restrt^0 + test^0 <= k^0 /\ 0 <= test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l47, l10, 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l47, l18, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= k^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l47, l18, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ n^0 <= k^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l41, 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ undef2241 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2241 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l47, 1 + n^0 <= i^0 /\ 1 + undef2241 <= 0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l62, l52, 1 + n^0 <= i^0 /\ n^0 <= k^0, {test^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l62, l62, i^0 <= n^0 /\ n^0 <= k^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l65, l62, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ i^0 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l65, l65, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l65, l65, j^0 <= i^0 /\ n^0 <= k^0, {j^0 -> 1 + j^0, sum^0 -> undef2714, rest remain the same}>
6.33/6.35	Checking unfeasibility...
6.33/6.35	Time used: 0.561269
6.33/6.35	Some transition disabled by a set of invariant(s):
6.33/6.35	Invariant at l10: n^0 <= k^0
6.33/6.35	Invariant at l18: 1 + n^0 <= i^0
6.33/6.35	Invariant at l22: 1 + n^0 <= i^0
6.33/6.35	Invariant at l24: 1 + n^0 <= i^0
6.33/6.35	Invariant at l41: n^0 <= 1 + k^0 + restrt^0 + test^0
6.33/6.35	Invariant at l52: n^0 <= 1 + i^0
6.33/6.35	Invariant at l65: n^0 <= k^0
6.33/6.35	
6.33/6.35	Strengthening and disabling transitions...
6.33/6.35	> It's unfeasible. Removing transition: 
6.33/6.35	<l22, l22, 1 + k^0 <= i^0 /\ 1 + k^0 <= n^0 /\ i^0 = n^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l10, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ undef1043 = 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1043, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= undef1043 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 + undef1043 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l18, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l24, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ j^0 + k^0 <= 1 + i^0 + n^0, {sum^0 -> undef734, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l41, l10, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ n^0 + restrt^0 + test^0 <= k^0 /\ 0 <= test^0 /\ n^0 <= 1 + k^0 + restrt^0 + test^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l41, 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ undef2241 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2241 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l47, 1 + n^0 <= i^0 /\ 1 + undef2241 <= 0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l65, l62, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ i^0 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l65, l65, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l65, l65, j^0 <= i^0 /\ n^0 <= k^0, {j^0 -> 1 + j^0, sum^0 -> undef2714, rest remain the same}>
6.33/6.35	Checking unfeasibility...
6.33/6.35	Time used: 0.515423
6.33/6.35	Some transition disabled by a set of invariant(s):
6.33/6.35	Invariant at l10: 0 <= restrt^0
6.33/6.35	Invariant at l18: 1 <= restrt^0
6.33/6.35	Invariant at l22: 1 <= restrt^0
6.33/6.35	Invariant at l24: 1 <= restrt^0
6.33/6.35	Invariant at l41: restrt^0 + test^0 <= 1
6.33/6.35	Invariant at l47: 0 <= restrt^0
6.33/6.35	Invariant at l52: 0 <= restrt^0
6.33/6.35	Invariant at l62: 0 <= restrt^0
6.33/6.35	Invariant at l65: 0 <= restrt^0
6.33/6.35	
6.33/6.35	Strengthening and disabling transitions...
6.33/6.35	> It's unfeasible. Removing transition: 
6.33/6.35	<l47, l18, 1 + n^0 <= i^0 /\ 1 + restrt^0 <= 0 /\ n^0 <= k^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l10, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l62, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ i^0 <= 0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= k^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ undef1043 = 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef1043, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 <= undef1043 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l18, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef1043 <= 0, {k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l18, l24, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ 1 + undef1043 <= 0 /\ j^0 <= n^0, {sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l18, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l22, l24, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l24, l22, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 + k^0 <= 1 + i^0 + n^0, {sum^0 -> undef734, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l41, l10, 1 + n^0 <= i^0 /\ 1 + n^0 + restrt^0 <= i^0 /\ n^0 + restrt^0 + test^0 <= k^0 /\ 0 <= test^0 /\ n^0 <= 1 + k^0 + restrt^0 + test^0 /\ restrt^0 + test^0 <= 1 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l47, l10, 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l47, l18, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ n^0 <= k^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l41, 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ undef2241 = 0, {restrt^0 -> 0, test^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l47, 1 + n^0 <= i^0 /\ 1 <= undef2241 /\ n^0 <= k^0 /\ 0 <= restrt^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l52, l47, 1 + n^0 <= i^0 /\ 1 + undef2241 <= 0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {all remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l62, l52, 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {test^0 -> 0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l62, l62, i^0 <= n^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l65, l62, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ i^0 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l65, l65, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	
6.33/6.35	LOG: CALL solverLinear in Graph for feasibility
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear in Graph for feasibility
6.33/6.35	Strengthening transition (result): 
6.33/6.35	<l65, l65, j^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2714, rest remain the same}>
6.33/6.35	Checking unfeasibility...
6.33/6.35	Time used: 1.16774
6.33/6.35	
6.33/6.35	Location 15 unreachable!
6.33/6.35	Checking conditional termination of SCC {l10, l18, l22, l24, l41, l47, l52, l62, l65}...
6.33/6.35	
6.33/6.35	LOG: CALL solveLinear
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear - Elapsed time: 0.032887s
6.33/6.35	Ranking function: -6 - 3*k^0 + 3*n^0 + 3*restrt^0
6.33/6.35	New Graphs: 
6.33/6.35	Transitions:
6.33/6.35	<l10, l62, 1 + n^0 <= i^0 /\ i^0 <= 0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	<l10, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {skip^0 -> 1, rest remain the same}>
6.33/6.35	<l62, l10, 1 + n^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ its^0 <= 199 /\ undef2241 = 0, {its^0 -> 1 + its^0, restrt^0 -> 0, test^0 -> 0, rest remain the same}>
6.33/6.35	<l62, l10, 1 + n^0 <= i^0 /\ 1 <= undef2241 /\ n^0 <= k^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
6.33/6.35	<l62, l62, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 1 <= undef2241 /\ i^0 <= 0 /\ n^0 <= k^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
6.33/6.35	<l62, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 1 <= undef2241 /\ n^0 <= k^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
6.33/6.35	<l62, l10, 1 + n^0 <= i^0 /\ 1 + undef2241 <= 0 /\ n^0 <= k^0 /\ its^0 <= 199 /\ restrt^0 = 0, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
6.33/6.35	<l62, l62, 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 1 + undef2241 <= 0 /\ i^0 <= 0 /\ n^0 <= k^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
6.33/6.35	<l62, l65, 1 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 <= restrt^0 /\ 1 + undef2241 <= 0 /\ n^0 <= k^0 /\ its^0 <= 199, {its^0 -> 1 + its^0, test^0 -> 0, rest remain the same}>
6.33/6.35	<l62, l62, i^0 <= n^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	<l65, l62, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ i^0 <= 1, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	<l65, l65, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	<l65, l65, j^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2714, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, its^0, j^0, k^0, n^0, restrt^0, sum^0, test^0
6.33/6.35	Transitions:
6.33/6.35	<l22, l22, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 + k^0 <= i^0 + n^0, {j^0 -> ((0 + 1) + 0) + j^0, sum^0 -> undef734, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, j^0, k^0, n^0, restrt^0, sum^0
6.33/6.35	Checking conditional termination of SCC {l10, l62, l65}...
6.33/6.35	
6.33/6.35	LOG: CALL solveLinear
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear - Elapsed time: 0.017270s
6.33/6.35	Ranking function: 199 - its^0 + k^0 - n^0
6.33/6.35	New Graphs: 
6.33/6.35	Transitions:
6.33/6.35	<l22, l22, 1 + k^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + k^0 <= n^0 /\ 1 <= restrt^0 /\ j^0 + k^0 <= i^0 + n^0, {j^0 -> ((0 + 1) + 0) + j^0, sum^0 -> undef734, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, j^0, k^0, n^0, restrt^0, sum^0
6.33/6.35	Transitions:
6.33/6.35	<l65, l65, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	<l65, l65, j^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2714, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, j^0, k^0, n^0, restrt^0, sum^0
6.33/6.35	Transitions:
6.33/6.35	<l62, l62, i^0 <= n^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, k^0, n^0, restrt^0
6.33/6.35	Checking conditional termination of SCC {l22}...
6.33/6.35	
6.33/6.35	LOG: CALL solveLinear
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear - Elapsed time: 0.004372s
6.33/6.35	Ranking function: -1 - j^0 + n^0
6.33/6.35	New Graphs: 
6.33/6.35	Transitions:
6.33/6.35	<l65, l65, 1 + i^0 <= j^0 /\ n^0 <= k^0 /\ 0 <= restrt^0 /\ 2 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
6.33/6.35	<l65, l65, j^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2714, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, j^0, k^0, n^0, restrt^0, sum^0
6.33/6.35	Transitions:
6.33/6.35	<l62, l62, i^0 <= n^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, k^0, n^0, restrt^0
6.33/6.35	Checking conditional termination of SCC {l65}...
6.33/6.35	
6.33/6.35	LOG: CALL solveLinear
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear - Elapsed time: 0.005007s
6.33/6.35	Ranking function: -1 + i^0
6.33/6.35	New Graphs: 
6.33/6.35	Transitions:
6.33/6.35	<l62, l62, i^0 <= n^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {i^0 -> 1 + i^0, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, k^0, n^0, restrt^0
6.33/6.35	Transitions:
6.33/6.35	<l65, l65, j^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2714, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, j^0, k^0, n^0, restrt^0, sum^0
6.33/6.35	Checking conditional termination of SCC {l62}...
6.33/6.35	
6.33/6.35	LOG: CALL solveLinear
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear - Elapsed time: 0.004146s
6.33/6.35	Ranking function: -i^0 + n^0
6.33/6.35	New Graphs: 
6.33/6.35	Transitions:
6.33/6.35	<l65, l65, j^0 <= i^0 /\ n^0 <= k^0 /\ 0 <= restrt^0, {j^0 -> 1 + j^0, sum^0 -> undef2714, rest remain the same}>
6.33/6.35	Variables:
6.33/6.35	i^0, j^0, k^0, n^0, restrt^0, sum^0
6.33/6.35	Checking conditional termination of SCC {l65}...
6.33/6.35	
6.33/6.35	LOG: CALL solveLinear
6.33/6.35	
6.33/6.35	LOG: RETURN solveLinear - Elapsed time: 0.004445s
6.33/6.35	Ranking function: i^0 - j^0
6.33/6.35	New Graphs: 
6.33/6.35	Proving termination of subgraph 4
6.33/6.35	Analyzing SCC {l36}...
6.33/6.35	No cycles found.
6.33/6.35	
6.33/6.35	Program Terminates
6.33/6.35	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
6.33/6.35	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
6.33/6.35	EOF