Solve the Halting Problem for Oneplis
Oneplis is a "very simple esolang" (I don't want to count this one toward my esolangs) made by me which only have three commands. As you can probably see from the name, it is a subset of 1+, along the lines of Befinge.
The three commands are:
1, which pushes 1. (Obviously!)+, which pops the top two numbers and pushes their sum. (Obviously!)#, pops a number n and jumps to the instruction after the nth (0-based)#.
Oneplis is almost certainly a (very limited) push-down automaton, since it's impossible to decrement a number and impossible to retrieve elements arbitrary deep in the stack! Oh, and the only way to read a number is with #, which cannot handle arbitrarily large numbers!
This is code-golf, so shortest code wins! Your output should be truthy for halting, and falsy for non-halting. You can use any set of five characters for the instructions. Don't care if it jumps to a non-existence # or trying to execute + when there are <2 numbers on the stack.
Test cases
11+ -> True 1##1# -> False 1## -> True 11+1+###11+# -> True 11+##1#1 -> False Sandbox
Test cases?
Shall I require the answers to deal with errors?