0.00/0.02	YES
0.00/0.02	
0.00/0.02	Solver Timeout: 4
0.00/0.02	Global Timeout: 300
0.00/0.02	No parsing errors!
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<l0, l3, true>
0.00/0.02	<l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 + 1), arg3 -> arg2}>
0.00/0.02	<l2, l2, (arg3 > arg2) /\ (arg3 > ~(1)) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg3 + 1)}>
0.00/0.02	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef1, undef4, undef7, undef8, undef9, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef1, undef4, undef7, undef8, undef9, 
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	Preprocessed LLVMGraph
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<l0, l2, (arg1 = undef1) /\ (arg2 = (undef8 + 1)) /\ (arg3 = undef8) /\ (undef1 <= undef7) /\ (undef8 > ~(1)) /\ (undef7 > 0) /\ (undef1 > 0)>
0.00/0.02	<l2, l2, (arg3 > arg2) /\ (arg3 > ~(1)) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg3 + 1)}>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	undef1, undef4, undef7, undef8, undef9, 
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	undef1, undef4, undef7, undef8, undef9, 
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	*************************************************************
0.00/0.02	*******************************************************************************************
0.00/0.02	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.02	*******************************************************************************************
0.00/0.02	
0.00/0.02	Init Location: 0
0.00/0.02	Graph 0:
0.00/0.02	Transitions:
0.00/0.02	Variables:
0.00/0.02	
0.00/0.02	Graph 1:
0.00/0.02	Transitions:
0.00/0.02	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef4 /\ undef4 <= arg1 /\ 0 <= arg3, {arg1 -> undef4, arg2 -> 1 + arg3, rest remain the same}>
0.00/0.02	Variables:
0.00/0.02	arg1, arg2, arg3
0.00/0.02	
0.00/0.02	Precedence: 
0.00/0.02	Graph 0
0.00/0.02	
0.00/0.02	Graph 1
0.00/0.02	<l0, l2, 1 <= undef1 /\ 1 <= undef7 /\ undef1 <= undef7 /\ 0 <= undef8 /\ arg2 = 1 + undef8 /\ arg1 = undef1 /\ arg3 = undef8, {all remain the same}>
0.00/0.02	
0.00/0.02	Map Locations to Subgraph:
0.00/0.02	( 0 , 0 )
0.00/0.02	( 2 , 1 )
0.00/0.02	
0.00/0.02	*******************************************************************************************
0.00/0.02	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.02	*******************************************************************************************
0.00/0.02	
0.00/0.02	Proving termination of subgraph 0
0.00/0.02	Proving termination of subgraph 1
0.00/0.02	Checking unfeasibility...
0.00/0.02	Time used: 0.003548
0.00/0.02	Some transition disabled by a set of invariant(s):
0.00/0.02	Invariant at l2: arg3 <= arg2
0.00/0.02	
0.00/0.02	Strengthening and disabling transitions...
0.00/0.02	> It's unfeasible. Removing transition: 
0.00/0.02	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef4 /\ undef4 <= arg1 /\ 0 <= arg3, {arg1 -> undef4, arg2 -> 1 + arg3, rest remain the same}>
0.00/0.02	Checking unfeasibility...
0.00/0.02	Time used: 2.8e-05
0.00/0.02	
0.00/0.02	Analyzing SCC {l2}...
0.00/0.02	No cycles found.
0.00/0.02	
0.00/0.02	Program Terminates
0.00/0.02	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.02	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.02	EOF