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, l4, true>
0.00/0.05	<l1, l2, (undef2 > ~(1)) /\ (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}>
0.00/0.05	<l2, l3, (arg2 > 0) /\ (arg2 > arg1) /\ (arg1 > 0)>
0.00/0.05	<l2, l3, (arg2 > 0) /\ (arg2 < arg1) /\ (arg1 > 0)>
0.00/0.05	<l2, l2, (arg2 > 0) /\ (0 = arg1), par{arg1 -> arg2, arg2 -> 0}>
0.00/0.05	<l2, l2, (arg1 > 0) /\ (arg1 = arg2), par{arg2 -> 0}>
0.00/0.05	<l3, l3, (arg2 < arg1) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - arg2)}>
0.00/0.05	<l3, l2, (arg2 > arg1), par{arg1 -> arg2, arg2 -> arg1}>
0.00/0.05	<l4, l1, true, par{arg1 -> undef15, arg2 -> undef16}>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef1, undef2, undef15, undef16, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef1, undef2, undef15, undef16, 
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) /\ (undef2 > ~(1)) /\ (undef16 > ~(1)) /\ (undef1 > ~(1)) /\ (undef15 > 0)>
0.00/0.05	<l2, l3, (arg2 > 0) /\ (arg2 > arg1) /\ (arg1 > 0)>
0.00/0.05	<l2, l3, (arg2 > 0) /\ (arg2 < arg1) /\ (arg1 > 0)>
0.00/0.05	<l2, l2, (arg2 > 0) /\ (0 = arg1), par{arg1 -> arg2, arg2 -> 0}>
0.00/0.05	<l2, l2, (arg1 > 0) /\ (arg1 = arg2), par{arg2 -> 0}>
0.00/0.05	<l3, l3, (arg2 < arg1) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - arg2)}>
0.00/0.05	<l3, l2, (arg2 > arg1), par{arg1 -> arg2, arg2 -> arg1}>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef1, undef2, undef15, undef16, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef1, undef2, undef15, undef16, 
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, l3, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
0.00/0.05	<l2, l3, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {all remain the same}>
0.00/0.05	<l2, l2, 1 <= arg2 /\ arg1 = 0, {arg1 -> arg2, arg2 -> 0, rest remain the same}>
0.00/0.05	<l2, l2, 1 <= arg1 /\ arg1 = arg2, {arg2 -> 0, rest remain the same}>
0.00/0.05	<l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg1 - arg2, rest remain the same}>
0.00/0.05	<l3, l2, 1 + arg1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	arg1, arg2
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 <= undef15 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef16 /\ 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	( 3 , 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.019289
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l2, l3}...
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.002342s
0.00/0.05	Ranking function: -4 + 2*arg1 + 2*arg2
0.00/0.05	It's unfeasible after collapsing. Removing transition: 
0.00/0.05	<l2, l2, 1 <= 0, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
0.00/0.05	New Graphs: 
0.00/0.05	Transitions:
0.00/0.05	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
0.00/0.05	<l2, l2, 1 <= arg2 /\ arg1 = 0, {arg1 -> arg2, arg2 -> 0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	arg1, arg2
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.001205s
0.00/0.05	Ranking function: (~(7) / 2) + (1 / 2)*arg1 + (3 / 2)*arg2
0.00/0.05	New Graphs: 
0.00/0.05	Transitions:
0.00/0.05	<l2, l2, 1 <= arg2 /\ arg1 = 0, {arg1 -> arg2, arg2 -> 0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	arg1, arg2
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.000665s
0.00/0.05	Ranking function: -arg1
0.00/0.05	New Graphs: 
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.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.05	EOF