anchor.diff:  			Arity = refac_syntax:function_arity(T),
   			case has_receive_expr(T) of
   			  {true, Line} ->
  -			      case is_non_tail_recursive_server(FName, Info, T, {ModName, FunName, Arity}, Line, SearchPaths) of
  +			      case is_non_tail_recursive_server(T, {ModName, FunName, Arity}, Line, SearchPaths) of
   				true -> [{ModName, FunName, Arity} | S];
   				_ -> S
   			      end;
  
positive.code: 	_ -> {true, lists:min(LineNums)}
      end.
  
  is_non_tail_recursive_server(FileName, Info, FunDef, {ModName, FunName, Arity}, Line, SearchPaths) ->
      Fun = fun (T, S) ->
  		  case refac_syntax:type(T) of
  		    receive_expr ->
  
negative.code: is_server(FileName, Info, FunDef, Scc, Line) ->
      ModName = get_module_name(FileName, Info),
      %%InscopeFuns = refac_util:auto_imported_bifs() ++ refac_util:inscope_funs(Info), 
      MFAs = [MFA || {MFA, _} <- Scc],
      F = fun (T, Acc) ->
  		case
  		  refac_syntax:type(T)      %% To think: any other cases here?
  		    of
  		  application -> Acc ++ [T];
  		  _ -> Acc
  		end
  	end,
      F1 = fun (E) ->
  		 {_, {EndLine, _}} = refac_util:get_range(E),
  		 case EndLine >= Line of
  		   true ->
  		       CalledFuns = wrangler_callgraph_server:called_funs(ModName, E),
  		       case lists:subtract(CalledFuns, MFAs) of
  			 CalledFuns -> false;
  			 _ -> true
  		       end;
  		   _ -> false
  		 end
  	 end,
      ListOfApps = refac_syntax_lib:fold(F, [], FunDef),
      lists:member(true, lists:map(F1, ListOfApps)).
    
  
  