18.27/18.30	NO
18.27/18.30	
18.27/18.30	Solver Timeout: 4
18.27/18.30	Global Timeout: 300
18.27/18.30	No parsing errors!
18.27/18.30	Init Location: 0
18.27/18.30	Transitions:
18.27/18.30	<l0, l3, true>
18.27/18.30	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
18.27/18.30	<l2, l2, (arg1 > 5), par{arg1 -> (arg1 + 1), arg2 -> undef4}>
18.27/18.30	<l2, l2, (arg1 < 6) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> undef6}>
18.27/18.30	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>
18.27/18.30	
18.27/18.30	Fresh variables:
18.27/18.30	undef2, undef4, undef6, undef7, undef8, 
18.27/18.30	
18.27/18.30	Undef variables:
18.27/18.30	undef2, undef4, undef6, undef7, undef8, 
18.27/18.30	
18.27/18.30	Abstraction variables:
18.27/18.30	
18.27/18.30	Exit nodes:
18.27/18.30	
18.27/18.30	Accepting locations:
18.27/18.30	
18.27/18.30	Asserts:
18.27/18.30	
18.27/18.30	Preprocessed LLVMGraph
18.27/18.30	Init Location: 0
18.27/18.30	Transitions:
18.27/18.30	<l0, l2, (arg1 = undef8) /\ (undef7 > 0) /\ (undef8 > ~(1))>
18.27/18.30	<l2, l2, (arg1 > 5), par{arg1 -> (arg1 + 1)}>
18.27/18.30	<l2, l2, (arg1 < 6) /\ (arg1 > 0), par{arg1 -> 0}>
18.27/18.30	
18.27/18.30	Fresh variables:
18.27/18.30	undef2, undef4, undef6, undef7, undef8, 
18.27/18.30	
18.27/18.30	Undef variables:
18.27/18.30	undef2, undef4, undef6, undef7, undef8, 
18.27/18.30	
18.27/18.30	Abstraction variables:
18.27/18.30	
18.27/18.30	Exit nodes:
18.27/18.30	
18.27/18.30	Accepting locations:
18.27/18.30	
18.27/18.30	Asserts:
18.27/18.30	
18.27/18.30	*************************************************************
18.27/18.30	*******************************************************************************************
18.27/18.30	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
18.27/18.30	*******************************************************************************************
18.27/18.30	
18.27/18.30	Init Location: 0
18.27/18.30	Graph 0:
18.27/18.30	Transitions:
18.27/18.30	Variables:
18.27/18.30	
18.27/18.30	Graph 1:
18.27/18.30	Transitions:
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	<l2, l2, 1 <= arg1 /\ arg1 <= 5, {arg1 -> 0, rest remain the same}>
18.27/18.30	Variables:
18.27/18.30	arg1
18.27/18.30	
18.27/18.30	Precedence: 
18.27/18.30	Graph 0
18.27/18.30	
18.27/18.30	Graph 1
18.27/18.30	<l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
18.27/18.30	
18.27/18.30	Map Locations to Subgraph:
18.27/18.30	( 0 , 0 )
18.27/18.30	( 2 , 1 )
18.27/18.30	
18.27/18.30	*******************************************************************************************
18.27/18.30	********************************    CHECKING ASSERTIONS    ********************************
18.27/18.30	*******************************************************************************************
18.27/18.30	
18.27/18.30	Proving termination of subgraph 0
18.27/18.30	Proving termination of subgraph 1
18.27/18.30	Checking unfeasibility...
18.27/18.30	Time used: 0.002873
18.27/18.30	
18.27/18.30	Checking conditional termination of SCC {l2}...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000735s
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.003394s
18.27/18.30	Piecewise ranking function: min(-7 + 7*arg1,71 - 6*arg1)
18.27/18.30	New Graphs: 
18.27/18.30	Transitions:
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Variables:
18.27/18.30	arg1
18.27/18.30	Checking conditional termination of SCC {l2}...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000383s
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001148s
18.27/18.30	Trying to remove transition: <l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003496s
18.27/18.30	Time used: 0.003375
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006435s
18.27/18.30	Time used: 0.006174
18.27/18.30	Improving Solution with cost 1 ...
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetNextSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019273s
18.27/18.30	Time used: 0.019267
18.27/18.30	
18.27/18.30	LOG: SAT solveNonLinear - Elapsed time: 0.025708s
18.27/18.30	Cost: 1; Total time: 0.025441
18.27/18.30	Failed at location 2: arg1 <= 0
18.27/18.30	Before Improving: 
18.27/18.30	Quasi-invariant at l2: arg1 <= 0
18.27/18.30	Optimizing invariants...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.002184s
18.27/18.30	Remaining time after improvement: 0.99913
18.27/18.30	Termination implied by a set of quasi-invariant(s):
18.27/18.30	Quasi-invariant at l2: arg1 <= 0
18.27/18.30	[ Invariant Graph ]
18.27/18.30	Strengthening and disabling transitions...
18.27/18.30	
18.27/18.30	LOG: CALL solverLinear in Graph for feasibility
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear in Graph for feasibility
18.27/18.30	It's unfeasible. Removing transition: 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	
18.27/18.30	LOG: CALL solverLinear in Graph for feasibility
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear in Graph for feasibility
18.27/18.30	It's unfeasible. Removing transition: 
18.27/18.30	<l2, l2, 1 <= arg1 /\ arg1 <= 5, {arg1 -> 0, rest remain the same}>
18.27/18.30	[ Termination Graph ]
18.27/18.30	Strengthening and disabling transitions...
18.27/18.30	> It's unfeasible. Removing transition: 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	New Graphs: 
18.27/18.30	Calling Safety with literal arg1 <= 0 and entry <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
18.27/18.30	
18.27/18.30	LOG: CALL check - Post:arg1 <= 0 - Process 1
18.27/18.30	* Exit transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
18.27/18.30	* Postcondition  : arg1 <= 0
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000489s
18.27/18.30	> Postcondition is not implied!
18.27/18.30	
18.27/18.30	LOG: RETURN check - Elapsed time: 0.000591s
18.27/18.30	INVARIANTS: 
18.27/18.30	2: 
18.27/18.30	Quasi-INVARIANTS to narrow Graph: 
18.27/18.30	2: arg1 <= 0 , 
18.27/18.30	Narrowing transition: 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	
18.27/18.30	LOG: Narrow transition size 1
18.27/18.30	It's unfeasible. Removing transition: 
18.27/18.30	<l2, l2, 1 <= arg1 /\ arg1 <= 5, {arg1 -> 0, rest remain the same}>
18.27/18.30	invGraph after Narrowing: 
18.27/18.30	Transitions:
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Variables:
18.27/18.30	arg1
18.27/18.30	Checking conditional termination of SCC {l2}...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000382s
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001175s
18.27/18.30	Trying to remove transition: <l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003331s
18.27/18.30	Time used: 0.003208
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004513s
18.27/18.30	Time used: 0.004218
18.27/18.30	Improving Solution with cost 1 ...
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetNextSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011002s
18.27/18.30	Time used: 0.010997
18.27/18.30	
18.27/18.30	LOG: SAT solveNonLinear - Elapsed time: 0.015515s
18.27/18.30	Cost: 1; Total time: 0.015215
18.27/18.30	Failed at location 2: arg1 <= 1
18.27/18.30	Before Improving: 
18.27/18.30	Quasi-invariant at l2: arg1 <= 1
18.27/18.30	Optimizing invariants...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001424s
18.27/18.30	Remaining time after improvement: 0.999284
18.27/18.30	Termination implied by a set of quasi-invariant(s):
18.27/18.30	Quasi-invariant at l2: arg1 <= 1
18.27/18.30	[ Invariant Graph ]
18.27/18.30	Strengthening and disabling transitions...
18.27/18.30	
18.27/18.30	LOG: CALL solverLinear in Graph for feasibility
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear in Graph for feasibility
18.27/18.30	It's unfeasible. Removing transition: 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	[ Termination Graph ]
18.27/18.30	Strengthening and disabling transitions...
18.27/18.30	
18.27/18.30	LOG: CALL solverLinear in Graph for feasibility
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear in Graph for feasibility
18.27/18.30	It's unfeasible. Removing transition: 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	New Graphs: 
18.27/18.30	Calling Safety with literal arg1 <= 1 and entry <l0, l2, 0 <= undef8 /\ 1 <= arg1 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
18.27/18.30	
18.27/18.30	LOG: CALL check - Post:arg1 <= 1 - Process 2
18.27/18.30	* Exit transition: <l0, l2, 0 <= undef8 /\ 1 <= arg1 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
18.27/18.30	* Postcondition  : arg1 <= 1
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000507s
18.27/18.30	> Postcondition is not implied!
18.27/18.30	
18.27/18.30	LOG: RETURN check - Elapsed time: 0.000611s
18.27/18.30	INVARIANTS: 
18.27/18.30	2: 
18.27/18.30	Quasi-INVARIANTS to narrow Graph: 
18.27/18.30	2: arg1 <= 1 , 
18.27/18.30	Narrowing transition: 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	
18.27/18.30	LOG: Narrow transition size 1
18.27/18.30	invGraph after Narrowing: 
18.27/18.30	Transitions:
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Variables:
18.27/18.30	arg1
18.27/18.30	Checking conditional termination of SCC {l2}...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000389s
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001173s
18.27/18.30	Trying to remove transition: <l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003307s
18.27/18.30	Time used: 0.003186
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010340s
18.27/18.30	Time used: 0.010098
18.27/18.30	Improving Solution with cost 1 ...
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetNextSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012836s
18.27/18.30	Time used: 0.012831
18.27/18.30	
18.27/18.30	LOG: SAT solveNonLinear - Elapsed time: 0.023176s
18.27/18.30	Cost: 1; Total time: 0.022929
18.27/18.30	Failed at location 2: arg1 <= 2
18.27/18.30	Before Improving: 
18.27/18.30	Quasi-invariant at l2: arg1 <= 2
18.27/18.30	Optimizing invariants...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001848s
18.27/18.30	Quasi-invariant improved
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001175s
18.27/18.30	Quasi-invariant improved
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001175s
18.27/18.30	Quasi-invariant improved
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000846s
18.27/18.30	Remaining time after improvement: 0.99617
18.27/18.30	Termination implied by a set of quasi-invariant(s):
18.27/18.30	Quasi-invariant at l2: arg1 <= 5
18.27/18.30	[ Invariant Graph ]
18.27/18.30	Strengthening and disabling transitions...
18.27/18.30	
18.27/18.30	LOG: CALL solverLinear in Graph for feasibility
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear in Graph for feasibility
18.27/18.30	It's unfeasible. Removing transition: 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	[ Termination Graph ]
18.27/18.30	Strengthening and disabling transitions...
18.27/18.30	
18.27/18.30	LOG: CALL solverLinear in Graph for feasibility
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear in Graph for feasibility
18.27/18.30	It's unfeasible. Removing transition: 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	New Graphs: 
18.27/18.30	Calling Safety with literal arg1 <= 5 and entry <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ 2 <= arg1 /\ arg1 = undef8, {all remain the same}>
18.27/18.30	
18.27/18.30	LOG: CALL check - Post:arg1 <= 5 - Process 3
18.27/18.30	* Exit transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ 2 <= arg1 /\ arg1 = undef8, {all remain the same}>
18.27/18.30	* Postcondition  : arg1 <= 5
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000510s
18.27/18.30	> Postcondition is not implied!
18.27/18.30	
18.27/18.30	LOG: RETURN check - Elapsed time: 0.000607s
18.27/18.30	INVARIANTS: 
18.27/18.30	2: 
18.27/18.30	Quasi-INVARIANTS to narrow Graph: 
18.27/18.30	2: arg1 <= 5 , 
18.27/18.30	Narrowing transition: 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	
18.27/18.30	LOG: Narrow transition size 1
18.27/18.30	invGraph after Narrowing: 
18.27/18.30	Transitions:
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Variables:
18.27/18.30	arg1
18.27/18.30	Checking conditional termination of SCC {l2}...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000392s
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001186s
18.27/18.30	Trying to remove transition: <l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003326s
18.27/18.30	Time used: 0.003204
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002058s
18.27/18.30	Time used: 4.00113
18.27/18.30	Solving with 2 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006372s
18.27/18.30	Time used: 4.00077
18.27/18.30	Solving with 3 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006939s
18.27/18.30	Time used: 1.00092
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009462s
18.27/18.30	Time used: 0.005221
18.27/18.30	Improving Solution with cost 1 ...
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetNextSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012873s
18.27/18.30	Time used: 0.012868
18.27/18.30	
18.27/18.30	LOG: SAT solveNonLinear - Elapsed time: 0.022336s
18.27/18.30	Cost: 1; Total time: 0.018089
18.27/18.30	Quasi-ranking function: 50000 - arg1
18.27/18.30	New Graphs: 
18.27/18.30	Transitions:
18.27/18.30	<l2, l2, 50001 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Variables:
18.27/18.30	arg1
18.27/18.30	Checking conditional termination of SCC {l2}...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.000405s
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001278s
18.27/18.30	Trying to remove transition: <l2, l2, 50001 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003633s
18.27/18.30	Time used: 0.003509
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003533s
18.27/18.30	Time used: 4.00285
18.27/18.30	Solving with 2 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006997s
18.27/18.30	Time used: 4.00089
18.27/18.30	Solving with 3 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007266s
18.27/18.30	Time used: 1.00109
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008576s
18.27/18.30	Time used: 0.005216
18.27/18.30	
18.27/18.30	Proving non-termination of subgraph 1
18.27/18.30	Transitions:
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	Variables:
18.27/18.30	arg1
18.27/18.30	
18.27/18.30	Checking conditional non-termination of SCC {l2}...
18.27/18.30	EXIT TRANSITIONS:
18.27/18.30	<l2, end, arg1 <= 5, {all remain the same}>
18.27/18.30	
18.27/18.30	Solving with 1 template(s).
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetFirstSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020900s
18.27/18.30	Time used: 0.020484
18.27/18.30	Improving Solution with cost 1 ...
18.27/18.30	
18.27/18.30	LOG: CALL solveNonLinearGetNextSolution
18.27/18.30	
18.27/18.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004531s
18.27/18.30	Time used: 0.004526
18.27/18.30	
18.27/18.30	LOG: SAT solveNonLinear - Elapsed time: 0.025431s
18.27/18.30	Cost: 1; Total time: 0.02501
18.27/18.30	Failed at location 2: 6 <= arg1
18.27/18.30	Before Improving: 
18.27/18.30	Quasi-invariant at l2: 6 <= arg1
18.27/18.30	Optimizing invariants...
18.27/18.30	
18.27/18.30	LOG: CALL solveLinear
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear - Elapsed time: 0.001632s
18.27/18.30	Remaining time after improvement: 0.998873
18.27/18.30	Non-termination implied by a set of quasi-invariant(s):
18.27/18.30	Quasi-invariant at l2: 6 <= arg1
18.27/18.30	
18.27/18.30	Strengthening and disabling EXIT transitions...
18.27/18.30	Closed exits from l2: 1
18.27/18.30	
18.27/18.30	Strengthening and disabling transitions...
18.27/18.30	
18.27/18.30	LOG: CALL solverLinear in Graph for feasibility
18.27/18.30	
18.27/18.30	LOG: RETURN solveLinear in Graph for feasibility
18.27/18.30	Strengthening transition (result): 
18.27/18.30	<l2, l2, 6 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
18.27/18.30	
18.27/18.30	Calling reachability with...
18.27/18.30	Transition: <l2, end, true, {all remain the same}>
18.27/18.30	Conditions: 6 <= arg1, 
18.27/18.30	OPEN EXITS: 
18.27/18.30	<l2, end, 6 <= arg1, {all remain the same}>
18.27/18.30	
18.27/18.30	--- Reachability graph ---
18.27/18.30	> Graph without transitions.
18.27/18.30	
18.27/18.30	Calling reachability with...
18.27/18.30	Transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
18.27/18.30	Conditions: 6 <= arg1, 
18.27/18.30	OPEN EXITS: 
18.27/18.30	<l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ 6 <= arg1 /\ arg1 = undef8, {all remain the same}>
18.27/18.30	
18.27/18.30	> Conditions are reachable!
18.27/18.30	
18.27/18.30	Program does NOT terminate
18.27/18.30	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
18.27/18.30	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
18.27/18.30	EOF