Software Open Access

Code from the ICAPS 2020 paper "Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement"

Seipp, Jendrik; von Allmen, Samuel; Helmert, Malte

The zipfile contains an extended version of the Fast Downward planning system ( The code for CEGAR can be found in the "src/search/cegar" directory.

Please see for instructions on how to compile the planner.

The following configuration computes a single Cartesian abstraction in at most 1000 seconds and uses incremental search to find abstract solutions in the refinement loop:

--search "astar(cegar([original()], max_states=infinity, max_transitions=infinity, max_time=1000, memory_padding=100, h_update=dijkstra_from_unconnected_orphans))"

 We actively maintain the code at

Files (832.4 kB)
Name Size
832.4 kB Download
All versions This version
Views 5555
Downloads 88
Data volume 6.7 MB6.7 MB
Unique views 5151
Unique downloads 88


Cite as