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