We are happy to announce the release of Spot 2.16.3 This is a maintenance release fixing a few bugs reported over the last two weeks. You can find the new release here: http://www.lre.epita.fr/dload/spot/spot-2.16.3.tar.gz See https://spot.lre.epita.fr/ for documentation and installation instructions. Please direct any feedback to <spot@lrde.epita.fr>, or create issues on https://gitlab.lre.epita.fr/spot/spot/-/works_item/new New in spot 2.16.3 (2026-11-15) Bug fixes: - Hopefully fix some test-suite failures with Clang on OSX (issue #609 again). - The parity game solver used by ltlsynt could abort on an assertion in fix_strat_acc() when a state of the current subgame had an edge leading to an older subgame with a larger priority of the same player. This was a regression introduced in Spot 2.16. - Fix missing simplification during propositional equivalence of obligation formulas. For instance G(i) -> G(i <-> XXX(0)) was reduced to !G(i) during the propositional equivalence, but because !G(i) is not a known subformula, the original formula was used as representative instead. The fix modifies the handling of ->, <-> and xor. Additionally, it improves the detection of unsatisfiable/tautological subformulas below X. (Issue #666.) - spot::relabel_bse() has been rewritten. This fixes two problems: some relabelings were missed (e.g., "a & (b <-> a)" is now relabeled as p0 instead of "p0 & (p0 <-> p1)"), and some were illegal because the relabeled subformulas could share atomic propositions (e.g., "a & c & (a <-> b)" used to be relabeled as "p0 & p1" with p0 = c & (a <-> b) and p1 = a, hiding the fact that both use a). (Issue #667.)