This fixes a bug introduced with the dynamic loading of models.

Uppaal automata parsed as a "bare" TA, i.e. no Dbm involved, for a proper separation of the functions.

Allow to use a 'preference' parameter (encoded as a variable with reserved name) to sort the WAITING list.

Change the way bounds are computed: much more accurate, yet slower pre-computation (explores the discrete state space).

Cache invariants per discrete state, instead of per location arrays (the values of the variables now matter).

The caml automaton is built from C thanks to OCaml callbacks.

Timed automaton now export the type of their discrete states as a hashed type (for use in hashtable).