0.00/0.21	YES
0.00/0.21	
0.00/0.21	Solver Timeout: 4
0.00/0.21	Global Timeout: 300
0.00/0.21	No parsing errors!
0.00/0.21	Init Location: 0
0.00/0.21	Transitions:
0.00/0.21	<l0, l3, true>
0.00/0.21	<l1, l2, (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> 1}>
0.00/0.21	<l2, l2, (arg1 < 101) /\ (arg2 > 0), par{arg1 -> (arg1 + 11), arg2 -> (arg2 + 1)}>
0.00/0.21	<l2, l2, (arg1 > 100) /\ (arg2 > 0), par{arg1 -> (arg1 - 10), arg2 -> (arg2 - 1)}>
0.00/0.21	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>
0.00/0.21	
0.00/0.21	Fresh variables:
0.00/0.21	undef1, undef7, undef8, 
0.00/0.21	
0.00/0.21	Undef variables:
0.00/0.21	undef1, undef7, undef8, 
0.00/0.21	
0.00/0.21	Abstraction variables:
0.00/0.21	
0.00/0.21	Exit nodes:
0.00/0.21	
0.00/0.21	Accepting locations:
0.00/0.21	
0.00/0.21	Asserts:
0.00/0.21	
0.00/0.21	Preprocessed LLVMGraph
0.00/0.21	Init Location: 0
0.00/0.21	Transitions:
0.00/0.21	<l0, l2, (arg1 = undef1) /\ (arg2 = 1) /\ (undef8 > ~(1)) /\ (undef1 > ~(1)) /\ (undef7 > 0)>
0.00/0.21	<l2, l2, (arg1 < 101) /\ (arg2 > 0), par{arg1 -> (arg1 + 11), arg2 -> (arg2 + 1)}>
0.00/0.21	<l2, l2, (arg1 > 100) /\ (arg2 > 0), par{arg1 -> (arg1 - 10), arg2 -> (arg2 - 1)}>
0.00/0.21	
0.00/0.21	Fresh variables:
0.00/0.21	undef1, undef7, undef8, 
0.00/0.21	
0.00/0.21	Undef variables:
0.00/0.21	undef1, undef7, undef8, 
0.00/0.21	
0.00/0.21	Abstraction variables:
0.00/0.21	
0.00/0.21	Exit nodes:
0.00/0.21	
0.00/0.21	Accepting locations:
0.00/0.21	
0.20/0.21	Asserts:
0.20/0.21	
0.20/0.21	*************************************************************
0.20/0.21	*******************************************************************************************
0.20/0.21	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.20/0.21	*******************************************************************************************
0.20/0.21	
0.20/0.21	Init Location: 0
0.20/0.21	Graph 0:
0.20/0.21	Transitions:
0.20/0.21	Variables:
0.20/0.21	
0.20/0.21	Graph 1:
0.20/0.21	Transitions:
0.20/0.21	<l2, l2, 1 <= arg2 /\ arg1 <= 100, {arg1 -> 11 + arg1, arg2 -> 1 + arg2, rest remain the same}>
0.20/0.21	<l2, l2, 1 <= arg2 /\ 101 <= arg1, {arg1 -> -10 + arg1, arg2 -> -1 + arg2, rest remain the same}>
0.20/0.21	Variables:
0.20/0.21	arg1, arg2
0.20/0.21	
0.20/0.21	Precedence: 
0.20/0.21	Graph 0
0.20/0.21	
0.20/0.21	Graph 1
0.20/0.21	<l0, l2, 1 <= undef7 /\ 0 <= undef1 /\ 0 <= undef8 /\ arg2 = 1 /\ arg1 = undef1, {all remain the same}>
0.20/0.21	
0.20/0.21	Map Locations to Subgraph:
0.20/0.21	( 0 , 0 )
0.20/0.21	( 2 , 1 )
0.20/0.21	
0.20/0.21	*******************************************************************************************
0.20/0.21	********************************    CHECKING ASSERTIONS    ********************************
0.20/0.21	*******************************************************************************************
0.20/0.21	
0.20/0.21	Proving termination of subgraph 0
0.20/0.21	Proving termination of subgraph 1
0.20/0.21	Checking unfeasibility...
0.20/0.21	Time used: 0.192986
0.20/0.21	
0.20/0.21	Checking conditional termination of SCC {l2}...
0.20/0.21	
0.20/0.21	LOG: CALL solveLinear
0.20/0.21	
0.20/0.21	LOG: RETURN solveLinear - Elapsed time: 0.001515s
0.20/0.21	Ranking function: 181 - 2*arg1 + 21*arg2
0.20/0.21	New Graphs: 
0.20/0.21	Transitions:
0.20/0.21	<l2, l2, 1 <= arg2 /\ 101 <= arg1, {arg1 -> -10 + arg1, arg2 -> -1 + arg2, rest remain the same}>
0.20/0.21	Variables:
0.20/0.21	arg1, arg2
0.20/0.21	Checking conditional termination of SCC {l2}...
0.20/0.21	
0.20/0.21	LOG: CALL solveLinear
0.20/0.21	
0.20/0.21	LOG: RETURN solveLinear - Elapsed time: 0.000646s
0.20/0.21	Ranking function: (~(101) / 10) + (1 / 10)*arg1
0.20/0.21	New Graphs: 
0.20/0.21	Program Terminates
0.20/0.22	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.20/0.22	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.20/0.22	EOF