67.02/67.12	NO
67.02/67.12	
67.02/67.12	Solver Timeout: 4
67.02/67.12	Global Timeout: 300
67.02/67.12	No parsing errors!
67.02/67.12	Init Location: 0
67.02/67.12	Transitions:
67.02/67.12	<l0, l4, true>
67.02/67.12	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 0, arg2 -> 0, arg3 -> (10 * arg2)}>
67.02/67.12	<l2, l3, (arg3 < 10) /\ (arg3 > 1), par{arg2 -> arg3, arg3 -> arg2}>
67.02/67.12	<l2, l3, (arg3 > 10), par{arg2 -> arg3, arg3 -> arg2}>
67.02/67.12	<l3, l2, (arg1 < 2) /\ (arg2 > 1) /\ (0 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg2 - 1)}>
67.02/67.12	<l2, l2, (arg1 < 2) /\ (1 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 2}>
67.02/67.12	<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}>
67.02/67.12	<l3, l2, (arg1 < 2) /\ (arg2 > 1) /\ (1 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg2 + 1)}>
67.02/67.12	<l4, l1, true, par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}>
67.02/67.12	
67.02/67.12	Fresh variables:
67.02/67.12	undef22, undef23, undef24, 
67.02/67.12	
67.02/67.12	Undef variables:
67.02/67.12	undef22, undef23, undef24, 
67.02/67.12	
67.02/67.12	Abstraction variables:
67.02/67.12	
67.02/67.12	Exit nodes:
67.02/67.12	
67.02/67.12	Accepting locations:
67.02/67.12	
67.02/67.12	Asserts:
67.02/67.12	
67.02/67.12	Preprocessed LLVMGraph
67.02/67.12	Init Location: 0
67.02/67.12	Transitions:
67.02/67.12	<l0, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = (10 * undef23)) /\ (undef22 > 0) /\ (undef23 > ~(1))>
67.02/67.12	<l2, l2, (arg3 < 10) /\ (arg3 > 1) /\ (arg1 < 2) /\ (arg3 > 1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}>
67.02/67.12	<l2, l2, (arg3 < 10) /\ (arg3 > 1) /\ (arg1 < 2) /\ (arg3 > 1) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}>
67.02/67.12	<l2, l2, (arg3 > 10) /\ (arg1 < 2) /\ (arg3 > 1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}>
67.02/67.12	<l2, l2, (arg3 > 10) /\ (arg1 < 2) /\ (arg3 > 1) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}>
67.02/67.12	<l2, l2, (arg1 < 2) /\ (1 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 2}>
67.02/67.12	<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}>
67.02/67.12	
67.02/67.12	Fresh variables:
67.02/67.12	undef22, undef23, undef24, 
67.02/67.12	
67.02/67.12	Undef variables:
67.02/67.12	undef22, undef23, undef24, 
67.02/67.12	
67.02/67.12	Abstraction variables:
67.02/67.12	
67.02/67.12	Exit nodes:
67.02/67.12	
67.02/67.12	Accepting locations:
67.02/67.12	
67.02/67.12	Asserts:
67.02/67.12	
67.02/67.12	*************************************************************
67.02/67.12	*******************************************************************************************
67.02/67.12	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
67.02/67.12	*******************************************************************************************
67.02/67.12	
67.02/67.12	Init Location: 0
67.02/67.12	Graph 0:
67.02/67.12	Transitions:
67.02/67.12	Variables:
67.02/67.12	
67.02/67.12	Graph 1:
67.02/67.12	Transitions:
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	Variables:
67.02/67.12	arg1, arg2, arg3
67.02/67.12	
67.02/67.12	Precedence: 
67.02/67.12	Graph 0
67.02/67.12	
67.02/67.12	Graph 1
67.02/67.12	<l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>
67.02/67.12	
67.02/67.12	Map Locations to Subgraph:
67.02/67.12	( 0 , 0 )
67.02/67.12	( 2 , 1 )
67.02/67.12	
67.02/67.12	*******************************************************************************************
67.02/67.12	********************************    CHECKING ASSERTIONS    ********************************
67.02/67.12	*******************************************************************************************
67.02/67.12	
67.02/67.12	Proving termination of subgraph 0
67.02/67.12	Proving termination of subgraph 1
67.02/67.12	Checking unfeasibility...
67.02/67.12	Time used: 0.78792
67.02/67.12	
67.02/67.12	Checking conditional termination of SCC {l2}...
67.02/67.12	
67.02/67.12	LOG: CALL solveLinear
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear - Elapsed time: 0.007678s
67.02/67.12	
67.02/67.12	LOG: CALL solveLinear
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear - Elapsed time: 0.099479s
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002783s
67.02/67.12	Time used: 4.00106
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.037221s
67.02/67.12	Time used: 4.00005
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.017551s
67.02/67.12	Time used: 4.00018
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014758s
67.02/67.12	Time used: 4.00064
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.018373s
67.02/67.12	Time used: 4.00078
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014751s
67.02/67.12	Time used: 4.00053
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.159436s
67.02/67.12	Time used: 0.141363
67.02/67.12	Improving Solution with cost 1 ...
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetNextSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002696s
67.02/67.12	Time used: 1.00265
67.02/67.12	
67.02/67.12	LOG: SAT solveNonLinear - Elapsed time: 1.162131s
67.02/67.12	Cost: 1; Total time: 1.14402
67.02/67.12	Failed at location 2: arg3 <= 0
67.02/67.12	Before Improving: 
67.02/67.12	Quasi-invariant at l2: arg3 <= 0
67.02/67.12	Optimizing invariants...
67.02/67.12	
67.02/67.12	LOG: CALL solveLinear
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear - Elapsed time: 0.012288s
67.02/67.12	Remaining time after improvement: 0.993006
67.02/67.12	Termination implied by a set of quasi-invariant(s):
67.02/67.12	Quasi-invariant at l2: arg3 <= 0
67.02/67.12	[ Invariant Graph ]
67.02/67.12	Strengthening and disabling transitions...
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	[ Termination Graph ]
67.02/67.12	Strengthening and disabling transitions...
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	It's unfeasible. Removing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	New Graphs: 
67.02/67.12	Calling Safety with literal arg3 <= 0 and entry <l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL check - Post:arg3 <= 0 - Process 1
67.02/67.12	* Exit transition: <l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>
67.02/67.12	* Postcondition  : arg3 <= 0
67.02/67.12	
67.02/67.12	LOG: CALL solveLinear
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear - Elapsed time: 0.001116s
67.02/67.12	> Postcondition is not implied!
67.02/67.12	
67.02/67.12	LOG: RETURN check - Elapsed time: 0.001227s
67.02/67.12	INVARIANTS: 
67.02/67.12	2: 
67.02/67.12	Quasi-INVARIANTS to narrow Graph: 
67.02/67.12	2: arg3 <= 0 , 
67.02/67.12	Narrowing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: Narrow transition size 1
67.02/67.12	Narrowing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: Narrow transition size 1
67.02/67.12	Narrowing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: Narrow transition size 1
67.02/67.12	Narrowing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: Narrow transition size 1
67.02/67.12	Narrowing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: Narrow transition size 1
67.02/67.12	Narrowing transition: 
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: Narrow transition size 1
67.02/67.12	invGraph after Narrowing: 
67.02/67.12	Transitions:
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	Variables:
67.02/67.12	arg1, arg2, arg3
67.02/67.12	Checking conditional termination of SCC {l2}...
67.02/67.12	
67.02/67.12	LOG: CALL solveLinear
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear - Elapsed time: 0.002914s
67.02/67.12	
67.02/67.12	LOG: CALL solveLinear
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear - Elapsed time: 0.101074s
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002563s
67.02/67.12	Time used: 4.00097
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.022740s
67.02/67.12	Time used: 4.0001
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.023031s
67.02/67.12	Time used: 4.00033
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009653s
67.02/67.12	Time used: 4.00087
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.019207s
67.02/67.12	Time used: 4.00068
67.02/67.12	Trying to remove transition: <l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009613s
67.02/67.12	Time used: 4.00054
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.017949s
67.02/67.12	Time used: 4.00018
67.02/67.12	Solving with 2 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.027751s
67.02/67.12	Time used: 4.00011
67.02/67.12	Solving with 3 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005240s
67.02/67.12	Time used: 1.00113
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008110s
67.02/67.12	Time used: 4.00017
67.02/67.12	
67.02/67.12	Proving non-termination of subgraph 1
67.02/67.12	Transitions:
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	Variables:
67.02/67.12	arg1, arg2, arg3
67.02/67.12	
67.02/67.12	Checking conditional non-termination of SCC {l2}...
67.02/67.12	EXIT TRANSITIONS:
67.02/67.12	<l2, end, 1 <= arg2 /\ 10 <= arg3 /\ 2 <= arg1, {all remain the same}>
67.02/67.12	<l2, end, arg2 <= 0 /\ 10 <= arg3 /\ 2 <= arg1, {all remain the same}>
67.02/67.12	<l2, end, 1 <= arg2 /\ 2 <= arg1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	<l2, end, arg2 <= 0 /\ 2 <= arg1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	<l2, end, 1 <= arg2 /\ arg3 <= 1 /\ 2 <= arg1, {all remain the same}>
67.02/67.12	<l2, end, arg2 <= 0 /\ arg3 <= 1 /\ 2 <= arg1, {all remain the same}>
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
67.02/67.12	<l2, end, arg2 <= 0 /\ arg3 <= 0 /\ arg1 <= 1, {all remain the same}>
67.02/67.12	
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.135008s
67.02/67.12	Time used: 0.134518
67.02/67.12	Improving Solution with cost 10 ...
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetNextSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001527s
67.02/67.12	Time used: 1.0015
67.02/67.12	
67.02/67.12	LOG: SAT solveNonLinear - Elapsed time: 1.136535s
67.02/67.12	Cost: 10; Total time: 1.13602
67.02/67.12	Non-termination implied by a set of quasi-invariant(s):
67.02/67.12	Quasi-invariant at l2: arg1 <= 1
67.02/67.12	
67.02/67.12	Strengthening and disabling EXIT transitions...
67.02/67.12	Closed exits from l2: 6
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg2 <= 0 /\ arg3 <= 0 /\ arg1 <= 1, {all remain the same}>
67.02/67.12	
67.02/67.12	Strengthening and disabling transitions...
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	
67.02/67.12	Checking conditional non-termination of SCC {l2}...
67.02/67.12	EXIT TRANSITIONS:
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	<l2, end, 1 + arg2 <= 0 /\ arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
67.02/67.12	<l2, end, arg2 <= 0 /\ arg3 <= 0 /\ arg1 <= 1, {all remain the same}>
67.02/67.12	
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085413s
67.02/67.12	Time used: 0.085033
67.02/67.12	Improving Solution with cost 7 ...
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetNextSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001043s
67.02/67.12	Time used: 1.00102
67.02/67.12	
67.02/67.12	LOG: SAT solveNonLinear - Elapsed time: 1.086456s
67.02/67.12	Cost: 7; Total time: 1.08605
67.02/67.12	Non-termination implied by a set of quasi-invariant(s):
67.02/67.12	Quasi-invariant at l2: 0 <= arg2
67.02/67.12	
67.02/67.12	Strengthening and disabling EXIT transitions...
67.02/67.12	Closed exits from l2: 2
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg3 <= 0 /\ arg1 <= 1 /\ arg2 = 0, {all remain the same}>
67.02/67.12	
67.02/67.12	Strengthening and disabling transitions...
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	
67.02/67.12	Checking conditional non-termination of SCC {l2}...
67.02/67.12	EXIT TRANSITIONS:
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	<l2, end, arg3 <= 0 /\ 1 <= arg2 /\ arg1 <= 1, {all remain the same}>
67.02/67.12	<l2, end, arg3 <= 0 /\ arg1 <= 1 /\ arg2 = 0, {all remain the same}>
67.02/67.12	
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035023s
67.02/67.12	Time used: 0.034656
67.02/67.12	Improving Solution with cost 4 ...
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetNextSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001079s
67.02/67.12	Time used: 1.00104
67.02/67.12	
67.02/67.12	LOG: SAT solveNonLinear - Elapsed time: 1.036102s
67.02/67.12	Cost: 4; Total time: 1.0357
67.02/67.12	Failed at location 2: 1 <= arg3
67.02/67.12	Before Improving: 
67.02/67.12	Quasi-invariant at l2: 1 <= arg3
67.02/67.12	Optimizing invariants...
67.02/67.12	
67.02/67.12	LOG: CALL solveLinear
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear - Elapsed time: 0.047200s
67.02/67.12	Remaining time after improvement: 0.995936
67.02/67.12	Non-termination implied by a set of quasi-invariant(s):
67.02/67.12	Quasi-invariant at l2: 1 <= arg3
67.02/67.12	
67.02/67.12	Strengthening and disabling EXIT transitions...
67.02/67.12	Closed exits from l2: 2
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	Strengthening exit transition (result): 
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	
67.02/67.12	Strengthening and disabling transitions...
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	
67.02/67.12	Checking conditional non-termination of SCC {l2}...
67.02/67.12	EXIT TRANSITIONS:
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 11 <= arg3, {all remain the same}>
67.02/67.12	<l2, end, arg1 <= 1 /\ 2 <= arg2 /\ 2 <= arg3 /\ arg3 <= 9, {all remain the same}>
67.02/67.12	
67.02/67.12	Solving with 1 template(s).
67.02/67.12	
67.02/67.12	LOG: CALL solveNonLinearGetFirstSolution
67.02/67.12	
67.02/67.12	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026902s
67.02/67.12	Time used: 0.026796
67.02/67.12	
67.02/67.12	LOG: SAT solveNonLinear - Elapsed time: 0.026902s
67.02/67.12	Cost: 0; Total time: 0.026796
67.02/67.12	Non-termination implied by a set of quasi-invariant(s):
67.02/67.12	Quasi-invariant at l2: arg2 <= 1
67.02/67.12	
67.02/67.12	Strengthening and disabling EXIT transitions...
67.02/67.12	Closed exits from l2: 2
67.02/67.12	
67.02/67.12	Strengthening and disabling transitions...
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 2 <= arg3 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, arg1 <= 1 /\ 11 <= arg3 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg2 <= 1 /\ arg3 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 2, rest remain the same}>
67.02/67.12	
67.02/67.12	LOG: CALL solverLinear in Graph for feasibility
67.02/67.12	
67.02/67.12	LOG: RETURN solveLinear in Graph for feasibility
67.02/67.12	Strengthening transition (result): 
67.02/67.12	<l2, l2, 0 <= arg2 /\ arg1 <= 1 /\ arg2 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
67.02/67.12	
67.02/67.12	Calling reachability with...
67.02/67.12	Transition: <l2, end, true, {all remain the same}>
67.02/67.12	Conditions: arg1 <= 1, 0 <= arg2, 1 <= arg3, arg2 <= 1, 
67.02/67.12	OPEN EXITS: 
67.02/67.12	<l2, end, 0 <= arg2 /\ 1 <= arg3 /\ arg1 <= 1 /\ arg2 <= 1, {all remain the same}>
67.02/67.12	
67.02/67.12	--- Reachability graph ---
67.02/67.12	> Graph without transitions.
67.02/67.12	
67.02/67.12	Calling reachability with...
67.02/67.12	Transition: <l0, l2, 0 <= undef23 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>
67.02/67.12	Conditions: 0 <= arg2, 1 <= arg3, arg1 <= 1, arg2 <= 1, 
67.02/67.12	OPEN EXITS: 
67.02/67.12	<l0, l2, 0 <= undef23 /\ 1 <= arg3 /\ 1 <= undef22 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = 10*undef23, {all remain the same}>
67.02/67.12	
67.02/67.12	> Conditions are reachable!
67.02/67.12	
67.02/67.12	Program does NOT terminate
67.02/67.12	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
67.02/67.12	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
67.02/67.12	EOF