Two decades ago, Alur, Henzinger, and Vardi introduced the reachability problem for parametric timed automata in the seminal paper [2]. Their main results are that reachability is decidable for timed automata with a single parametric clock, and undecidable for timed automata with three or more parametric clocks. In the case of two parametric clocks, decidability was left open, with hardly any p...