69.53/69.60	NO
69.53/69.60	
69.53/69.60	Solver Timeout: 4
69.53/69.60	Global Timeout: 300
69.53/69.60	No parsing errors!
69.53/69.60	Init Location: 0
69.53/69.60	Transitions:
69.53/69.60	<l0, l3, true>
69.53/69.60	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0}>
69.53/69.60	<l2, l2, (1 = arg2), par{arg1 -> 1, arg2 -> 2}>
69.53/69.60	<l2, l2, (arg2 < 10) /\ (arg2 > 1) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
69.53/69.60	<l2, l2, (arg2 < 10) /\ (arg2 > 1) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
69.53/69.60	<l2, l2, (arg2 > 10) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
69.53/69.60	<l2, l2, (arg2 > 10) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
69.53/69.60	<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>
69.53/69.60	<l3, l1, true, par{arg1 -> undef15, arg2 -> undef16}>
69.53/69.60	
69.53/69.60	Fresh variables:
69.53/69.60	undef15, undef16, 
69.53/69.60	
69.53/69.60	Undef variables:
69.53/69.60	undef15, undef16, 
69.53/69.60	
69.53/69.60	Abstraction variables:
69.53/69.60	
69.53/69.60	Exit nodes:
69.53/69.60	
69.53/69.60	Accepting locations:
69.53/69.60	
69.53/69.60	Asserts:
69.53/69.60	
69.53/69.60	Preprocessed LLVMGraph
69.53/69.60	Init Location: 0
69.53/69.60	Transitions:
69.53/69.60	<l0, l2, (arg1 = 0) /\ (arg2 = undef16) /\ (undef15 > 0) /\ (undef16 > ~(1))>
69.53/69.60	<l2, l2, (1 = arg2), par{arg1 -> 1, arg2 -> 2}>
69.53/69.60	<l2, l2, (arg2 < 10) /\ (arg2 > 1) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
69.53/69.60	<l2, l2, (arg2 < 10) /\ (arg2 > 1) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
69.53/69.60	<l2, l2, (arg2 > 10) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
69.53/69.60	<l2, l2, (arg2 > 10) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
69.53/69.60	<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>
69.53/69.60	
69.53/69.60	Fresh variables:
69.53/69.60	undef15, undef16, 
69.53/69.60	
69.53/69.60	Undef variables:
69.53/69.60	undef15, undef16, 
69.53/69.60	
69.53/69.60	Abstraction variables:
69.53/69.60	
69.53/69.60	Exit nodes:
69.53/69.60	
69.53/69.60	Accepting locations:
69.53/69.60	
69.53/69.60	Asserts:
69.53/69.60	
69.53/69.60	*************************************************************
69.53/69.60	*******************************************************************************************
69.53/69.60	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
69.53/69.60	*******************************************************************************************
69.53/69.60	
69.53/69.60	Init Location: 0
69.53/69.60	Graph 0:
69.53/69.60	Transitions:
69.53/69.60	Variables:
69.53/69.60	
69.53/69.60	Graph 1:
69.53/69.60	Transitions:
69.53/69.60	<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.60	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.60	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.60	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.60	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.60	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.60	Variables:
69.53/69.60	arg2, arg1
69.53/69.60	
69.53/69.60	Precedence: 
69.53/69.60	Graph 0
69.53/69.60	
69.53/69.60	Graph 1
69.53/69.60	<l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>
69.53/69.60	
69.53/69.60	Map Locations to Subgraph:
69.53/69.60	( 0 , 0 )
69.53/69.60	( 2 , 1 )
69.53/69.60	
69.53/69.60	*******************************************************************************************
69.53/69.60	********************************    CHECKING ASSERTIONS    ********************************
69.53/69.60	*******************************************************************************************
69.53/69.60	
69.53/69.60	Proving termination of subgraph 0
69.53/69.60	Proving termination of subgraph 1
69.53/69.60	Checking unfeasibility...
69.53/69.60	Time used: 0.411581
69.53/69.60	
69.53/69.60	Checking conditional termination of SCC {l2}...
69.53/69.60	
69.53/69.60	LOG: CALL solveLinear
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear - Elapsed time: 0.004944s
69.53/69.60	
69.53/69.60	LOG: CALL solveLinear
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear - Elapsed time: 0.074208s
69.53/69.60	Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.60	Solving with 1 template(s).
69.53/69.60	
69.53/69.60	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.60	
69.53/69.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003082s
69.53/69.60	Time used: 4.00166
69.53/69.60	Trying to remove transition: <l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.60	Solving with 1 template(s).
69.53/69.60	
69.53/69.60	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.60	
69.53/69.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.586118s
69.53/69.60	Time used: 0.580569
69.53/69.60	Trying to remove transition: <l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.60	Solving with 1 template(s).
69.53/69.60	
69.53/69.60	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.60	
69.53/69.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.388261s
69.53/69.60	Time used: 0.381326
69.53/69.60	Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.60	Solving with 1 template(s).
69.53/69.60	
69.53/69.60	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.60	
69.53/69.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009194s
69.53/69.60	Time used: 4.00163
69.53/69.60	Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.60	Solving with 1 template(s).
69.53/69.60	
69.53/69.60	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.60	
69.53/69.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011249s
69.53/69.60	Time used: 4.00562
69.53/69.60	Trying to remove transition: <l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.60	Solving with 1 template(s).
69.53/69.60	
69.53/69.60	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.60	
69.53/69.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.151847s
69.53/69.60	Time used: 3.14649
69.53/69.60	Solving with 1 template(s).
69.53/69.60	
69.53/69.60	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.60	
69.53/69.60	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.120474s
69.53/69.60	Time used: 0.101572
69.53/69.60	Improving Solution with cost 1 ...
69.53/69.60	
69.53/69.60	LOG: CALL solveNonLinearGetNextSolution
69.53/69.60	
69.53/69.60	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.663377s
69.53/69.60	Time used: 0.663336
69.53/69.60	
69.53/69.60	LOG: SAT solveNonLinear - Elapsed time: 0.783851s
69.53/69.60	Cost: 1; Total time: 0.764908
69.53/69.60	Failed at location 2: arg2 <= 0
69.53/69.60	Before Improving: 
69.53/69.60	Quasi-invariant at l2: arg2 <= 0
69.53/69.60	Optimizing invariants...
69.53/69.60	
69.53/69.60	LOG: CALL solveLinear
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear - Elapsed time: 0.009901s
69.53/69.60	Remaining time after improvement: 0.995314
69.53/69.60	Termination implied by a set of quasi-invariant(s):
69.53/69.60	Quasi-invariant at l2: arg2 <= 0
69.53/69.60	[ Invariant Graph ]
69.53/69.60	Strengthening and disabling transitions...
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.60	[ Termination Graph ]
69.53/69.60	Strengthening and disabling transitions...
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.60	It's unfeasible. Removing transition: 
69.53/69.60	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.60	
69.53/69.60	LOG: CALL solverLinear in Graph for feasibility
69.53/69.60	
69.53/69.60	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	It's unfeasible. Removing transition: 
69.53/69.61	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	New Graphs: 
69.53/69.61	Calling Safety with literal arg2 <= 0 and entry <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL check - Post:arg2 <= 0 - Process 1
69.53/69.61	* Exit transition: <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>
69.53/69.61	* Postcondition  : arg2 <= 0
69.53/69.61	
69.53/69.61	LOG: CALL solveLinear
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear - Elapsed time: 0.001013s
69.53/69.61	> Postcondition is not implied!
69.53/69.61	
69.53/69.61	LOG: RETURN check - Elapsed time: 0.001113s
69.53/69.61	INVARIANTS: 
69.53/69.61	2: 
69.53/69.61	Quasi-INVARIANTS to narrow Graph: 
69.53/69.61	2: arg2 <= 0 , 
69.53/69.61	Narrowing transition: 
69.53/69.61	<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: Narrow transition size 1
69.53/69.61	Narrowing transition: 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: Narrow transition size 1
69.53/69.61	Narrowing transition: 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: Narrow transition size 1
69.53/69.61	Narrowing transition: 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: Narrow transition size 1
69.53/69.61	Narrowing transition: 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: Narrow transition size 1
69.53/69.61	Narrowing transition: 
69.53/69.61	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: Narrow transition size 1
69.53/69.61	invGraph after Narrowing: 
69.53/69.61	Transitions:
69.53/69.61	<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	Variables:
69.53/69.61	arg2, arg1
69.53/69.61	Checking conditional termination of SCC {l2}...
69.53/69.61	
69.53/69.61	LOG: CALL solveLinear
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear - Elapsed time: 0.002205s
69.53/69.61	
69.53/69.61	LOG: CALL solveLinear
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear - Elapsed time: 0.075723s
69.53/69.61	Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004454s
69.53/69.61	Time used: 4.00279
69.53/69.61	Trying to remove transition: <l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.600756s
69.53/69.61	Time used: 0.594035
69.53/69.61	Trying to remove transition: <l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.404467s
69.53/69.61	Time used: 0.396457
69.53/69.61	Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011269s
69.53/69.61	Time used: 4.00298
69.53/69.61	Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011782s
69.53/69.61	Time used: 4.00545
69.53/69.61	Trying to remove transition: <l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.165363s
69.53/69.61	Time used: 3.16
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.019881s
69.53/69.61	Time used: 3.00027
69.53/69.61	Improving Solution with cost 1 ...
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetNextSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000593s
69.53/69.61	Time used: 1.00052
69.53/69.61	
69.53/69.61	LOG: SAT solveNonLinear - Elapsed time: 4.020474s
69.53/69.61	Cost: 1; Total time: 4.00078
69.53/69.61	Failed at location 2: arg2 <= 9 + arg1
69.53/69.61	Before Improving: 
69.53/69.61	Quasi-invariant at l2: arg2 <= 9 + arg1
69.53/69.61	Optimizing invariants...
69.53/69.61	
69.53/69.61	LOG: CALL solveLinear
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear - Elapsed time: 0.010753s
69.53/69.61	Remaining time after improvement: 0.99552
69.53/69.61	Termination implied by a set of quasi-invariant(s):
69.53/69.61	Quasi-invariant at l2: arg2 <= 9 + arg1
69.53/69.61	[ Invariant Graph ]
69.53/69.61	Strengthening and disabling transitions...
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, arg2 <= 9 + arg1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 + arg1 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 + arg1 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	It's unfeasible. Removing transition: 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	It's unfeasible. Removing transition: 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, arg2 <= 9 + arg1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	[ Termination Graph ]
69.53/69.61	Strengthening and disabling transitions...
69.53/69.61	> It's unfeasible. Removing transition: 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, arg2 <= 9 + arg1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 + arg1 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 + arg1 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	It's unfeasible. Removing transition: 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, arg2 <= 9 + arg1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	New Graphs: 
69.53/69.61	Transitions:
69.53/69.61	<l2, l2, arg2 <= 9 + arg1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 + arg1 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 + arg1 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, arg2 <= 9 + arg1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	Variables:
69.53/69.61	arg1, arg2
69.53/69.61	Checking conditional termination of SCC {l2}...
69.53/69.61	
69.53/69.61	LOG: CALL solveLinear
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear - Elapsed time: 0.002136s
69.53/69.61	
69.53/69.61	LOG: CALL solveLinear
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear - Elapsed time: 0.069719s
69.53/69.61	Trying to remove transition: <l2, l2, arg2 <= 9 + arg1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014679s
69.53/69.61	Time used: 4.01352
69.53/69.61	Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 + arg1 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.025627s
69.53/69.61	Time used: 4.00305
69.53/69.61	Trying to remove transition: <l2, l2, 2 <= arg2 /\ arg2 <= 9 + arg1 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.042065s
69.53/69.61	Time used: 4.00244
69.53/69.61	Trying to remove transition: <l2, l2, arg2 <= 9 + arg1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.049125s
69.53/69.61	Time used: 4.00237
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012931s
69.53/69.61	Time used: 4.00208
69.53/69.61	Solving with 2 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015283s
69.53/69.61	Time used: 4.00112
69.53/69.61	Solving with 3 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017943s
69.53/69.61	Time used: 1.00013
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.035933s
69.53/69.61	Time used: 4.00248
69.53/69.61	
69.53/69.61	Proving non-termination of subgraph 1
69.53/69.61	Transitions:
69.53/69.61	<l2, l2, arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	Variables:
69.53/69.61	arg2, arg1
69.53/69.61	
69.53/69.61	Checking conditional non-termination of SCC {l2}...
69.53/69.61	EXIT TRANSITIONS:
69.53/69.61	<l2, end, 2 <= arg1 /\ 11 <= arg2, {all remain the same}>
69.53/69.61	<l2, end, 1 + arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
69.53/69.61	<l2, end, 2 <= arg1 /\ 2 <= arg2 /\ arg2 <= 9, {all remain the same}>
69.53/69.61	<l2, end, 1 + arg1 <= 0 /\ 2 <= arg2 /\ arg2 <= 9, {all remain the same}>
69.53/69.61	<l2, end, arg2 <= 0 /\ 2 <= arg1, {all remain the same}>
69.53/69.61	<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
69.53/69.61	<l2, end, arg1 <= 0 /\ arg2 <= 0, {all remain the same}>
69.53/69.61	
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039062s
69.53/69.61	Time used: 0.038732
69.53/69.61	Improving Solution with cost 7 ...
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetNextSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.022502s
69.53/69.61	Time used: 1.02243
69.53/69.61	
69.53/69.61	LOG: SAT solveNonLinear - Elapsed time: 1.061565s
69.53/69.61	Cost: 7; Total time: 1.06116
69.53/69.61	Non-termination implied by a set of quasi-invariant(s):
69.53/69.61	Quasi-invariant at l2: arg1 <= 1
69.53/69.61	
69.53/69.61	Strengthening and disabling EXIT transitions...
69.53/69.61	Closed exits from l2: 3
69.53/69.61	Strengthening exit transition (result): 
69.53/69.61	<l2, end, 1 + arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
69.53/69.61	Strengthening exit transition (result): 
69.53/69.61	<l2, end, 1 + arg1 <= 0 /\ 2 <= arg2 /\ arg2 <= 9, {all remain the same}>
69.53/69.61	Strengthening exit transition (result): 
69.53/69.61	<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
69.53/69.61	Strengthening exit transition (result): 
69.53/69.61	<l2, end, arg1 <= 0 /\ arg2 <= 0, {all remain the same}>
69.53/69.61	
69.53/69.61	Strengthening and disabling transitions...
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, arg1 <= 1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, arg1 <= 1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	
69.53/69.61	Checking conditional non-termination of SCC {l2}...
69.53/69.61	EXIT TRANSITIONS:
69.53/69.61	<l2, end, 1 + arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
69.53/69.61	<l2, end, 1 + arg1 <= 0 /\ 2 <= arg2 /\ arg2 <= 9, {all remain the same}>
69.53/69.61	<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
69.53/69.61	<l2, end, arg1 <= 0 /\ arg2 <= 0, {all remain the same}>
69.53/69.61	
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034017s
69.53/69.61	Time used: 0.033675
69.53/69.61	Improving Solution with cost 4 ...
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetNextSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.033959s
69.53/69.61	Time used: 1.03361
69.53/69.61	
69.53/69.61	LOG: SAT solveNonLinear - Elapsed time: 1.067976s
69.53/69.61	Cost: 4; Total time: 1.06728
69.53/69.61	Non-termination implied by a set of quasi-invariant(s):
69.53/69.61	Quasi-invariant at l2: 0 <= arg1
69.53/69.61	
69.53/69.61	Strengthening and disabling EXIT transitions...
69.53/69.61	Closed exits from l2: 2
69.53/69.61	Strengthening exit transition (result): 
69.53/69.61	<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
69.53/69.61	Strengthening exit transition (result): 
69.53/69.61	<l2, end, arg2 <= 0 /\ arg1 = 0, {all remain the same}>
69.53/69.61	
69.53/69.61	Strengthening and disabling transitions...
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	
69.53/69.61	Checking conditional non-termination of SCC {l2}...
69.53/69.61	EXIT TRANSITIONS:
69.53/69.61	<l2, end, arg2 <= 0 /\ arg1 = 1, {all remain the same}>
69.53/69.61	<l2, end, arg2 <= 0 /\ arg1 = 0, {all remain the same}>
69.53/69.61	
69.53/69.61	Solving with 1 template(s).
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetFirstSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026120s
69.53/69.61	Time used: 0.025807
69.53/69.61	Improving Solution with cost 1 ...
69.53/69.61	
69.53/69.61	LOG: CALL solveNonLinearGetNextSolution
69.53/69.61	
69.53/69.61	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040458s
69.53/69.61	Time used: 0.04045
69.53/69.61	
69.53/69.61	LOG: SAT solveNonLinear - Elapsed time: 0.066578s
69.53/69.61	Cost: 1; Total time: 0.066257
69.53/69.61	Failed at location 2: 1 <= arg2
69.53/69.61	Before Improving: 
69.53/69.61	Quasi-invariant at l2: 1 <= arg2
69.53/69.61	Optimizing invariants...
69.53/69.61	
69.53/69.61	LOG: CALL solveLinear
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear - Elapsed time: 0.016612s
69.53/69.61	Remaining time after improvement: 0.997459
69.53/69.61	Non-termination implied by a set of quasi-invariant(s):
69.53/69.61	Quasi-invariant at l2: 1 <= arg2
69.53/69.61	
69.53/69.61	Strengthening and disabling EXIT transitions...
69.53/69.61	Closed exits from l2: 2
69.53/69.61	
69.53/69.61	Strengthening and disabling transitions...
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 1, {arg1 -> 1, arg2 -> 2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 2 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 11 <= arg2 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
69.53/69.61	
69.53/69.61	LOG: CALL solverLinear in Graph for feasibility
69.53/69.61	
69.53/69.61	LOG: RETURN solveLinear in Graph for feasibility
69.53/69.61	Strengthening transition (result): 
69.53/69.61	<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
69.53/69.61	
69.53/69.61	Calling reachability with...
69.53/69.61	Transition: <l2, end, true, {all remain the same}>
69.53/69.61	Conditions: arg1 <= 1, 0 <= arg1, 1 <= arg2, 
69.53/69.61	OPEN EXITS: 
69.53/69.61	<l2, end, 0 <= arg1 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
69.53/69.61	
69.53/69.61	--- Reachability graph ---
69.53/69.61	> Graph without transitions.
69.53/69.61	
69.53/69.61	Calling reachability with...
69.53/69.61	Transition: <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>
69.53/69.61	Conditions: 0 <= arg1, 1 <= arg2, arg1 <= 1, 
69.53/69.61	OPEN EXITS: 
69.53/69.61	<l0, l2, 0 <= undef16 /\ 1 <= arg2 /\ 1 <= undef15 /\ arg1 = 0 /\ arg2 = undef16, {all remain the same}>
69.53/69.61	
69.53/69.61	> Conditions are reachable!
69.53/69.61	
69.53/69.61	Program does NOT terminate
69.53/69.61	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
69.53/69.61	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
69.53/69.61	EOF