anchor.diff:          integer             :: i, col_mins(3)
   
           col_mins = minval(p1, 2)
  -        forall (i = 1:size(p1, 2))
  +        do i = 1, size(p1, 2)
               p2(:, i) = p1(:, i) - col_mins + 1
  -        end forall
  +        end do
       end function
   
       pure function sparse_to_dense(p1, id) result(p2)
  
positive.code:                            isin(theta),   icos(theta),      0,    &
                                       0,             0,      1 /), &
                          (/ 3, 3, 3 /))
          end forall
      end subroutine
  
      pure function rotate(p1, axis, theta) result(p2)
  
negative.code:         integer             :: p2(3, 3, 3)
  
          p2 = 0
          do i = 1, size(p1, 2)
              p2(p1(1, i), p1(2, i), p1(3, i)) = id
          end do
      end function
  
      pure function contains_p (ps, p) result(b)
  