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, l7, true>
0.00/0.03	<l1, l2, (undef1 <= arg1) /\ (arg1 > ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}>
0.00/0.03	<l3, l2, (arg1 > 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}>
0.00/0.03	<l2, l4, (undef6 > ~(1)) /\ (undef7 > 0) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}>
0.00/0.03	<l4, l5, (arg1 > 0) /\ (arg2 < 2) /\ ((undef8 + 2) <= arg1), par{arg1 -> undef8, arg2 -> undef9}>
0.00/0.03	<l4, l4, ((undef10 + 1) <= arg1) /\ (arg2 > 1) /\ (arg1 > 0) /\ (undef10 > ~(1)), par{arg1 -> undef10, arg2 -> (arg2 - 1)}>
0.00/0.03	<l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef13}>
0.00/0.03	<l3, l6, (arg2 > ~(1)) /\ (undef14 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef14, arg2 -> 1}>
0.00/0.03	<l6, l6, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}>
0.00/0.03	<l7, l3, true, par{arg1 -> undef18, arg2 -> undef19}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef13, undef14, undef18, undef19, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef13, undef14, undef18, undef19, 
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, l4, (undef18 > 0) /\ (undef3 > ~(1)) /\ (undef6 > ~(1)) /\ (undef7 > 0) /\ (undef5 <= undef3) /\ (undef3 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}>
0.00/0.03	<l0, l6, (undef19 > ~(1)) /\ (undef14 > ~(1)) /\ (undef18 > 0), par{arg1 -> undef14, arg2 -> 1}>
0.00/0.03	<l4, l5, (arg1 > 0) /\ (arg2 < 2) /\ ((undef8 + 2) <= arg1), par{arg1 -> undef8, arg2 -> undef9}>
0.00/0.03	<l4, l4, ((undef10 + 1) <= arg1) /\ (arg2 > 1) /\ (arg1 > 0) /\ (undef10 > ~(1)), par{arg1 -> undef10, arg2 -> (arg2 - 1)}>
0.00/0.03	<l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef13}>
0.00/0.03	<l6, l6, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef13, undef14, undef18, undef19, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef13, undef14, undef18, undef19, 
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	<l6, l6, 1 <= arg1 /\ 1 <= arg2, {arg1 -> -1 + arg1, 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	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	<l4, l4, 1 <= arg1 /\ 1 + undef10 <= arg1 /\ 0 <= undef10 /\ 2 <= arg2, {arg1 -> undef10, 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	Graph 3:
0.00/0.03	Transitions:
0.00/0.03	<l5, l5, 1 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef13, 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, l6, 1 <= undef18 /\ 0 <= undef14 /\ 0 <= undef19, {arg1 -> undef14, arg2 -> 1, rest remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l0, l4, 1 <= undef3 /\ 1 <= undef5 /\ 1 <= undef7 /\ 1 <= undef18 /\ undef5 <= undef3 /\ 0 <= undef6, {arg1 -> undef5, arg2 -> undef6, rest remain the same}>
0.00/0.03	
0.00/0.03	Graph 3
0.00/0.03	<l4, l5, 1 <= arg1 /\ arg2 <= 1 /\ 2 + undef8 <= arg1, {arg1 -> undef8, arg2 -> undef9, 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	( 4 , 2 )
0.00/0.03	( 5 , 3 )
0.00/0.03	( 6 , 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.002498
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l6}...
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.000679s
0.00/0.03	Ranking function: -1 + arg1
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.00254
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l4}...
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.000928s
0.00/0.03	Ranking function: -1 + arg1
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 3
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.001802
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l5}...
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.000640s
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