0.00/0.40	YES
0.00/0.40	
0.00/0.41	Solver Timeout: 4
0.00/0.41	Global Timeout: 300
0.00/0.41	No parsing errors!
0.00/0.41	Init Location: 0
0.00/0.41	Transitions:
0.00/0.41	<l0, l4, true>
0.00/0.41	<l1, l2, true, par{arg1 -> 0, arg2 -> undef2}>
0.00/0.41	<l2, l3, (arg1 < 10), par{arg2 -> 3}>
0.00/0.41	<l3, l2, (arg2 > 11), par{arg1 -> (arg1 + 1), arg2 -> undef6}>
0.00/0.41	<l3, l3, (arg2 < 12), par{arg2 -> (arg2 + 1)}>
0.00/0.41	<l4, l1, true, par{arg1 -> undef9, arg2 -> undef10}>
0.00/0.41	
0.00/0.41	Fresh variables:
0.00/0.41	undef2, undef6, undef9, undef10, 
0.00/0.41	
0.00/0.41	Undef variables:
0.00/0.41	undef2, undef6, undef9, undef10, 
0.00/0.41	
0.00/0.41	Abstraction variables:
0.00/0.41	
0.00/0.41	Exit nodes:
0.00/0.41	
0.00/0.41	Accepting locations:
0.00/0.41	
0.00/0.41	Asserts:
0.00/0.41	
0.00/0.41	Preprocessed LLVMGraph
0.00/0.41	Init Location: 0
0.00/0.41	Transitions:
0.00/0.41	<l0, l3, (arg1 = 0) /\ (arg2 = 3) /\ (0 < 10)>
0.00/0.41	<l3, l3, (arg2 > 11) /\ ((arg1 + 1) < 10), par{arg1 -> (arg1 + 1), arg2 -> 3}>
0.00/0.41	<l3, l3, (arg2 < 12), par{arg2 -> (arg2 + 1)}>
0.00/0.41	
0.00/0.41	Fresh variables:
0.00/0.41	undef2, undef6, undef9, undef10, 
0.00/0.41	
0.00/0.41	Undef variables:
0.00/0.41	undef2, undef6, undef9, undef10, 
0.00/0.41	
0.00/0.41	Abstraction variables:
0.00/0.41	
0.00/0.41	Exit nodes:
0.00/0.41	
0.00/0.41	Accepting locations:
0.00/0.41	
0.00/0.41	Asserts:
0.00/0.41	
0.00/0.41	*************************************************************
0.00/0.41	*******************************************************************************************
0.00/0.41	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.41	*******************************************************************************************
0.00/0.41	
0.00/0.41	Init Location: 0
0.00/0.41	Graph 0:
0.00/0.41	Transitions:
0.00/0.41	Variables:
0.00/0.41	
0.00/0.41	Graph 1:
0.00/0.41	Transitions:
0.00/0.41	<l3, l3, 12 <= arg2 /\ arg1 <= 8, {arg1 -> 1 + arg1, arg2 -> 3, rest remain the same}>
0.00/0.41	<l3, l3, arg2 <= 11, {arg2 -> 1 + arg2, rest remain the same}>
0.00/0.41	Variables:
0.00/0.41	arg1, arg2
0.00/0.41	
0.00/0.41	Precedence: 
0.00/0.41	Graph 0
0.00/0.41	
0.00/0.41	Graph 1
0.00/0.41	<l0, l3, arg1 = 0 /\ arg2 = 3, {all remain the same}>
0.00/0.41	
0.00/0.41	Map Locations to Subgraph:
0.00/0.41	( 0 , 0 )
0.00/0.41	( 3 , 1 )
0.00/0.41	
0.00/0.41	*******************************************************************************************
0.00/0.41	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.41	*******************************************************************************************
0.00/0.41	
0.00/0.41	Proving termination of subgraph 0
0.00/0.41	Proving termination of subgraph 1
0.00/0.41	Checking unfeasibility...
0.00/0.41	Time used: 0.383176
0.00/0.41	
0.00/0.41	Checking conditional termination of SCC {l3}...
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.002021s
0.00/0.41	Ranking function: 8 - arg1
0.00/0.41	New Graphs: 
0.00/0.41	Transitions:
0.00/0.41	<l3, l3, arg2 <= 11, {arg2 -> 1 + arg2, rest remain the same}>
0.00/0.41	Variables:
0.00/0.41	arg2
0.00/0.41	Checking conditional termination of SCC {l3}...
0.00/0.41	
0.00/0.41	LOG: CALL solveLinear
0.00/0.41	
0.00/0.41	LOG: RETURN solveLinear - Elapsed time: 0.000470s
0.00/0.41	Ranking function: 11 - arg2
0.00/0.41	New Graphs: 
0.00/0.41	Program Terminates
0.00/0.41	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.41	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.41	EOF