Can someone give me the definition of #Monotone-2SAT?
Satisfiability problems are about making the formula true, not necessarily the variables. Counting satisfiability problems ask how many different assignments to the variables make the formula true.

In $\#\text{Monotone-2SAT}$, the formula is in 2-CNF (conjunctive normal form with at most two literals per clause) and is monotone (there are no negations). So, certainly, making all the variables true satisfies the formula, but there are plenty of other ways.  Just consider the formula $x\lor y$, which is monotone and in 2-CNF. It has three satisfying assignments.