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