# Given a NP Algorithm for SAT, do we expect to have Correct and Incorrect Solutions?

I am reading about Boolean Satisfiability Problem and Nondeterministic Algorithms, in the latter defination it says :

In computational complexity theory, nondeterministic algorithms are ones that, at every possible step, can allow for multiple continuations $$...$$ These algorithms do not arrive at a solution for every possible computational path; however, they are guaranteed to arrive at a correct solution for some path

Assume we have a Non-deterministic algorithm for (SAT), does that mean the algorithm will show some computational paths leading to incorrect solutions (Non Satisfying Assignments) and other computational paths leading to correct solutions (Satisfying Assignment) ?

Or it is supposed to show only the correct solutions ?