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