9.06/9.13	NO
9.06/9.13	
9.06/9.13	Solver Timeout: 4
9.06/9.13	Global Timeout: 300
9.06/9.13	No parsing errors!
9.06/9.13	Init Location: 0
9.06/9.13	Transitions:
9.06/9.13	<l0, l10, true>
9.06/9.13	<l1, l2, ((0 + dobreak^0) <= 0) /\ (undef6 = 1) /\ (undef3 = undef3), par{A^0 -> 0, __rho_1_^0 -> undef3, n^0 -> (0 + undef3)}>
9.06/9.13	<l1, l3, (1 <= (0 + dobreak^0))>
9.06/9.13	<l4, l1, true>
9.06/9.13	<l2, l5, true>
9.06/9.13	<l6, l7, true>
9.06/9.13	<l3, l8, true>
9.06/9.13	<l8, l3, true>
9.06/9.13	<l5, l2, (1 <= (0 + n^0)), par{n^0 -> (~(1) + n^0)}>
9.06/9.13	<l5, l4, ((0 + n^0) <= 0) /\ (undef47 = 1) /\ (undef45 = undef45), par{R^0 -> 0, dobreak^0 -> undef45}>
9.06/9.13	<l9, l4, (undef51 = undef51), par{A^0 -> 0, R^0 -> 0, dobreak^0 -> undef51}>
9.06/9.13	<l10, l9, true>
9.06/9.13	
9.06/9.13	Fresh variables:
9.06/9.13	undef3, undef6, undef45, undef47, undef51, 
9.06/9.13	
9.06/9.13	Undef variables:
9.06/9.13	undef3, undef6, undef45, undef47, undef51, 
9.06/9.13	
9.06/9.13	Abstraction variables:
9.06/9.13	
9.06/9.13	Exit nodes:
9.06/9.13	
9.06/9.13	Accepting locations:
9.06/9.13	
9.06/9.13	Asserts:
9.06/9.13	
9.06/9.13	Preprocessed LLVMGraph
9.06/9.13	Init Location: 0
9.06/9.13	Transitions:
9.06/9.13	<l0, l2, (undef51 = undef51) /\ ((0 + undef51) <= 0) /\ (undef6 = 1) /\ (undef3 = undef3), par{n^0 -> (0 + undef3)}>
9.06/9.13	<l0, l3, (undef51 = undef51) /\ (1 <= (0 + undef51))>
9.06/9.13	<l2, l2, (1 <= (0 + n^0)), par{n^0 -> (~(1) + n^0)}>
9.06/9.13	<l2, l2, ((0 + n^0) <= 0) /\ (undef47 = 1) /\ (undef45 = undef45) /\ ((0 + undef45) <= 0) /\ (undef6 = 1) /\ (undef3 = undef3), par{n^0 -> (0 + undef3)}>
9.06/9.13	<l2, l3, ((0 + n^0) <= 0) /\ (undef47 = 1) /\ (undef45 = undef45) /\ (1 <= (0 + undef45))>
9.06/9.13	<l3, l3, true>
9.06/9.13	
9.06/9.13	Fresh variables:
9.06/9.13	undef3, undef6, undef45, undef47, undef51, 
9.06/9.13	
9.06/9.13	Undef variables:
9.06/9.13	undef3, undef6, undef45, undef47, undef51, 
9.06/9.13	
9.06/9.13	Abstraction variables:
9.06/9.13	
9.06/9.13	Exit nodes:
9.06/9.13	
9.06/9.13	Accepting locations:
9.06/9.13	
9.06/9.13	Asserts:
9.06/9.13	
9.06/9.13	*************************************************************
9.06/9.13	*******************************************************************************************
9.06/9.13	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
9.06/9.13	*******************************************************************************************
9.06/9.13	
9.06/9.13	Init Location: 0
9.06/9.13	Graph 0:
9.06/9.13	Transitions:
9.06/9.13	Variables:
9.06/9.13	
9.06/9.13	Graph 1:
9.06/9.13	Transitions:
9.06/9.13	<l2, l2, 1 <= n^0, {n^0 -> -1 + n^0, rest remain the same}>
9.06/9.13	<l2, l2, n^0 <= 0 /\ undef45 <= 0 /\ undef6 = 1 /\ undef47 = 1, {n^0 -> undef3, rest remain the same}>
9.06/9.13	Variables:
9.06/9.13	n^0
9.06/9.13	
9.06/9.13	Graph 2:
9.06/9.13	Transitions:
9.06/9.13	<l3, l3, true, {all remain the same}>
9.06/9.13	Variables:
9.06/9.13	
9.06/9.13	Precedence: 
9.06/9.13	Graph 0
9.06/9.13	
9.06/9.13	Graph 1
9.06/9.13	<l0, l2, undef51 <= 0 /\ undef6 = 1, {n^0 -> undef3, rest remain the same}>
9.06/9.13	
9.06/9.13	Graph 2
9.06/9.13	<l0, l3, 1 <= undef51, {all remain the same}>
9.06/9.13	<l2, l3, n^0 <= 0 /\ 1 <= undef45 /\ undef47 = 1, {all remain the same}>
9.06/9.13	
9.06/9.13	Map Locations to Subgraph:
9.06/9.13	( 0 , 0 )
9.06/9.13	( 2 , 1 )
9.06/9.13	( 3 , 2 )
9.06/9.13	
9.06/9.13	*******************************************************************************************
9.06/9.13	********************************    CHECKING ASSERTIONS    ********************************
9.06/9.13	*******************************************************************************************
9.06/9.13	
9.06/9.13	Proving termination of subgraph 0
9.06/9.13	Proving termination of subgraph 1
9.06/9.13	Checking unfeasibility...
9.06/9.13	Time used: 0.002703
9.06/9.13	
9.06/9.13	Checking conditional termination of SCC {l2}...
9.06/9.13	
9.06/9.13	LOG: CALL solveLinear
9.06/9.13	
9.06/9.13	LOG: RETURN solveLinear - Elapsed time: 0.000852s
9.06/9.13	
9.06/9.13	LOG: CALL solveLinear
9.06/9.13	
9.06/9.13	LOG: RETURN solveLinear - Elapsed time: 0.003669s
9.06/9.13	Trying to remove transition: <l2, l2, n^0 <= 0 /\ undef45 <= 0 /\ undef6 = 1 /\ undef47 = 1, {n^0 -> undef3, rest remain the same}>
9.06/9.13	Solving with 1 template(s).
9.06/9.13	
9.06/9.13	LOG: CALL solveNonLinearGetFirstSolution
9.06/9.13	
9.06/9.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005402s
9.06/9.13	Time used: 0.005199
9.06/9.13	Trying to remove transition: <l2, l2, 1 <= n^0, {n^0 -> -1 + n^0, rest remain the same}>
9.06/9.13	Solving with 1 template(s).
9.06/9.13	
9.06/9.13	LOG: CALL solveNonLinearGetFirstSolution
9.06/9.13	
9.06/9.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005362s
9.06/9.13	Time used: 0.004994
9.06/9.13	Solving with 1 template(s).
9.06/9.13	
9.06/9.13	LOG: CALL solveNonLinearGetFirstSolution
9.06/9.13	
9.06/9.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002489s
9.06/9.13	Time used: 4.00191
9.06/9.13	Solving with 2 template(s).
9.06/9.13	
9.06/9.13	LOG: CALL solveNonLinearGetFirstSolution
9.06/9.13	
9.06/9.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009902s
9.06/9.13	Time used: 4.0014
9.06/9.13	Solving with 3 template(s).
9.06/9.13	
9.06/9.13	LOG: CALL solveNonLinearGetFirstSolution
9.06/9.13	
9.06/9.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.020316s
9.06/9.13	Time used: 1.01057
9.06/9.13	Solving with 1 template(s).
9.06/9.13	
9.06/9.13	LOG: CALL solveNonLinearGetFirstSolution
9.06/9.13	
9.06/9.13	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014983s
9.06/9.13	Time used: 0.008954
9.06/9.13	Termination failed. Trying to show unreachability...
9.06/9.13	Proving unreachability of entry: <l0, l2, undef51 <= 0 /\ undef6 = 1, {n^0 -> undef3, rest remain the same}>
9.06/9.13	
9.06/9.13	LOG: CALL check - Post:1 <= 0 - Process 1
9.06/9.13	* Exit transition: <l0, l2, undef51 <= 0 /\ undef6 = 1, {n^0 -> undef3, rest remain the same}>
9.06/9.13	* Postcondition  : 1 <= 0
9.06/9.13	
9.06/9.13	LOG: CALL solveLinear
9.06/9.13	
9.06/9.13	LOG: RETURN solveLinear - Elapsed time: 0.001129s
9.06/9.13	> Postcondition is not implied!
9.06/9.13	
9.06/9.13	LOG: RETURN check - Elapsed time: 0.001220s
9.06/9.13	Cannot prove unreachability
9.06/9.13	
9.06/9.13	Proving non-termination of subgraph 1
9.06/9.13	Transitions:
9.06/9.13	<l2, l2, 1 <= n^0, {n^0 -> -1 + n^0, rest remain the same}>
9.06/9.13	<l2, l2, n^0 <= 0 /\ undef45 <= 0 /\ undef6 = 1 /\ undef47 = 1, {n^0 -> undef3, rest remain the same}>
9.06/9.13	Variables:
9.06/9.13	n^0
9.06/9.13	
9.06/9.13	Checking conditional non-termination of SCC {l2}...
9.06/9.13	> No exit transition to close.
9.06/9.13	Calling reachability with...
9.06/9.13	Transition: <l2, end, true, {all remain the same}>
9.06/9.13	Conditions: 
9.06/9.13	OPEN EXITS: 
9.06/9.13	<l2, end, true, {all remain the same}>
9.06/9.13	
9.06/9.13	--- Reachability graph ---
9.06/9.13	> Graph without transitions.
9.06/9.13	
9.06/9.13	Calling reachability with...
9.06/9.13	Transition: <l0, l2, undef51 <= 0 /\ undef6 = 1, {n^0 -> undef3, rest remain the same}>
9.06/9.13	Conditions: 
9.06/9.13	OPEN EXITS: 
9.06/9.13	<l0, l2, undef51 <= 0 /\ undef6 = 1, {n^0 -> undef3, rest remain the same}>
9.06/9.13	
9.06/9.13	> Conditions are reachable!
9.06/9.13	
9.06/9.13	Program does NOT terminate
9.06/9.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
9.06/9.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
9.06/9.13	EOF