0.00/0.17	YES
0.00/0.17	
0.00/0.17	Solver Timeout: 4
0.00/0.17	Global Timeout: 300
0.00/0.17	No parsing errors!
0.00/0.17	Init Location: 0
0.00/0.17	Transitions:
0.00/0.17	<l0, l4, true>
0.00/0.17	<l1, l2, (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}>
0.00/0.17	<l2, l3, (arg1 > 1), par{arg1 -> 0, arg2 -> arg1}>
0.00/0.17	<l3, l2, (arg2 < 2), par{arg2 -> undef6}>
0.00/0.17	<l3, l3, (arg2 > 1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 2)}>
0.00/0.17	<l4, l1, true, par{arg1 -> undef9, arg2 -> undef10}>
0.00/0.17	
0.00/0.17	Fresh variables:
0.00/0.17	undef1, undef2, undef6, undef9, undef10, 
0.00/0.17	
0.00/0.17	Undef variables:
0.00/0.17	undef1, undef2, undef6, undef9, undef10, 
0.00/0.17	
0.00/0.17	Abstraction variables:
0.00/0.17	
0.00/0.17	Exit nodes:
0.00/0.17	
0.00/0.17	Accepting locations:
0.00/0.17	
0.00/0.17	Asserts:
0.00/0.17	
0.00/0.17	Preprocessed LLVMGraph
0.00/0.17	Init Location: 0
0.00/0.17	Transitions:
0.00/0.17	<l0, l3, (arg1 = 0) /\ (arg2 = undef1) /\ (undef10 > ~(1)) /\ (undef1 > ~(1)) /\ (undef9 > 0) /\ (undef1 > 1)>
0.00/0.17	<l3, l3, (arg2 < 2) /\ (arg1 > 1), par{arg1 -> 0, arg2 -> arg1}>
0.00/0.17	<l3, l3, (arg2 > 1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 2)}>
0.00/0.17	
0.00/0.17	Fresh variables:
0.00/0.17	undef1, undef2, undef6, undef9, undef10, 
0.00/0.17	
0.00/0.17	Undef variables:
0.00/0.17	undef1, undef2, undef6, undef9, undef10, 
0.00/0.17	
0.00/0.17	Abstraction variables:
0.00/0.17	
0.00/0.17	Exit nodes:
0.00/0.17	
0.00/0.17	Accepting locations:
0.00/0.17	
0.00/0.17	Asserts:
0.00/0.17	
0.00/0.17	*************************************************************
0.00/0.17	*******************************************************************************************
0.00/0.17	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.17	*******************************************************************************************
0.00/0.17	
0.00/0.17	Init Location: 0
0.00/0.17	Graph 0:
0.00/0.17	Transitions:
0.00/0.17	Variables:
0.00/0.17	
0.00/0.17	Graph 1:
0.00/0.17	Transitions:
0.00/0.17	<l3, l3, arg2 <= 1 /\ 2 <= arg1, {arg1 -> 0, arg2 -> arg1, rest remain the same}>
0.00/0.17	<l3, l3, 2 <= arg2, {arg1 -> 1 + arg1, arg2 -> -2 + arg2, rest remain the same}>
0.00/0.17	Variables:
0.00/0.17	arg1, arg2
0.00/0.17	
0.00/0.17	Precedence: 
0.00/0.17	Graph 0
0.00/0.17	
0.00/0.17	Graph 1
0.00/0.17	<l0, l3, 1 <= undef9 /\ 0 <= undef10 /\ 2 <= undef1 /\ arg1 = 0 /\ arg2 = undef1, {all remain the same}>
0.00/0.17	
0.00/0.17	Map Locations to Subgraph:
0.00/0.17	( 0 , 0 )
0.00/0.17	( 3 , 1 )
0.00/0.17	
0.00/0.17	*******************************************************************************************
0.00/0.17	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.17	*******************************************************************************************
0.00/0.17	
0.00/0.17	Proving termination of subgraph 0
0.00/0.17	Proving termination of subgraph 1
0.00/0.17	Checking unfeasibility...
0.00/0.17	Time used: 0.042221
0.00/0.17	
0.00/0.17	Checking conditional termination of SCC {l3}...
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.001035s
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.012509s
0.00/0.17	Trying to remove transition: <l3, l3, 2 <= arg2, {arg1 -> 1 + arg1, arg2 -> -2 + arg2, rest remain the same}>
0.00/0.17	Solving with 1 template(s).
0.00/0.17	
0.00/0.17	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.17	
0.00/0.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053536s
0.00/0.17	Time used: 0.053239
0.00/0.17	Trying to remove transition: <l3, l3, arg2 <= 1 /\ 2 <= arg1, {arg1 -> 0, arg2 -> arg1, rest remain the same}>
0.00/0.17	Solving with 1 template(s).
0.00/0.17	
0.00/0.17	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.17	
0.00/0.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017298s
0.00/0.17	Time used: 0.016573
0.00/0.17	Solving with 1 template(s).
0.00/0.17	
0.00/0.17	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.17	
0.00/0.17	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015269s
0.00/0.17	Time used: 0.014762
0.00/0.17	
0.00/0.17	LOG: SAT solveNonLinear - Elapsed time: 0.015269s
0.00/0.17	Cost: 0; Total time: 0.014762
0.00/0.17	Termination implied by a set of invariant(s):
0.00/0.17	Invariant at l3: 0 <= arg2
0.00/0.17	[ Invariant Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	Strengthening transition (result): 
0.00/0.17	<l3, l3, arg2 <= 1 /\ 0 <= arg2 /\ 2 <= arg1, {arg1 -> 0, arg2 -> arg1, rest remain the same}>
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	Strengthening transition (result): 
0.00/0.17	<l3, l3, 2 <= arg2, {arg1 -> 1 + arg1, arg2 -> -2 + arg2, rest remain the same}>
0.00/0.17	[ Termination Graph ]
0.00/0.17	Strengthening and disabling transitions...
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	Strengthening transition (result): 
0.00/0.17	<l3, l3, arg2 <= 1 /\ 0 <= arg2 /\ 2 <= arg1, {arg1 -> 0, arg2 -> arg1, rest remain the same}>
0.00/0.17	
0.00/0.17	LOG: CALL solverLinear in Graph for feasibility
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.17	Strengthening transition (result): 
0.00/0.17	<l3, l3, 2 <= arg2, {arg1 -> 1 + arg1, arg2 -> -2 + arg2, rest remain the same}>
0.00/0.17	Ranking function: 3*arg1 + 2*arg2
0.00/0.17	New Graphs: 
0.00/0.17	Transitions:
0.00/0.17	<l3, l3, 2 <= arg2, {arg1 -> 1 + arg1, arg2 -> -2 + arg2, rest remain the same}>
0.00/0.17	Variables:
0.00/0.17	arg1, arg2
0.00/0.17	Checking conditional termination of SCC {l3}...
0.00/0.17	
0.00/0.17	LOG: CALL solveLinear
0.00/0.17	
0.00/0.17	LOG: RETURN solveLinear - Elapsed time: 0.000624s
0.00/0.17	Ranking function: -1 + (1 / 2)*arg2
0.00/0.17	New Graphs: 
0.00/0.17	INVARIANTS: 
0.00/0.17	3: 0 <= arg2 , 
0.00/0.17	Quasi-INVARIANTS to narrow Graph: 
0.00/0.17	3: 
0.00/0.17	Program Terminates
0.00/0.17	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.17	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.17	EOF