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, (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}>
0.00/0.03	<l3, l2, (arg1 > 0), par{arg1 -> arg2, arg2 -> undef4}>
0.00/0.03	<l3, l4, (arg2 > ~(1)) /\ (undef5 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef5, arg2 -> undef6}>
0.00/0.03	<l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef8}>
0.00/0.03	<l2, l5, (undef9 > 0) /\ (arg1 > 1), par{arg1 -> undef9, arg2 -> undef10}>
0.00/0.03	<l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef12}>
0.00/0.03	<l6, l3, true, par{arg1 -> undef13, arg2 -> undef14}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef1, undef2, undef4, undef5, undef6, undef8, undef9, undef10, undef12, undef13, undef14, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef1, undef2, undef4, undef5, undef6, undef8, undef9, undef10, undef12, undef13, undef14, 
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, l5, (undef13 > 0) /\ (undef9 > 0) /\ (undef14 > 1), par{arg1 -> undef9}>
0.00/0.03	<l0, l4, (undef14 > ~(1)) /\ (undef5 > ~(1)) /\ (undef13 > 0), par{arg1 -> undef5}>
0.00/0.03	<l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1)}>
0.00/0.03	<l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1)}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef1, undef2, undef4, undef5, undef6, undef8, undef9, undef10, undef12, undef13, undef14, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef1, undef2, undef4, undef5, undef6, undef8, undef9, undef10, undef12, undef13, undef14, 
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	<l4, l4, 1 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	arg1
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	<l5, l5, 1 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	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, l4, 0 <= undef5 /\ 0 <= undef14 /\ 1 <= undef13, {arg1 -> undef5, rest remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l0, l5, 1 <= undef9 /\ 1 <= undef13 /\ 2 <= undef14, {arg1 -> undef9, 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	( 4 , 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.00161
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l4}...
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.000517s
0.00/0.03	Ranking function: -1 + arg1
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.001467
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.000517s
0.00/0.03	Ranking function: -1 + arg1
0.00/0.03	New Graphs: 
0.00/0.03	Program Terminates
0.00/0.03	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.03	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.03	EOF