5.36/5.40	NO
5.36/5.40	
5.36/5.40	Solver Timeout: 4
5.36/5.40	Global Timeout: 300
5.36/5.40	No parsing errors!
5.36/5.40	Init Location: 0
5.36/5.40	Transitions:
5.36/5.40	<l0, l8, true>
5.36/5.40	<l1, l2, (undef8 = undef8), par{p_7^0 -> (0 + undef8), x_5^0 -> undef8}>
5.36/5.40	<l2, l3, (undef19 = (0 + cnt_16^0)) /\ (((0 + (~(1) * undef19)) + y_6^0) <= 0) /\ (undef13 = undef13) /\ (undef10 = undef10), par{Result_4^0 -> undef10, lt_10^0 -> undef13}>
5.36/5.40	<l2, l4, (undef29 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef29)) + y_6^0)) /\ (undef23 = undef23) /\ (undef26 = undef26) /\ ((0 + undef26) <= 0) /\ (0 <= (0 + undef26)), par{lt_10^0 -> undef23, tmp_8^0 -> undef26}>
5.36/5.40	<l4, l2, true>
5.36/5.40	<l2, l5, (undef48 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef48)) + y_6^0)) /\ (undef42 = undef42) /\ (undef45 = undef45), par{lt_10^0 -> undef42, tmp_8^0 -> undef45}>
5.36/5.40	<l5, l6, (undef50 = __disjvr_0^0) /\ (__disjvr_0^0 = undef50), par{__disjvr_0^0 -> undef50}>
5.36/5.40	<l6, l7, (undef67 = (0 + cnt_16^0)) /\ (undef62 = undef62), par{lt_9^0 -> undef62}>
5.36/5.40	<l7, l2, true>
5.36/5.40	<l8, l1, true>
5.36/5.40	
5.36/5.40	Fresh variables:
5.36/5.40	undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 
5.36/5.40	
5.36/5.40	Undef variables:
5.36/5.40	undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 
5.36/5.40	
5.36/5.40	Abstraction variables:
5.36/5.40	
5.36/5.40	Exit nodes:
5.36/5.40	
5.36/5.40	Accepting locations:
5.36/5.40	
5.36/5.40	Asserts:
5.36/5.40	
5.36/5.40	Preprocessed LLVMGraph
5.36/5.40	Init Location: 0
5.36/5.40	Transitions:
5.36/5.40	<l0, l2, (undef8 = undef8)>
5.36/5.40	<l2, l3, (undef19 = (0 + cnt_16^0)) /\ (((0 + (~(1) * undef19)) + y_6^0) <= 0) /\ (undef13 = undef13) /\ (undef10 = undef10)>
5.36/5.40	<l2, l2, (undef29 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef29)) + y_6^0)) /\ (undef23 = undef23) /\ (undef26 = undef26) /\ ((0 + undef26) <= 0) /\ (0 <= (0 + undef26))>
5.36/5.40	<l2, l2, (undef48 = (0 + cnt_16^0)) /\ (0 <= ((~(1) + (~(1) * undef48)) + y_6^0)) /\ (undef42 = undef42) /\ (undef45 = undef45) /\ (undef50 = __disjvr_0^0) /\ (__disjvr_0^0 = undef50) /\ (undef67 = (0 + cnt_16^0)) /\ (undef62 = undef62), par{__disjvr_0^0 -> undef50}>
5.36/5.40	
5.36/5.40	Fresh variables:
5.36/5.40	undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 
5.36/5.40	
5.36/5.40	Undef variables:
5.36/5.40	undef8, undef10, undef13, undef19, undef23, undef26, undef29, undef42, undef45, undef48, undef50, undef62, undef67, 
5.36/5.40	
5.36/5.40	Abstraction variables:
5.36/5.40	
5.36/5.40	Exit nodes:
5.36/5.40	
5.36/5.40	Accepting locations:
5.36/5.40	
5.36/5.40	Asserts:
5.36/5.40	
5.36/5.40	*************************************************************
5.36/5.40	*******************************************************************************************
5.36/5.40	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.36/5.40	*******************************************************************************************
5.36/5.40	
5.36/5.40	Init Location: 0
5.36/5.40	Graph 0:
5.36/5.40	Transitions:
5.36/5.40	Variables:
5.36/5.40	
5.36/5.40	Graph 1:
5.36/5.40	Transitions:
5.36/5.40	<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	Variables:
5.36/5.40	cnt_16^0, y_6^0, __disjvr_0^0
5.36/5.40	
5.36/5.40	Graph 2:
5.36/5.40	Transitions:
5.36/5.40	Variables:
5.36/5.40	
5.36/5.40	Precedence: 
5.36/5.40	Graph 0
5.36/5.40	
5.36/5.40	Graph 1
5.36/5.40	<l0, l2, true, {all remain the same}>
5.36/5.40	
5.36/5.40	Graph 2
5.36/5.40	<l2, l3, y_6^0 <= undef19 /\ cnt_16^0 = undef19, {all remain the same}>
5.36/5.40	
5.36/5.40	Map Locations to Subgraph:
5.36/5.40	( 0 , 0 )
5.36/5.40	( 2 , 1 )
5.36/5.40	( 3 , 2 )
5.36/5.40	
5.36/5.40	*******************************************************************************************
5.36/5.40	********************************    CHECKING ASSERTIONS    ********************************
5.36/5.40	*******************************************************************************************
5.36/5.40	
5.36/5.40	Proving termination of subgraph 0
5.36/5.40	Proving termination of subgraph 1
5.36/5.40	Checking unfeasibility...
5.36/5.40	Time used: 0.004466
5.36/5.40	
5.36/5.40	Checking conditional termination of SCC {l2}...
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.000813s
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.002666s
5.36/5.40	Trying to remove transition: <l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	Solving with 1 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009741s
5.36/5.40	Time used: 0.009501
5.36/5.40	Solving with 1 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012622s
5.36/5.40	Time used: 0.011929
5.36/5.40	Improving Solution with cost 1 ...
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetNextSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026696s
5.36/5.40	Time used: 0.02669
5.36/5.40	
5.36/5.40	LOG: SAT solveNonLinear - Elapsed time: 0.039318s
5.36/5.40	Cost: 1; Total time: 0.038619
5.36/5.40	Failed at location 2: 1 + y_6^0 <= cnt_16^0
5.36/5.40	Before Improving: 
5.36/5.40	Quasi-invariant at l2: 1 + y_6^0 <= cnt_16^0
5.36/5.40	Optimizing invariants...
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.004476s
5.36/5.40	Remaining time after improvement: 0.998199
5.36/5.40	Termination implied by a set of quasi-invariant(s):
5.36/5.40	Quasi-invariant at l2: 1 + y_6^0 <= cnt_16^0
5.36/5.40	[ Invariant Graph ]
5.36/5.40	Strengthening and disabling transitions...
5.36/5.40	
5.36/5.40	LOG: CALL solverLinear in Graph for feasibility
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.40	It's unfeasible. Removing transition: 
5.36/5.40	<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	
5.36/5.40	LOG: CALL solverLinear in Graph for feasibility
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.40	It's unfeasible. Removing transition: 
5.36/5.40	<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	[ Termination Graph ]
5.36/5.40	Strengthening and disabling transitions...
5.36/5.40	> It's unfeasible. Removing transition: 
5.36/5.40	<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	
5.36/5.40	LOG: CALL solverLinear in Graph for feasibility
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.40	It's unfeasible. Removing transition: 
5.36/5.40	<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	New Graphs: 
5.36/5.40	Calling Safety with literal 1 + y_6^0 <= cnt_16^0 and entry <l0, l2, true, {all remain the same}>
5.36/5.40	
5.36/5.40	LOG: CALL check - Post:1 + y_6^0 <= cnt_16^0 - Process 1
5.36/5.40	* Exit transition: <l0, l2, true, {all remain the same}>
5.36/5.40	* Postcondition  : 1 + y_6^0 <= cnt_16^0
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.000464s
5.36/5.40	> Postcondition is not implied!
5.36/5.40	
5.36/5.40	LOG: RETURN check - Elapsed time: 0.000535s
5.36/5.40	INVARIANTS: 
5.36/5.40	2: 
5.36/5.40	Quasi-INVARIANTS to narrow Graph: 
5.36/5.40	2: 1 + y_6^0 <= cnt_16^0 , 
5.36/5.40	Narrowing transition: 
5.36/5.40	<l2, l2, 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	
5.36/5.40	LOG: Narrow transition size 1
5.36/5.40	Narrowing transition: 
5.36/5.40	<l2, l2, 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	
5.36/5.40	LOG: Narrow transition size 1
5.36/5.40	invGraph after Narrowing: 
5.36/5.40	Transitions:
5.36/5.40	<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	Variables:
5.36/5.40	cnt_16^0, y_6^0, __disjvr_0^0
5.36/5.40	Checking conditional termination of SCC {l2}...
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.000781s
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.003119s
5.36/5.40	Trying to remove transition: <l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	Solving with 1 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008394s
5.36/5.40	Time used: 0.008151
5.36/5.40	Solving with 1 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014789s
5.36/5.40	Time used: 0.014054
5.36/5.40	Improving Solution with cost 1 ...
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetNextSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019401s
5.36/5.40	Time used: 0.019395
5.36/5.40	
5.36/5.40	LOG: SAT solveNonLinear - Elapsed time: 0.034190s
5.36/5.40	Cost: 1; Total time: 0.033449
5.36/5.40	Failed at location 2: y_6^0 <= cnt_16^0
5.36/5.40	Before Improving: 
5.36/5.40	Quasi-invariant at l2: y_6^0 <= cnt_16^0
5.36/5.40	Optimizing invariants...
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.004789s
5.36/5.40	Remaining time after improvement: 0.997867
5.36/5.40	Termination implied by a set of quasi-invariant(s):
5.36/5.40	Quasi-invariant at l2: y_6^0 <= cnt_16^0
5.36/5.40	[ Invariant Graph ]
5.36/5.40	Strengthening and disabling transitions...
5.36/5.40	
5.36/5.40	LOG: CALL solverLinear in Graph for feasibility
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.40	It's unfeasible. Removing transition: 
5.36/5.40	<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	
5.36/5.40	LOG: CALL solverLinear in Graph for feasibility
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.40	It's unfeasible. Removing transition: 
5.36/5.40	<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	[ Termination Graph ]
5.36/5.40	Strengthening and disabling transitions...
5.36/5.40	> It's unfeasible. Removing transition: 
5.36/5.40	<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	
5.36/5.40	LOG: CALL solverLinear in Graph for feasibility
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.40	It's unfeasible. Removing transition: 
5.36/5.40	<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	New Graphs: 
5.36/5.40	Calling Safety with literal y_6^0 <= cnt_16^0 and entry <l0, l2, cnt_16^0 <= y_6^0, {all remain the same}>
5.36/5.40	
5.36/5.40	LOG: CALL check - Post:y_6^0 <= cnt_16^0 - Process 2
5.36/5.40	* Exit transition: <l0, l2, cnt_16^0 <= y_6^0, {all remain the same}>
5.36/5.40	* Postcondition  : y_6^0 <= cnt_16^0
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.000584s
5.36/5.40	> Postcondition is not implied!
5.36/5.40	
5.36/5.40	LOG: RETURN check - Elapsed time: 0.000662s
5.36/5.40	INVARIANTS: 
5.36/5.40	2: 
5.36/5.40	Quasi-INVARIANTS to narrow Graph: 
5.36/5.40	2: y_6^0 <= cnt_16^0 , 
5.36/5.40	Narrowing transition: 
5.36/5.40	<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	
5.36/5.40	LOG: Narrow transition size 1
5.36/5.40	Narrowing transition: 
5.36/5.40	<l2, l2, cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	
5.36/5.40	LOG: Narrow transition size 1
5.36/5.40	invGraph after Narrowing: 
5.36/5.40	Transitions:
5.36/5.40	<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	Variables:
5.36/5.40	cnt_16^0, y_6^0, __disjvr_0^0
5.36/5.40	Checking conditional termination of SCC {l2}...
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.000783s
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.003064s
5.36/5.40	Trying to remove transition: <l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	Solving with 1 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009497s
5.36/5.40	Time used: 0.009302
5.36/5.40	Solving with 1 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016916s
5.36/5.40	Time used: 0.016247
5.36/5.40	Solving with 2 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001436s
5.36/5.40	Time used: 4.00057
5.36/5.40	Solving with 3 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004771s
5.36/5.40	Time used: 1.00016
5.36/5.40	Solving with 1 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026170s
5.36/5.40	Time used: 0.011256
5.36/5.40	
5.36/5.40	Proving non-termination of subgraph 1
5.36/5.40	Transitions:
5.36/5.40	<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	Variables:
5.36/5.40	cnt_16^0, y_6^0, __disjvr_0^0
5.36/5.40	
5.36/5.40	Checking that every undef value has an assignment...
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.002731s
5.36/5.40	Checking conditional non-termination of SCC {l2}...
5.36/5.40	EXIT TRANSITIONS:
5.36/5.40	<l2, end, y_6^0 <= cnt_16^0, {all remain the same}>
5.36/5.40	
5.36/5.40	Solving with 1 template(s).
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetFirstSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061668s
5.36/5.40	Time used: 0.061081
5.36/5.40	Improving Solution with cost 1 ...
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinearGetNextSolution
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.053036s
5.36/5.40	Time used: 0.053029
5.36/5.40	
5.36/5.40	LOG: SAT solveNonLinear - Elapsed time: 0.114704s
5.36/5.40	Cost: 1; Total time: 0.11411
5.36/5.40	Failed at location 2: 1 + cnt_16^0 <= y_6^0
5.36/5.40	Before Improving: 
5.36/5.40	Quasi-invariant at l2: 1 + cnt_16^0 <= y_6^0
5.36/5.40	Optimizing invariants...
5.36/5.40	
5.36/5.40	LOG: CALL solveLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear - Elapsed time: 0.006526s
5.36/5.40	Remaining time after improvement: 0.996648
5.36/5.40	Minimizing number of undef constraints...
5.36/5.40	
5.36/5.40	LOG: CALL solveNonLinear
5.36/5.40	
5.36/5.40	LOG: RETURN solveNonLinear - Elapsed time: 0.006798s
5.36/5.40	Number of undef constraints reduced!
5.36/5.40	
5.36/5.40	Non-termination implied by a set of quasi-invariant(s):
5.36/5.40	Quasi-invariant at l2: 1 + cnt_16^0 <= y_6^0
5.36/5.40	
5.36/5.40	Strengthening and disabling EXIT transitions...
5.36/5.40	Closed exits from l2: 1
5.36/5.40	
5.36/5.40	Strengthening and disabling transitions...
5.36/5.40	
5.36/5.40	LOG: CALL solverLinear in Graph for feasibility
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.40	Strengthening transition (result): 
5.36/5.40	<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef29 <= y_6^0 /\ cnt_16^0 = undef29 /\ undef26 = 0, {all remain the same}>
5.36/5.40	
5.36/5.40	LOG: CALL solverLinear in Graph for feasibility
5.36/5.40	
5.36/5.40	LOG: RETURN solveLinear in Graph for feasibility
5.36/5.40	Strengthening transition (result): 
5.36/5.40	<l2, l2, 1 + cnt_16^0 <= y_6^0 /\ 1 + undef48 <= y_6^0 /\ __disjvr_0^0 = undef50 /\ cnt_16^0 = undef48 /\ cnt_16^0 = undef67, {__disjvr_0^0 -> undef50, rest remain the same}>
5.36/5.40	
5.36/5.40	Calling reachability with...
5.36/5.40	Transition: <l2, end, true, {all remain the same}>
5.36/5.40	Conditions: 1 + cnt_16^0 <= y_6^0, 
5.36/5.40	OPEN EXITS: 
5.36/5.40	<l2, end, true, {all remain the same}> (condsUp: 1 + cnt_16^0 <= y_6^0)
5.36/5.40	
5.36/5.40	--- Reachability graph ---
5.36/5.40	> Graph without transitions.
5.36/5.40	
5.36/5.40	Calling reachability with...
5.36/5.40	Transition: <l0, l2, true, {all remain the same}>
5.36/5.40	Conditions: 1 + cnt_16^0 <= y_6^0, 
5.36/5.40	OPEN EXITS: 
5.36/5.40	<l0, l2, 1 + cnt_16^0 <= y_6^0, {all remain the same}>
5.36/5.40	
5.36/5.40	> Conditions are reachable!
5.36/5.40	
5.36/5.40	Program does NOT terminate
5.36/5.40	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.36/5.40	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.36/5.40	EOF