Since the question in this form is somewhat ill-defined, I elaborate on it so it can be solved by experiment:
What is the maximum centipawn value you can come up with so that the weaker side holds a draw?
Assume two very strong deterministic (i.e., you only need one game) computers play out a position which is very bad (with value c centipawns) for one side, but the weaker side still draws. Say, two Leela copies. (Fortresses would be the first thing I'd try. But they neither may be solvable by tablebases nor a draw by 50 move/3 repetitions inside the horizon, otherwise it's an immediate 0.0!)
P.S. For a "normal" position I expect a guaranteed win somewhere in the evaluation range +2 to +3.