5.58/5.64	NO
5.58/5.64	
5.58/5.64	Solver Timeout: 4
5.58/5.64	Global Timeout: 300
5.58/5.64	No parsing errors!
5.58/5.64	Init Location: 0
5.58/5.64	Transitions:
5.58/5.64	<l0, l8, true>
5.58/5.64	<l1, l2, true, par{p_14^0 -> (0 + x_13^0)}>
5.58/5.64	<l2, l3, ((0 + y_16^0) <= (0 + lt_15^0)) /\ (undef12 = undef12), par{lt_15^0 -> undef12, rt_11^0 -> (0 + st_17^0)}>
5.58/5.64	<l2, l4, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef22 = undef22) /\ (undef31 = undef31) /\ (undef27 = (0 + undef31)) /\ (undef24 = undef24) /\ (0 <= (0 + undef27)) /\ ((0 + undef27) <= 0), par{lt_15^0 -> undef22, nd_12^0 -> undef24, rv_18^0 -> undef27}>
5.58/5.64	<l4, l2, true>
5.58/5.64	<l2, l5, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef43 = undef43) /\ (undef52 = undef52) /\ (undef45 = undef45), par{lt_15^0 -> undef43, nd_12^0 -> undef45, rv_18^0 -> (0 + undef52)}>
5.58/5.64	<l5, l6, (undef53 = __disjvr_0^0) /\ (__disjvr_0^0 = undef53), par{__disjvr_0^0 -> undef53}>
5.58/5.64	<l6, l7, (undef65 = undef65), par{lt_19^0 -> undef65}>
5.58/5.64	<l7, l2, true>
5.58/5.64	<l8, l1, true>
5.58/5.64	
5.58/5.64	Fresh variables:
5.58/5.64	undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, 
5.58/5.64	
5.58/5.64	Undef variables:
5.58/5.64	undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, 
5.58/5.64	
5.58/5.64	Abstraction variables:
5.58/5.64	
5.58/5.64	Exit nodes:
5.58/5.64	
5.58/5.64	Accepting locations:
5.58/5.64	
5.58/5.64	Asserts:
5.58/5.64	
5.58/5.64	Preprocessed LLVMGraph
5.58/5.64	Init Location: 0
5.58/5.64	Transitions:
5.58/5.64	<l0, l2, true>
5.58/5.64	<l2, l3, ((0 + y_16^0) <= (0 + lt_15^0)) /\ (undef12 = undef12), par{lt_15^0 -> undef12}>
5.58/5.64	<l2, l2, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef22 = undef22) /\ (undef31 = undef31) /\ (undef27 = (0 + undef31)) /\ (undef24 = undef24) /\ (0 <= (0 + undef27)) /\ ((0 + undef27) <= 0), par{lt_15^0 -> undef22}>
5.58/5.64	<l2, l2, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef43 = undef43) /\ (undef52 = undef52) /\ (undef45 = undef45) /\ (undef53 = __disjvr_0^0) /\ (__disjvr_0^0 = undef53) /\ (undef65 = undef65), par{__disjvr_0^0 -> undef53, lt_15^0 -> undef43}>
5.58/5.64	
5.58/5.64	Fresh variables:
5.58/5.64	undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, 
5.58/5.64	
5.58/5.64	Undef variables:
5.58/5.64	undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, 
5.58/5.64	
5.58/5.64	Abstraction variables:
5.58/5.64	
5.58/5.64	Exit nodes:
5.58/5.64	
5.58/5.64	Accepting locations:
5.58/5.64	
5.58/5.64	Asserts:
5.58/5.64	
5.58/5.64	*************************************************************
5.58/5.64	*******************************************************************************************
5.58/5.64	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.58/5.64	*******************************************************************************************
5.58/5.64	
5.58/5.64	Init Location: 0
5.58/5.64	Graph 0:
5.58/5.64	Transitions:
5.58/5.64	Variables:
5.58/5.64	
5.58/5.64	Graph 1:
5.58/5.64	Transitions:
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	Variables:
5.58/5.64	lt_15^0, y_16^0, __disjvr_0^0
5.58/5.64	
5.58/5.64	Graph 2:
5.58/5.64	Transitions:
5.58/5.64	Variables:
5.58/5.64	
5.58/5.64	Precedence: 
5.58/5.64	Graph 0
5.58/5.64	
5.58/5.64	Graph 1
5.58/5.64	<l0, l2, true, {all remain the same}>
5.58/5.64	
5.58/5.64	Graph 2
5.58/5.64	<l2, l3, y_16^0 <= lt_15^0, {lt_15^0 -> undef12, rest remain the same}>
5.58/5.64	
5.58/5.64	Map Locations to Subgraph:
5.58/5.64	( 0 , 0 )
5.58/5.64	( 2 , 1 )
5.58/5.64	( 3 , 2 )
5.58/5.64	
5.58/5.64	*******************************************************************************************
5.58/5.64	********************************    CHECKING ASSERTIONS    ********************************
5.58/5.64	*******************************************************************************************
5.58/5.64	
5.58/5.64	Proving termination of subgraph 0
5.58/5.64	Proving termination of subgraph 1
5.58/5.64	Checking unfeasibility...
5.58/5.64	Time used: 0.004316
5.58/5.64	
5.58/5.64	Checking conditional termination of SCC {l2}...
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.001198s
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.004651s
5.58/5.64	Trying to remove transition: <l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010283s
5.58/5.64	Time used: 0.010003
5.58/5.64	Trying to remove transition: <l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007282s
5.58/5.64	Time used: 0.00662
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019447s
5.58/5.64	Time used: 0.018792
5.58/5.64	Improving Solution with cost 1 ...
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetNextSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040322s
5.58/5.64	Time used: 0.040311
5.58/5.64	
5.58/5.64	LOG: SAT solveNonLinear - Elapsed time: 0.059769s
5.58/5.64	Cost: 1; Total time: 0.059103
5.58/5.64	Failed at location 2: 1 + y_16^0 <= lt_15^0
5.58/5.64	Before Improving: 
5.58/5.64	Quasi-invariant at l2: 1 + y_16^0 <= lt_15^0
5.58/5.64	Optimizing invariants...
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.006041s
5.58/5.64	Remaining time after improvement: 0.998035
5.58/5.64	Termination implied by a set of quasi-invariant(s):
5.58/5.64	Quasi-invariant at l2: 1 + y_16^0 <= lt_15^0
5.58/5.64	[ Invariant Graph ]
5.58/5.64	Strengthening and disabling transitions...
5.58/5.64	
5.58/5.64	LOG: CALL solverLinear in Graph for feasibility
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear in Graph for feasibility
5.58/5.64	It's unfeasible. Removing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	
5.58/5.64	LOG: CALL solverLinear in Graph for feasibility
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear in Graph for feasibility
5.58/5.64	It's unfeasible. Removing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	[ Termination Graph ]
5.58/5.64	Strengthening and disabling transitions...
5.58/5.64	> It's unfeasible. Removing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	
5.58/5.64	LOG: CALL solverLinear in Graph for feasibility
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear in Graph for feasibility
5.58/5.64	It's unfeasible. Removing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	New Graphs: 
5.58/5.64	Calling Safety with literal 1 + y_16^0 <= lt_15^0 and entry <l0, l2, true, {all remain the same}>
5.58/5.64	
5.58/5.64	LOG: CALL check - Post:1 + y_16^0 <= lt_15^0 - Process 1
5.58/5.64	* Exit transition: <l0, l2, true, {all remain the same}>
5.58/5.64	* Postcondition  : 1 + y_16^0 <= lt_15^0
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.000540s
5.58/5.64	> Postcondition is not implied!
5.58/5.64	
5.58/5.64	LOG: RETURN check - Elapsed time: 0.000614s
5.58/5.64	INVARIANTS: 
5.58/5.64	2: 
5.58/5.64	Quasi-INVARIANTS to narrow Graph: 
5.58/5.64	2: 1 + y_16^0 <= lt_15^0 , 
5.58/5.64	Narrowing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	
5.58/5.64	LOG: Narrow transition size 1
5.58/5.64	Narrowing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	
5.58/5.64	LOG: Narrow transition size 1
5.58/5.64	invGraph after Narrowing: 
5.58/5.64	Transitions:
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	Variables:
5.58/5.64	lt_15^0, y_16^0, __disjvr_0^0
5.58/5.64	Checking conditional termination of SCC {l2}...
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.001122s
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.004500s
5.58/5.64	Trying to remove transition: <l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008698s
5.58/5.64	Time used: 0.008388
5.58/5.64	Trying to remove transition: <l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007513s
5.58/5.64	Time used: 0.006812
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021337s
5.58/5.64	Time used: 0.020627
5.58/5.64	Improving Solution with cost 1 ...
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetNextSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025424s
5.58/5.64	Time used: 0.025415
5.58/5.64	
5.58/5.64	LOG: SAT solveNonLinear - Elapsed time: 0.046761s
5.58/5.64	Cost: 1; Total time: 0.046042
5.58/5.64	Failed at location 2: y_16^0 <= lt_15^0
5.58/5.64	Before Improving: 
5.58/5.64	Quasi-invariant at l2: y_16^0 <= lt_15^0
5.58/5.64	Optimizing invariants...
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.006117s
5.58/5.64	Remaining time after improvement: 0.998006
5.58/5.64	Termination implied by a set of quasi-invariant(s):
5.58/5.64	Quasi-invariant at l2: y_16^0 <= lt_15^0
5.58/5.64	[ Invariant Graph ]
5.58/5.64	Strengthening and disabling transitions...
5.58/5.64	
5.58/5.64	LOG: CALL solverLinear in Graph for feasibility
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear in Graph for feasibility
5.58/5.64	It's unfeasible. Removing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	
5.58/5.64	LOG: CALL solverLinear in Graph for feasibility
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear in Graph for feasibility
5.58/5.64	It's unfeasible. Removing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	[ Termination Graph ]
5.58/5.64	Strengthening and disabling transitions...
5.58/5.64	
5.58/5.64	LOG: CALL solverLinear in Graph for feasibility
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear in Graph for feasibility
5.58/5.64	It's unfeasible. Removing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	
5.58/5.64	LOG: CALL solverLinear in Graph for feasibility
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear in Graph for feasibility
5.58/5.64	It's unfeasible. Removing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	New Graphs: 
5.58/5.64	Calling Safety with literal y_16^0 <= lt_15^0 and entry <l0, l2, lt_15^0 <= y_16^0, {all remain the same}>
5.58/5.64	
5.58/5.64	LOG: CALL check - Post:y_16^0 <= lt_15^0 - Process 2
5.58/5.64	* Exit transition: <l0, l2, lt_15^0 <= y_16^0, {all remain the same}>
5.58/5.64	* Postcondition  : y_16^0 <= lt_15^0
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.000599s
5.58/5.64	> Postcondition is not implied!
5.58/5.64	
5.58/5.64	LOG: RETURN check - Elapsed time: 0.000680s
5.58/5.64	INVARIANTS: 
5.58/5.64	2: 
5.58/5.64	Quasi-INVARIANTS to narrow Graph: 
5.58/5.64	2: y_16^0 <= lt_15^0 , 
5.58/5.64	Narrowing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	
5.58/5.64	LOG: Narrow transition size 1
5.58/5.64	Narrowing transition: 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	
5.58/5.64	LOG: Narrow transition size 1
5.58/5.64	invGraph after Narrowing: 
5.58/5.64	Transitions:
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	Variables:
5.58/5.64	lt_15^0, y_16^0, __disjvr_0^0
5.58/5.64	Checking conditional termination of SCC {l2}...
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.001130s
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.004496s
5.58/5.64	Trying to remove transition: <l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008863s
5.58/5.64	Time used: 0.00855
5.58/5.64	Trying to remove transition: <l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007420s
5.58/5.64	Time used: 0.006678
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024288s
5.58/5.64	Time used: 0.023697
5.58/5.64	Solving with 2 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002525s
5.58/5.64	Time used: 4.00064
5.58/5.64	Solving with 3 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006808s
5.58/5.64	Time used: 1.0001
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035010s
5.58/5.64	Time used: 0.014742
5.58/5.64	
5.58/5.64	Proving non-termination of subgraph 1
5.58/5.64	Transitions:
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	Variables:
5.58/5.64	lt_15^0, y_16^0, __disjvr_0^0
5.58/5.64	
5.58/5.64	Checking that every undef value has an assignment...
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.001997s
5.58/5.64	Checking conditional non-termination of SCC {l2}...
5.58/5.64	EXIT TRANSITIONS:
5.58/5.64	<l2, end, y_16^0 <= lt_15^0, {all remain the same}>
5.58/5.64	
5.58/5.64	Solving with 1 template(s).
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetFirstSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048988s
5.58/5.64	Time used: 0.048541
5.58/5.64	Improving Solution with cost 1 ...
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinearGetNextSolution
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.199678s
5.58/5.64	Time used: 0.199525
5.58/5.64	
5.58/5.64	LOG: SAT solveNonLinear - Elapsed time: 0.248666s
5.58/5.64	Cost: 1; Total time: 0.248066
5.58/5.64	Failed at location 2: 1 + lt_15^0 <= y_16^0
5.58/5.64	Before Improving: 
5.58/5.64	Quasi-invariant at l2: 1 + lt_15^0 <= y_16^0
5.58/5.64	Optimizing invariants...
5.58/5.64	
5.58/5.64	LOG: CALL solveLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear - Elapsed time: 0.032637s
5.58/5.64	Remaining time after improvement: 0.997103
5.58/5.64	Minimizing number of undef constraints...
5.58/5.64	
5.58/5.64	LOG: CALL solveNonLinear
5.58/5.64	
5.58/5.64	LOG: RETURN solveNonLinear - Elapsed time: 0.005243s
5.58/5.64	Non-termination implied by a set of quasi-invariant(s):
5.58/5.64	Quasi-invariant at l2: 1 + lt_15^0 <= y_16^0
5.58/5.64	Constraint over undef '1 + undef22 <= y_16^0' in transition:
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	Constraint over undef 'undef43 <= lt_15^0' in transition:
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	
5.58/5.64	Strengthening and disabling EXIT transitions...
5.58/5.64	Closed exits from l2: 1
5.58/5.64	
5.58/5.64	Strengthening and disabling transitions...
5.58/5.64	
5.58/5.64	LOG: CALL solverLinear in Graph for feasibility
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear in Graph for feasibility
5.58/5.64	Strengthening transition (result): 
5.58/5.64	<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 + undef22 <= y_16^0 /\ undef27 = 0 /\ undef27 = undef31, {lt_15^0 -> undef22, rest remain the same}>
5.58/5.64	
5.58/5.64	LOG: CALL solverLinear in Graph for feasibility
5.58/5.64	
5.58/5.64	LOG: RETURN solveLinear in Graph for feasibility
5.58/5.64	Strengthening transition (result): 
5.58/5.64	<l2, l2, undef43 <= lt_15^0 /\ 1 + lt_15^0 <= y_16^0 /\ __disjvr_0^0 = undef53, {__disjvr_0^0 -> undef53, lt_15^0 -> undef43, rest remain the same}>
5.58/5.64	
5.58/5.64	Calling reachability with...
5.58/5.64	Transition: <l2, end, true, {all remain the same}>
5.58/5.64	Conditions: 1 + lt_15^0 <= y_16^0, 
5.58/5.64	OPEN EXITS: 
5.58/5.64	<l2, end, 1 + lt_15^0 <= y_16^0, {all remain the same}>
5.58/5.64	
5.58/5.64	--- Reachability graph ---
5.58/5.64	> Graph without transitions.
5.58/5.64	
5.58/5.64	Calling reachability with...
5.58/5.64	Transition: <l0, l2, true, {all remain the same}>
5.58/5.64	Conditions: 1 + lt_15^0 <= y_16^0, 
5.58/5.64	OPEN EXITS: 
5.58/5.64	<l0, l2, 1 + lt_15^0 <= y_16^0, {all remain the same}>
5.58/5.64	
5.58/5.64	> Conditions are reachable!
5.58/5.64	
5.58/5.64	Program does NOT terminate
5.58/5.64	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.58/5.64	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.58/5.64	EOF