15.56/15.60	NO
15.56/15.60	
15.56/15.61	Solver Timeout: 4
15.56/15.61	Global Timeout: 300
15.56/15.61	No parsing errors!
15.56/15.61	Init Location: 0
15.56/15.61	Transitions:
15.56/15.61	<l0, l7, true>
15.56/15.61	<l1, l2, true>
15.56/15.61	<l1, l3, (undef8 = undef8), par{fvalue3^0 -> undef8, up5^0 -> (~(1) + low6^0)}>
15.56/15.61	<l1, l2, true>
15.56/15.61	<l4, l5, ((1 + up5^0) <= (0 + low6^0)) /\ (undef25 = (0 + fvalue3^0)), par{ret_binary_search7^0 -> undef25, tmp^0 -> (0 + undef25)}>
15.56/15.61	<l4, l1, ((0 + low6^0) <= (0 + up5^0)) /\ (undef31 = undef31), par{mid4^0 -> undef31}>
15.56/15.61	<l3, l4, true>
15.56/15.61	<l2, l3, true, par{low6^0 -> (1 + mid4^0)}>
15.56/15.61	<l2, l3, true, par{up5^0 -> (~(1) + mid4^0)}>
15.56/15.61	<l6, l3, true, par{fvalue3^0 -> ~(1), low6^0 -> 0, up5^0 -> 14, x2^0 -> 8}>
15.56/15.61	<l7, l6, true>
15.56/15.61	
15.56/15.61	Fresh variables:
15.56/15.61	undef8, undef25, undef31, 
15.56/15.61	
15.56/15.61	Undef variables:
15.56/15.61	undef8, undef25, undef31, 
15.56/15.61	
15.56/15.61	Abstraction variables:
15.56/15.61	
15.56/15.61	Exit nodes:
15.56/15.61	
15.56/15.61	Accepting locations:
15.56/15.61	
15.56/15.61	Asserts:
15.56/15.61	
15.56/15.61	Preprocessed LLVMGraph
15.56/15.61	Init Location: 0
15.56/15.61	Transitions:
15.56/15.61	<l0, l3, (fvalue3^0 = ~(1)) /\ (low6^0 = 0) /\ (up5^0 = 14)>
15.56/15.61	<l3, l5, ((1 + up5^0) <= (0 + low6^0)) /\ (undef25 = (0 + fvalue3^0))>
15.56/15.61	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef31 = undef31), par{low6^0 -> (1 + undef31)}>
15.56/15.61	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef31 = undef31), par{up5^0 -> (~(1) + undef31)}>
15.56/15.61	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef31 = undef31) /\ (undef8 = undef8), par{fvalue3^0 -> undef8, up5^0 -> (~(1) + low6^0)}>
15.56/15.61	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef31 = undef31), par{low6^0 -> (1 + undef31)}>
15.56/15.61	<l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef31 = undef31), par{up5^0 -> (~(1) + undef31)}>
15.56/15.61	
15.56/15.61	Fresh variables:
15.56/15.61	undef8, undef25, undef31, 
15.56/15.61	
15.56/15.61	Undef variables:
15.56/15.61	undef8, undef25, undef31, 
15.56/15.61	
15.56/15.61	Abstraction variables:
15.56/15.61	
15.56/15.61	Exit nodes:
15.56/15.61	
15.56/15.61	Accepting locations:
15.56/15.61	
15.56/15.61	Asserts:
15.56/15.61	
15.56/15.61	*************************************************************
15.56/15.61	*******************************************************************************************
15.56/15.61	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
15.56/15.61	*******************************************************************************************
15.56/15.61	
15.56/15.61	Init Location: 0
15.56/15.61	Graph 0:
15.56/15.61	Transitions:
15.56/15.61	Variables:
15.56/15.61	
15.56/15.61	Graph 1:
15.56/15.61	Transitions:
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {fvalue3^0 -> undef8, up5^0 -> -1 + low6^0, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	Variables:
15.56/15.61	low6^0, up5^0, fvalue3^0
15.56/15.61	
15.56/15.61	Graph 2:
15.56/15.61	Transitions:
15.56/15.61	Variables:
15.56/15.61	
15.56/15.61	Precedence: 
15.56/15.61	Graph 0
15.56/15.61	
15.56/15.61	Graph 1
15.56/15.61	<l0, l3, 1 + fvalue3^0 = 0 /\ low6^0 = 0 /\ up5^0 = 14, {all remain the same}>
15.56/15.61	
15.56/15.61	Graph 2
15.56/15.61	<l3, l5, 1 + up5^0 <= low6^0 /\ fvalue3^0 = undef25, {all remain the same}>
15.56/15.61	
15.56/15.61	Map Locations to Subgraph:
15.56/15.61	( 0 , 0 )
15.56/15.61	( 3 , 1 )
15.56/15.61	( 5 , 2 )
15.56/15.61	
15.56/15.61	*******************************************************************************************
15.56/15.61	********************************    CHECKING ASSERTIONS    ********************************
15.56/15.61	*******************************************************************************************
15.56/15.61	
15.56/15.61	Proving termination of subgraph 0
15.56/15.61	Proving termination of subgraph 1
15.56/15.61	Checking unfeasibility...
15.56/15.61	Time used: 0.013699
15.56/15.61	
15.56/15.61	Checking conditional termination of SCC {l3}...
15.56/15.61	
15.56/15.61	LOG: CALL solveLinear
15.56/15.61	
15.56/15.61	LOG: RETURN solveLinear - Elapsed time: 0.002048s
15.56/15.61	
15.56/15.61	LOG: CALL solveLinear
15.56/15.61	
15.56/15.61	LOG: RETURN solveLinear - Elapsed time: 0.008318s
15.56/15.61	Piecewise ranking function: min(1 - 3*low6^0 + 3*up5^0,0)
15.56/15.61	New Graphs: 
15.56/15.61	Transitions:
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	Variables:
15.56/15.61	low6^0, up5^0
15.56/15.61	Checking conditional termination of SCC {l3}...
15.56/15.61	
15.56/15.61	LOG: CALL solveLinear
15.56/15.61	
15.56/15.61	LOG: RETURN solveLinear - Elapsed time: 0.001156s
15.56/15.61	
15.56/15.61	LOG: CALL solveLinear
15.56/15.61	
15.56/15.61	LOG: RETURN solveLinear - Elapsed time: 0.006229s
15.56/15.61	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	Solving with 1 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010612s
15.56/15.61	Time used: 0.010236
15.56/15.61	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	Solving with 1 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009776s
15.56/15.61	Time used: 0.00884
15.56/15.61	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	Solving with 1 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009545s
15.56/15.61	Time used: 0.008724
15.56/15.61	Trying to remove transition: <l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	Solving with 1 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009496s
15.56/15.61	Time used: 0.008666
15.56/15.61	Solving with 1 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044317s
15.56/15.61	Time used: 0.043484
15.56/15.61	Solving with 2 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005371s
15.56/15.61	Time used: 4.00132
15.56/15.61	Solving with 3 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.036720s
15.56/15.61	Time used: 1.00146
15.56/15.61	Solving with 1 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041785s
15.56/15.61	Time used: 0.03661
15.56/15.61	Termination failed. Trying to show unreachability...
15.56/15.61	Proving unreachability of entry: <l0, l3, 1 + fvalue3^0 = 0 /\ low6^0 = 0 /\ up5^0 = 14, {all remain the same}>
15.56/15.61	
15.56/15.61	LOG: CALL check - Post:1 <= 0 - Process 1
15.56/15.61	* Exit transition: <l0, l3, 1 + fvalue3^0 = 0 /\ low6^0 = 0 /\ up5^0 = 14, {all remain the same}>
15.56/15.61	* Postcondition  : 1 <= 0
15.56/15.61	
15.56/15.61	LOG: CALL solveLinear
15.56/15.61	
15.56/15.61	LOG: RETURN solveLinear - Elapsed time: 0.005984s
15.56/15.61	> Postcondition is not implied!
15.56/15.61	
15.56/15.61	LOG: RETURN check - Elapsed time: 0.006115s
15.56/15.61	Cannot prove unreachability
15.56/15.61	
15.56/15.61	Proving non-termination of subgraph 1
15.56/15.61	Transitions:
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {fvalue3^0 -> undef8, up5^0 -> -1 + low6^0, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	Variables:
15.56/15.61	low6^0, up5^0, fvalue3^0
15.56/15.61	
15.56/15.61	Checking conditional non-termination of SCC {l3}...
15.56/15.61	EXIT TRANSITIONS:
15.56/15.61	<l3, end, 1 + up5^0 <= low6^0, {all remain the same}>
15.56/15.61	
15.56/15.61	Solving with 1 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.090169s
15.56/15.61	Time used: 0.090061
15.56/15.61	Solving with 2 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.057084s
15.56/15.61	Time used: 5.05216
15.56/15.61	Solving with 3 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.021664s
15.56/15.61	Time used: 5.00034
15.56/15.61	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
15.56/15.61	
15.56/15.61	Proving non-termination of subgraph 1
15.56/15.61	Transitions:
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	Variables:
15.56/15.61	low6^0, up5^0
15.56/15.61	
15.56/15.61	Checking conditional non-termination of SCC {l3}...
15.56/15.61	EXIT TRANSITIONS:
15.56/15.61	<l3, end, 1 + up5^0 <= low6^0, {all remain the same}>
15.56/15.61	
15.56/15.61	Solving with 1 template(s).
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinearGetFirstSolution
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030013s
15.56/15.61	Time used: 0.029907
15.56/15.61	
15.56/15.61	LOG: SAT solveNonLinear - Elapsed time: 0.030013s
15.56/15.61	Cost: 0; Total time: 0.029907
15.56/15.61	Minimizing number of undef constraints...
15.56/15.61	
15.56/15.61	LOG: CALL solveNonLinear
15.56/15.61	
15.56/15.61	LOG: RETURN solveNonLinear - Elapsed time: 0.008469s
15.56/15.61	Non-termination implied by a set of quasi-invariant(s):
15.56/15.61	Quasi-invariant at l3: 1 + low6^0 <= up5^0
15.56/15.61	Constraint over undef '1 + undef31 <= low6^0' in transition:
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	Constraint over undef '1 + up5^0 <= undef31' in transition:
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	Constraint over undef '1 + undef31 <= low6^0' in transition:
15.56/15.61	<l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	Constraint over undef '1 + up5^0 <= undef31' in transition:
15.56/15.61	<l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	
15.56/15.61	Strengthening and disabling EXIT transitions...
15.56/15.61	Closed exits from l3: 1
15.56/15.61	
15.56/15.61	Strengthening and disabling transitions...
15.56/15.61	
15.56/15.61	LOG: CALL solverLinear in Graph for feasibility
15.56/15.61	
15.56/15.61	LOG: RETURN solveLinear in Graph for feasibility
15.56/15.61	Strengthening transition (result): 
15.56/15.61	<l3, l3, 1 + low6^0 <= up5^0 /\ 1 + undef31 <= low6^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	
15.56/15.61	LOG: CALL solverLinear in Graph for feasibility
15.56/15.61	
15.56/15.61	LOG: RETURN solveLinear in Graph for feasibility
15.56/15.61	Strengthening transition (result): 
15.56/15.61	<l3, l3, 1 + low6^0 <= up5^0 /\ 1 + up5^0 <= undef31, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	
15.56/15.61	LOG: CALL solverLinear in Graph for feasibility
15.56/15.61	
15.56/15.61	LOG: RETURN solveLinear in Graph for feasibility
15.56/15.61	Strengthening transition (result): 
15.56/15.61	<l3, l3, 1 + low6^0 <= up5^0 /\ 1 + undef31 <= low6^0, {low6^0 -> 1 + undef31, rest remain the same}>
15.56/15.61	
15.56/15.61	LOG: CALL solverLinear in Graph for feasibility
15.56/15.61	
15.56/15.61	LOG: RETURN solveLinear in Graph for feasibility
15.56/15.61	Strengthening transition (result): 
15.56/15.61	<l3, l3, 1 + low6^0 <= up5^0 /\ 1 + up5^0 <= undef31, {up5^0 -> -1 + undef31, rest remain the same}>
15.56/15.61	
15.56/15.61	Calling reachability with...
15.56/15.61	Transition: <l3, end, true, {all remain the same}>
15.56/15.61	Conditions: 1 + low6^0 <= up5^0, 
15.56/15.61	OPEN EXITS: 
15.56/15.61	<l3, end, 1 + low6^0 <= up5^0, {all remain the same}>
15.56/15.61	
15.56/15.61	--- Reachability graph ---
15.56/15.61	> Graph without transitions.
15.56/15.61	
15.56/15.61	Calling reachability with...
15.56/15.61	Transition: <l0, l3, 1 + fvalue3^0 = 0 /\ low6^0 = 0 /\ up5^0 = 14, {all remain the same}>
15.56/15.61	Conditions: 1 + low6^0 <= up5^0, 
15.56/15.61	OPEN EXITS: 
15.56/15.61	<l0, l3, 1 + low6^0 <= up5^0 /\ 1 + fvalue3^0 = 0 /\ low6^0 = 0 /\ up5^0 = 14, {all remain the same}>
15.56/15.61	
15.56/15.61	> Conditions are reachable!
15.56/15.61	
15.56/15.61	Program does NOT terminate
15.56/15.61	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
15.56/15.61	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
15.56/15.61	EOF