0.00/0.03	YES
0.00/0.03	
0.00/0.04	Solver Timeout: 4
0.00/0.04	Global Timeout: 300
0.00/0.04	No parsing errors!
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l3, true>
0.00/0.04	<l1, l2, (undef2 > 0) /\ (undef1 > 4), par{arg1 -> undef1, arg2 -> undef2}>
0.00/0.04	<l2, l2, ((undef3 + 2) <= arg1) /\ ((undef4 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef3 > 0) /\ (undef4 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}>
0.00/0.04	<l2, l2, ((undef5 + 2) <= arg1) /\ ((undef6 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef5 > 0) /\ (undef6 > ~(1)), par{arg1 -> undef5, arg2 -> undef6}>
0.00/0.04	<l2, l2, ((undef7 + 2) <= arg1) /\ ((undef8 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > ~(1)), par{arg1 -> undef7, arg2 -> undef8}>
0.00/0.04	<l3, l1, true, par{arg1 -> undef9, arg2 -> undef10}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	Preprocessed LLVMGraph
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (undef2 > 0) /\ (undef1 > 4)>
0.00/0.04	<l2, l2, ((undef3 + 2) <= arg1) /\ ((undef4 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef3 > 0) /\ (undef4 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}>
0.00/0.04	<l2, l2, ((undef5 + 2) <= arg1) /\ ((undef6 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef5 > 0) /\ (undef6 > ~(1)), par{arg1 -> undef5, arg2 -> undef6}>
0.00/0.04	<l2, l2, ((undef7 + 2) <= arg1) /\ ((undef8 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > ~(1)), par{arg1 -> undef7, arg2 -> undef8}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	*************************************************************
0.00/0.04	*******************************************************************************************
0.00/0.04	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Graph 0:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Graph 1:
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, 0 <= undef4 /\ 2 + undef3 <= arg1 /\ 3 <= arg1 /\ 3 + undef4 <= arg1 /\ 1 <= arg2 /\ 1 <= undef3, {arg1 -> undef3, arg2 -> undef4, rest remain the same}>
0.00/0.04	<l2, l2, 0 <= undef6 /\ 2 + undef5 <= arg1 /\ 3 <= arg1 /\ 3 + undef6 <= arg1 /\ 1 <= arg2 /\ 1 <= undef5, {arg1 -> undef5, arg2 -> undef6, rest remain the same}>
0.00/0.04	<l2, l2, 0 <= undef8 /\ 2 + undef7 <= arg1 /\ 3 <= arg1 /\ 3 + undef8 <= arg1 /\ 1 <= arg2 /\ 1 <= undef7, {arg1 -> undef7, arg2 -> undef8, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	arg1, arg2
0.00/0.04	
0.00/0.04	Precedence: 
0.00/0.04	Graph 0
0.00/0.04	
0.00/0.04	Graph 1
0.00/0.04	<l0, l2, 1 <= undef2 /\ 5 <= undef1 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
0.00/0.04	
0.00/0.04	Map Locations to Subgraph:
0.00/0.04	( 0 , 0 )
0.00/0.04	( 2 , 1 )
0.00/0.04	
0.00/0.04	*******************************************************************************************
0.00/0.04	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Proving termination of subgraph 0
0.00/0.04	Proving termination of subgraph 1
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.0094
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l2}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.003304s
0.00/0.04	Ranking function: (~(3) / 2) + (1 / 2)*arg1
0.00/0.04	New Graphs: 
0.00/0.04	Program Terminates
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.04	EOF