About the Execution of ITS-Tools for RobotManipulation-PT-02000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFF?FFFFTFFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264500587.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is RobotManipulation-PT-02000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264500587
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-02000-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749136753847
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-02000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 15:19:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 15:19:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 15:19:15] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2025-06-05 15:19:15] [INFO ] Transformed 15 places.
[2025-06-05 15:19:15] [INFO ] Transformed 11 transitions.
[2025-06-05 15:19:15] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RobotManipulation-PT-02000-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 6 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2025-06-05 15:19:15] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:15] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-05 15:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:15] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2025-06-05 15:19:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 11/26 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 11/26 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 31 constraints, problems are : Problem set: 0 solved, 10 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 403ms
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2025-06-05 15:19:16] [INFO ] Flatten gal took : 12 ms
[2025-06-05 15:19:16] [INFO ] Flatten gal took : 3 ms
[2025-06-05 15:19:16] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 48032 steps (8 resets) in 114 ms. (417 steps per ms) remains 18/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 7/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 5/7 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 5/5 properties
[2025-06-05 15:19:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/14 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/15 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 11/26 variables, 15/21 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 21 constraints, problems are : Problem set: 1 solved, 4 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/13 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/26 variables, 15/21 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 4/25 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 25 constraints, problems are : Problem set: 1 solved, 4 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 16007 steps, including 0 resets, run visited all 4 properties in 214 ms. (steps per millisecond=74 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 219 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA RobotManipulation-PT-02000-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(p0))||G(p1))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 4 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2025-06-05 15:19:17] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:17] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 593 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-00
Product exploration explored 100000 steps with 16673 reset in 180 ms.
Entered a terminal (fully accepting) state of product in 9246 steps with 1533 reset in 11 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-00 finished in 881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U ((F(p1) U p2) U X(X(G(p3)))))||X(p3)))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2025-06-05 15:19:17] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:17] [INFO ] Implicit Places using invariants in 22 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 538 ms :[(NOT p3), (AND (NOT p1) (NOT p0) p2 (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 125 ms.
Stack based approach found an accepted trace after 2324 steps with 0 reset with depth 2325 and stack size 2323 in 5 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-02 finished in 735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(F((p1||X(X(X(p2))))))))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2025-06-05 15:19:18] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:18] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 48032 steps (8 resets) in 54 ms. (873 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
// Phase 1: matrix 11 rows 13 cols
[2025-06-05 15:19:19] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 17 constraints, problems are : Problem set: 0 solved, 3 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 20 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 801455 steps, including 49 resets, run visited all 3 properties in 722 ms. (steps per millisecond=1110 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 722 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2025-06-05 15:19:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-05 15:19:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:21] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2025-06-05 15:19:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 17 constraints, problems are : Problem set: 0 solved, 10 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 27 constraints, problems are : Problem set: 0 solved, 10 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 206ms
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 13/13 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 48032 steps (8 resets) in 31 ms. (1501 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
[2025-06-05 15:19:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 17 constraints, problems are : Problem set: 0 solved, 3 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/13 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 20 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1332876 steps, including 82 resets, run visited all 3 properties in 954 ms. (steps per millisecond=1397 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 954 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 241 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 145 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 13 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 12 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 11 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 11 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 7 rules in 12 ms. Remains 11 /13 variables (removed 2) and now considering 10/11 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:19:24] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 11 cols
[2025-06-05 15:19:24] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 4 (OVERLAPS) 10/21 variables, 11/14 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 14 constraints, problems are : Problem set: 3 solved, 6 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 4/10 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 10/20 variables, 10/13 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 6/19 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/20 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 20 constraints, problems are : Problem set: 3 solved, 6 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 3 solved, 6 unsolved
Search for dead transitions found 3 dead transitions in 154ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 11/13 places, 7/11 transitions.
Graph (complete) has 11 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 8 /11 variables (removed 3) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/13 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179 ms. Remains : 8/13 places, 7/11 transitions.
Built C files in :
/tmp/ltsmin10714006714526138915
[2025-06-05 15:19:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10714006714526138915
Running compilation step : cd /tmp/ltsmin10714006714526138915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 204 ms.
Running link step : cd /tmp/ltsmin10714006714526138915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10714006714526138915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10823735864998942079.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2025-06-05 15:19:40] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-05 15:19:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:19:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2025-06-05 15:19:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 17 constraints, problems are : Problem set: 0 solved, 10 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 27 constraints, problems are : Problem set: 0 solved, 10 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 236ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 236ms
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 13/13 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin12175200608867687920
[2025-06-05 15:19:40] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12175200608867687920
Running compilation step : cd /tmp/ltsmin12175200608867687920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin12175200608867687920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12175200608867687920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11184470669235214420.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 15:19:55] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:19:55] [INFO ] Flatten gal took : 4 ms
[2025-06-05 15:19:55] [INFO ] Time to serialize gal into /tmp/LTL6551711459572089351.gal : 3 ms
[2025-06-05 15:19:55] [INFO ] Time to serialize properties into /tmp/LTL15514749110590163857.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6551711459572089351.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13594534878980057756.hoa' '-atoms' '/tmp/LTL15514749110590163857.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15514749110590163857.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13594534878980057756.hoa
Detected timeout of ITS tools.
[2025-06-05 15:20:10] [INFO ] Flatten gal took : 6 ms
[2025-06-05 15:20:10] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:20:10] [INFO ] Time to serialize gal into /tmp/LTL3183266061543196046.gal : 0 ms
[2025-06-05 15:20:10] [INFO ] Time to serialize properties into /tmp/LTL15727141051981911466.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3183266061543196046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15727141051981911466.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(access>=2)")||(X(X(F(("(p_m<=r_stopped)")||(X(X(X("(p_rel<3)")))))))))))
Formula 0 simplified : F(!"(access>=2)" & XXG(!"(p_m<=r_stopped)" & XXX!"(p_rel<3)"))
Detected timeout of ITS tools.
[2025-06-05 15:20:25] [INFO ] Flatten gal took : 1 ms
[2025-06-05 15:20:25] [INFO ] Applying decomposition
[2025-06-05 15:20:25] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4644491646818381642.txt' '-o' '/tmp/graph4644491646818381642.bin' '-w' '/tmp/graph4644491646818381642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4644491646818381642.bin' '-l' '-1' '-v' '-w' '/tmp/graph4644491646818381642.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:20:25] [INFO ] Decomposing Gal with order
[2025-06-05 15:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:20:25] [INFO ] Flatten gal took : 27 ms
[2025-06-05 15:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 15:20:25] [INFO ] Time to serialize gal into /tmp/LTL535334262524300387.gal : 1 ms
[2025-06-05 15:20:25] [INFO ] Time to serialize properties into /tmp/LTL9440779153500370759.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL535334262524300387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9440779153500370759.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(("(gi1.gi0.gu3.access>=2)")||(X(X(F(("(gu1.p_m<=gu1.r_stopped)")||(X(X(X("(gi1.gi0.gu3.p_rel<3)")))))))))))
Formula 0 simplified : F(!"(gi1.gi0.gu3.access>=2)" & XXG(!"(gu1.p_m<=gu1.r_stopped)" & XXX!"(gi1.gi0.gu3.p_rel<3)"))
Detected timeout of ITS tools.
Treatment of property RobotManipulation-PT-02000-LTLCardinality-03 finished in 82257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Applied a total of 6 rules in 5 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2025-06-05 15:20:40] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:40] [INFO ] Implicit Places using invariants in 23 ms returned [5, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 9/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 8
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 8 cols
[2025-06-05 15:20:40] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:40] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-05 15:20:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:40] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 8/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 8/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-04 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2025-06-05 15:20:41] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:41] [INFO ] Implicit Places using invariants in 21 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2025-06-05 15:20:41] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-05 15:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 455 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-05 finished in 172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p1)&&X(G(p2)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2025-06-05 15:20:41] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:41] [INFO ] Implicit Places using invariants in 24 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) p1), true, p1, (NOT p2), p1, (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 136 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-06 finished in 408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G((!p1&&F(p0))))) U X(X(X(p2)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2025-06-05 15:20:41] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:41] [INFO ] Implicit Places using invariants in 30 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 881 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-08
Product exploration explored 100000 steps with 25000 reset in 52 ms.
Product exploration explored 100000 steps with 25000 reset in 59 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 23 states, 50 edges and 3 AP (stutter sensitive) to 16 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 639 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
RANDOM walk for 48032 steps (8 resets) in 22 ms. (2088 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/9 properties
BEST_FIRST walk for 36849 steps (8 resets) in 61 ms. (594 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F p1), (F (NOT (OR p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 5 factoid took 484 ms. Reduced automaton from 16 states, 32 edges and 3 AP (stutter sensitive) to 16 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 719 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 664 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2025-06-05 15:20:45] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-05 15:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2025-06-05 15:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/23 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 15 constraints, problems are : Problem set: 0 solved, 10 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/23 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 25 constraints, problems are : Problem set: 0 solved, 10 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 184ms
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 12/12 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 16 states, 32 edges and 3 AP (stutter sensitive) to 16 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 716 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
RANDOM walk for 48032 steps (8 resets) in 14 ms. (3202 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 3/9 properties
BEST_FIRST walk for 33595 steps (8 resets) in 33 ms. (988 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT (OR (NOT p0) p2))), (F p0)]
Knowledge based reduction with 1 factoid took 433 ms. Reduced automaton from 16 states, 32 edges and 3 AP (stutter sensitive) to 16 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 691 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 696 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 676 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 25000 reset in 42 ms.
Product exploration explored 100000 steps with 25000 reset in 47 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 658 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 11 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 11 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 6 rules in 4 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:20:49] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 11 cols
[2025-06-05 15:20:49] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD6 is UNSAT
At refinement iteration 4 (OVERLAPS) 10/21 variables, 11/14 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 14 constraints, problems are : Problem set: 3 solved, 6 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/21 variables, 11/14 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 6/20 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 20 constraints, problems are : Problem set: 3 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 3 solved, 6 unsolved
Search for dead transitions found 3 dead transitions in 143ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 7/11 transitions.
Graph (complete) has 11 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 0 ms. Remains 7 /11 variables (removed 4) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/12 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 7/12 places, 7/11 transitions.
Built C files in :
/tmp/ltsmin3729702074710137498
[2025-06-05 15:20:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3729702074710137498
Running compilation step : cd /tmp/ltsmin3729702074710137498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin3729702074710137498;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3729702074710137498;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8389939019146038361.hoa' '--buchi-type=spotba'
LTSmin run took 43 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-02000-LTLCardinality-08 finished in 8609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(!p1||F(G(p2))))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2025-06-05 15:20:50] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:50] [INFO ] Implicit Places using invariants in 25 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26 ms. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-09
Product exploration explored 100000 steps with 1 reset in 84 ms.
Stack based approach found an accepted trace after 361 steps with 0 reset with depth 362 and stack size 362 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-09 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 4 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2025-06-05 15:20:50] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:50] [INFO ] Implicit Places using invariants in 32 ms returned [4, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 7/11 transitions.
Graph (trivial) has 5 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 4
Applied a total of 3 rules in 7 ms. Remains 3 /6 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-05 15:20:50] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:50] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-05 15:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-10 finished in 150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 3 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2025-06-05 15:20:50] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:50] [INFO ] Implicit Places using invariants in 26 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 7/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 6
Applied a total of 2 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 6 cols
[2025-06-05 15:20:50] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-05 15:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:50] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/15 places, 6/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 64 ms.
Product exploration explored 100000 steps with 0 reset in 90 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 16008 steps (0 resets) in 22 ms. (696 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-05 15:20:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-05 15:20:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:51] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:20:51] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-05 15:20:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/12 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 6/6 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 16008 steps (0 resets) in 26 ms. (592 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Built C files in :
/tmp/ltsmin17726301587916820556
[2025-06-05 15:20:51] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-05 15:20:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:20:51] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-05 15:20:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:20:51] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-05 15:20:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:20:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17726301587916820556
Running compilation step : cd /tmp/ltsmin17726301587916820556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin17726301587916820556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17726301587916820556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11009064203611258342.hoa' '--buchi-type=spotba'
LTSmin run took 686 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-02000-LTLCardinality-11 finished in 2050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||F(p1)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 3 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2025-06-05 15:20:52] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:52] [INFO ] Implicit Places using invariants in 28 ms returned [4, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 8/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4 transition count 5
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 3 transition count 4
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 3 transition count 4
Applied a total of 8 rules in 2 ms. Remains 3 /7 variables (removed 4) and now considering 4/8 (removed 4) transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-05 15:20:52] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:52] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-05 15:20:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:52] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/15 places, 4/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-12
Product exploration explored 100000 steps with 1810 reset in 60 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 9 in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-12 finished in 216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2025-06-05 15:20:52] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:53] [INFO ] Implicit Places using invariants in 28 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-02000-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-02000-LTLCardinality-15 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(F((p1||X(X(X(p2))))))))))'
Found a Shortening insensitive property : RobotManipulation-PT-02000-LTLCardinality-03
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 6 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2025-06-05 15:20:53] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:53] [INFO ] Implicit Places using invariants in 32 ms returned [4, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/15 places, 8/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-06-05 15:20:53] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-05 15:20:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:53] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 7/15 places, 7/11 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 75 ms. Remains : 7/15 places, 7/11 transitions.
Running random walk in product with property : RobotManipulation-PT-02000-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 48020 steps (8 resets) in 82 ms. (578 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
[2025-06-05 15:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 232575 steps, including 28 resets, run visited all 3 properties in 177 ms. (steps per millisecond=1313 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 178 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2025-06-05 15:20:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:55] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-05 15:20:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:20:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2025-06-05 15:20:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 7/7 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 48020 steps (8 resets) in 83 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
[2025-06-05 15:20:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 208479 steps, including 25 resets, run visited all 3 properties in 181 ms. (steps per millisecond=1151 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 180 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 15:20:57] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-05 15:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 7/7 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin5220348240999801051
[2025-06-05 15:20:57] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5220348240999801051
Running compilation step : cd /tmp/ltsmin5220348240999801051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin5220348240999801051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5220348240999801051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6748410083237991993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2025-06-05 15:21:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:21:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-05 15:21:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 15:21:12] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2025-06-05 15:21:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/14 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 7/7 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin10269797348715047783
[2025-06-05 15:21:12] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10269797348715047783
Running compilation step : cd /tmp/ltsmin10269797348715047783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin10269797348715047783;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10269797348715047783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3651400916768933636.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 15:21:28] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:21:28] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:21:28] [INFO ] Time to serialize gal into /tmp/LTL16182677029287868178.gal : 0 ms
[2025-06-05 15:21:28] [INFO ] Time to serialize properties into /tmp/LTL17456959347394949801.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16182677029287868178.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9409749643068798178.hoa' '-atoms' '/tmp/LTL17456959347394949801.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17456959347394949801.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9409749643068798178.hoa
Detected timeout of ITS tools.
[2025-06-05 15:21:43] [INFO ] Flatten gal took : 1 ms
[2025-06-05 15:21:43] [INFO ] Flatten gal took : 1 ms
[2025-06-05 15:21:43] [INFO ] Time to serialize gal into /tmp/LTL14727953728191231890.gal : 0 ms
[2025-06-05 15:21:43] [INFO ] Time to serialize properties into /tmp/LTL5993230873950826278.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14727953728191231890.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5993230873950826278.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(access>=2)")||(X(X(F(("(p_m<=r_stopped)")||(X(X(X("(p_rel<3)")))))))))))
Formula 0 simplified : F(!"(access>=2)" & XXG(!"(p_m<=r_stopped)" & XXX!"(p_rel<3)"))
Detected timeout of ITS tools.
[2025-06-05 15:21:58] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:21:58] [INFO ] Applying decomposition
[2025-06-05 15:21:58] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13758927526538945688.txt' '-o' '/tmp/graph13758927526538945688.bin' '-w' '/tmp/graph13758927526538945688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13758927526538945688.bin' '-l' '-1' '-v' '-w' '/tmp/graph13758927526538945688.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:21:58] [INFO ] Decomposing Gal with order
[2025-06-05 15:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:21:58] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-05 15:21:58] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:21:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-05 15:21:58] [INFO ] Time to serialize gal into /tmp/LTL4977731382576012440.gal : 0 ms
[2025-06-05 15:21:58] [INFO ] Time to serialize properties into /tmp/LTL2204973712569218553.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4977731382576012440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2204973712569218553.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(gi0.gu2.access>=2)")||(X(X(F(("(gu1.p_m<=gu1.r_stopped)")||(X(X(X("(gi0.gu2.p_rel<3)")))))))))))
Formula 0 simplified : F(!"(gi0.gu2.access>=2)" & XXG(!"(gu1.p_m<=gu1.r_stopped)" & XXX!"(gi0.gu2.p_rel<3)"))
Detected timeout of ITS tools.
Treatment of property RobotManipulation-PT-02000-LTLCardinality-03 finished in 80036 ms.
[2025-06-05 15:22:13] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16984825040125934831
[2025-06-05 15:22:13] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2025-06-05 15:22:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:22:13] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2025-06-05 15:22:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:22:13] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2025-06-05 15:22:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 15:22:13] [INFO ] Applying decomposition
[2025-06-05 15:22:13] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16984825040125934831
Running compilation step : cd /tmp/ltsmin16984825040125934831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-05 15:22:13] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16943872445695634771.txt' '-o' '/tmp/graph16943872445695634771.bin' '-w' '/tmp/graph16943872445695634771.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16943872445695634771.bin' '-l' '-1' '-v' '-w' '/tmp/graph16943872445695634771.weights' '-q' '0' '-e' '0.001'
[2025-06-05 15:22:13] [INFO ] Decomposing Gal with order
[2025-06-05 15:22:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 15:22:13] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-05 15:22:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality923479629918093298.gal : 0 ms
[2025-06-05 15:22:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality9348336387441828362.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality923479629918093298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9348336387441828362.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((G(("(gi1.gi0.gu0.access>=2)")||(X(X(F(("(gu2.p_m<=gu2.r_stopped)")||(X(X(X("(gi1.gi0.gu1.p_rel<3)")))))))))))
Formula 0 simplified : F(!"(gi1.gi0.gu0.access>=2)" & XXG(!"(gu2.p_m<=gu2.r_stopped)" & XXX!"(gi1.gi0.gu1.p_rel<3)"))
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin16984825040125934831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16984825040125934831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(<>(((LTLAPp1==true)||X(X(X((LTLAPp2==true))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: [](((LTLAPp0==true)||X(X(<>(((LTLAPp1==true)||X(X(X((LTLAPp2==true))))))))))
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: "[](((LTLAPp0==true)||X(X(<>(((LTLAPp1==true)||X(X(X((LTLAPp2==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.077: DFS-FIFO for weak LTL, using special progress label 15
pins2lts-mc-linux64( 0/ 8), 0.077: There are 16 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.077: State length is 16, there are 18 groups
pins2lts-mc-linux64( 0/ 8), 0.077: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.077: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.077: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.077: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.092: ~1 levels ~960 states ~3360 transitions
pins2lts-mc-linux64( 5/ 8), 0.105: ~1 levels ~1920 states ~7624 transitions
pins2lts-mc-linux64( 5/ 8), 0.120: ~1 levels ~3840 states ~16584 transitions
pins2lts-mc-linux64( 5/ 8), 0.140: ~1 levels ~7680 states ~35912 transitions
pins2lts-mc-linux64( 7/ 8), 0.200: ~1 levels ~15360 states ~85112 transitions
pins2lts-mc-linux64( 7/ 8), 0.299: ~1 levels ~30720 states ~178408 transitions
pins2lts-mc-linux64( 7/ 8), 0.509: ~1 levels ~61440 states ~374520 transitions
pins2lts-mc-linux64( 7/ 8), 0.907: ~1 levels ~122880 states ~777448 transitions
pins2lts-mc-linux64( 6/ 8), 1.500: ~1 levels ~245760 states ~1589408 transitions
pins2lts-mc-linux64( 5/ 8), 2.241: ~1 levels ~491520 states ~3380128 transitions
pins2lts-mc-linux64( 1/ 8), 3.242: ~1 levels ~983040 states ~6539696 transitions
pins2lts-mc-linux64( 6/ 8), 4.539: ~1 levels ~1966080 states ~14020744 transitions
pins2lts-mc-linux64( 6/ 8), 7.407: ~1 levels ~3932160 states ~28598512 transitions
pins2lts-mc-linux64( 6/ 8), 13.109: ~1 levels ~7864320 states ~59493656 transitions
pins2lts-mc-linux64( 6/ 8), 25.298: ~1 levels ~15728640 states ~121097800 transitions
pins2lts-mc-linux64( 1/ 8), 49.891: ~1 levels ~31457280 states ~240152776 transitions
pins2lts-mc-linux64( 2/ 8), 101.379: ~1 levels ~62914560 states ~485720328 transitions
pins2lts-mc-linux64( 2/ 8), 213.366: ~1 levels ~125829120 states ~990667968 transitions
pins2lts-mc-linux64( 4/ 8), 244.539: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 244.569:
pins2lts-mc-linux64( 0/ 8), 244.569: mean standard work distribution: 4.9% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 244.569:
pins2lts-mc-linux64( 0/ 8), 244.569: Explored 123174658 states 1029705067 transitions, fanout: 8.360
pins2lts-mc-linux64( 0/ 8), 244.569: Total exploration time 244.490 sec (244.460 sec minimum, 244.470 sec on average)
pins2lts-mc-linux64( 0/ 8), 244.569: States per second: 503802, Transitions per second: 4211645
pins2lts-mc-linux64( 0/ 8), 244.569:
pins2lts-mc-linux64( 0/ 8), 244.569: Progress states detected: 134217022
pins2lts-mc-linux64( 0/ 8), 244.569: Redundant explorations: -8.2274
pins2lts-mc-linux64( 0/ 8), 244.569:
pins2lts-mc-linux64( 0/ 8), 244.569: Queue width: 8B, total height: 23483289, memory: 179.16MB
pins2lts-mc-linux64( 0/ 8), 244.569: Tree memory: 1072.9MB, 8.4 B/state, compr.: 12.7%
pins2lts-mc-linux64( 0/ 8), 244.569: Tree fill ratio (roots/leafs): 99.0%/19.0%
pins2lts-mc-linux64( 0/ 8), 244.569: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 244.569: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 244.569: Est. total memory use: 1252.1MB (~1203.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16984825040125934831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(<>(((LTLAPp1==true)||X(X(X((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16984825040125934831;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(<>(((LTLAPp1==true)||X(X(X((LTLAPp2==true))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 15:43:12] [INFO ] Flatten gal took : 2 ms
[2025-06-05 15:43:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality14066163005695258575.gal : 0 ms
[2025-06-05 15:43:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality8733123421203614626.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14066163005695258575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8733123421203614626.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(("(access>=2)")||(X(X(F(("(p_m<=r_stopped)")||(X(X(X("(p_rel<3)")))))))))))
Formula 0 simplified : F(!"(access>=2)" & XXG(!"(p_m<=r_stopped)" & XXX!"(p_rel<3)"))
Detected timeout of ITS tools.
[2025-06-05 16:04:12] [INFO ] Flatten gal took : 128 ms
[2025-06-05 16:04:13] [INFO ] Input system was already deterministic with 11 transitions.
[2025-06-05 16:04:13] [INFO ] Transformed 15 places.
[2025-06-05 16:04:13] [INFO ] Transformed 11 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-05 16:04:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality1469006283632915974.gal : 3 ms
[2025-06-05 16:04:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality13338577379105987883.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1469006283632915974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13338577379105987883.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(access>=2)")||(X(X(F(("(p_m<=r_stopped)")||(X(X(X("(p_rel<3)")))))))))))
Formula 0 simplified : F(!"(access>=2)" & XXG(!"(p_m<=r_stopped)" & XXX!"(p_rel<3)"))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-02000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is RobotManipulation-PT-02000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889264500587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-02000.tgz
mv RobotManipulation-PT-02000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;