23.19/23.27	NO
23.19/23.27	
23.19/23.27	Solver Timeout: 4
23.19/23.27	Global Timeout: 300
23.19/23.27	No parsing errors!
23.19/23.27	Init Location: 0
23.19/23.27	Transitions:
23.19/23.27	<l0, l6, true>
23.19/23.27	<l1, l2, (undef2 = 0) /\ (0 <= (0 + undef2)) /\ ((0 + undef2) <= 0), par{i_13^0 -> undef2}>
23.19/23.27	<l3, l2, ((1 + i_13^0) <= 10) /\ (undef11 = (~(1) + i_13^0)) /\ (undef7 = undef7) /\ (~(1) <= (0 + undef7)) /\ ((0 + undef7) <= ~(1)) /\ (undef6 = undef6) /\ ((0 + undef6) <= (0 + undef7)) /\ ((0 + undef7) <= (0 + undef6)), par{a_19^0 -> undef6, i_13^0 -> undef7}>
23.19/23.27	<l2, l4, (10 <= (0 + i_13^0)), par{rt_11^0 -> (0 + st_14^0)}>
23.19/23.27	<l2, l5, (undef19 = undef19) /\ ((1 + i_13^0) <= 10) /\ (undef18 = (~(1) + i_13^0)) /\ ((0 + undef18) <= (~(1) + undef19)) /\ ((~(1) + undef19) <= (0 + undef18)) /\ ((1 + undef19) <= 10), par{i_13^0 -> undef18, i_20^0 -> undef19}>
23.19/23.27	<l5, l2, true>
23.19/23.27	<l6, l1, true>
23.19/23.27	
23.19/23.27	Fresh variables:
23.19/23.27	undef2, undef6, undef7, undef11, undef18, undef19, 
23.19/23.27	
23.19/23.27	Undef variables:
23.19/23.27	undef2, undef6, undef7, undef11, undef18, undef19, 
23.19/23.27	
23.19/23.27	Abstraction variables:
23.19/23.27	
23.19/23.27	Exit nodes:
23.19/23.27	
23.19/23.27	Accepting locations:
23.19/23.27	
23.19/23.27	Asserts:
23.19/23.27	
23.19/23.27	Preprocessed LLVMGraph
23.19/23.27	Init Location: 0
23.19/23.27	Transitions:
23.19/23.27	<l0, l2, (i_13^0 = undef2) /\ (undef2 = 0) /\ (0 <= (0 + undef2)) /\ ((0 + undef2) <= 0)>
23.19/23.27	<l2, l4, (10 <= (0 + i_13^0))>
23.19/23.27	<l2, l2, (undef19 = undef19) /\ ((1 + i_13^0) <= 10) /\ (undef18 = (~(1) + i_13^0)) /\ ((0 + undef18) <= (~(1) + undef19)) /\ ((~(1) + undef19) <= (0 + undef18)) /\ ((1 + undef19) <= 10), par{i_13^0 -> undef18}>
23.19/23.27	
23.19/23.27	Fresh variables:
23.19/23.27	undef2, undef6, undef7, undef11, undef18, undef19, 
23.19/23.27	
23.19/23.27	Undef variables:
23.19/23.27	undef2, undef6, undef7, undef11, undef18, undef19, 
23.19/23.27	
23.19/23.27	Abstraction variables:
23.19/23.27	
23.19/23.27	Exit nodes:
23.19/23.27	
23.19/23.27	Accepting locations:
23.19/23.27	
23.19/23.27	Asserts:
23.19/23.27	
23.19/23.27	*************************************************************
23.19/23.27	*******************************************************************************************
23.19/23.27	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
23.19/23.27	*******************************************************************************************
23.19/23.27	
23.19/23.27	Init Location: 0
23.19/23.27	Graph 0:
23.19/23.27	Transitions:
23.19/23.27	Variables:
23.19/23.27	
23.19/23.27	Graph 1:
23.19/23.27	Transitions:
23.19/23.27	<l2, l2, i_13^0 <= 9 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
23.19/23.27	Variables:
23.19/23.27	i_13^0
23.19/23.27	
23.19/23.27	Graph 2:
23.19/23.27	Transitions:
23.19/23.27	Variables:
23.19/23.27	
23.19/23.27	Precedence: 
23.19/23.27	Graph 0
23.19/23.27	
23.19/23.27	Graph 1
23.19/23.27	<l0, l2, i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>
23.19/23.27	
23.19/23.27	Graph 2
23.19/23.27	<l2, l4, 10 <= i_13^0, {all remain the same}>
23.19/23.27	
23.19/23.27	Map Locations to Subgraph:
23.19/23.27	( 0 , 0 )
23.19/23.27	( 2 , 1 )
23.19/23.27	( 4 , 2 )
23.19/23.27	
23.19/23.27	*******************************************************************************************
23.19/23.27	********************************    CHECKING ASSERTIONS    ********************************
23.19/23.27	*******************************************************************************************
23.19/23.27	
23.19/23.27	Proving termination of subgraph 0
23.19/23.27	Proving termination of subgraph 1
23.19/23.27	Checking unfeasibility...
23.19/23.27	Time used: 0.001835
23.19/23.27	
23.19/23.27	Checking conditional termination of SCC {l2}...
23.19/23.27	
23.19/23.27	LOG: CALL solveLinear
23.19/23.27	
23.19/23.27	LOG: RETURN solveLinear - Elapsed time: 0.000686s
23.19/23.27	
23.19/23.27	LOG: CALL solveLinear
23.19/23.27	
23.19/23.27	LOG: RETURN solveLinear - Elapsed time: 0.002487s
23.19/23.27	Trying to remove transition: <l2, l2, i_13^0 <= 9 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
23.19/23.27	Solving with 1 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004198s
23.19/23.27	Time used: 0.004
23.19/23.27	Solving with 1 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001963s
23.19/23.27	Time used: 4.0008
23.19/23.27	Solving with 2 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006469s
23.19/23.27	Time used: 4.00106
23.19/23.27	Solving with 3 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.038839s
23.19/23.27	Time used: 1.00084
23.19/23.27	Solving with 1 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011447s
23.19/23.27	Time used: 0.006622
23.19/23.27	Improving Solution with cost 1 ...
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetNextSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000925s
23.19/23.27	Time used: 1.00083
23.19/23.27	
23.19/23.27	LOG: SAT solveNonLinear - Elapsed time: 1.012372s
23.19/23.27	Cost: 1; Total time: 1.00745
23.19/23.27	Termination implied by a set of invariant(s):
23.19/23.27	Invariant at l2: i_13^0 <= 0
23.19/23.27	[ Invariant Graph ]
23.19/23.27	Strengthening and disabling transitions...
23.19/23.27	
23.19/23.27	LOG: CALL solverLinear in Graph for feasibility
23.19/23.27	
23.19/23.27	LOG: RETURN solveLinear in Graph for feasibility
23.19/23.27	Strengthening transition (result): 
23.19/23.27	<l2, l2, i_13^0 <= 0 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
23.19/23.27	[ Termination Graph ]
23.19/23.27	Strengthening and disabling transitions...
23.19/23.27	
23.19/23.27	LOG: CALL solverLinear in Graph for feasibility
23.19/23.27	
23.19/23.27	LOG: RETURN solveLinear in Graph for feasibility
23.19/23.27	Strengthening transition (result): 
23.19/23.27	<l2, l2, i_13^0 <= 0 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
23.19/23.27	Quasi-ranking function: 50000 + i_13^0
23.19/23.27	New Graphs: 
23.19/23.27	Transitions:
23.19/23.27	<l2, l2, undef19 <= 9 /\ 50001 + i_13^0 <= 0 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
23.19/23.27	Variables:
23.19/23.27	i_13^0
23.19/23.27	Checking conditional termination of SCC {l2}...
23.19/23.27	
23.19/23.27	LOG: CALL solveLinear
23.19/23.27	
23.19/23.27	LOG: RETURN solveLinear - Elapsed time: 0.000726s
23.19/23.27	
23.19/23.27	LOG: CALL solveLinear
23.19/23.27	
23.19/23.27	LOG: RETURN solveLinear - Elapsed time: 0.002939s
23.19/23.27	Trying to remove transition: <l2, l2, undef19 <= 9 /\ 50001 + i_13^0 <= 0 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
23.19/23.27	Solving with 1 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005508s
23.19/23.27	Time used: 0.005337
23.19/23.27	Solving with 1 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002323s
23.19/23.27	Time used: 4.00145
23.19/23.27	Solving with 2 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008884s
23.19/23.27	Time used: 4.00367
23.19/23.27	Solving with 3 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013667s
23.19/23.27	Time used: 1.00716
23.19/23.27	Solving with 1 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015257s
23.19/23.27	Time used: 4.00183
23.19/23.27	Termination failed. Trying to show unreachability...
23.19/23.27	Proving unreachability of entry: <l0, l2, i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>
23.19/23.27	
23.19/23.27	LOG: CALL check - Post:1 <= 0 - Process 1
23.19/23.27	* Exit transition: <l0, l2, i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>
23.19/23.27	* Postcondition  : 1 <= 0
23.19/23.27	
23.19/23.27	LOG: CALL solveLinear
23.19/23.27	
23.19/23.27	LOG: RETURN solveLinear - Elapsed time: 0.005590s
23.19/23.27	> Postcondition is not implied!
23.19/23.27	
23.19/23.27	LOG: RETURN check - Elapsed time: 0.005710s
23.19/23.27	Cannot prove unreachability
23.19/23.27	
23.19/23.27	Proving non-termination of subgraph 1
23.19/23.27	Transitions:
23.19/23.27	<l2, l2, i_13^0 <= 9 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
23.19/23.27	Variables:
23.19/23.27	i_13^0
23.19/23.27	
23.19/23.27	Checking that every undef value has an assignment...
23.19/23.27	
23.19/23.27	LOG: CALL solveLinear
23.19/23.27	
23.19/23.27	LOG: RETURN solveLinear - Elapsed time: 0.001253s
23.19/23.27	Checking conditional non-termination of SCC {l2}...
23.19/23.27	EXIT TRANSITIONS:
23.19/23.27	<l2, end, 10 <= i_13^0, {all remain the same}>
23.19/23.27	
23.19/23.27	Solving with 1 template(s).
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinearGetFirstSolution
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024287s
23.19/23.27	Time used: 0.024168
23.19/23.27	
23.19/23.27	LOG: SAT solveNonLinear - Elapsed time: 0.024287s
23.19/23.27	Cost: 0; Total time: 0.024168
23.19/23.27	Minimizing number of undef constraints...
23.19/23.27	
23.19/23.27	LOG: CALL solveNonLinear
23.19/23.27	
23.19/23.27	LOG: RETURN solveNonLinear - Elapsed time: 0.004185s
23.19/23.27	Number of undef constraints reduced!
23.19/23.27	
23.19/23.27	Non-termination implied by a set of quasi-invariant(s):
23.19/23.27	Quasi-invariant at l2: i_13^0 <= 0
23.19/23.27	
23.19/23.27	Strengthening and disabling EXIT transitions...
23.19/23.27	Closed exits from l2: 1
23.19/23.27	
23.19/23.27	Strengthening and disabling transitions...
23.19/23.27	
23.19/23.27	LOG: CALL solverLinear in Graph for feasibility
23.19/23.27	
23.19/23.27	LOG: RETURN solveLinear in Graph for feasibility
23.19/23.27	Strengthening transition (result): 
23.19/23.27	<l2, l2, i_13^0 <= 0 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
23.19/23.27	
23.19/23.27	Calling reachability with...
23.19/23.27	Transition: <l2, end, true, {all remain the same}>
23.19/23.27	Conditions: i_13^0 <= 0, 
23.19/23.27	OPEN EXITS: 
23.19/23.27	<l2, end, i_13^0 <= 0, {all remain the same}>
23.19/23.27	
23.19/23.27	--- Reachability graph ---
23.19/23.27	> Graph without transitions.
23.19/23.27	
23.19/23.27	Calling reachability with...
23.19/23.27	Transition: <l0, l2, i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>
23.19/23.27	Conditions: i_13^0 <= 0, 
23.19/23.27	OPEN EXITS: 
23.19/23.27	<l0, l2, i_13^0 <= 0 /\ i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>
23.19/23.27	
23.19/23.27	> Conditions are reachable!
23.19/23.27	
23.19/23.27	Program does NOT terminate
23.19/23.27	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
23.19/23.27	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
23.19/23.27	EOF