sweap: Reactive Synthesis for Infinite-State Integer Problems

TL;DR

sweap is a new reactive synthesis tool for infinite-state systems that uses CEGAR and supports various formalisms, outperforming existing solutions.

Contribution

introduces sweap, a reactive synthesis tool for infinite-state systems with novel features like dual abstraction and improved unrealisability proofs.

Findings

sweap outperforms its only competitor in the domain.

supports multiple input formalisms for infinite-state synthesis.

implements a CEGAR approach using finite-state synthesis tools as black boxes.

Abstract

Recent years have seen a significant increase in the interest in reactive synthesis from specifications that relate to infinite state spaces. We present sweap, a tool for synthesis of infinite-state Linear Integer Arithmetic reactive systems. sweap implements a CEGAR approach, relying on state-of-the-art finite-state synthesis tools as black boxes to solve abstract synthesis problems. sweap supports most common input formalisms for infinite-state reactive-synthesis problems: Temporal Stream Logic Modulo Theories, Reactive Program Games, the bespoke input of the ISSY tool, and our own bespoke input. We present a mature version of sweap with novel features: a dual abstraction approach that improves its capabilities in proving unrealisability, support for nondeterministic and unbounded updates, more general initialization of variables, and equirealisable reductions for optimisation. Experimental evaluation shows that sweap outperforms its only competitor in this domain.