43.01/43.05	NO
43.01/43.05	
43.01/43.05	Solver Timeout: 4
43.01/43.05	Global Timeout: 300
43.01/43.05	No parsing errors!
43.01/43.05	Init Location: 0
43.01/43.05	Transitions:
43.01/43.05	<l0, l3, true>
43.01/43.05	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0}>
43.01/43.05	<l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
43.01/43.05	<l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
43.01/43.05	<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>
43.01/43.05	<l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}>
43.01/43.05	<l3, l1, true, par{arg1 -> undef11, arg2 -> undef12}>
43.01/43.05	
43.01/43.05	Fresh variables:
43.01/43.05	undef11, undef12, 
43.01/43.05	
43.01/43.05	Undef variables:
43.01/43.05	undef11, undef12, 
43.01/43.05	
43.01/43.05	Abstraction variables:
43.01/43.05	
43.01/43.05	Exit nodes:
43.01/43.05	
43.01/43.05	Accepting locations:
43.01/43.05	
43.01/43.05	Asserts:
43.01/43.05	
43.01/43.05	Preprocessed LLVMGraph
43.01/43.05	Init Location: 0
43.01/43.05	Transitions:
43.01/43.05	<l0, l2, (arg1 = 0) /\ (arg2 = undef12) /\ (undef11 > 0) /\ (undef12 > ~(1))>
43.01/43.05	<l2, l2, (arg2 < 10) /\ (arg2 > 0) /\ (arg2 < 11) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1)}>
43.01/43.05	<l2, l2, (arg2 < 10) /\ (arg2 < 11) /\ (arg2 > 0) /\ (1 = arg1), par{arg1 -> 1, arg2 -> (arg2 + 1)}>
43.01/43.05	<l2, l2, (10 = arg2), par{arg1 -> 0, arg2 -> 9}>
43.01/43.05	<l2, l2, (0 = arg2), par{arg1 -> 1, arg2 -> 1}>
43.01/43.05	
43.01/43.05	Fresh variables:
43.01/43.05	undef11, undef12, 
43.01/43.05	
43.01/43.05	Undef variables:
43.01/43.05	undef11, undef12, 
43.01/43.05	
43.01/43.05	Abstraction variables:
43.01/43.05	
43.01/43.05	Exit nodes:
43.01/43.05	
43.01/43.05	Accepting locations:
43.01/43.05	
43.01/43.05	Asserts:
43.01/43.05	
43.01/43.05	*************************************************************
43.01/43.05	*******************************************************************************************
43.01/43.05	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
43.01/43.05	*******************************************************************************************
43.01/43.05	
43.01/43.05	Init Location: 0
43.01/43.05	Graph 0:
43.01/43.05	Transitions:
43.01/43.05	Variables:
43.01/43.05	
43.01/43.05	Graph 1:
43.01/43.05	Transitions:
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	Variables:
43.01/43.05	arg1, arg2
43.01/43.05	
43.01/43.05	Precedence: 
43.01/43.05	Graph 0
43.01/43.05	
43.01/43.05	Graph 1
43.01/43.05	<l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
43.01/43.05	
43.01/43.05	Map Locations to Subgraph:
43.01/43.05	( 0 , 0 )
43.01/43.05	( 2 , 1 )
43.01/43.05	
43.01/43.05	*******************************************************************************************
43.01/43.05	********************************    CHECKING ASSERTIONS    ********************************
43.01/43.05	*******************************************************************************************
43.01/43.05	
43.01/43.05	Proving termination of subgraph 0
43.01/43.05	Proving termination of subgraph 1
43.01/43.05	Checking unfeasibility...
43.01/43.05	Time used: 0.160239
43.01/43.05	
43.01/43.05	Checking conditional termination of SCC {l2}...
43.01/43.05	
43.01/43.05	LOG: CALL solveLinear
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear - Elapsed time: 0.002367s
43.01/43.05	
43.01/43.05	LOG: CALL solveLinear
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear - Elapsed time: 0.011660s
43.01/43.05	Trying to remove transition: <l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.788199s
43.01/43.05	Time used: 0.787829
43.01/43.05	Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007745s
43.01/43.05	Time used: 4.00161
43.01/43.05	Trying to remove transition: <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.081608s
43.01/43.05	Time used: 4.00145
43.01/43.05	Trying to remove transition: <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.041159s
43.01/43.05	Time used: 4.00169
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.361819s
43.01/43.05	Time used: 1.31918
43.01/43.05	Improving Solution with cost 1 ...
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetNextSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.481755s
43.01/43.05	Time used: 0.481773
43.01/43.05	
43.01/43.05	LOG: SAT solveNonLinear - Elapsed time: 1.843574s
43.01/43.05	Cost: 1; Total time: 1.80095
43.01/43.05	Failed at location 2: 11 <= arg2
43.01/43.05	Before Improving: 
43.01/43.05	Quasi-invariant at l2: 11 <= arg2
43.01/43.05	Optimizing invariants...
43.01/43.05	
43.01/43.05	LOG: CALL solveLinear
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear - Elapsed time: 0.040879s
43.01/43.05	Remaining time after improvement: 0.996982
43.01/43.05	Termination implied by a set of quasi-invariant(s):
43.01/43.05	Quasi-invariant at l2: 11 <= arg2
43.01/43.05	[ Invariant Graph ]
43.01/43.05	Strengthening and disabling transitions...
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	It's unfeasible. Removing transition: 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	It's unfeasible. Removing transition: 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	It's unfeasible. Removing transition: 
43.01/43.05	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	It's unfeasible. Removing transition: 
43.01/43.05	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	[ Termination Graph ]
43.01/43.05	Strengthening and disabling transitions...
43.01/43.05	> It's unfeasible. Removing transition: 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	It's unfeasible. Removing transition: 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	It's unfeasible. Removing transition: 
43.01/43.05	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	It's unfeasible. Removing transition: 
43.01/43.05	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	New Graphs: 
43.01/43.05	Calling Safety with literal 11 <= arg2 and entry <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL check - Post:11 <= arg2 - Process 1
43.01/43.05	* Exit transition: <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
43.01/43.05	* Postcondition  : 11 <= arg2
43.01/43.05	
43.01/43.05	LOG: CALL solveLinear
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear - Elapsed time: 0.001186s
43.01/43.05	> Postcondition is not implied!
43.01/43.05	
43.01/43.05	LOG: RETURN check - Elapsed time: 0.001287s
43.01/43.05	INVARIANTS: 
43.01/43.05	2: 
43.01/43.05	Quasi-INVARIANTS to narrow Graph: 
43.01/43.05	2: 11 <= arg2 , 
43.01/43.05	Narrowing transition: 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: Narrow transition size 1
43.01/43.05	Narrowing transition: 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: Narrow transition size 1
43.01/43.05	Narrowing transition: 
43.01/43.05	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: Narrow transition size 1
43.01/43.05	Narrowing transition: 
43.01/43.05	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: Narrow transition size 1
43.01/43.05	invGraph after Narrowing: 
43.01/43.05	Transitions:
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	Variables:
43.01/43.05	arg1, arg2
43.01/43.05	Checking conditional termination of SCC {l2}...
43.01/43.05	
43.01/43.05	LOG: CALL solveLinear
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear - Elapsed time: 0.001391s
43.01/43.05	
43.01/43.05	LOG: CALL solveLinear
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear - Elapsed time: 0.012180s
43.01/43.05	Trying to remove transition: <l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.782326s
43.01/43.05	Time used: 0.782032
43.01/43.05	Trying to remove transition: <l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009670s
43.01/43.05	Time used: 4.00287
43.01/43.05	Trying to remove transition: <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.044375s
43.01/43.05	Time used: 4.00329
43.01/43.05	Trying to remove transition: <l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.042145s
43.01/43.05	Time used: 4.00224
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.046312s
43.01/43.05	Time used: 4.00194
43.01/43.05	Solving with 2 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013568s
43.01/43.05	Time used: 4.00125
43.01/43.05	Solving with 3 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.024263s
43.01/43.05	Time used: 1.00117
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.038070s
43.01/43.05	Time used: 4.00425
43.01/43.05	
43.01/43.05	Proving non-termination of subgraph 1
43.01/43.05	Transitions:
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	Variables:
43.01/43.05	arg1, arg2
43.01/43.05	
43.01/43.05	Checking conditional non-termination of SCC {l2}...
43.01/43.05	EXIT TRANSITIONS:
43.01/43.05	<l2, end, 1 <= arg1 /\ 11 <= arg2, {all remain the same}>
43.01/43.05	<l2, end, arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
43.01/43.05	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
43.01/43.05	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
43.01/43.05	<l2, end, 1 <= arg1 /\ 1 + arg2 <= 0, {all remain the same}>
43.01/43.05	<l2, end, arg1 <= 0 /\ 1 + arg2 <= 0, {all remain the same}>
43.01/43.05	
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026852s
43.01/43.05	Time used: 0.026578
43.01/43.05	Improving Solution with cost 6 ...
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetNextSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001692s
43.01/43.05	Time used: 1.00158
43.01/43.05	
43.01/43.05	LOG: SAT solveNonLinear - Elapsed time: 1.028544s
43.01/43.05	Cost: 6; Total time: 1.02815
43.01/43.05	Non-termination implied by a set of quasi-invariant(s):
43.01/43.05	Quasi-invariant at l2: 0 <= arg2
43.01/43.05	
43.01/43.05	Strengthening and disabling EXIT transitions...
43.01/43.05	Closed exits from l2: 2
43.01/43.05	Strengthening exit transition (result): 
43.01/43.05	<l2, end, 1 <= arg1 /\ 11 <= arg2, {all remain the same}>
43.01/43.05	Strengthening exit transition (result): 
43.01/43.05	<l2, end, arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
43.01/43.05	Strengthening exit transition (result): 
43.01/43.05	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
43.01/43.05	Strengthening exit transition (result): 
43.01/43.05	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
43.01/43.05	
43.01/43.05	Strengthening and disabling transitions...
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	
43.01/43.05	Checking conditional non-termination of SCC {l2}...
43.01/43.05	EXIT TRANSITIONS:
43.01/43.05	<l2, end, 1 <= arg1 /\ 11 <= arg2, {all remain the same}>
43.01/43.05	<l2, end, arg1 <= 0 /\ 11 <= arg2, {all remain the same}>
43.01/43.05	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
43.01/43.05	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
43.01/43.05	
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025539s
43.01/43.05	Time used: 0.02527
43.01/43.05	Improving Solution with cost 5 ...
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetNextSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.465132s
43.01/43.05	Time used: 0.465148
43.01/43.05	Improving Solution with cost 3 ...
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetNextSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.199968s
43.01/43.05	Time used: 0.199971
43.01/43.05	
43.01/43.05	LOG: SAT solveNonLinear - Elapsed time: 0.690639s
43.01/43.05	Cost: 3; Total time: 0.690389
43.01/43.05	Failed at location 2: arg2 <= 10
43.01/43.05	Before Improving: 
43.01/43.05	Quasi-invariant at l2: arg2 <= 10
43.01/43.05	Optimizing invariants...
43.01/43.05	
43.01/43.05	LOG: CALL solveLinear
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear - Elapsed time: 0.018508s
43.01/43.05	Remaining time after improvement: 0.997336
43.01/43.05	Non-termination implied by a set of quasi-invariant(s):
43.01/43.05	Quasi-invariant at l2: arg2 <= 10
43.01/43.05	
43.01/43.05	Strengthening and disabling EXIT transitions...
43.01/43.05	Closed exits from l2: 2
43.01/43.05	Strengthening exit transition (result): 
43.01/43.05	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
43.01/43.05	Strengthening exit transition (result): 
43.01/43.05	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
43.01/43.05	
43.01/43.05	Strengthening and disabling transitions...
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	
43.01/43.05	Checking conditional non-termination of SCC {l2}...
43.01/43.05	EXIT TRANSITIONS:
43.01/43.05	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
43.01/43.05	<l2, end, 1 + arg1 <= 0 /\ 1 <= arg2 /\ arg2 <= 9, {all remain the same}>
43.01/43.05	
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017106s
43.01/43.05	Time used: 0.016863
43.01/43.05	Improving Solution with cost 1 ...
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetNextSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.048342s
43.01/43.05	Time used: 0.048338
43.01/43.05	
43.01/43.05	LOG: SAT solveNonLinear - Elapsed time: 0.065448s
43.01/43.05	Cost: 1; Total time: 0.065201
43.01/43.05	Non-termination implied by a set of quasi-invariant(s):
43.01/43.05	Quasi-invariant at l2: 0 <= arg1
43.01/43.05	
43.01/43.05	Strengthening and disabling EXIT transitions...
43.01/43.05	Closed exits from l2: 1
43.01/43.05	Strengthening exit transition (result): 
43.01/43.05	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
43.01/43.05	
43.01/43.05	Strengthening and disabling transitions...
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 0 <= arg1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 0 <= arg1 /\ arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	
43.01/43.05	Checking conditional non-termination of SCC {l2}...
43.01/43.05	EXIT TRANSITIONS:
43.01/43.05	<l2, end, 1 <= arg2 /\ arg2 <= 9 /\ 2 <= arg1, {all remain the same}>
43.01/43.05	
43.01/43.05	Solving with 1 template(s).
43.01/43.05	
43.01/43.05	LOG: CALL solveNonLinearGetFirstSolution
43.01/43.05	
43.01/43.05	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013891s
43.01/43.05	Time used: 0.01379
43.01/43.05	
43.01/43.05	LOG: SAT solveNonLinear - Elapsed time: 0.013891s
43.01/43.05	Cost: 0; Total time: 0.01379
43.01/43.05	Non-termination implied by a set of quasi-invariant(s):
43.01/43.05	Quasi-invariant at l2: arg1 <= 1
43.01/43.05	
43.01/43.05	Strengthening and disabling EXIT transitions...
43.01/43.05	Closed exits from l2: 1
43.01/43.05	
43.01/43.05	Strengthening and disabling transitions...
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 1 <= arg2 /\ arg2 <= 9 /\ arg1 = 1, {arg1 -> 1, arg2 -> 1 + arg2, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 10, {arg1 -> 0, arg2 -> 9, rest remain the same}>
43.01/43.05	
43.01/43.05	LOG: CALL solverLinear in Graph for feasibility
43.01/43.05	
43.01/43.05	LOG: RETURN solveLinear in Graph for feasibility
43.01/43.05	Strengthening transition (result): 
43.01/43.05	<l2, l2, 0 <= arg1 /\ arg1 <= 1 /\ arg2 = 0, {arg1 -> 1, arg2 -> 1, rest remain the same}>
43.01/43.05	
43.01/43.05	Calling reachability with...
43.01/43.05	Transition: <l2, end, true, {all remain the same}>
43.01/43.05	Conditions: 0 <= arg2, arg2 <= 10, 0 <= arg1, arg1 <= 1, 
43.01/43.05	OPEN EXITS: 
43.01/43.05	<l2, end, 0 <= arg1 /\ 0 <= arg2 /\ arg1 <= 1 /\ arg2 <= 10, {all remain the same}>
43.01/43.05	
43.01/43.05	--- Reachability graph ---
43.01/43.05	> Graph without transitions.
43.01/43.05	
43.01/43.05	Calling reachability with...
43.01/43.05	Transition: <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
43.01/43.05	Conditions: 0 <= arg1, 0 <= arg2, arg1 <= 1, arg2 <= 10, 
43.01/43.05	OPEN EXITS: 
43.01/43.05	<l0, l2, 0 <= arg2 /\ 0 <= undef12 /\ 1 <= undef11 /\ arg2 <= 10 /\ arg1 = 0 /\ arg2 = undef12, {all remain the same}>
43.01/43.05	
43.01/43.05	> Conditions are reachable!
43.01/43.05	
43.01/43.05	Program does NOT terminate
43.01/43.05	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
43.01/43.05	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
43.01/43.05	EOF