0.00/0.13	YES
0.00/0.13	
0.00/0.13	Solver Timeout: 4
0.00/0.13	Global Timeout: 300
0.00/0.13	No parsing errors!
0.00/0.13	Init Location: 0
0.00/0.13	Transitions:
0.00/0.13	<l0, l8, true>
0.00/0.13	<l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> arg2, arg4 -> undef4}>
0.00/0.13	<l2, l3, (arg3 >= arg2) /\ (arg3 > ~(1)) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg3 -> 0, arg4 -> arg3}>
0.00/0.13	<l3, l2, (arg3 > arg4) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> (arg2 + 1), arg3 -> arg4, arg4 -> undef12}>
0.00/0.13	<l3, l4, (arg4 >= arg2) /\ (arg4 >= arg3) /\ (arg1 > 0), par{arg1 -> arg3, arg3 -> undef15, arg4 -> undef16}>
0.00/0.13	<l3, l3, (arg4 > ~(1)) /\ (arg4 >= arg3) /\ (undef17 <= arg1) /\ (arg1 > 0) /\ (undef17 > 0) /\ (0 = arg2), par{arg1 -> undef17, arg2 -> 0, arg3 -> (arg3 + 1)}>
0.00/0.13	<l3, l3, (arg4 >= arg2) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (arg1 > 0) /\ (undef21 > 0) /\ (0 = arg3), par{arg1 -> undef21, arg3 -> 1}>
0.00/0.13	<l5, l3, (undef25 <= arg1) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg3 -> (arg3 + 1)}>
0.00/0.13	<l3, l3, (arg4 >= arg2) /\ (arg4 >= arg3) /\ (arg4 > ~(1)) /\ (undef29 <= arg1) /\ (arg1 > 0) /\ (undef29 > 0), par{arg1 -> undef29, arg3 -> (arg3 + 1)}>
0.00/0.13	<l4, l4, (arg2 > 0) /\ (arg2 < arg1) /\ (arg1 > 1), par{arg1 -> arg2, arg3 -> undef35, arg4 -> undef36}>
0.00/0.13	<l4, l4, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 > 0), par{arg2 -> (arg2 - arg1), arg3 -> undef39, arg4 -> undef40}>
0.00/0.13	<l4, l6, (arg2 > 0) /\ (arg1 > 0) /\ ((arg2 - arg1) = 0) /\ (arg2 >= arg1), par{arg3 -> (arg1 - 1), arg4 -> undef44}>
0.00/0.13	<l7, l6, (arg2 > 0), par{arg1 -> arg2, arg2 -> arg1, arg3 -> (arg2 - 1), arg4 -> undef48}>
0.00/0.13	<l4, l6, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 > 0), par{arg3 -> (arg1 - 1), arg4 -> undef52}>
0.00/0.13	<l6, l4, (arg2 > 0) /\ (arg1 > 0) /\ (undef57 > 0) /\ (arg3 < arg1), par{arg1 -> arg3, arg3 -> undef55, arg4 -> undef56}>
0.00/0.13	<l4, l4, (arg2 > 0) /\ (arg1 > 1) /\ (arg2 >= arg1) /\ ((arg1 - 1) < arg1) /\ (undef62 > 0), par{arg1 -> (arg1 - 1), arg3 -> undef60, arg4 -> undef61}>
0.00/0.13	<l8, l1, true, par{arg1 -> undef63, arg2 -> undef64, arg3 -> undef65, arg4 -> undef66}>
0.00/0.13	
0.00/0.13	Fresh variables:
0.00/0.13	undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, 
0.00/0.13	
0.00/0.13	Undef variables:
0.00/0.13	undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, 
0.00/0.13	
0.00/0.13	Abstraction variables:
0.00/0.13	
0.00/0.13	Exit nodes:
0.00/0.13	
0.00/0.13	Accepting locations:
0.00/0.13	
0.00/0.13	Asserts:
0.00/0.13	
0.00/0.13	Preprocessed LLVMGraph
0.00/0.13	Init Location: 0
0.00/0.13	Transitions:
0.00/0.13	<l0, l3, (arg1 = undef5) /\ (arg2 = 0) /\ (arg3 = 0) /\ (arg4 = undef64) /\ (undef1 <= undef63) /\ (undef64 > ~(1)) /\ (undef63 > 0) /\ (undef1 > 0) /\ (undef64 >= 0) /\ (undef64 > ~(1)) /\ (undef5 <= undef1) /\ (undef1 > 0) /\ (undef5 > 0)>
0.00/0.13	<l3, l3, (arg3 > arg4) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0) /\ (arg4 >= (arg2 + 1)) /\ (arg4 > ~(1)) /\ (undef5 <= undef9) /\ (undef9 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> arg4}>
0.00/0.13	<l3, l4, (arg4 >= arg2) /\ (arg4 >= arg3) /\ (arg1 > 0), par{arg1 -> arg3, arg3 -> undef15, arg4 -> undef16}>
0.00/0.13	<l3, l3, (arg4 > ~(1)) /\ (arg4 >= arg3) /\ (undef17 <= arg1) /\ (arg1 > 0) /\ (undef17 > 0) /\ (0 = arg2), par{arg1 -> undef17, arg2 -> 0, arg3 -> (arg3 + 1)}>
0.00/0.13	<l3, l3, (arg4 >= arg2) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (arg1 > 0) /\ (undef21 > 0) /\ (0 = arg3), par{arg1 -> undef21, arg3 -> 1}>
0.00/0.13	<l3, l3, (arg4 >= arg2) /\ (arg4 >= arg3) /\ (arg4 > ~(1)) /\ (undef29 <= arg1) /\ (arg1 > 0) /\ (undef29 > 0), par{arg1 -> undef29, arg3 -> (arg3 + 1)}>
0.00/0.13	<l4, l4, (arg2 > 0) /\ (arg2 < arg1) /\ (arg1 > 1), par{arg1 -> arg2, arg3 -> undef35, arg4 -> undef36}>
0.00/0.13	<l4, l4, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 > 0), par{arg2 -> (arg2 - arg1), arg3 -> undef39, arg4 -> undef40}>
0.00/0.13	<l4, l4, (arg2 > 0) /\ (arg1 > 0) /\ ((arg2 - arg1) = 0) /\ (arg2 >= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef57 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> undef55, arg4 -> undef56}>
0.00/0.13	<l4, l4, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef57 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> undef55, arg4 -> undef56}>
0.00/0.13	<l4, l4, (arg2 > 0) /\ (arg1 > 1) /\ (arg2 >= arg1) /\ ((arg1 - 1) < arg1) /\ (undef62 > 0), par{arg1 -> (arg1 - 1), arg3 -> undef60, arg4 -> undef61}>
0.00/0.13	
0.00/0.13	Fresh variables:
0.00/0.13	undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, 
0.00/0.13	
0.00/0.13	Undef variables:
0.00/0.13	undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, 
0.00/0.13	
0.00/0.13	Abstraction variables:
0.00/0.13	
0.00/0.13	Exit nodes:
0.00/0.13	
0.00/0.13	Accepting locations:
0.00/0.13	
0.00/0.13	Asserts:
0.00/0.13	
0.00/0.13	*************************************************************
0.00/0.13	*******************************************************************************************
0.00/0.13	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.13	*******************************************************************************************
0.00/0.13	
0.00/0.13	Init Location: 0
0.00/0.13	Graph 0:
0.00/0.13	Transitions:
0.00/0.13	Variables:
0.00/0.13	
0.00/0.13	Graph 1:
0.00/0.13	Transitions:
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 + arg2 <= arg4 /\ 1 + arg4 <= arg3 /\ 1 <= undef5 /\ 1 <= undef9 /\ undef9 <= arg1 /\ 0 <= arg4 /\ undef5 <= undef9, {arg1 -> undef5, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}>
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= undef17 /\ undef17 <= arg1 /\ arg3 <= arg4 /\ 0 <= arg4 /\ arg2 = 0, {arg1 -> undef17, arg2 -> 0, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= undef21 /\ undef21 <= arg1 /\ arg2 <= arg4 /\ 0 <= arg4 /\ arg3 = 0, {arg1 -> undef21, arg3 -> 1, rest remain the same}>
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= undef29 /\ undef29 <= arg1 /\ arg2 <= arg4 /\ arg3 <= arg4 /\ 0 <= arg4, {arg1 -> undef29, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	
0.00/0.13	Graph 2:
0.00/0.13	Transitions:
0.00/0.13	<l4, l4, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 2 <= arg1, {arg1 -> arg2, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
0.00/0.13	<l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ arg1 <= arg2, {arg2 -> -arg1 + arg2, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
0.00/0.13	<l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef57 /\ arg1 = arg2, {arg1 -> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}>
0.00/0.13	<l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef57 /\ arg1 <= arg2, {arg1 -> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}>
0.00/0.13	<l4, l4, 1 <= arg2 /\ 1 <= undef62 /\ arg1 <= arg2 /\ 2 <= arg1, {arg1 -> -1 + arg1, arg3 -> undef60, arg4 -> undef61, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	
0.00/0.13	Precedence: 
0.00/0.13	Graph 0
0.00/0.13	
0.00/0.13	Graph 1
0.00/0.13	<l0, l3, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef63 /\ undef1 <= undef63 /\ undef5 <= undef1 /\ 0 <= undef64 /\ arg1 = undef5 /\ arg2 = 0 /\ arg3 = 0 /\ arg4 = undef64, {all remain the same}>
0.00/0.13	
0.00/0.13	Graph 2
0.00/0.13	<l3, l4, 1 <= arg1 /\ arg2 <= arg4 /\ arg3 <= arg4, {arg1 -> arg3, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
0.00/0.13	
0.00/0.13	Map Locations to Subgraph:
0.00/0.13	( 0 , 0 )
0.00/0.13	( 3 , 1 )
0.00/0.13	( 4 , 2 )
0.00/0.13	
0.00/0.13	*******************************************************************************************
0.00/0.13	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.13	*******************************************************************************************
0.00/0.13	
0.00/0.13	Proving termination of subgraph 0
0.00/0.13	Proving termination of subgraph 1
0.00/0.13	Checking unfeasibility...
0.00/0.13	Time used: 0.019522
0.00/0.13	
0.00/0.13	Checking conditional termination of SCC {l3}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.004832s
0.00/0.13	Ranking function: -3 - 3*arg2 + 3*arg4
0.00/0.13	New Graphs: 
0.00/0.13	Transitions:
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= undef17 /\ undef17 <= arg1 /\ arg3 <= arg4 /\ 0 <= arg4 /\ arg2 = 0, {arg1 -> undef17, arg2 -> 0, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= undef21 /\ undef21 <= arg1 /\ arg2 <= arg4 /\ 0 <= arg4 /\ arg3 = 0, {arg1 -> undef21, arg3 -> 1, rest remain the same}>
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= undef29 /\ undef29 <= arg1 /\ arg2 <= arg4 /\ arg3 <= arg4 /\ 0 <= arg4, {arg1 -> undef29, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	Checking conditional termination of SCC {l3}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.002814s
0.00/0.13	Ranking function: -4*arg2 - arg3 + arg4
0.00/0.13	New Graphs: 
0.00/0.13	Transitions:
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= undef21 /\ undef21 <= arg1 /\ arg2 <= arg4 /\ 0 <= arg4 /\ arg3 = 0, {arg1 -> undef21, arg3 -> 1, rest remain the same}>
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= undef29 /\ undef29 <= arg1 /\ arg2 <= arg4 /\ arg3 <= arg4 /\ 0 <= arg4, {arg1 -> undef29, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	Checking conditional termination of SCC {l3}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.002041s
0.00/0.13	Ranking function: -4*arg3
0.00/0.13	New Graphs: 
0.00/0.13	Transitions:
0.00/0.13	<l3, l3, 1 <= arg1 /\ 1 <= undef29 /\ undef29 <= arg1 /\ arg2 <= arg4 /\ arg3 <= arg4 /\ 0 <= arg4, {arg1 -> undef29, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	Checking conditional termination of SCC {l3}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.001177s
0.00/0.13	Ranking function: -arg3 + arg4
0.00/0.13	New Graphs: 
0.00/0.13	Proving termination of subgraph 2
0.00/0.13	Checking unfeasibility...
0.00/0.13	Time used: 0.012905
0.00/0.13	
0.00/0.13	Checking conditional termination of SCC {l4}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.004054s
0.00/0.13	Ranking function: -1 + arg2
0.00/0.13	New Graphs: 
0.00/0.13	Transitions:
0.00/0.13	<l4, l4, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 2 <= arg1, {arg1 -> arg2, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
0.00/0.13	<l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef57 /\ arg1 = arg2, {arg1 -> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}>
0.00/0.13	<l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef57 /\ arg1 <= arg2, {arg1 -> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}>
0.00/0.13	<l4, l4, 1 <= arg2 /\ 1 <= undef62 /\ arg1 <= arg2 /\ 2 <= arg1, {arg1 -> -1 + arg1, arg3 -> undef60, arg4 -> undef61, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	Checking conditional termination of SCC {l4}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.002670s
0.00/0.13	Ranking function: 3*arg1 - 3*arg2
0.00/0.13	New Graphs: 
0.00/0.13	Transitions:
0.00/0.13	<l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef57 /\ arg1 <= arg2, {arg1 -> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}>
0.00/0.13	<l4, l4, 1 <= arg2 /\ 1 <= undef62 /\ arg1 <= arg2 /\ 2 <= arg1, {arg1 -> -1 + arg1, arg3 -> undef60, arg4 -> undef61, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	Checking conditional termination of SCC {l4}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.001758s
0.00/0.13	Ranking function: -8 + arg1 + 3*arg2
0.00/0.13	New Graphs: 
0.00/0.13	Transitions:
0.00/0.13	<l4, l4, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef57 /\ arg1 <= arg2, {arg1 -> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}>
0.00/0.13	Variables:
0.00/0.13	arg1, arg2, arg3, arg4
0.00/0.13	Checking conditional termination of SCC {l4}...
0.00/0.13	
0.00/0.13	LOG: CALL solveLinear
0.00/0.13	
0.00/0.13	LOG: RETURN solveLinear - Elapsed time: 0.001095s
0.00/0.13	Ranking function: -1 + arg1
0.00/0.13	New Graphs: 
0.00/0.13	Program Terminates
0.00/0.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.13	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.13	EOF