5.11/5.13	NO
5.11/5.13	
5.11/5.13	Solver Timeout: 4
5.11/5.13	Global Timeout: 300
5.11/5.13	No parsing errors!
5.11/5.13	Init Location: 0
5.11/5.13	Transitions:
5.11/5.13	<l0, l5, true>
5.11/5.13	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
5.11/5.13	<l1, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef15 = (0 + cnt_15^0)) /\ (undef10 = undef10), par{lt_9^0 -> undef10}>
5.11/5.13	<l3, l1, true>
5.11/5.13	<l4, l1, (undef29 = undef29), par{p_8^0 -> (0 + undef29), z_7^0 -> undef29}>
5.11/5.13	<l5, l4, true>
5.11/5.13	
5.11/5.13	Fresh variables:
5.11/5.13	undef1, undef10, undef15, undef29, 
5.11/5.13	
5.11/5.13	Undef variables:
5.11/5.13	undef1, undef10, undef15, undef29, 
5.11/5.13	
5.11/5.13	Abstraction variables:
5.11/5.13	
5.11/5.13	Exit nodes:
5.11/5.13	
5.11/5.13	Accepting locations:
5.11/5.13	
5.11/5.13	Asserts:
5.11/5.13	
5.11/5.13	Preprocessed LLVMGraph
5.11/5.13	Init Location: 0
5.11/5.13	Transitions:
5.11/5.13	<l0, l1, (undef29 = undef29)>
5.11/5.13	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1)>
5.11/5.13	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef15 = (0 + cnt_15^0)) /\ (undef10 = undef10)>
5.11/5.13	
5.11/5.13	Fresh variables:
5.11/5.13	undef1, undef10, undef15, undef29, 
5.11/5.13	
5.11/5.13	Undef variables:
5.11/5.13	undef1, undef10, undef15, undef29, 
5.11/5.13	
5.11/5.13	Abstraction variables:
5.11/5.13	
5.11/5.13	Exit nodes:
5.11/5.13	
5.11/5.13	Accepting locations:
5.11/5.13	
5.11/5.13	Asserts:
5.11/5.13	
5.11/5.13	*************************************************************
5.11/5.13	*******************************************************************************************
5.11/5.13	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.11/5.13	*******************************************************************************************
5.11/5.13	
5.11/5.13	Init Location: 0
5.11/5.13	Graph 0:
5.11/5.13	Transitions:
5.11/5.13	Variables:
5.11/5.13	
5.11/5.13	Graph 1:
5.11/5.13	Transitions:
5.11/5.13	<l1, l1, 1 + x_5^0 <= y_6^0 /\ cnt_15^0 = undef15, {all remain the same}>
5.11/5.13	Variables:
5.11/5.13	cnt_15^0, x_5^0, y_6^0
5.11/5.13	
5.11/5.13	Graph 2:
5.11/5.13	Transitions:
5.11/5.13	Variables:
5.11/5.13	
5.11/5.13	Precedence: 
5.11/5.13	Graph 0
5.11/5.13	
5.11/5.13	Graph 1
5.11/5.13	<l0, l1, true, {all remain the same}>
5.11/5.13	
5.11/5.13	Graph 2
5.11/5.13	<l1, l2, y_6^0 <= x_5^0, {all remain the same}>
5.11/5.13	
5.11/5.13	Map Locations to Subgraph:
5.11/5.13	( 0 , 0 )
5.11/5.13	( 1 , 1 )
5.11/5.13	( 2 , 2 )
5.11/5.13	
5.11/5.13	*******************************************************************************************
5.11/5.13	********************************    CHECKING ASSERTIONS    ********************************
5.11/5.13	*******************************************************************************************
5.11/5.13	
5.11/5.13	Proving termination of subgraph 0
5.11/5.13	Proving termination of subgraph 1
5.11/5.13	Checking unfeasibility...
5.11/5.13	Time used: 0.002271
5.11/5.13	
5.11/5.13	> No variable changes in termination graph.
5.11/5.13	Checking conditional unfeasibility...
5.11/5.13	Calling Safety with literal y_6^0 <= x_5^0 and entry <l1, l1, true, {all remain the same}>
5.11/5.13	
5.11/5.13	LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 1
5.11/5.13	* Exit transition: <l1, l1, true, {all remain the same}>
5.11/5.13	* Postcondition  : y_6^0 <= x_5^0
5.11/5.13	Postcodition moved up: y_6^0 <= x_5^0
5.11/5.13	
5.11/5.13	LOG: Try proving POST
5.11/5.13	Postcondition: y_6^0 <= x_5^0
5.11/5.13	
5.11/5.13	LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 2
5.11/5.13	* Exit transition: <l0, l1, true, {all remain the same}>
5.11/5.13	* Postcondition  : y_6^0 <= x_5^0
5.11/5.13	
5.11/5.13	LOG: CALL solveLinear
5.11/5.13	
5.11/5.13	LOG: RETURN solveLinear - Elapsed time: 0.000253s
5.11/5.13	> Postcondition is not implied!
5.11/5.13	
5.11/5.13	LOG: RETURN check - Elapsed time: 0.000328s
5.11/5.13	
5.11/5.13	LOG: NarrowEntry size 1
5.11/5.13	Narrowing transition: 
5.11/5.13	<l1, l1, 1 + x_5^0 <= y_6^0 /\ cnt_15^0 = undef15, {all remain the same}>
5.11/5.13	
5.11/5.13	LOG: Narrow transition size 1
5.11/5.13	ENTRIES:
5.11/5.13	<l0, l1, 1 + x_5^0 <= y_6^0, {all remain the same}>
5.11/5.13	END ENTRIES:
5.11/5.13	GRAPH:
5.11/5.13	<l1, l1, 1 + x_5^0 <= y_6^0 /\ cnt_15^0 = undef15, {all remain the same}>
5.11/5.13	END GRAPH:
5.11/5.13	EXIT: <l1, l1, true, {all remain the same}>
5.11/5.13	POST: y_6^0 <= x_5^0
5.11/5.13	
5.11/5.13	
5.11/5.13	LOG: Try proving POST
5.11/5.13	Solving with 1 template(s).
5.11/5.13	
5.11/5.13	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.13	
5.11/5.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007637s
5.11/5.13	Time used: 0.007535
5.11/5.13	Solving with 2 template(s).
5.11/5.13	
5.11/5.13	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.13	
5.11/5.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000749s
5.11/5.13	Time used: 4.00031
5.11/5.13	Solving with 3 template(s).
5.11/5.13	
5.11/5.13	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.13	
5.11/5.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.001845s
5.11/5.13	Time used: 1.0001
5.11/5.13	
5.11/5.13	LOG: Postcondition is not implied - no solution
5.11/5.13	> Postcondition is not implied!
5.11/5.13	
5.11/5.13	LOG: RETURN check - Elapsed time: 5.016100s
5.11/5.13	
5.11/5.13	Proving non-termination of subgraph 1
5.11/5.13	Transitions:
5.11/5.13	<l1, l1, 1 + x_5^0 <= y_6^0 /\ cnt_15^0 = undef15, {all remain the same}>
5.11/5.13	Variables:
5.11/5.13	cnt_15^0, x_5^0, y_6^0
5.11/5.13	
5.11/5.13	Checking that every undef value has an assignment...
5.11/5.13	
5.11/5.13	LOG: CALL solveLinear
5.11/5.13	
5.11/5.13	LOG: RETURN solveLinear - Elapsed time: 0.000920s
5.11/5.13	Checking conditional non-termination of SCC {l1}...
5.11/5.13	EXIT TRANSITIONS:
5.11/5.13	<l1, end, y_6^0 <= x_5^0, {all remain the same}>
5.11/5.13	
5.11/5.13	Solving with 1 template(s).
5.11/5.13	
5.11/5.13	LOG: CALL solveNonLinearGetFirstSolution
5.11/5.13	
5.11/5.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016791s
5.11/5.13	Time used: 0.01655
5.11/5.13	Improving Solution with cost 1 ...
5.11/5.13	
5.11/5.13	LOG: CALL solveNonLinearGetNextSolution
5.11/5.13	
5.11/5.13	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.047341s
5.11/5.13	Time used: 0.047336
5.11/5.13	
5.11/5.13	LOG: SAT solveNonLinear - Elapsed time: 0.064133s
5.11/5.13	Cost: 1; Total time: 0.063886
5.11/5.13	Failed at location 1: 1 + x_5^0 <= y_6^0
5.11/5.13	Before Improving: 
5.11/5.13	Quasi-invariant at l1: 1 + x_5^0 <= y_6^0
5.11/5.13	Optimizing invariants...
5.11/5.13	
5.11/5.13	LOG: CALL solveLinear
5.11/5.13	
5.11/5.13	LOG: RETURN solveLinear - Elapsed time: 0.007984s
5.11/5.13	Remaining time after improvement: 0.998593
5.11/5.13	Minimizing number of undef constraints...
5.11/5.13	
5.11/5.13	LOG: CALL solveNonLinear
5.11/5.13	
5.11/5.13	LOG: RETURN solveNonLinear - Elapsed time: 0.002311s
5.11/5.13	Number of undef constraints reduced!
5.11/5.13	
5.11/5.13	Non-termination implied by a set of quasi-invariant(s):
5.11/5.13	Quasi-invariant at l1: 1 + x_5^0 <= y_6^0
5.11/5.13	
5.11/5.13	Strengthening and disabling EXIT transitions...
5.11/5.13	Closed exits from l1: 1
5.11/5.13	
5.11/5.13	Strengthening and disabling transitions...
5.11/5.13	
5.11/5.13	LOG: CALL solverLinear in Graph for feasibility
5.11/5.13	
5.11/5.13	LOG: RETURN solveLinear in Graph for feasibility
5.11/5.13	Strengthening transition (result): 
5.11/5.13	<l1, l1, 1 + x_5^0 <= y_6^0 /\ cnt_15^0 = undef15, {all remain the same}>
5.11/5.13	
5.11/5.13	Calling reachability with...
5.11/5.13	Transition: <l1, end, true, {all remain the same}>
5.11/5.13	Conditions: 1 + x_5^0 <= y_6^0, 
5.11/5.13	OPEN EXITS: 
5.11/5.13	<l1, end, true, {all remain the same}> (condsUp: 1 + x_5^0 <= y_6^0)
5.11/5.13	
5.11/5.13	--- Reachability graph ---
5.11/5.13	> Graph without transitions.
5.11/5.13	
5.11/5.13	Calling reachability with...
5.11/5.13	Transition: <l0, l1, true, {all remain the same}>
5.11/5.13	Conditions: 1 + x_5^0 <= y_6^0, 
5.11/5.13	OPEN EXITS: 
5.11/5.13	<l0, l1, 1 + x_5^0 <= y_6^0, {all remain the same}>
5.11/5.13	
5.11/5.13	> Conditions are reachable!
5.11/5.13	
5.11/5.13	Program does NOT terminate
5.11/5.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.11/5.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.11/5.13	EOF