42.83/42.94	NO
42.83/42.94	
42.83/42.94	Solver Timeout: 4
42.83/42.94	Global Timeout: 300
42.83/42.94	No parsing errors!
42.83/42.94	Init Location: 0
42.83/42.94	Transitions:
42.83/42.94	<l0, l3, true>
42.83/42.94	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0}>
42.83/42.94	<l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
42.83/42.94	<l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
42.83/42.94	<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>
42.83/42.94	<l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}>
42.83/42.94	<l3, l1, true, par{arg1 -> undef11, arg2 -> undef12}>
42.83/42.94	
42.83/42.94	Fresh variables:
42.83/42.94	undef11, undef12, 
42.83/42.94	
42.83/42.94	Undef variables:
42.83/42.94	undef11, undef12, 
42.83/42.94	
42.83/42.94	Abstraction variables:
42.83/42.94	
42.83/42.94	Exit nodes:
42.83/42.94	
42.83/42.94	Accepting locations:
42.83/42.94	
42.83/42.94	Asserts:
42.83/42.94	
42.83/42.94	Preprocessed LLVMGraph
42.83/42.94	Init Location: 0
42.83/42.94	Transitions:
42.83/42.94	<l0, l2, (arg1 = 0) /\ (arg2 = undef12) /\ (undef11 > 0) /\ (undef12 > ~(1))>
42.83/42.94	<l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
42.83/42.94	<l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
42.83/42.94	<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>
42.83/42.94	<l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}>
42.83/42.94	
42.83/42.94	Fresh variables:
42.83/42.94	undef11, undef12, 
42.83/42.94	
42.83/42.94	Undef variables:
42.83/42.94	undef11, undef12, 
42.83/42.94	
42.83/42.94	Abstraction variables:
42.83/42.94	
42.83/42.94	Exit nodes:
42.83/42.94	
42.83/42.94	Accepting locations:
42.83/42.94	
42.83/42.94	Asserts:
42.83/42.94	
42.83/42.94	*************************************************************
42.83/42.94	*******************************************************************************************
42.83/42.94	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
42.83/42.94	*******************************************************************************************
42.83/42.94	
42.83/42.94	Init Location: 0
42.83/42.94	Graph 0:
42.83/42.94	Transitions:
42.83/42.94	Variables:
42.83/42.94	
42.83/42.94	Graph 1:
42.83/42.94	Transitions:
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	Variables:
42.83/42.94	arg1, arg2
42.83/42.94	
42.83/42.94	Precedence: 
42.83/42.94	Graph 0
42.83/42.94	
42.83/42.94	Graph 1
42.83/42.94	<l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
42.83/42.94	
42.83/42.94	Map Locations to Subgraph:
42.83/42.94	( 0 , 0 )
42.83/42.94	( 2 , 1 )
42.83/42.94	
42.83/42.94	*******************************************************************************************
42.83/42.94	********************************    CHECKING ASSERTIONS    ********************************
42.83/42.94	*******************************************************************************************
42.83/42.94	
42.83/42.94	Proving termination of subgraph 0
42.83/42.94	Proving termination of subgraph 1
42.83/42.94	Checking unfeasibility...
42.83/42.94	Time used: 0.154362
42.83/42.94	
42.83/42.94	Checking conditional termination of SCC {l2}...
42.83/42.94	
42.83/42.94	LOG: CALL solveLinear
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear - Elapsed time: 0.002436s
42.83/42.94	
42.83/42.94	LOG: CALL solveLinear
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear - Elapsed time: 0.017162s
42.83/42.94	Trying to remove transition: <l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.761200s
42.83/42.94	Time used: 0.76079
42.83/42.94	Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007953s
42.83/42.94	Time used: 4.00155
42.83/42.94	Trying to remove transition: <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.085774s
42.83/42.94	Time used: 4.0017
42.83/42.94	Trying to remove transition: <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.046037s
42.83/42.94	Time used: 4.00171
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.313793s
42.83/42.94	Time used: 1.27901
42.83/42.94	Improving Solution with cost 1 ...
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetNextSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.466409s
42.83/42.94	Time used: 0.466393
42.83/42.94	
42.83/42.94	LOG: SAT solveNonLinear - Elapsed time: 1.780202s
42.83/42.94	Cost: 1; Total time: 1.7454
42.83/42.94	Failed at location 2: 11 <= arg2
42.83/42.94	Before Improving: 
42.83/42.94	Quasi-invariant at l2: 11 <= arg2
42.83/42.94	Optimizing invariants...
42.83/42.94	
42.83/42.94	LOG: CALL solveLinear
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear - Elapsed time: 0.041141s
42.83/42.94	Remaining time after improvement: 0.9968
42.83/42.94	Termination implied by a set of quasi-invariant(s):
42.83/42.94	Quasi-invariant at l2: 11 <= arg2
42.83/42.94	[ Invariant Graph ]
42.83/42.94	Strengthening and disabling transitions...
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	It's unfeasible. Removing transition: 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	It's unfeasible. Removing transition: 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	It's unfeasible. Removing transition: 
42.83/42.94	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	It's unfeasible. Removing transition: 
42.83/42.94	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	[ Termination Graph ]
42.83/42.94	Strengthening and disabling transitions...
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	It's unfeasible. Removing transition: 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	It's unfeasible. Removing transition: 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	It's unfeasible. Removing transition: 
42.83/42.94	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	It's unfeasible. Removing transition: 
42.83/42.94	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	New Graphs: 
42.83/42.94	Calling Safety with literal 11 <= arg2 and entry <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL check - Post:11 <= arg2 - Process 1
42.83/42.94	* Exit transition: <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
42.83/42.94	* Postcondition  : 11 <= arg2
42.83/42.94	
42.83/42.94	LOG: CALL solveLinear
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear - Elapsed time: 0.001161s
42.83/42.94	> Postcondition is not implied!
42.83/42.94	
42.83/42.94	LOG: RETURN check - Elapsed time: 0.001266s
42.83/42.94	INVARIANTS: 
42.83/42.94	2: 
42.83/42.94	Quasi-INVARIANTS to narrow Graph: 
42.83/42.94	2: 11 <= arg2 , 
42.83/42.94	Narrowing transition: 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: Narrow transition size 1
42.83/42.94	Narrowing transition: 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: Narrow transition size 1
42.83/42.94	Narrowing transition: 
42.83/42.94	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: Narrow transition size 1
42.83/42.94	Narrowing transition: 
42.83/42.94	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: Narrow transition size 1
42.83/42.94	invGraph after Narrowing: 
42.83/42.94	Transitions:
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	Variables:
42.83/42.94	arg1, arg2
42.83/42.94	Checking conditional termination of SCC {l2}...
42.83/42.94	
42.83/42.94	LOG: CALL solveLinear
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear - Elapsed time: 0.001428s
42.83/42.94	
42.83/42.94	LOG: CALL solveLinear
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear - Elapsed time: 0.017651s
42.83/42.94	Trying to remove transition: <l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.757433s
42.83/42.94	Time used: 0.756982
42.83/42.94	Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008974s
42.83/42.94	Time used: 4.00191
42.83/42.94	Trying to remove transition: <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.054036s
42.83/42.94	Time used: 4.01303
42.83/42.94	Trying to remove transition: <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.052292s
42.83/42.94	Time used: 4.00196
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.037170s
42.83/42.94	Time used: 4.00188
42.83/42.94	Solving with 2 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.018024s
42.83/42.94	Time used: 4.00104
42.83/42.94	Solving with 3 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.042573s
42.83/42.94	Time used: 1.00131
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.035852s
42.83/42.94	Time used: 4.00226
42.83/42.94	
42.83/42.94	Proving non-termination of subgraph 1
42.83/42.94	Transitions:
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	Variables:
42.83/42.94	arg1, arg2
42.83/42.94	
42.83/42.94	Checking conditional non-termination of SCC {l2}...
42.83/42.94	EXIT TRANSITIONS:
42.83/42.94	<l2, end, 11 <= arg2 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	<l2, end, 11 <= arg2 /\ arg1 = 1, {all remain the same}>
42.83/42.94	<l2, end, arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
42.83/42.94	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
42.83/42.94	<l2, end, 1 + arg2 <= 0 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	<l2, end, 1 + arg2 <= 0 /\ arg1 = 1, {all remain the same}>
42.83/42.94	<l2, end, arg1 <= 0 /\ 1 + arg2 <= 0, {all remain the same}>
42.83/42.94	
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080327s
42.83/42.94	Time used: 0.080019
42.83/42.94	Improving Solution with cost 8 ...
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetNextSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001560s
42.83/42.94	Time used: 1.00153
42.83/42.94	
42.83/42.94	LOG: SAT solveNonLinear - Elapsed time: 1.081887s
42.83/42.94	Cost: 8; Total time: 1.08155
42.83/42.94	Non-termination implied by a set of quasi-invariant(s):
42.83/42.94	Quasi-invariant at l2: 0 <= arg2
42.83/42.94	
42.83/42.94	Strengthening and disabling EXIT transitions...
42.83/42.94	Closed exits from l2: 3
42.83/42.94	Strengthening exit transition (result): 
42.83/42.94	<l2, end, 11 <= arg2 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	Strengthening exit transition (result): 
42.83/42.94	<l2, end, 11 <= arg2 /\ arg1 = 1, {all remain the same}>
42.83/42.94	Strengthening exit transition (result): 
42.83/42.94	<l2, end, arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
42.83/42.94	Strengthening exit transition (result): 
42.83/42.94	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	Strengthening exit transition (result): 
42.83/42.94	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
42.83/42.94	
42.83/42.94	Strengthening and disabling transitions...
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	
42.83/42.94	Checking conditional non-termination of SCC {l2}...
42.83/42.94	EXIT TRANSITIONS:
42.83/42.94	<l2, end, 11 <= arg2 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	<l2, end, 11 <= arg2 /\ arg1 = 1, {all remain the same}>
42.83/42.94	<l2, end, arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
42.83/42.94	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
42.83/42.94	
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049035s
42.83/42.94	Time used: 0.048747
42.83/42.94	Improving Solution with cost 5 ...
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetNextSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.219377s
42.83/42.94	Time used: 0.218877
42.83/42.94	Improving Solution with cost 3 ...
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetNextSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.244803s
42.83/42.94	Time used: 0.24479
42.83/42.94	
42.83/42.94	LOG: SAT solveNonLinear - Elapsed time: 0.513214s
42.83/42.94	Cost: 3; Total time: 0.512414
42.83/42.94	Failed at location 2: arg2 <= 10
42.83/42.94	Before Improving: 
42.83/42.94	Quasi-invariant at l2: arg2 <= 10
42.83/42.94	Optimizing invariants...
42.83/42.94	
42.83/42.94	LOG: CALL solveLinear
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear - Elapsed time: 0.020875s
42.83/42.94	Remaining time after improvement: 0.99766
42.83/42.94	Non-termination implied by a set of quasi-invariant(s):
42.83/42.94	Quasi-invariant at l2: arg2 <= 10
42.83/42.94	
42.83/42.94	Strengthening and disabling EXIT transitions...
42.83/42.94	Closed exits from l2: 3
42.83/42.94	Strengthening exit transition (result): 
42.83/42.94	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	Strengthening exit transition (result): 
42.83/42.94	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
42.83/42.94	
42.83/42.94	Strengthening and disabling transitions...
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	
42.83/42.94	Checking conditional non-termination of SCC {l2}...
42.83/42.94	EXIT TRANSITIONS:
42.83/42.94	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
42.83/42.94	
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017431s
42.83/42.94	Time used: 0.017178
42.83/42.94	Improving Solution with cost 1 ...
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetNextSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.048611s
42.83/42.94	Time used: 0.048603
42.83/42.94	
42.83/42.94	LOG: SAT solveNonLinear - Elapsed time: 0.066042s
42.83/42.94	Cost: 1; Total time: 0.065781
42.83/42.94	Non-termination implied by a set of quasi-invariant(s):
42.83/42.94	Quasi-invariant at l2: 0 <= arg1
42.83/42.94	
42.83/42.94	Strengthening and disabling EXIT transitions...
42.83/42.94	Closed exits from l2: 1
42.83/42.94	Strengthening exit transition (result): 
42.83/42.94	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	
42.83/42.94	Strengthening and disabling transitions...
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 0 <= arg1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 0 <= arg1 /\ arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	
42.83/42.94	Checking conditional non-termination of SCC {l2}...
42.83/42.94	EXIT TRANSITIONS:
42.83/42.94	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
42.83/42.94	
42.83/42.94	Solving with 1 template(s).
42.83/42.94	
42.83/42.94	LOG: CALL solveNonLinearGetFirstSolution
42.83/42.94	
42.83/42.94	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013717s
42.83/42.94	Time used: 0.013614
42.83/42.94	
42.83/42.94	LOG: SAT solveNonLinear - Elapsed time: 0.013717s
42.83/42.94	Cost: 0; Total time: 0.013614
42.83/42.94	Non-termination implied by a set of quasi-invariant(s):
42.83/42.94	Quasi-invariant at l2: arg1 <= 1
42.83/42.94	
42.83/42.94	Strengthening and disabling EXIT transitions...
42.83/42.94	Closed exits from l2: 1
42.83/42.94	
42.83/42.94	Strengthening and disabling transitions...
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
42.83/42.94	
42.83/42.94	LOG: CALL solverLinear in Graph for feasibility
42.83/42.94	
42.83/42.94	LOG: RETURN solveLinear in Graph for feasibility
42.83/42.94	Strengthening transition (result): 
42.83/42.94	<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
42.83/42.94	
42.83/42.94	Calling reachability with...
42.83/42.94	Transition: <l2, end, true, {all remain the same}>
42.83/42.94	Conditions: 0 <= arg2, arg2 <= 10, 0 <= arg1, arg1 <= 1, 
42.83/42.94	OPEN EXITS: 
42.83/42.94	<l2, end, 0 <= arg1 /\ 0 <= arg2 /\ arg1 <= 1 /\ arg2 <= 10, {all remain the same}>
42.83/42.94	
42.83/42.94	--- Reachability graph ---
42.83/42.94	> Graph without transitions.
42.83/42.94	
42.83/42.94	Calling reachability with...
42.83/42.94	Transition: <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
42.83/42.94	Conditions: 0 <= arg1, 0 <= arg2, arg1 <= 1, arg2 <= 10, 
42.83/42.94	OPEN EXITS: 
42.83/42.94	<l0, l2, 0 <= arg2 /\ 0 <= undef12 /\ 1 <= undef11 /\ arg2 <= 10 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
42.83/42.94	
42.83/42.94	> Conditions are reachable!
42.83/42.94	
42.83/42.94	Program does NOT terminate
42.83/42.94	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
42.83/42.94	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
42.83/42.94	EOF