18.20/18.21	NO
18.20/18.21	
18.20/18.21	Solver Timeout: 4
18.20/18.21	Global Timeout: 300
18.20/18.21	No parsing errors!
18.20/18.21	Init Location: 0
18.20/18.21	Transitions:
18.20/18.21	<l0, l5, true>
18.20/18.21	<l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (arg1 > 0)>
18.20/18.21	<l2, l3, (undef6 > ~(1)) /\ (arg2 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6, arg2 -> undef7}>
18.20/18.21	<l3, l4, (0 = arg1), par{arg1 -> 0, arg2 -> undef11}>
18.20/18.21	<l1, l2, (undef14 > ~(1)) /\ (arg2 > 1) /\ (undef15 > ~(1)) /\ ((undef15 - (2 * undef16)) = 0) /\ (arg1 > 0)>
18.20/18.21	<l2, l4, (undef19 > ~(1)) /\ (arg2 > 1) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 0) /\ (arg1 > 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef20 - (2 * undef21)) >= 0), par{arg1 -> (0 - undef19), arg2 -> undef18}>
18.20/18.21	<l3, l3, (arg1 > 1), par{arg1 -> (arg1 - 2), arg2 -> undef23}>
18.20/18.21	<l4, l4, (arg1 < 0) /\ (arg1 < 3), par{arg1 -> (arg1 - 2), arg2 -> undef25}>
18.20/18.21	<l5, l1, true, par{arg1 -> undef26, arg2 -> undef27}>
18.20/18.21	
18.20/18.21	Fresh variables:
18.20/18.21	undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, 
18.20/18.21	
18.20/18.21	Undef variables:
18.20/18.21	undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, 
18.20/18.21	
18.20/18.21	Abstraction variables:
18.20/18.21	
18.20/18.21	Exit nodes:
18.20/18.21	
18.20/18.21	Accepting locations:
18.20/18.21	
18.20/18.21	Asserts:
18.20/18.21	
18.20/18.21	Preprocessed LLVMGraph
18.20/18.21	Init Location: 0
18.20/18.21	Transitions:
18.20/18.21	<l0, l3, (undef3 > ~(1)) /\ (undef27 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef26 > 0) /\ (undef6 > ~(1)) /\ (undef27 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef26 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}>
18.20/18.21	<l0, l4, (undef3 > ~(1)) /\ (undef27 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef26 > 0) /\ (undef19 > ~(1)) /\ (undef27 > 1) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 0) /\ (undef26 > 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef20 - (2 * undef21)) >= 0), par{arg1 -> (0 - undef19)}>
18.20/18.21	<l0, l3, (undef14 > ~(1)) /\ (undef27 > 1) /\ (undef15 > ~(1)) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef26 > 0) /\ (undef6 > ~(1)) /\ (undef27 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef26 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}>
18.20/18.21	<l0, l4, (undef14 > ~(1)) /\ (undef27 > 1) /\ (undef15 > ~(1)) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef26 > 0) /\ (undef19 > ~(1)) /\ (undef27 > 1) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 0) /\ (undef26 > 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef20 - (2 * undef21)) >= 0), par{arg1 -> (0 - undef19)}>
18.20/18.21	<l3, l4, (0 = arg1), par{arg1 -> 0}>
18.20/18.21	<l3, l3, (arg1 > 1), par{arg1 -> (arg1 - 2)}>
18.20/18.21	<l4, l4, (arg1 < 0) /\ (arg1 < 3), par{arg1 -> (arg1 - 2)}>
18.20/18.21	
18.20/18.21	Fresh variables:
18.20/18.21	undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, 
18.20/18.21	
18.20/18.21	Undef variables:
18.20/18.21	undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, 
18.20/18.21	
18.20/18.21	Abstraction variables:
18.20/18.21	
18.20/18.21	Exit nodes:
18.20/18.21	
18.20/18.21	Accepting locations:
18.20/18.21	
18.20/18.21	Asserts:
18.20/18.21	
18.20/18.21	*************************************************************
18.20/18.21	*******************************************************************************************
18.20/18.21	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
18.20/18.21	*******************************************************************************************
18.20/18.21	
18.20/18.21	Init Location: 0
18.20/18.21	Graph 0:
18.20/18.21	Transitions:
18.20/18.21	Variables:
18.20/18.21	
18.20/18.21	Graph 1:
18.20/18.21	Transitions:
18.20/18.21	<l3, l3, 2 <= arg1, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.21	Variables:
18.20/18.21	arg1
18.20/18.21	
18.20/18.21	Graph 2:
18.20/18.21	Transitions:
18.20/18.21	<l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.21	Variables:
18.20/18.21	arg1
18.20/18.21	
18.20/18.21	Precedence: 
18.20/18.21	Graph 0
18.20/18.21	
18.20/18.21	Graph 1
18.20/18.21	<l0, l3, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef6 /\ 0 <= undef8 /\ undef4 = 1 + 2*undef5 /\ undef8 = 1 + 2*undef9, {arg1 -> undef6, rest remain the same}>
18.20/18.22	<l0, l3, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef6 /\ 0 <= undef8 /\ 0 <= undef14 /\ 0 <= undef15 /\ undef8 = 1 + 2*undef9 /\ undef15 = 2*undef16, {arg1 -> undef6, rest remain the same}>
18.20/18.22	
18.20/18.22	Graph 2
18.20/18.22	<l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef4 = 1 + 2*undef5 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	<l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef14 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef15 = 2*undef16 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	<l3, l4, arg1 = 0, {arg1 -> 0, rest remain the same}>
18.20/18.22	
18.20/18.22	Map Locations to Subgraph:
18.20/18.22	( 0 , 0 )
18.20/18.22	( 3 , 1 )
18.20/18.22	( 4 , 2 )
18.20/18.22	
18.20/18.22	*******************************************************************************************
18.20/18.22	********************************    CHECKING ASSERTIONS    ********************************
18.20/18.22	*******************************************************************************************
18.20/18.22	
18.20/18.22	Proving termination of subgraph 0
18.20/18.22	Proving termination of subgraph 1
18.20/18.22	Checking unfeasibility...
18.20/18.22	Time used: 0.002651
18.20/18.22	
18.20/18.22	Checking conditional termination of SCC {l3}...
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.000596s
18.20/18.22	Ranking function: -1 + (1 / 2)*arg1
18.20/18.22	New Graphs: 
18.20/18.22	Proving termination of subgraph 2
18.20/18.22	Checking unfeasibility...
18.20/18.22	Time used: 0.002287
18.20/18.22	
18.20/18.22	Checking conditional termination of SCC {l4}...
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.000472s
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.001133s
18.20/18.22	Trying to remove transition: <l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	Solving with 1 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004443s
18.20/18.22	Time used: 0.004321
18.20/18.22	Solving with 1 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007842s
18.20/18.22	Time used: 0.007533
18.20/18.22	Improving Solution with cost 2 ...
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetNextSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015290s
18.20/18.22	Time used: 0.015285
18.20/18.22	
18.20/18.22	LOG: SAT solveNonLinear - Elapsed time: 0.023133s
18.20/18.22	Cost: 2; Total time: 0.022818
18.20/18.22	Failed at location 4: 0 <= arg1
18.20/18.22	Failed at location 4: 0 <= arg1
18.20/18.22	Before Improving: 
18.20/18.22	Quasi-invariant at l4: 0 <= arg1
18.20/18.22	Optimizing invariants...
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.001843s
18.20/18.22	Remaining time after improvement: 0.99912
18.20/18.22	Termination implied by a set of quasi-invariant(s):
18.20/18.22	Quasi-invariant at l4: 0 <= arg1
18.20/18.22	[ Invariant Graph ]
18.20/18.22	Strengthening and disabling transitions...
18.20/18.22	
18.20/18.22	LOG: CALL solverLinear in Graph for feasibility
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear in Graph for feasibility
18.20/18.22	It's unfeasible. Removing transition: 
18.20/18.22	<l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	[ Termination Graph ]
18.20/18.22	Strengthening and disabling transitions...
18.20/18.22	
18.20/18.22	LOG: CALL solverLinear in Graph for feasibility
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear in Graph for feasibility
18.20/18.22	It's unfeasible. Removing transition: 
18.20/18.22	<l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	New Graphs: 
18.20/18.22	Calling Safety with literal 0 <= arg1 and entry <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef4 = 1 + 2*undef5 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	
18.20/18.22	LOG: CALL check - Post:0 <= arg1 - Process 1
18.20/18.22	* Exit transition: <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef4 = 1 + 2*undef5 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	* Postcondition  : 0 <= arg1
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.000633s
18.20/18.22	> Postcondition is not implied!
18.20/18.22	
18.20/18.22	LOG: RETURN check - Elapsed time: 0.000776s
18.20/18.22	Calling Safety with literal 0 <= arg1 and entry <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef14 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef15 = 2*undef16 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	
18.20/18.22	LOG: CALL check - Post:0 <= arg1 - Process 2
18.20/18.22	* Exit transition: <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef14 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef15 = 2*undef16 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	* Postcondition  : 0 <= arg1
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.000609s
18.20/18.22	> Postcondition is not implied!
18.20/18.22	
18.20/18.22	LOG: RETURN check - Elapsed time: 0.000745s
18.20/18.22	INVARIANTS: 
18.20/18.22	4: 
18.20/18.22	Quasi-INVARIANTS to narrow Graph: 
18.20/18.22	4: 0 <= arg1 , 
18.20/18.22	Narrowing transition: 
18.20/18.22	<l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	
18.20/18.22	LOG: Narrow transition size 1
18.20/18.22	invGraph after Narrowing: 
18.20/18.22	Transitions:
18.20/18.22	<l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	Variables:
18.20/18.22	arg1
18.20/18.22	Checking conditional termination of SCC {l4}...
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.000388s
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.001144s
18.20/18.22	Trying to remove transition: <l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	Solving with 1 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004092s
18.20/18.22	Time used: 0.003971
18.20/18.22	Solving with 1 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001499s
18.20/18.22	Time used: 4.00125
18.20/18.22	Solving with 2 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006097s
18.20/18.22	Time used: 4.00084
18.20/18.22	Solving with 3 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006515s
18.20/18.22	Time used: 1.00048
18.20/18.22	Solving with 1 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010714s
18.20/18.22	Time used: 0.006733
18.20/18.22	Improving Solution with cost 1 ...
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetNextSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015596s
18.20/18.22	Time used: 0.015592
18.20/18.22	
18.20/18.22	LOG: SAT solveNonLinear - Elapsed time: 0.026310s
18.20/18.22	Cost: 1; Total time: 0.022325
18.20/18.22	Termination implied by a set of invariant(s):
18.20/18.22	Invariant at l4: 1 + arg1 <= 0
18.20/18.22	[ Invariant Graph ]
18.20/18.22	Strengthening and disabling transitions...
18.20/18.22	
18.20/18.22	LOG: CALL solverLinear in Graph for feasibility
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear in Graph for feasibility
18.20/18.22	Strengthening transition (result): 
18.20/18.22	<l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	[ Termination Graph ]
18.20/18.22	Strengthening and disabling transitions...
18.20/18.22	
18.20/18.22	LOG: CALL solverLinear in Graph for feasibility
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear in Graph for feasibility
18.20/18.22	Strengthening transition (result): 
18.20/18.22	<l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	Quasi-ranking function: 50000 + arg1
18.20/18.22	New Graphs: 
18.20/18.22	Transitions:
18.20/18.22	<l4, l4, 50001 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	Variables:
18.20/18.22	arg1
18.20/18.22	Checking conditional termination of SCC {l4}...
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.000408s
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.001253s
18.20/18.22	Trying to remove transition: <l4, l4, 50001 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	Solving with 1 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005015s
18.20/18.22	Time used: 0.004887
18.20/18.22	Solving with 1 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001834s
18.20/18.22	Time used: 4.00162
18.20/18.22	Solving with 2 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006240s
18.20/18.22	Time used: 4.00124
18.20/18.22	Solving with 3 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006689s
18.20/18.22	Time used: 1.00064
18.20/18.22	Solving with 1 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010186s
18.20/18.22	Time used: 0.006872
18.20/18.22	
18.20/18.22	Proving non-termination of subgraph 2
18.20/18.22	Transitions:
18.20/18.22	<l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	Variables:
18.20/18.22	arg1
18.20/18.22	
18.20/18.22	Checking conditional non-termination of SCC {l4}...
18.20/18.22	EXIT TRANSITIONS:
18.20/18.22	<l4, end, 0 <= arg1, {all remain the same}>
18.20/18.22	
18.20/18.22	Solving with 1 template(s).
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetFirstSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005017s
18.20/18.22	Time used: 0.004828
18.20/18.22	Improving Solution with cost 3 ...
18.20/18.22	
18.20/18.22	LOG: CALL solveNonLinearGetNextSolution
18.20/18.22	
18.20/18.22	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005647s
18.20/18.22	Time used: 0.005641
18.20/18.22	
18.20/18.22	LOG: SAT solveNonLinear - Elapsed time: 0.010664s
18.20/18.22	Cost: 3; Total time: 0.010469
18.20/18.22	Failed at location 4: 1 + arg1 <= 0
18.20/18.22	Failed at location 4: 1 + arg1 <= 0
18.20/18.22	Failed at location 4: 1 + arg1 <= 0
18.20/18.22	Before Improving: 
18.20/18.22	Quasi-invariant at l4: 1 + arg1 <= 0
18.20/18.22	Optimizing invariants...
18.20/18.22	
18.20/18.22	LOG: CALL solveLinear
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear - Elapsed time: 0.001867s
18.20/18.22	Remaining time after improvement: 0.998819
18.20/18.22	Non-termination implied by a set of quasi-invariant(s):
18.20/18.22	Quasi-invariant at l4: 1 + arg1 <= 0
18.20/18.22	
18.20/18.22	Strengthening and disabling EXIT transitions...
18.20/18.22	Closed exits from l4: 1
18.20/18.22	
18.20/18.22	Strengthening and disabling transitions...
18.20/18.22	
18.20/18.22	LOG: CALL solverLinear in Graph for feasibility
18.20/18.22	
18.20/18.22	LOG: RETURN solveLinear in Graph for feasibility
18.20/18.22	Strengthening transition (result): 
18.20/18.22	<l4, l4, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
18.20/18.22	
18.20/18.22	Calling reachability with...
18.20/18.22	Transition: <l4, end, true, {all remain the same}>
18.20/18.22	Conditions: 1 + arg1 <= 0, 
18.20/18.22	Transition: <l4, end, true, {all remain the same}>
18.20/18.22	Conditions: 1 + arg1 <= 0, 
18.20/18.22	Transition: <l4, end, true, {all remain the same}>
18.20/18.22	Conditions: 1 + arg1 <= 0, 
18.20/18.22	OPEN EXITS: 
18.20/18.22	<l4, end, 1 + arg1 <= 0, {all remain the same}>
18.20/18.22	<l4, end, 1 + arg1 <= 0, {all remain the same}>
18.20/18.22	<l4, end, 1 + arg1 <= 0, {all remain the same}>
18.20/18.22	
18.20/18.22	--- Reachability graph ---
18.20/18.22	> Graph without transitions.
18.20/18.22	
18.20/18.22	Calling reachability with...
18.20/18.22	Transition: <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef4 = 1 + 2*undef5 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	Conditions: 1 + arg1 <= 0, 
18.20/18.22	Transition: <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef14 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef15 = 2*undef16 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	Conditions: 1 + arg1 <= 0, 
18.20/18.22	Transition: <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef4 = 1 + 2*undef5 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	Conditions: 1 + arg1 <= 0, 
18.20/18.22	Transition: <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef14 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef15 = 2*undef16 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	Conditions: 1 + arg1 <= 0, 
18.20/18.22	Transition: <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef4 = 1 + 2*undef5 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	Conditions: 1 + arg1 <= 0, 
18.20/18.22	Transition: <l0, l4, 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef14 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ undef15 = 2*undef16 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	Conditions: 1 + arg1 <= 0, 
18.20/18.22	OPEN EXITS: 
18.20/18.22	<l0, l4, 1 <= undef19 /\ 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef20 /\ undef4 = 1 + 2*undef5 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	<l0, l4, 1 <= undef19 /\ 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef14 /\ 0 <= undef15 /\ 0 <= undef20 /\ undef15 = 2*undef16 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	<l0, l4, 1 <= undef19 /\ 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef20 /\ undef4 = 1 + 2*undef5 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	<l0, l4, 1 <= undef19 /\ 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef14 /\ 0 <= undef15 /\ 0 <= undef20 /\ undef15 = 2*undef16 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	<l0, l4, 1 <= undef19 /\ 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef20 /\ undef4 = 1 + 2*undef5 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	<l0, l4, 1 <= undef19 /\ 1 <= undef26 /\ 2 <= undef27 /\ 0 <= undef14 /\ 0 <= undef15 /\ 0 <= undef20 /\ undef15 = 2*undef16 /\ undef20 = 2*undef21, {arg1 -> -undef19, rest remain the same}>
18.20/18.22	
18.20/18.22	> Conditions are reachable!
18.20/18.22	
18.20/18.22	Program does NOT terminate
18.20/18.22	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
18.20/18.22	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
18.20/18.22	EOF