Dat3M: Memory Model Aware Verification

Dartagnan is a tool to check state reachability under weak memory models.

Requirements

Maven
Java 8 or above
Smack 2.8.0 or above (only to verify C programs)
Clang the concrete version depends on Smack (only to verify C programs)

Installation

Docker

The docker contains everything pre-installed to run the tool.

Build the container:

docker build . -t dartagnan

Run the container:

docker run -w /home/Dat3M -it dartagnan /bin/bash

From Sources

Set Dat3M's home and add it to the path

export DAT3M_HOME=<Dat3M's root>

At least the following compiler flag needs to be set, further can be added

export CFLAGS="-I$DAT3M_HOME/include"
export SMACK_FLAGS="-q -t --no-memory-splitting"

If you are verifying C code, be sure both clang and smack are in your PATH.

To build the tool run

mvn clean install -DskipTests

Usage

Dartagnan comes with a user interface (not available from the docker container) where it is easy to import, export and modify both the program and the memory model and select the options for the verification engine (see below). You can start the user interface by running

java -jar ui/target/ui-3.0.0.jar

Dartagnan supports programs written in the .c, .litmus or .bpl (Boogie code generated by smack) formats.

There are three possible results for the verification:

FAIL: one assertion was violated.
PASS: loops have been fully unrolled and all assertions are satisfied.
UNKNOWN: no assertion violation was found, but loops have not been fully unrolled (you need to increase the unrolling bound).

You can also run Dartagnan from the console:

java -jar dartagnan/target/dartagnan-3.0.0.jar <CAT file> [--target=<arch>] <program file> [options]

For programs written in .c and .bpl, value <arch> specifies the architectures to which the program will be compiled. It must be one of the following:

none
tso
power
arm8

Program written in .litmus format do not require such option.

Further options can be specified using --<option>=<value>. Common options include:

bound: unrolling bound for the BMC (default is 1).
solver: specifies which SMT solver to use as a backend. Since we use JavaSMT, several SMT solvers are supported depending on the OS and the used SMT logic (default is Z3).
method: specifies which solving method to use. Option caat (the default one) uses a customized solver for memory consistency. Options incremental and assume solve a monolithic formula using incremental/assume-based SMT solving.

Dartagnan supports input non-determinism using the SVCOMP command __VERIFIER_nondet_X.

Authors and Contact

Maintainer:

Hernán Ponce de León

Developers:

Former Developers:

Florian Furbach
Natalia Gavrilenko

Please feel free to contact us in case of questions or to send feedback.

References

[1] Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer: Portability Analysis for Weak Memory Models. PORTHOS: One Tool for all Models. SAS 2017.

[2] Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer: BMC with Memory Models as Modules. FMCAD 2018.

[3] Natalia Gavrilenko, Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer: BMC for Weak Memory Models: Relation Analysis for Compact SMT Encodings. CAV 2019.

[4] Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer: Dartagnan: Bounded Model Checking for Weak Memory Models (Competition Contribution). TACAS 2020.

[5] Hernán Ponce de León, Thomas Haas, Roland Meyer: Dartagnan: Leveraging Compiler Optimizations and the Price of Precision (Competition Contribution). TACAS 2021.

[6] Hernán Ponce de León, Thomas Haas, Roland Meyer: Dartagnan: SMT-based Violation Witness Validation (Competition Contribution). TACAS 2022.

manggoguy/Dat3M