  We introduce a prototype tool strategFTO addressing the verification of a
security property in critical software. We consider a recent definition of
timed opacity where an attacker aims to deduce some secret while having access
only to the total execution time. The system, here modeled by timed automata,
is deemed opaque if for any execution time, there are either no corresponding
runs, or both public and private corresponding runs. We focus on the untimed
control problem: exhibiting a controller, i.e., a set of allowed actions, such
that the system restricted to those actions is fully timed-opaque. We first
show that this problem is not more complex than the full timed opacity problem,
and then we propose an algorithm, implemented and evaluated in practice.
