5.12/5.16	NO
5.12/5.16	
5.12/5.16	Solver Timeout: 4
5.12/5.16	Global Timeout: 300
5.12/5.16	No parsing errors!
5.12/5.16	Init Location: 0
5.12/5.16	Transitions:
5.12/5.16	<l0, l10, true>
5.12/5.16	<l1, l2, true>
5.12/5.16	<l3, l4, true>
5.12/5.16	<l5, l6, true>
5.12/5.16	<l7, l8, true>
5.12/5.16	<l8, l7, true>
5.12/5.16	<l4, l3, (1 <= (0 + n^0))>
5.12/5.16	<l4, l1, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33), par{R^0 -> 0, __rho_1_^0 -> undef33, dobreak^0 -> (0 + undef33)}>
5.12/5.16	<l2, l3, ((0 + dobreak^0) <= 0) /\ (undef42 = 1) /\ (undef39 = undef39), par{A^0 -> 0, __rho_1_^0 -> undef39, n^0 -> (0 + undef39)}>
5.12/5.16	<l2, l7, (1 <= (0 + dobreak^0))>
5.12/5.16	<l9, l1, (undef50 = undef50), par{A^0 -> 0, R^0 -> 0, __rho_1_^0 -> undef50, dobreak^0 -> (0 + undef50)}>
5.12/5.16	<l10, l9, true>
5.12/5.16	
5.12/5.16	Fresh variables:
5.12/5.16	undef33, undef36, undef39, undef42, undef50, 
5.12/5.16	
5.12/5.16	Undef variables:
5.12/5.16	undef33, undef36, undef39, undef42, undef50, 
5.12/5.16	
5.12/5.16	Abstraction variables:
5.12/5.16	
5.12/5.16	Exit nodes:
5.12/5.16	
5.12/5.16	Accepting locations:
5.12/5.16	
5.12/5.16	Asserts:
5.12/5.16	
5.12/5.16	Preprocessed LLVMGraph
5.12/5.16	Init Location: 0
5.12/5.16	Transitions:
5.12/5.16	<l0, l3, (undef50 = undef50) /\ ((0 + (0 + undef50)) <= 0) /\ (undef42 = 1) /\ (undef39 = undef39), par{n^0 -> (0 + undef39)}>
5.12/5.16	<l0, l7, (undef50 = undef50) /\ (1 <= (0 + (0 + undef50)))>
5.12/5.16	<l3, l3, (1 <= (0 + n^0))>
5.12/5.16	<l3, l3, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ ((0 + (0 + undef33)) <= 0) /\ (undef42 = 1) /\ (undef39 = undef39), par{n^0 -> (0 + undef39)}>
5.12/5.16	<l3, l7, ((0 + n^0) <= 0) /\ (undef36 = 1) /\ (undef33 = undef33) /\ (1 <= (0 + (0 + undef33)))>
5.12/5.16	<l7, l7, true>
5.12/5.16	
5.12/5.16	Fresh variables:
5.12/5.16	undef33, undef36, undef39, undef42, undef50, 
5.12/5.16	
5.12/5.16	Undef variables:
5.12/5.16	undef33, undef36, undef39, undef42, undef50, 
5.12/5.16	
5.12/5.16	Abstraction variables:
5.12/5.16	
5.12/5.16	Exit nodes:
5.12/5.16	
5.12/5.16	Accepting locations:
5.12/5.16	
5.12/5.16	Asserts:
5.12/5.16	
5.12/5.16	*************************************************************
5.12/5.16	*******************************************************************************************
5.12/5.16	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.12/5.16	*******************************************************************************************
5.12/5.16	
5.12/5.16	Init Location: 0
5.12/5.16	Graph 0:
5.12/5.16	Transitions:
5.12/5.16	Variables:
5.12/5.16	
5.12/5.16	Graph 1:
5.12/5.16	Transitions:
5.12/5.16	<l3, l3, 1 <= n^0, {all remain the same}>
5.12/5.16	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	Variables:
5.12/5.16	n^0
5.12/5.16	
5.12/5.16	Graph 2:
5.12/5.16	Transitions:
5.12/5.16	<l7, l7, true, {all remain the same}>
5.12/5.16	Variables:
5.12/5.16	
5.12/5.16	Precedence: 
5.12/5.16	Graph 0
5.12/5.16	
5.12/5.16	Graph 1
5.12/5.16	<l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	
5.12/5.16	Graph 2
5.12/5.16	<l0, l7, 1 <= undef50, {all remain the same}>
5.12/5.16	<l3, l7, 1 <= undef33 /\ n^0 <= 0 /\ undef36 = 1, {all remain the same}>
5.12/5.16	
5.12/5.16	Map Locations to Subgraph:
5.12/5.16	( 0 , 0 )
5.12/5.16	( 3 , 1 )
5.12/5.16	( 7 , 2 )
5.12/5.16	
5.12/5.16	*******************************************************************************************
5.12/5.16	********************************    CHECKING ASSERTIONS    ********************************
5.12/5.16	*******************************************************************************************
5.12/5.16	
5.12/5.16	Proving termination of subgraph 0
5.12/5.16	Proving termination of subgraph 1
5.12/5.16	Checking unfeasibility...
5.12/5.16	Time used: 0.002658
5.12/5.16	
5.12/5.16	Checking conditional termination of SCC {l3}...
5.12/5.16	
5.12/5.16	LOG: CALL solveLinear
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear - Elapsed time: 0.000637s
5.12/5.16	
5.12/5.16	LOG: CALL solveLinear
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear - Elapsed time: 0.001944s
5.12/5.16	Trying to remove transition: <l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	Solving with 1 template(s).
5.12/5.16	
5.12/5.16	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.16	
5.12/5.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004229s
5.12/5.16	Time used: 0.00409
5.12/5.16	Solving with 1 template(s).
5.12/5.16	
5.12/5.16	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.16	
5.12/5.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007386s
5.12/5.16	Time used: 0.007013
5.12/5.16	Improving Solution with cost 1 ...
5.12/5.16	
5.12/5.16	LOG: CALL solveNonLinearGetNextSolution
5.12/5.16	
5.12/5.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017346s
5.12/5.16	Time used: 0.01734
5.12/5.16	
5.12/5.16	LOG: SAT solveNonLinear - Elapsed time: 0.024733s
5.12/5.16	Cost: 1; Total time: 0.024353
5.12/5.16	Failed at location 3: 1 <= n^0
5.12/5.16	Before Improving: 
5.12/5.16	Quasi-invariant at l3: 1 <= n^0
5.12/5.16	Optimizing invariants...
5.12/5.16	
5.12/5.16	LOG: CALL solveLinear
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear - Elapsed time: 0.003066s
5.12/5.16	Remaining time after improvement: 0.998545
5.12/5.16	Termination implied by a set of quasi-invariant(s):
5.12/5.16	Quasi-invariant at l3: 1 <= n^0
5.12/5.16	[ Invariant Graph ]
5.12/5.16	Strengthening and disabling transitions...
5.12/5.16	
5.12/5.16	LOG: CALL solverLinear in Graph for feasibility
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear in Graph for feasibility
5.12/5.16	Strengthening transition (result): 
5.12/5.16	<l3, l3, 1 <= n^0, {all remain the same}>
5.12/5.16	
5.12/5.16	LOG: CALL solverLinear in Graph for feasibility
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear in Graph for feasibility
5.12/5.16	It's unfeasible. Removing transition: 
5.12/5.16	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	[ Termination Graph ]
5.12/5.16	Strengthening and disabling transitions...
5.12/5.16	
5.12/5.16	LOG: CALL solverLinear in Graph for feasibility
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear in Graph for feasibility
5.12/5.16	Strengthening transition (result): 
5.12/5.16	<l3, l3, 1 <= n^0, {all remain the same}>
5.12/5.16	
5.12/5.16	LOG: CALL solverLinear in Graph for feasibility
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear in Graph for feasibility
5.12/5.16	It's unfeasible. Removing transition: 
5.12/5.16	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	New Graphs: 
5.12/5.16	Transitions:
5.12/5.16	<l3, l3, 1 <= n^0, {all remain the same}>
5.12/5.16	Variables:
5.12/5.16	n^0
5.12/5.16	> No variable changes in termination graph.
5.12/5.16	Checking conditional unfeasibility...
5.12/5.16	Calling Safety with literal n^0 <= 0 and entry <l3, l3, true, {all remain the same}>
5.12/5.16	
5.12/5.16	LOG: CALL check - Post:n^0 <= 0 - Process 1
5.12/5.16	* Exit transition: <l3, l3, true, {all remain the same}>
5.12/5.16	* Postcondition  : n^0 <= 0
5.12/5.16	Quasi-invariants: 
5.12/5.16	Location 3: n^0 <= 0 ; undef39 <= 0 ; 
5.12/5.16	Postcondition: n^0 <= 0
5.12/5.16	
5.12/5.16	LOG: CALL check - Post:n^0 <= 0 - Process 2
5.12/5.16	* Exit transition: <l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	* Postcondition  : n^0 <= 0
5.12/5.16	
5.12/5.16	LOG: CALL solveLinear
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear - Elapsed time: 0.000357s
5.12/5.16	> Postcondition is not implied!
5.12/5.16	
5.12/5.16	LOG: RETURN check - Elapsed time: 0.000448s
5.12/5.16	Postcondition: undef39 <= 0
5.12/5.16	
5.12/5.16	LOG: CALL check - Post:undef39 <= 0 - Process 3
5.12/5.16	* Exit transition: <l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	* Postcondition  : undef39 <= 0
5.12/5.16	
5.12/5.16	LOG: CALL solveLinear
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear - Elapsed time: 0.000355s
5.12/5.16	> Postcondition is not implied!
5.12/5.16	
5.12/5.16	LOG: RETURN check - Elapsed time: 0.000433s
5.12/5.16	
5.12/5.16	LOG: NarrowEntry size 2
5.12/5.16	Narrowing transition: 
5.12/5.16	<l3, l3, 1 <= n^0, {all remain the same}>
5.12/5.16	
5.12/5.16	LOG: Narrow transition size 2
5.12/5.16	Narrowing transition: 
5.12/5.16	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	
5.12/5.16	LOG: Narrow transition size 2
5.12/5.16	ENTRIES:
5.12/5.16	<l0, l3, 1 <= undef39 /\ undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	END ENTRIES:
5.12/5.16	GRAPH:
5.12/5.16	<l3, l3, 1 <= n^0, {all remain the same}>
5.12/5.16	<l3, l3, 1 <= undef39 /\ n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	END GRAPH:
5.12/5.16	EXIT: <l3, l3, true, {all remain the same}>
5.12/5.16	POST: n^0 <= 0
5.12/5.16	
5.12/5.16	
5.12/5.16	LOG: Try proving POST
5.12/5.16	Solving with 1 template(s).
5.12/5.16	
5.12/5.16	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.16	
5.12/5.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004163s
5.12/5.16	Time used: 0.003998
5.12/5.16	Improving Solution with cost 50 ...
5.12/5.16	
5.12/5.16	LOG: CALL solveNonLinearGetNextSolution
5.12/5.16	
5.12/5.16	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008565s
5.12/5.16	Time used: 0.00856
5.12/5.16	
5.12/5.16	LOG: SAT solveNonLinear - Elapsed time: 0.012729s
5.12/5.16	Cost: 50; Total time: 0.012558
5.12/5.16	Some transition disabled by a set of invariant(s):
5.12/5.16	Invariant at l3: 1 <= n^0
5.12/5.16	Strengthening and disabling transitions...
5.12/5.16	> It's unfeasible. Removing transition: 
5.12/5.16	<l3, l3, 1 <= undef39 /\ n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	
5.12/5.16	LOG: CALL solverLinear in Graph for feasibility
5.12/5.16	
5.12/5.16	LOG: RETURN solveLinear in Graph for feasibility
5.12/5.16	Strengthening transition (result): 
5.12/5.16	<l3, l3, 1 <= n^0, {all remain the same}>
5.12/5.16	Solving with 1 template(s).
5.12/5.16	
5.12/5.16	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.16	
5.12/5.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004034s
5.12/5.16	Time used: 0.003936
5.12/5.16	Solving with 2 template(s).
5.12/5.16	
5.12/5.16	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.16	
5.12/5.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001320s
5.12/5.16	Time used: 4.00067
5.12/5.16	Solving with 3 template(s).
5.12/5.16	
5.12/5.16	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.16	
5.12/5.16	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021703s
5.12/5.16	Time used: 1.00069
5.12/5.16	
5.12/5.16	LOG: Postcondition is not implied - no solution
5.12/5.16	> Postcondition is not implied!
5.12/5.16	
5.12/5.16	LOG: RETURN check - Elapsed time: 5.066901s
5.12/5.16	
5.12/5.16	Proving non-termination of subgraph 1
5.12/5.16	Transitions:
5.12/5.16	<l3, l3, 1 <= n^0, {all remain the same}>
5.12/5.16	<l3, l3, n^0 <= 0 /\ undef33 <= 0 /\ undef36 = 1 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	Variables:
5.12/5.16	n^0
5.12/5.16	
5.12/5.16	Checking conditional non-termination of SCC {l3}...
5.12/5.16	> No exit transition to close.
5.12/5.16	Calling reachability with...
5.12/5.16	Transition: <l3, end, true, {all remain the same}>
5.12/5.16	Conditions: 
5.12/5.16	OPEN EXITS: 
5.12/5.16	<l3, end, true, {all remain the same}>
5.12/5.16	
5.12/5.16	--- Reachability graph ---
5.12/5.16	> Graph without transitions.
5.12/5.16	
5.12/5.16	Calling reachability with...
5.12/5.16	Transition: <l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	Conditions: 
5.12/5.16	OPEN EXITS: 
5.12/5.16	<l0, l3, undef50 <= 0 /\ undef42 = 1, {n^0 -> undef39, rest remain the same}>
5.12/5.16	
5.12/5.16	> Conditions are reachable!
5.12/5.16	
5.12/5.16	Program does NOT terminate
5.12/5.16	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.12/5.16	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.12/5.16	EOF