0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	No parsing errors!
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l8, true>
0.00/0.06	<l1, l2, (arg1 > 0) /\ (undef1 > 2) /\ (0 = arg2), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}>
0.00/0.06	<l1, l2, ((undef4 - 1) <= arg1) /\ (arg1 > 0) /\ (undef4 > 1) /\ (0 = arg2), par{arg1 -> undef4, arg2 -> undef5, arg3 -> undef6}>
0.00/0.06	<l1, l3, (arg1 > 0) /\ (undef10 > ~(1)) /\ (undef7 > 2) /\ (1 = arg2), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}>
0.00/0.06	<l1, l3, ((undef11 - 1) <= arg1) /\ (undef14 > ~(1)) /\ (arg1 > 0) /\ (undef11 > 1) /\ (1 = arg2), par{arg1 -> undef11, arg2 -> undef12, arg3 -> undef13}>
0.00/0.06	<l1, l4, ((undef18 * undef19) >= 0) /\ (arg2 > 1) /\ (undef19 > ~(1)) /\ (undef18 > ~(1)) /\ (undef15 <= arg1) /\ (arg1 > 0) /\ (undef15 > 0) /\ (undef16 > 2), par{arg1 -> undef15, arg2 -> undef16, arg3 -> undef17}>
0.00/0.06	<l1, l4, ((undef23 * undef24) >= 0) /\ (arg2 > 1) /\ (undef24 > ~(1)) /\ (undef23 > ~(1)) /\ (undef20 <= arg1) /\ ((undef21 - 1) <= arg1) /\ (arg1 > 0) /\ (undef20 > 0) /\ (undef21 > 1), par{arg1 -> undef20, arg2 -> undef21, arg3 -> undef22}>
0.00/0.06	<l1, l5, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 10, arg2 -> undef26, arg3 -> undef27}>
0.00/0.06	<l1, l5, (arg1 > 0) /\ (undef31 > ~(1)) /\ (1 = arg2), par{arg1 -> 10, arg2 -> undef29, arg3 -> undef30}>
0.00/0.06	<l1, l5, ((undef35 * undef36) >= 0) /\ (arg2 > 1) /\ (undef36 > ~(1)) /\ (undef35 > ~(1)) /\ (arg1 > 0), par{arg1 -> ((undef35 * undef36) + 10), arg2 -> undef33, arg3 -> undef34}>
0.00/0.06	<l5, l5, (arg1 > 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef38, arg3 -> undef39}>
0.00/0.06	<l5, l6, ((arg1 - 1) < arg1) /\ (undef40 > 4) /\ (arg1 > 1), par{arg1 -> undef40, arg2 -> (arg1 - 1), arg3 -> undef42}>
0.00/0.06	<l5, l6, ((arg1 - 1) < arg1) /\ (undef43 > 3) /\ (arg1 > 1), par{arg1 -> undef43, arg2 -> (arg1 - 1), arg3 -> undef45}>
0.00/0.06	<l6, l5, (arg1 > 2) /\ (arg2 > 0), par{arg1 -> arg2, arg2 -> undef47, arg3 -> undef48}>
0.00/0.06	<l2, l7, (undef49 <= arg1) /\ ((undef50 + 1) <= arg1) /\ (arg1 > 0) /\ (undef49 > 0) /\ (undef50 > ~(1)), par{arg1 -> undef49, arg2 -> undef50, arg3 -> undef51}>
0.00/0.06	<l3, l7, (undef52 <= arg1) /\ ((undef53 + 1) <= arg1) /\ (arg1 > 0) /\ (undef52 > 0) /\ (undef53 > ~(1)), par{arg1 -> undef52, arg2 -> undef53, arg3 -> undef54}>
0.00/0.06	<l4, l7, (undef55 <= arg2) /\ (undef58 > 1) /\ ((undef56 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef55 > 0) /\ (undef56 > ~(1)), par{arg1 -> undef55, arg2 -> undef56, arg3 -> undef57}>
0.00/0.06	<l7, l7, ((undef59 + 2) <= arg1) /\ (undef59 <= arg2) /\ ((undef60 + 3) <= arg1) /\ ((undef60 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef59 > 0) /\ (undef60 > ~(1)), par{arg1 -> undef59, arg2 -> undef60, arg3 -> undef61}>
0.00/0.06	<l7, l7, ((undef62 + 2) <= arg1) /\ ((undef63 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > ~(1)) /\ (undef62 > 0) /\ (undef63 > ~(1)), par{arg1 -> undef62, arg2 -> undef63, arg3 -> undef64}>
0.00/0.06	<l8, l1, true, par{arg1 -> undef65, arg2 -> undef66, arg3 -> undef67}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef26, undef27, undef29, undef30, undef31, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef42, undef43, undef45, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, undef66, undef67, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef26, undef27, undef29, undef30, undef31, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef42, undef43, undef45, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, undef66, undef67, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l7, (undef65 > 0) /\ (undef1 > 2) /\ (0 = undef66) /\ (undef49 <= undef1) /\ ((undef50 + 1) <= undef1) /\ (undef1 > 0) /\ (undef49 > 0) /\ (undef50 > ~(1)), par{arg1 -> undef49, arg2 -> undef50}>
0.00/0.06	<l0, l7, ((undef4 - 1) <= undef65) /\ (undef65 > 0) /\ (undef4 > 1) /\ (0 = undef66) /\ (undef49 <= undef4) /\ ((undef50 + 1) <= undef4) /\ (undef4 > 0) /\ (undef49 > 0) /\ (undef50 > ~(1)), par{arg1 -> undef49, arg2 -> undef50}>
0.00/0.06	<l0, l7, (undef65 > 0) /\ (undef10 > ~(1)) /\ (undef7 > 2) /\ (1 = undef66) /\ (undef52 <= undef7) /\ ((undef53 + 1) <= undef7) /\ (undef7 > 0) /\ (undef52 > 0) /\ (undef53 > ~(1)), par{arg1 -> undef52, arg2 -> undef53}>
0.00/0.06	<l0, l7, ((undef11 - 1) <= undef65) /\ (undef14 > ~(1)) /\ (undef65 > 0) /\ (undef11 > 1) /\ (1 = undef66) /\ (undef52 <= undef11) /\ ((undef53 + 1) <= undef11) /\ (undef11 > 0) /\ (undef52 > 0) /\ (undef53 > ~(1)), par{arg1 -> undef52, arg2 -> undef53}>
0.00/0.06	<l0, l7, (undef66 > 1) /\ (undef19 > ~(1)) /\ (undef18 > ~(1)) /\ (undef15 <= undef65) /\ (undef65 > 0) /\ (undef15 > 0) /\ (undef16 > 2) /\ (undef55 <= undef16) /\ (undef58 > 1) /\ ((undef56 + 1) <= undef16) /\ (undef15 > 0) /\ (undef16 > 0) /\ (undef55 > 0) /\ (undef56 > ~(1)), par{arg1 -> undef55, arg2 -> undef56}>
0.00/0.06	<l0, l7, (undef66 > 1) /\ (undef24 > ~(1)) /\ (undef23 > ~(1)) /\ (undef20 <= undef65) /\ ((undef21 - 1) <= undef65) /\ (undef65 > 0) /\ (undef20 > 0) /\ (undef21 > 1) /\ (undef55 <= undef21) /\ (undef58 > 1) /\ ((undef56 + 1) <= undef21) /\ (undef20 > 0) /\ (undef21 > 0) /\ (undef55 > 0) /\ (undef56 > ~(1)), par{arg1 -> undef55, arg2 -> undef56}>
0.00/0.06	<l0, l5, (undef65 > 0) /\ (0 = undef66), par{arg1 -> 10, arg2 -> undef26}>
0.00/0.06	<l0, l5, (undef65 > 0) /\ (undef31 > ~(1)) /\ (1 = undef66), par{arg1 -> 10, arg2 -> undef29}>
0.00/0.06	<l0, l5, (undef66 > 1) /\ (undef36 > ~(1)) /\ (undef35 > ~(1)) /\ (undef65 > 0), par{arg1 -> abstract_68, arg2 -> undef33}>
0.00/0.06	<l5, l5, (arg1 > 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef38}>
0.00/0.06	<l5, l5, ((arg1 - 1) < arg1) /\ (undef40 > 4) /\ (arg1 > 1) /\ (undef40 > 2) /\ ((arg1 - 1) > 0), par{arg1 -> (arg1 - 1), arg2 -> undef47}>
0.00/0.06	<l5, l5, ((arg1 - 1) < arg1) /\ (undef43 > 3) /\ (arg1 > 1) /\ (undef43 > 2) /\ ((arg1 - 1) > 0), par{arg1 -> (arg1 - 1), arg2 -> undef47}>
0.00/0.06	<l7, l7, ((undef59 + 2) <= arg1) /\ (undef59 <= arg2) /\ ((undef60 + 3) <= arg1) /\ ((undef60 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef59 > 0) /\ (undef60 > ~(1)), par{arg1 -> undef59, arg2 -> undef60}>
0.00/0.06	<l7, l7, ((undef62 + 2) <= arg1) /\ ((undef63 + 3) <= arg1) /\ (arg1 > 2) /\ (arg2 > ~(1)) /\ (undef62 > 0) /\ (undef63 > ~(1)), par{arg1 -> undef62, arg2 -> undef63}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef26, undef27, undef29, undef30, undef31, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef42, undef43, undef45, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, undef66, undef67, abstract_68, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef26, undef27, undef29, undef30, undef31, undef33, undef34, undef35, undef36, undef38, undef39, undef40, undef42, undef43, undef45, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, undef66, undef67, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	abstract_68 --> ( + ( * undef35 undef36 ) 10 )
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l5, l5, 2 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef38, rest remain the same}>
0.00/0.06	<l5, l5, 2 <= arg1 /\ 5 <= undef40, {arg1 -> -1 + arg1, arg2 -> undef47, rest remain the same}>
0.00/0.06	<l5, l5, 2 <= arg1 /\ 4 <= undef43, {arg1 -> -1 + arg1, arg2 -> undef47, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arg1, arg2
0.00/0.06	
0.00/0.06	Graph 2:
0.00/0.06	Transitions:
0.00/0.06	<l7, l7, undef59 <= arg2 /\ 0 <= undef60 /\ 2 + undef59 <= arg1 /\ 1 <= arg2 /\ 1 + undef60 <= arg2 /\ 1 <= undef59 /\ 3 <= arg1 /\ 3 + undef60 <= arg1, {arg1 -> undef59, arg2 -> undef60, rest remain the same}>
0.00/0.06	<l7, l7, 0 <= arg2 /\ 0 <= undef63 /\ 2 + undef62 <= arg1 /\ 1 <= undef62 /\ 3 <= arg1 /\ 3 + undef63 <= arg1, {arg1 -> undef62, arg2 -> undef63, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arg1, arg2
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l5, 1 <= undef65 /\ undef66 = 0, {arg1 -> 10, arg2 -> undef26, rest remain the same}>
0.00/0.06	<l0, l5, 0 <= undef31 /\ 1 <= undef65 /\ undef66 = 1, {arg1 -> 10, arg2 -> undef29, rest remain the same}>
0.00/0.06	<l0, l5, 0 <= undef35 /\ 0 <= undef36 /\ 2 <= undef66 /\ 1 <= undef65, {arg1 -> abstract_68, arg2 -> undef33, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l0, l7, undef49 <= undef1 /\ 0 <= undef50 /\ 1 + undef50 <= undef1 /\ 1 <= undef49 /\ 1 <= undef65 /\ 3 <= undef1 /\ undef66 = 0, {arg1 -> undef49, arg2 -> undef50, rest remain the same}>
0.00/0.06	<l0, l7, undef49 <= undef4 /\ 0 <= undef50 /\ 2 <= undef4 /\ 1 + undef50 <= undef4 /\ 1 <= undef49 /\ 1 <= undef65 /\ undef4 <= 1 + undef65 /\ undef66 = 0, {arg1 -> undef49, arg2 -> undef50, rest remain the same}>
0.00/0.06	<l0, l7, undef52 <= undef7 /\ 0 <= undef10 /\ 0 <= undef53 /\ 1 + undef53 <= undef7 /\ 1 <= undef52 /\ 1 <= undef65 /\ 3 <= undef7 /\ undef66 = 1, {arg1 -> undef52, arg2 -> undef53, rest remain the same}>
0.00/0.06	<l0, l7, undef52 <= undef11 /\ 0 <= undef14 /\ 0 <= undef53 /\ 2 <= undef11 /\ 1 + undef53 <= undef11 /\ 1 <= undef52 /\ 1 <= undef65 /\ undef11 <= 1 + undef65 /\ undef66 = 1, {arg1 -> undef52, arg2 -> undef53, rest remain the same}>
0.00/0.06	<l0, l7, undef15 <= undef65 /\ undef55 <= undef16 /\ 0 <= undef18 /\ 0 <= undef19 /\ 0 <= undef56 /\ 2 <= undef58 /\ 2 <= undef66 /\ 1 <= undef15 /\ 1 + undef56 <= undef16 /\ 1 <= undef55 /\ 1 <= undef65 /\ 3 <= undef16, {arg1 -> undef55, arg2 -> undef56, rest remain the same}>
0.00/0.06	<l0, l7, undef20 <= undef65 /\ undef55 <= undef21 /\ 0 <= undef23 /\ 0 <= undef24 /\ 0 <= undef56 /\ 2 <= undef21 /\ 2 <= undef58 /\ 2 <= undef66 /\ 1 <= undef20 /\ 1 + undef56 <= undef21 /\ 1 <= undef55 /\ 1 <= undef65 /\ undef21 <= 1 + undef65, {arg1 -> undef55, arg2 -> undef56, rest remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 5 , 1 )
0.00/0.06	( 7 , 2 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Detected abstraction incompatible with non-termination check.
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.006298
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l5}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001439s
0.00/0.06	Ranking function: -2 + arg1
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.008128
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l7}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.002731s
0.00/0.06	Ranking function: (~(3) / 2) + (1 / 2)*arg1
0.00/0.06	New Graphs: 
0.00/0.06	Program Terminates
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.06	EOF