0.00/0.04	YES
0.00/0.04	
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, l6, true>
0.00/0.04	<l1, l2, (undef1 <= arg1) /\ ((undef1 - 1) <= arg2) /\ (undef2 <= arg2) /\ (arg1 > 0) /\ (arg2 > ~(1)) /\ (undef1 > 0) /\ (undef2 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}>
0.00/0.04	<l3, l2, (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef4, arg2 -> undef5, arg3 -> undef6}>
0.00/0.04	<l3, l4, (arg2 > ~(1)) /\ (undef7 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}>
0.00/0.04	<l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef11, arg3 -> undef12}>
0.00/0.04	<l2, l5, (undef13 <= arg2) /\ (undef16 > 0) /\ (undef15 <= arg2) /\ (arg1 > 0) /\ (arg2 > ~(1)) /\ (undef13 > ~(1)) /\ (undef15 > ~(1)), par{arg1 -> undef13, arg2 -> 1, arg3 -> undef15}>
0.00/0.04	<l5, l5, ((undef17 + 1) <= arg1) /\ ((undef17 + 1) <= arg3) /\ ((undef19 + 1) <= arg1) /\ ((undef19 + 1) <= arg3) /\ (arg1 > 0) /\ (arg3 > 0) /\ (undef17 > ~(1)) /\ (undef19 > ~(1)) /\ (0 = arg2), par{arg1 -> undef17, arg2 -> 1, arg3 -> undef19}>
0.00/0.04	<l5, l5, (undef20 <= arg1) /\ (undef20 <= arg3) /\ (undef22 <= arg1) /\ (undef22 <= arg3) /\ (arg1 > 0) /\ (arg3 > 0) /\ (undef20 > 0) /\ (undef22 > 0) /\ (1 = arg2), par{arg1 -> undef20, arg2 -> 0, arg3 -> undef22}>
0.00/0.04	<l6, l3, true, par{arg1 -> undef23, arg2 -> undef24, arg3 -> undef25}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef12, undef13, undef15, undef16, undef17, undef19, undef20, undef22, undef23, undef24, undef25, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef12, undef13, undef15, undef16, undef17, undef19, undef20, undef22, undef23, undef24, undef25, 
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, l5, (undef4 <= undef23) /\ (undef23 > 0) /\ (undef4 > 0) /\ (undef5 > ~(1)) /\ (undef13 <= undef5) /\ (undef16 > 0) /\ (undef15 <= undef5) /\ (undef4 > 0) /\ (undef5 > ~(1)) /\ (undef13 > ~(1)) /\ (undef15 > ~(1)), par{arg1 -> undef13, arg2 -> 1, arg3 -> undef15}>
0.00/0.04	<l0, l4, (undef24 > ~(1)) /\ (undef7 > ~(1)) /\ (undef23 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}>
0.00/0.04	<l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef11, arg3 -> undef12}>
0.00/0.04	<l5, l5, ((undef17 + 1) <= arg1) /\ ((undef17 + 1) <= arg3) /\ ((undef19 + 1) <= arg1) /\ ((undef19 + 1) <= arg3) /\ (arg1 > 0) /\ (arg3 > 0) /\ (undef17 > ~(1)) /\ (undef19 > ~(1)) /\ (0 = arg2), par{arg1 -> undef17, arg2 -> 1, arg3 -> undef19}>
0.00/0.04	<l5, l5, (undef20 <= arg1) /\ (undef20 <= arg3) /\ (undef22 <= arg1) /\ (undef22 <= arg3) /\ (arg1 > 0) /\ (arg3 > 0) /\ (undef20 > 0) /\ (undef22 > 0) /\ (1 = arg2), par{arg1 -> undef20, arg2 -> 0, arg3 -> undef22}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef12, undef13, undef15, undef16, undef17, undef19, undef20, undef22, undef23, undef24, undef25, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef12, undef13, undef15, undef16, undef17, undef19, undef20, undef22, undef23, undef24, undef25, 
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	<l4, l4, 1 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef11, arg3 -> undef12, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	arg1, arg2, arg3
0.00/0.04	
0.00/0.04	Graph 2:
0.00/0.04	Transitions:
0.00/0.04	<l5, l5, 1 <= arg1 /\ 1 + undef17 <= arg1 /\ 1 + undef19 <= arg1 /\ 1 <= arg3 /\ 1 + undef17 <= arg3 /\ 1 + undef19 <= arg3 /\ 0 <= undef17 /\ 0 <= undef19 /\ arg2 = 0, {arg1 -> undef17, arg2 -> 1, arg3 -> undef19, rest remain the same}>
0.00/0.04	<l5, l5, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef20 /\ 1 <= undef22 /\ undef20 <= arg1 /\ undef22 <= arg1 /\ undef20 <= arg3 /\ undef22 <= arg3 /\ arg2 = 1, {arg1 -> undef20, arg2 -> 0, arg3 -> undef22, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	arg1, arg2, arg3
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, l4, 1 <= undef23 /\ 0 <= undef7 /\ 0 <= undef24, {arg1 -> undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l0, l5, 1 <= undef4 /\ 1 <= undef16 /\ 1 <= undef23 /\ undef4 <= undef23 /\ 0 <= undef5 /\ undef13 <= undef5 /\ undef15 <= undef5 /\ 0 <= undef13 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> 1, arg3 -> undef15, rest 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	( 4 , 1 )
0.00/0.04	( 5 , 2 )
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.002545
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l4}...
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.000693s
0.00/0.04	Ranking function: -1 + arg1
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.008375
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l5}...
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.002922s
0.00/0.04	Ranking function: -6 + 3*arg2 + 3*arg3
0.00/0.04	New Graphs: 
0.00/0.04	Transitions:
0.00/0.04	<l5, l5, 1 <= arg1 /\ 1 + undef17 <= arg1 /\ 1 + undef19 <= arg1 /\ 1 <= arg3 /\ 1 + undef17 <= arg3 /\ 1 + undef19 <= arg3 /\ 0 <= undef17 /\ 0 <= undef19 /\ arg2 = 0, {arg1 -> undef17, arg2 -> 1, arg3 -> undef19, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	arg1, arg2, arg3
0.00/0.04	Checking conditional termination of SCC {l5}...
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.001386s
0.00/0.04	Ranking function: -arg2
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.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.05	EOF