5.06/5.12	NO
5.06/5.12	
5.06/5.12	Solver Timeout: 4
5.06/5.12	Global Timeout: 300
5.06/5.12	No parsing errors!
5.06/5.12	Init Location: 0
5.06/5.12	Transitions:
5.06/5.12	<l0, l5, true>
5.06/5.12	<l1, l2, true>
5.06/5.12	<l2, l3, ((0 + (~(1) * x_5^0)) <= 0)>
5.06/5.12	<l3, l2, true>
5.06/5.12	<l2, l4, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef7 = undef7), par{Result_4^0 -> undef7}>
5.06/5.12	<l5, l1, true>
5.06/5.12	
5.06/5.12	Fresh variables:
5.06/5.12	undef7, 
5.06/5.12	
5.06/5.12	Undef variables:
5.06/5.12	undef7, 
5.06/5.12	
5.06/5.12	Abstraction variables:
5.06/5.12	
5.06/5.12	Exit nodes:
5.06/5.12	
5.06/5.12	Accepting locations:
5.06/5.12	
5.06/5.12	Asserts:
5.06/5.12	
5.06/5.12	Preprocessed LLVMGraph
5.06/5.12	Init Location: 0
5.06/5.12	Transitions:
5.06/5.12	<l0, l2, true>
5.06/5.12	<l2, l2, ((0 + (~(1) * x_5^0)) <= 0)>
5.06/5.12	<l2, l4, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef7 = undef7)>
5.06/5.12	
5.06/5.12	Fresh variables:
5.06/5.12	undef7, 
5.06/5.12	
5.06/5.12	Undef variables:
5.06/5.12	undef7, 
5.06/5.12	
5.06/5.12	Abstraction variables:
5.06/5.12	
5.06/5.12	Exit nodes:
5.06/5.12	
5.06/5.12	Accepting locations:
5.06/5.12	
5.06/5.12	Asserts:
5.06/5.12	
5.06/5.12	*************************************************************
5.06/5.12	*******************************************************************************************
5.06/5.12	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.06/5.12	*******************************************************************************************
5.06/5.12	
5.06/5.12	Init Location: 0
5.06/5.12	Graph 0:
5.06/5.12	Transitions:
5.06/5.12	Variables:
5.06/5.12	
5.06/5.12	Graph 1:
5.06/5.12	Transitions:
5.06/5.12	<l2, l2, 0 <= x_5^0, {all remain the same}>
5.06/5.12	Variables:
5.06/5.12	x_5^0
5.06/5.12	
5.06/5.12	Graph 2:
5.06/5.12	Transitions:
5.06/5.12	Variables:
5.06/5.12	
5.06/5.12	Precedence: 
5.06/5.12	Graph 0
5.06/5.12	
5.06/5.12	Graph 1
5.06/5.12	<l0, l2, true, {all remain the same}>
5.06/5.12	
5.06/5.12	Graph 2
5.06/5.12	<l2, l4, 1 + x_5^0 <= 0, {all remain the same}>
5.06/5.12	
5.06/5.12	Map Locations to Subgraph:
5.06/5.12	( 0 , 0 )
5.06/5.12	( 2 , 1 )
5.06/5.12	( 4 , 2 )
5.06/5.12	
5.06/5.12	*******************************************************************************************
5.06/5.12	********************************    CHECKING ASSERTIONS    ********************************
5.06/5.12	*******************************************************************************************
5.06/5.12	
5.06/5.12	Proving termination of subgraph 0
5.06/5.12	Proving termination of subgraph 1
5.06/5.12	Checking unfeasibility...
5.06/5.12	Time used: 0.001476
5.06/5.12	
5.06/5.12	> No variable changes in termination graph.
5.06/5.12	Checking conditional unfeasibility...
5.06/5.12	Calling Safety with literal 1 + x_5^0 <= 0 and entry <l2, l2, true, {all remain the same}>
5.06/5.12	
5.06/5.12	LOG: CALL check - Post:1 + x_5^0 <= 0 - Process 1
5.06/5.12	* Exit transition: <l2, l2, true, {all remain the same}>
5.06/5.12	* Postcondition  : 1 + x_5^0 <= 0
5.06/5.12	Postcodition moved up: 1 + x_5^0 <= 0
5.06/5.12	
5.06/5.12	LOG: Try proving POST
5.06/5.12	Postcondition: 1 + x_5^0 <= 0
5.06/5.12	
5.06/5.12	LOG: CALL check - Post:1 + x_5^0 <= 0 - Process 2
5.06/5.12	* Exit transition: <l0, l2, true, {all remain the same}>
5.06/5.12	* Postcondition  : 1 + x_5^0 <= 0
5.06/5.12	
5.06/5.12	LOG: CALL solveLinear
5.06/5.12	
5.06/5.12	LOG: RETURN solveLinear - Elapsed time: 0.000184s
5.06/5.12	> Postcondition is not implied!
5.06/5.12	
5.06/5.12	LOG: RETURN check - Elapsed time: 0.000248s
5.06/5.12	
5.06/5.12	LOG: NarrowEntry size 1
5.06/5.12	Narrowing transition: 
5.06/5.12	<l2, l2, 0 <= x_5^0, {all remain the same}>
5.06/5.12	
5.06/5.12	LOG: Narrow transition size 1
5.06/5.12	ENTRIES:
5.06/5.12	<l0, l2, 0 <= x_5^0, {all remain the same}>
5.06/5.12	END ENTRIES:
5.06/5.12	GRAPH:
5.06/5.12	<l2, l2, 0 <= x_5^0, {all remain the same}>
5.06/5.12	END GRAPH:
5.06/5.12	EXIT: <l2, l2, true, {all remain the same}>
5.06/5.12	POST: 1 + x_5^0 <= 0
5.06/5.12	
5.06/5.12	
5.06/5.12	LOG: Try proving POST
5.06/5.12	Solving with 1 template(s).
5.06/5.12	
5.06/5.12	LOG: CALL solveNonLinearGetFirstSolution
5.06/5.12	
5.06/5.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003075s
5.06/5.12	Time used: 0.002977
5.06/5.12	Solving with 2 template(s).
5.06/5.12	
5.06/5.12	LOG: CALL solveNonLinearGetFirstSolution
5.06/5.12	
5.06/5.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002043s
5.06/5.12	Time used: 4.00143
5.06/5.12	Solving with 3 template(s).
5.06/5.12	
5.06/5.12	LOG: CALL solveNonLinearGetFirstSolution
5.06/5.12	
5.06/5.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.020314s
5.06/5.12	Time used: 1.00053
5.06/5.12	
5.06/5.12	LOG: Postcondition is not implied - no solution
5.06/5.12	> Postcondition is not implied!
5.06/5.12	
5.06/5.12	LOG: RETURN check - Elapsed time: 5.056637s
5.06/5.12	
5.06/5.12	Proving non-termination of subgraph 1
5.06/5.12	Transitions:
5.06/5.12	<l2, l2, 0 <= x_5^0, {all remain the same}>
5.06/5.12	Variables:
5.06/5.12	x_5^0
5.06/5.12	
5.06/5.12	Checking conditional non-termination of SCC {l2}...
5.06/5.12	EXIT TRANSITIONS:
5.06/5.12	<l2, end, 1 + x_5^0 <= 0, {all remain the same}>
5.06/5.12	
5.06/5.12	Solving with 1 template(s).
5.06/5.12	
5.06/5.12	LOG: CALL solveNonLinearGetFirstSolution
5.06/5.12	
5.06/5.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002809s
5.06/5.12	Time used: 0.002671
5.06/5.12	Improving Solution with cost 1 ...
5.06/5.12	
5.06/5.12	LOG: CALL solveNonLinearGetNextSolution
5.06/5.12	
5.06/5.12	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.003813s
5.06/5.12	Time used: 0.003808
5.06/5.12	
5.06/5.12	LOG: SAT solveNonLinear - Elapsed time: 0.006622s
5.06/5.12	Cost: 1; Total time: 0.006479
5.06/5.12	Failed at location 2: 1 <= x_5^0
5.06/5.12	Before Improving: 
5.06/5.12	Quasi-invariant at l2: 1 <= x_5^0
5.06/5.12	Optimizing invariants...
5.06/5.12	
5.06/5.12	LOG: CALL solveLinear
5.06/5.12	
5.06/5.12	LOG: RETURN solveLinear - Elapsed time: 0.001250s
5.06/5.12	Remaining time after improvement: 0.999255
5.06/5.12	Non-termination implied by a set of quasi-invariant(s):
5.06/5.12	Quasi-invariant at l2: 1 <= x_5^0
5.06/5.12	
5.06/5.12	Strengthening and disabling EXIT transitions...
5.06/5.12	Closed exits from l2: 1
5.06/5.12	
5.06/5.12	Strengthening and disabling transitions...
5.06/5.12	
5.06/5.12	LOG: CALL solverLinear in Graph for feasibility
5.06/5.12	
5.06/5.12	LOG: RETURN solveLinear in Graph for feasibility
5.06/5.12	Strengthening transition (result): 
5.06/5.12	<l2, l2, 1 <= x_5^0, {all remain the same}>
5.06/5.12	
5.06/5.12	Calling reachability with...
5.06/5.12	Transition: <l2, end, true, {all remain the same}>
5.06/5.12	Conditions: 1 <= x_5^0, 
5.06/5.12	OPEN EXITS: 
5.06/5.12	<l2, end, true, {all remain the same}> (condsUp: 1 <= x_5^0)
5.06/5.12	
5.06/5.12	--- Reachability graph ---
5.06/5.12	> Graph without transitions.
5.06/5.12	
5.06/5.12	Calling reachability with...
5.06/5.12	Transition: <l0, l2, true, {all remain the same}>
5.06/5.12	Conditions: 1 <= x_5^0, 
5.06/5.12	OPEN EXITS: 
5.06/5.12	<l0, l2, 1 <= x_5^0, {all remain the same}>
5.06/5.13	
5.06/5.13	> Conditions are reachable!
5.06/5.13	
5.06/5.13	Program does NOT terminate
5.06/5.13	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.06/5.13	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.06/5.13	EOF