anchor.diff:            list%head => null()
             list%tail => null()
           end if
  -				!call ll_del_first(list,move)
  +        !call ll_del_first(list,move)
           deallocate(move)
  -				nullify(move)
  -			end if			
  -		end do
  -  end subroutine
  -
  -	subroutine finalize_ll_int(list)
  -	implicit none
  -		type(linkedlist_int), intent(inout) :: list
  -		type(llnode_int), pointer :: move
  -		do
  -			!Check if list empty.
  -			if (.not. associated(list%head)) then
  -				exit
  -			else
  +        nullify(move)
  +      end if      
  +    end do
  +  end subroutine
  +
  +  subroutine finalize_ll_int(list)
  +  implicit none
  +    type(linkedlist_int), intent(inout) :: list
  +    type(llnode_int), pointer :: move
  +    do
  +      !Check if list empty.
  +      if (.not. associated(list%head)) then
  +        exit
  +      else
           !Check if more than 1 node.
           if (associated(list%head%next)) then !more than one node.
             move => list%head
  
positive.code:           list%head => null()
            list%tail => null()
          end if
  				!call ll_del_first(list,move)
          deallocate(move)
  				nullify(move)
  			end if			
  		end do
  	end subroutine
  
  end module linked_list
  
  
negative.code: 
    implicit none
  
    type llnode_real
      type(llnode_real), pointer :: next=>null()
      real(wp) :: a
    end type
  
    type llnode_int
      type(llnode_int), pointer :: next=>null()
      integer :: a
    end type
  
    type linkedlist_real
      type(llnode_real), pointer :: head=>null(), tail=>null()
      integer :: nelements = 0
    end type
  
    type linkedlist_int
      type(llnode_int), pointer :: head=>null(), tail=>null()
      integer :: nelements = 0
    end type
  
    interface new
      module procedure init_node_real
  