5.74/5.75	NO
5.74/5.75	
5.74/5.76	Solver Timeout: 4
5.74/5.76	Global Timeout: 300
5.74/5.76	No parsing errors!
5.74/5.76	Init Location: 0
5.74/5.76	Transitions:
5.74/5.76	<l0, l7, true>
5.74/5.76	<l1, l2, true>
5.74/5.76	<l1, l3, (undef12 = undef12), par{fvalue3^0 -> undef12, up5^0 -> (~(1) + low6^0)}>
5.74/5.76	<l1, l2, true>
5.74/5.76	<l4, l5, ((1 + up5^0) <= (0 + low6^0)) /\ (undef33 = (0 + fvalue3^0)), par{ret_binary_search7^0 -> undef33, tmp^0 -> (0 + undef33)}>
5.74/5.76	<l4, l1, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{mid4^0 -> undef41}>
5.74/5.76	<l3, l4, true>
5.74/5.76	<l2, l3, true, par{low6^0 -> (1 + mid4^0)}>
5.74/5.76	<l2, l3, true, par{up5^0 -> (~(1) + mid4^0)}>
5.74/5.76	<l6, l3, true, par{fvalue3^0 -> ~(1), low6^0 -> 0, up5^0 -> (0 + __const_14^0), x2^0 -> (0 + __const_8^0)}>
5.74/5.76	<l7, l6, true>
5.74/5.76	
5.74/5.76	Fresh variables:
5.74/5.76	undef12, undef33, undef41, 
5.74/5.76	
5.74/5.76	Undef variables:
5.74/5.76	undef12, undef33, undef41, 
5.74/5.76	
5.74/5.76	Abstraction variables:
5.74/5.76	
5.74/5.76	Exit nodes:
5.74/5.76	
5.74/5.76	Accepting locations:
5.74/5.76	
5.74/5.76	Asserts:
5.74/5.76	
5.74/5.76	Preprocessed LLVMGraph
5.74/5.76	Init Location: 0
5.74/5.76	Transitions:
5.74/5.76	<l0, l3, (fvalue3^0 = ~(1)) /\ (low6^0 = 0) /\ (up5^0 = (0 + __const_14^0))>
5.74/5.76	<l3, l5, ((1 + up5^0) <= (0 + low6^0)) /\ (undef33 = (0 + fvalue3^0))>
5.74/5.76	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{low6^0 -> (1 + undef41)}>
5.74/5.76	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{up5^0 -> (~(1) + undef41)}>
5.74/5.76	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41) /\ (undef12 = undef12), par{fvalue3^0 -> undef12, up5^0 -> (~(1) + low6^0)}>
5.74/5.76	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{low6^0 -> (1 + undef41)}>
5.74/5.76	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{up5^0 -> (~(1) + undef41)}>
5.74/5.76	
5.74/5.76	Fresh variables:
5.74/5.76	undef12, undef33, undef41, 
5.74/5.76	
5.74/5.76	Undef variables:
5.74/5.76	undef12, undef33, undef41, 
5.74/5.76	
5.74/5.76	Abstraction variables:
5.74/5.76	
5.74/5.76	Exit nodes:
5.74/5.76	
5.74/5.76	Accepting locations:
5.74/5.76	
5.74/5.76	Asserts:
5.74/5.76	
5.74/5.76	*************************************************************
5.74/5.76	*******************************************************************************************
5.74/5.76	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.74/5.76	*******************************************************************************************
5.74/5.76	
5.74/5.76	Init Location: 0
5.74/5.76	Graph 0:
5.74/5.76	Transitions:
5.74/5.76	Variables:
5.74/5.76	
5.74/5.76	Graph 1:
5.74/5.76	Transitions:
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {fvalue3^0 -> undef12, up5^0 -> -1 + low6^0, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	Variables:
5.74/5.76	low6^0, up5^0, fvalue3^0
5.74/5.76	
5.74/5.76	Graph 2:
5.74/5.76	Transitions:
5.74/5.76	Variables:
5.74/5.76	
5.74/5.76	Precedence: 
5.74/5.76	Graph 0
5.74/5.76	
5.74/5.76	Graph 1
5.74/5.76	<l0, l3, 1 + fvalue3^0 = 0 /\ __const_14^0 = up5^0 /\ low6^0 = 0, {all remain the same}>
5.74/5.76	
5.74/5.76	Graph 2
5.74/5.76	<l3, l5, 1 + up5^0 <= low6^0 /\ fvalue3^0 = undef33, {all remain the same}>
5.74/5.76	
5.74/5.76	Map Locations to Subgraph:
5.74/5.76	( 0 , 0 )
5.74/5.76	( 3 , 1 )
5.74/5.76	( 5 , 2 )
5.74/5.76	
5.74/5.76	*******************************************************************************************
5.74/5.76	********************************    CHECKING ASSERTIONS    ********************************
5.74/5.76	*******************************************************************************************
5.74/5.76	
5.74/5.76	Proving termination of subgraph 0
5.74/5.76	Proving termination of subgraph 1
5.74/5.76	Checking unfeasibility...
5.74/5.76	Time used: 0.013443
5.74/5.76	
5.74/5.76	Checking conditional termination of SCC {l3}...
5.74/5.76	
5.74/5.76	LOG: CALL solveLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear - Elapsed time: 0.002046s
5.74/5.76	
5.74/5.76	LOG: CALL solveLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear - Elapsed time: 0.008322s
5.74/5.76	Piecewise ranking function: min(1 - 3*low6^0 + 3*up5^0,0)
5.74/5.76	New Graphs: 
5.74/5.76	Transitions:
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	Variables:
5.74/5.76	low6^0, up5^0
5.74/5.76	Checking conditional termination of SCC {l3}...
5.74/5.76	
5.74/5.76	LOG: CALL solveLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear - Elapsed time: 0.001146s
5.74/5.76	
5.74/5.76	LOG: CALL solveLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear - Elapsed time: 0.006300s
5.74/5.76	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010630s
5.74/5.76	Time used: 0.010246
5.74/5.76	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009867s
5.74/5.76	Time used: 0.00893
5.74/5.76	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009602s
5.74/5.76	Time used: 0.008772
5.74/5.76	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009563s
5.74/5.76	Time used: 0.008725
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054332s
5.74/5.76	Time used: 0.053286
5.74/5.76	Improving Solution with cost 1 ...
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetNextSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.122852s
5.74/5.76	Time used: 0.122842
5.74/5.76	
5.74/5.76	LOG: SAT solveNonLinear - Elapsed time: 0.177184s
5.74/5.76	Cost: 1; Total time: 0.176128
5.74/5.76	Failed at location 3: 1 + up5^0 <= low6^0
5.74/5.76	Before Improving: 
5.74/5.76	Quasi-invariant at l3: 1 + up5^0 <= low6^0
5.74/5.76	Optimizing invariants...
5.74/5.76	
5.74/5.76	LOG: CALL solveLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear - Elapsed time: 0.016849s
5.74/5.76	Remaining time after improvement: 0.996357
5.74/5.76	Termination implied by a set of quasi-invariant(s):
5.74/5.76	Quasi-invariant at l3: 1 + up5^0 <= low6^0
5.74/5.76	[ Invariant Graph ]
5.74/5.76	Strengthening and disabling transitions...
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {fvalue3^0 -> undef12, up5^0 -> -1 + low6^0, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	[ Termination Graph ]
5.74/5.76	Strengthening and disabling transitions...
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	New Graphs: 
5.74/5.76	Calling Safety with literal 1 + up5^0 <= low6^0 and entry <l0, l3, 1 + fvalue3^0 = 0 /\ __const_14^0 = up5^0 /\ low6^0 = 0, {all remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL check - Post:1 + up5^0 <= low6^0 - Process 1
5.74/5.76	* Exit transition: <l0, l3, 1 + fvalue3^0 = 0 /\ __const_14^0 = up5^0 /\ low6^0 = 0, {all remain the same}>
5.74/5.76	* Postcondition  : 1 + up5^0 <= low6^0
5.74/5.76	
5.74/5.76	LOG: CALL solveLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear - Elapsed time: 0.000920s
5.74/5.76	> Postcondition is not implied!
5.74/5.76	
5.74/5.76	LOG: RETURN check - Elapsed time: 0.001046s
5.74/5.76	INVARIANTS: 
5.74/5.76	3: 
5.74/5.76	Quasi-INVARIANTS to narrow Graph: 
5.74/5.76	3: 1 + up5^0 <= low6^0 , 
5.74/5.76	Narrowing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: Narrow transition size 1
5.74/5.76	Narrowing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: Narrow transition size 1
5.74/5.76	It's unfeasible. Removing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {fvalue3^0 -> undef12, up5^0 -> -1 + low6^0, rest remain the same}>
5.74/5.76	Narrowing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: Narrow transition size 1
5.74/5.76	Narrowing transition: 
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: Narrow transition size 1
5.74/5.76	invGraph after Narrowing: 
5.74/5.76	Transitions:
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	Variables:
5.74/5.76	low6^0, up5^0, fvalue3^0
5.74/5.76	Checking conditional termination of SCC {l3}...
5.74/5.76	
5.74/5.76	LOG: CALL solveLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear - Elapsed time: 0.001189s
5.74/5.76	
5.74/5.76	LOG: CALL solveLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear - Elapsed time: 0.006448s
5.74/5.76	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009542s
5.74/5.76	Time used: 0.009156
5.74/5.76	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009822s
5.74/5.76	Time used: 0.008818
5.74/5.76	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009951s
5.74/5.76	Time used: 0.009004
5.74/5.76	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009912s
5.74/5.76	Time used: 0.008923
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030423s
5.74/5.76	Time used: 0.029461
5.74/5.76	Solving with 2 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004617s
5.74/5.76	Time used: 4.00117
5.74/5.76	Solving with 3 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.030510s
5.74/5.76	Time used: 1.0013
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038247s
5.74/5.76	Time used: 0.034242
5.74/5.76	
5.74/5.76	Proving non-termination of subgraph 1
5.74/5.76	Transitions:
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	Variables:
5.74/5.76	low6^0, up5^0, fvalue3^0
5.74/5.76	
5.74/5.76	Checking conditional non-termination of SCC {l3}...
5.74/5.76	EXIT TRANSITIONS:
5.74/5.76	<l3, end, 1 + up5^0 <= low6^0, {all remain the same}>
5.74/5.76	
5.74/5.76	Solving with 1 template(s).
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetFirstSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033710s
5.74/5.76	Time used: 0.033389
5.74/5.76	Improving Solution with cost 1 ...
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinearGetNextSolution
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.141622s
5.74/5.76	Time used: 0.141612
5.74/5.76	
5.74/5.76	LOG: SAT solveNonLinear - Elapsed time: 0.175332s
5.74/5.76	Cost: 1; Total time: 0.175001
5.74/5.76	Failed at location 3: 1 + low6^0 <= up5^0
5.74/5.76	Before Improving: 
5.74/5.76	Quasi-invariant at l3: 1 + low6^0 <= up5^0
5.74/5.76	Optimizing invariants...
5.74/5.76	
5.74/5.76	LOG: CALL solveLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear - Elapsed time: 0.026714s
5.74/5.76	Remaining time after improvement: 0.997921
5.74/5.76	Minimizing number of undef constraints...
5.74/5.76	
5.74/5.76	LOG: CALL solveNonLinear
5.74/5.76	
5.74/5.76	LOG: RETURN solveNonLinear - Elapsed time: 0.004631s
5.74/5.76	Non-termination implied by a set of quasi-invariant(s):
5.74/5.76	Quasi-invariant at l3: 1 + low6^0 <= up5^0
5.74/5.76	Constraint over undef '1 + undef41 <= low6^0' in transition:
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	Constraint over undef '1 + up5^0 <= undef41' in transition:
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	Constraint over undef '1 + undef41 <= low6^0' in transition:
5.74/5.76	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	Constraint over undef '1 + up5^0 <= undef41' in transition:
5.74/5.76	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	Strengthening and disabling EXIT transitions...
5.74/5.76	Closed exits from l3: 1
5.74/5.76	
5.74/5.76	Strengthening and disabling transitions...
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	Strengthening transition (result): 
5.74/5.76	<l3, l3, 1 + low6^0 <= up5^0 /\ 1 + undef41 <= low6^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	Strengthening transition (result): 
5.74/5.76	<l3, l3, 1 + low6^0 <= up5^0 /\ 1 + up5^0 <= undef41, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	Strengthening transition (result): 
5.74/5.76	<l3, l3, 1 + low6^0 <= up5^0 /\ 1 + undef41 <= low6^0, {low6^0 -> 1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	LOG: CALL solverLinear in Graph for feasibility
5.74/5.76	
5.74/5.76	LOG: RETURN solveLinear in Graph for feasibility
5.74/5.76	Strengthening transition (result): 
5.74/5.76	<l3, l3, 1 + low6^0 <= up5^0 /\ 1 + up5^0 <= undef41, {up5^0 -> -1 + undef41, rest remain the same}>
5.74/5.76	
5.74/5.76	Calling reachability with...
5.74/5.76	Transition: <l3, end, true, {all remain the same}>
5.74/5.76	Conditions: 1 + low6^0 <= up5^0, 
5.74/5.76	OPEN EXITS: 
5.74/5.76	<l3, end, 1 + low6^0 <= up5^0, {all remain the same}>
5.74/5.76	
5.74/5.76	--- Reachability graph ---
5.74/5.76	> Graph without transitions.
5.74/5.76	
5.74/5.76	Calling reachability with...
5.74/5.76	Transition: <l0, l3, 1 + fvalue3^0 = 0 /\ __const_14^0 = up5^0 /\ low6^0 = 0, {all remain the same}>
5.74/5.76	Conditions: 1 + low6^0 <= up5^0, 
5.74/5.76	OPEN EXITS: 
5.74/5.76	<l0, l3, 1 + low6^0 <= up5^0 /\ 1 + fvalue3^0 = 0 /\ __const_14^0 = up5^0 /\ low6^0 = 0, {all remain the same}>
5.74/5.76	
5.74/5.76	> Conditions are reachable!
5.74/5.76	
5.74/5.76	Program does NOT terminate
5.74/5.76	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.74/5.76	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.74/5.76	EOF