Reachability results for timed automata with unbounded data structures