0.00/0.01	YES
0.00/0.01	
0.00/0.01	Solver Timeout: 4
0.00/0.01	Global Timeout: 300
0.00/0.01	No parsing errors!
0.00/0.01	Init Location: 0
0.00/0.01	Transitions:
0.00/0.01	<l0, l3, true>
0.00/0.01	<l1, l2, (undef6 = undef6) /\ (undef7 = undef7) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef10 = undef10) /\ (undef9 = undef9) /\ (undef11 = undef11) /\ (undef3 = undef3) /\ (undef1 = undef1), par{Result_4^0 -> undef1, devExt_7^0 -> undef3, i_12^0 -> undef4, irp_11^0 -> undef5, loop_count_14^0 -> undef6, loop_max_13^0 -> undef7, lt_48^0 -> (0 + cnt_60^0), nPacketsOld_9^0 -> undef9, nPackets_10^0 -> undef10, request_8^0 -> undef11}>
0.00/0.01	<l3, l1, true>
0.00/0.01	
0.00/0.01	Fresh variables:
0.00/0.01	undef1, undef3, undef4, undef5, undef6, undef7, undef9, undef10, undef11, 
0.00/0.01	
0.00/0.01	Undef variables:
0.00/0.01	undef1, undef3, undef4, undef5, undef6, undef7, undef9, undef10, undef11, 
0.00/0.01	
0.00/0.01	Abstraction variables:
0.00/0.01	
0.00/0.01	Exit nodes:
0.00/0.01	
0.00/0.01	Accepting locations:
0.00/0.01	
0.00/0.01	Asserts:
0.00/0.01	
0.00/0.01	Preprocessed LLVMGraph
0.00/0.01	Init Location: 0
0.00/0.01	Transitions:
0.00/0.01	<l0, l2, (undef6 = undef6) /\ (undef7 = undef7) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef10 = undef10) /\ (undef9 = undef9) /\ (undef11 = undef11) /\ (undef3 = undef3) /\ (undef1 = undef1)>
0.00/0.01	
0.00/0.01	Fresh variables:
0.00/0.01	undef1, undef3, undef4, undef5, undef6, undef7, undef9, undef10, undef11, 
0.00/0.01	
0.00/0.01	Undef variables:
0.00/0.01	undef1, undef3, undef4, undef5, undef6, undef7, undef9, undef10, undef11, 
0.00/0.01	
0.00/0.01	Abstraction variables:
0.00/0.01	
0.00/0.01	Exit nodes:
0.00/0.01	
0.00/0.01	Accepting locations:
0.00/0.01	
0.00/0.01	Asserts:
0.00/0.01	
0.00/0.01	*************************************************************
0.00/0.01	*******************************************************************************************
0.00/0.01	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.01	*******************************************************************************************
0.00/0.01	
0.00/0.01	Init Location: 0
0.00/0.01	Graph 0:
0.00/0.01	Transitions:
0.00/0.01	Variables:
0.00/0.01	
0.00/0.01	Graph 1:
0.00/0.01	Transitions:
0.00/0.01	Variables:
0.00/0.01	
0.00/0.01	Precedence: 
0.00/0.01	Graph 0
0.00/0.01	
0.00/0.01	Graph 1
0.00/0.01	<l0, l2, true, {all remain the same}>
0.00/0.01	
0.00/0.01	Map Locations to Subgraph:
0.00/0.01	( 0 , 0 )
0.00/0.01	( 2 , 1 )
0.00/0.01	
0.00/0.01	*******************************************************************************************
0.00/0.01	********************************    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	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