About the Execution of ITS-Tools for StigmergyCommit-PT-06a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 765426.00 | 0.00 | 0.00 | TFFTTFTFTTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490600065.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 StigmergyCommit-PT-06a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490600065
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:33 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 StigmergyCommit-PT-06a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2023-15
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-06a-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1749071276213
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 21:07:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 21:07:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:07:58] [INFO ] Load time of PNML (sax parser for PT used): 446 ms
[2025-06-04 21:07:58] [INFO ] Transformed 256 places.
[2025-06-04 21:07:58] [INFO ] Transformed 2816 transitions.
[2025-06-04 21:07:58] [INFO ] Found NUPN structural information;
[2025-06-04 21:07:58] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 637 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 98 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 587/587 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 223 transition count 551
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 223 transition count 551
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 223 transition count 547
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 219 transition count 543
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 219 transition count 543
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 219 transition count 541
Applied a total of 80 rules in 84 ms. Remains 219 /256 variables (removed 37) and now considering 541/587 (removed 46) transitions.
[2025-06-04 21:07:59] [INFO ] Flow matrix only has 526 transitions (discarded 15 similar events)
// Phase 1: matrix 526 rows 219 cols
[2025-06-04 21:07:59] [INFO ] Computed 5 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:07:59] [INFO ] Implicit Places using invariants in 541 ms returned []
[2025-06-04 21:07:59] [INFO ] Flow matrix only has 526 transitions (discarded 15 similar events)
[2025-06-04 21:07:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:07:59] [INFO ] State equation strengthened by 347 read => feed constraints.
[2025-06-04 21:08:02] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned [218]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3254 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/256 places, 541/587 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 214 transition count 537
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 214 transition count 537
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 213 transition count 536
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 213 transition count 536
Applied a total of 10 rules in 27 ms. Remains 213 /218 variables (removed 5) and now considering 536/541 (removed 5) transitions.
[2025-06-04 21:08:02] [INFO ] Flow matrix only has 521 transitions (discarded 15 similar events)
// Phase 1: matrix 521 rows 213 cols
[2025-06-04 21:08:02] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:08:02] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-04 21:08:02] [INFO ] Flow matrix only has 521 transitions (discarded 15 similar events)
[2025-06-04 21:08:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:08:02] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:08:02] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 213/256 places, 536/587 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3892 ms. Remains : 213/256 places, 536/587 transitions.
Support contains 98 out of 213 places after structural reductions.
[2025-06-04 21:08:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-04 21:08:03] [INFO ] Flatten gal took : 124 ms
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 21:08:03] [INFO ] Flatten gal took : 78 ms
[2025-06-04 21:08:03] [INFO ] Input system was already deterministic with 536 transitions.
Support contains 89 out of 213 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 4401 ms. (9 steps per ms) remains 9/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
[2025-06-04 21:08:05] [INFO ] Flow matrix only has 521 transitions (discarded 15 similar events)
[2025-06-04 21:08:05] [INFO ] Invariant cache hit.
[2025-06-04 21:08:05] [INFO ] State equation strengthened by 260 read => feed constraints.
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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 194/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 520/733 variables, 213/217 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/733 variables, 259/476 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/733 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/734 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/734 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 477 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 213/213 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 194/213 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:06] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:07] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:07] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:07] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:07] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:07] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:08] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:08] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:08] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:08] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:09] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:09] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:09] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:09] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:09] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:10] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:10] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:10] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:10] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:10] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:10] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:11] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:11] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:11] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 17 ms to minimize.
SMT process timed out in 6341ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 536/536 transitions.
Graph (complete) has 412 edges and 213 vertex of which 210 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 210 transition count 398
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 146 rules applied. Total rules applied 282 place count 94 transition count 368
Reduce places removed 8 places and 0 transitions.
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 2 with 11 rules applied. Total rules applied 293 place count 86 transition count 365
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 298 place count 85 transition count 361
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 302 place count 81 transition count 361
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 302 place count 81 transition count 354
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 316 place count 74 transition count 354
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 333 place count 57 transition count 334
Iterating global reduction 5 with 17 rules applied. Total rules applied 350 place count 57 transition count 334
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 366 place count 57 transition count 318
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 367 place count 56 transition count 316
Iterating global reduction 6 with 1 rules applied. Total rules applied 368 place count 56 transition count 316
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 384 place count 56 transition count 300
Performed 12 Post agglomeration using F-continuation condition with reduction of 113 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 408 place count 44 transition count 175
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 7 with 94 rules applied. Total rules applied 502 place count 44 transition count 81
Performed 3 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 508 place count 41 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 522 place count 41 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 530 place count 41 transition count 48
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 9 with 2 rules applied. Total rules applied 532 place count 40 transition count 47
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 534 place count 40 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 536 place count 38 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 537 place count 38 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 538 place count 38 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 539 place count 37 transition count 43
Applied a total of 539 rules in 100 ms. Remains 37 /213 variables (removed 176) and now considering 43/536 (removed 493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 37/213 places, 43/536 transitions.
RANDOM walk for 40000 steps (556 resets) in 484 ms. (82 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (127 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
// Phase 1: matrix 43 rows 37 cols
[2025-06-04 21:08:11] [INFO ] Computed 7 invariants in 0 ms
[2025-06-04 21:08:11] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/74 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/75 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/79 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/80 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/80 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 53 constraints, problems are : Problem set: 0 solved, 3 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 9/9 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem AtomicPropp9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp57 is UNSAT
After SMT solving in domain Int declared 34/80 variables, and 16 constraints, problems are : Problem set: 3 solved, 0 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 0/37 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2025-06-04 21:08:12] [INFO ] Flatten gal took : 48 ms
[2025-06-04 21:08:12] [INFO ] Flatten gal took : 44 ms
[2025-06-04 21:08:12] [INFO ] Input system was already deterministic with 536 transitions.
Computed a total of 40 stabilizing places and 40 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 173 transition count 490
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 173 transition count 490
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 87 place count 173 transition count 483
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 111 place count 149 transition count 455
Iterating global reduction 1 with 24 rules applied. Total rules applied 135 place count 149 transition count 455
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 141 place count 149 transition count 449
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 156 place count 134 transition count 434
Iterating global reduction 2 with 15 rules applied. Total rules applied 171 place count 134 transition count 434
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 180 place count 125 transition count 425
Iterating global reduction 2 with 9 rules applied. Total rules applied 189 place count 125 transition count 425
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 196 place count 118 transition count 418
Iterating global reduction 2 with 7 rules applied. Total rules applied 203 place count 118 transition count 418
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 209 place count 112 transition count 412
Iterating global reduction 2 with 6 rules applied. Total rules applied 215 place count 112 transition count 412
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 218 place count 112 transition count 409
Applied a total of 218 rules in 31 ms. Remains 112 /213 variables (removed 101) and now considering 409/536 (removed 127) transitions.
[2025-06-04 21:08:12] [INFO ] Flow matrix only has 401 transitions (discarded 8 similar events)
// Phase 1: matrix 401 rows 112 cols
[2025-06-04 21:08:12] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:08:12] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-04 21:08:12] [INFO ] Flow matrix only has 401 transitions (discarded 8 similar events)
[2025-06-04 21:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:08:12] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:08:13] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2025-06-04 21:08:13] [INFO ] Flow matrix only has 401 transitions (discarded 8 similar events)
[2025-06-04 21:08:13] [INFO ] Invariant cache hit.
[2025-06-04 21:08:13] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:18] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:18] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:18] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:18] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:18] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:18] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:18] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:19] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:20] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:20] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:20] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:20] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:20] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:20] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:20] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:21] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:21] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:21] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:21] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:21] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:21] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:21] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:22] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:22] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:22] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:22] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:22] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:22] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:22] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:22] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:22] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:24] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:24] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:24] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:24] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:24] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:24] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:25] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:27] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:27] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:27] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:27] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:28] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:28] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:28] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:28] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:34] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:35] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (OVERLAPS) 400/512 variables, 112/180 constraints. Problems are: Problem set: 0 solved, 408 unsolved
SMT process timed out in 31119ms, After SMT, problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 31134ms
Starting structural reductions in LTL mode, iteration 1 : 112/213 places, 409/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31573 ms. Remains : 112/213 places, 409/536 transitions.
[2025-06-04 21:08:44] [INFO ] Flatten gal took : 25 ms
[2025-06-04 21:08:44] [INFO ] Flatten gal took : 28 ms
[2025-06-04 21:08:44] [INFO ] Input system was already deterministic with 409 transitions.
[2025-06-04 21:08:44] [INFO ] Flatten gal took : 28 ms
[2025-06-04 21:08:44] [INFO ] Flatten gal took : 25 ms
[2025-06-04 21:08:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality7712369563961440772.gal : 22 ms
[2025-06-04 21:08:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15279761720797819411.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7712369563961440772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15279761720797819411.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14519e+06,1.09105,24704,2,3375,5,42566,6,0,849,27651,0
Converting to forward existential form...Done !
original formula: AF(EG((((EX((p74==0)) + (p192==0)) + (p170==1)) * ((E(A((p132==1) U (p19==0)) U (((p135==0)||(p156==1))&&(p25==0))) + (p214==0)) + ((p108...174
=> equivalent forward existential formula: [FwdG(Init,!(EG((((EX((p74==0)) + (p192==0)) + (p170==1)) * ((E(!((E(!((p19==0)) U (!((p132==1)) * !((p19==0))))...264
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t22, t23, t25, t26, t28, t30, t31,...492
(forward)formula 0,1,5.5632,127156,1,0,577,338366,853,151,12016,244429,889
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 171 transition count 487
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 171 transition count 487
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 92 place count 171 transition count 479
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 119 place count 144 transition count 448
Iterating global reduction 1 with 27 rules applied. Total rules applied 146 place count 144 transition count 448
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 152 place count 144 transition count 442
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 168 place count 128 transition count 426
Iterating global reduction 2 with 16 rules applied. Total rules applied 184 place count 128 transition count 426
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 197 place count 115 transition count 413
Iterating global reduction 2 with 13 rules applied. Total rules applied 210 place count 115 transition count 413
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 222 place count 103 transition count 401
Iterating global reduction 2 with 12 rules applied. Total rules applied 234 place count 103 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 236 place count 103 transition count 399
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 243 place count 96 transition count 392
Iterating global reduction 3 with 7 rules applied. Total rules applied 250 place count 96 transition count 392
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 253 place count 96 transition count 389
Applied a total of 253 rules in 27 ms. Remains 96 /213 variables (removed 117) and now considering 389/536 (removed 147) transitions.
[2025-06-04 21:08:50] [INFO ] Flow matrix only has 380 transitions (discarded 9 similar events)
// Phase 1: matrix 380 rows 96 cols
[2025-06-04 21:08:50] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:08:50] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-04 21:08:50] [INFO ] Flow matrix only has 380 transitions (discarded 9 similar events)
[2025-06-04 21:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:08:50] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:08:50] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 388 sub problems to find dead transitions.
[2025-06-04 21:08:50] [INFO ] Flow matrix only has 380 transitions (discarded 9 similar events)
[2025-06-04 21:08:50] [INFO ] Invariant cache hit.
[2025-06-04 21:08:50] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:54] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:54] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:54] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:54] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:55] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:56] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:56] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:56] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:56] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:56] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:56] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:56] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:56] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:57] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:58] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:58] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:58] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:58] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:58] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:58] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:08:58] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:00] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:00] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:00] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:00] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:00] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:00] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:01] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:02] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:02] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:02] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:02] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:02] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:03] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:04] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:04] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:04] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:04] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:04] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:05] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:05] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:05] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:08] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:09] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 10 (OVERLAPS) 379/475 variables, 96/164 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 259/423 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:16] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/476 variables, and 424 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 388/126 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:25] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:25] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:09:26] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (OVERLAPS) 379/475 variables, 96/168 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 259/427 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 126/553 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/476 variables, and 553 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 388/126 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60679ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60683ms
Starting structural reductions in LTL mode, iteration 1 : 96/213 places, 389/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61148 ms. Remains : 96/213 places, 389/536 transitions.
[2025-06-04 21:09:51] [INFO ] Flatten gal took : 21 ms
[2025-06-04 21:09:51] [INFO ] Flatten gal took : 41 ms
[2025-06-04 21:09:51] [INFO ] Input system was already deterministic with 389 transitions.
[2025-06-04 21:09:51] [INFO ] Flatten gal took : 19 ms
[2025-06-04 21:09:51] [INFO ] Flatten gal took : 20 ms
[2025-06-04 21:09:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality15476910090907261109.gal : 10 ms
[2025-06-04 21:09:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality2386378840270946146.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15476910090907261109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2386378840270946146.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14108e+06,0.813789,21040,2,2533,5,33259,6,0,762,20434,0
Converting to forward existential form...Done !
original formula: EX(((E(!(AF(((p223==0)||(p171==1)))) U AF((p80==1))) * (p90==0)) * ((p252==0)||(p93==1))))
=> equivalent forward existential formula: [(FwdU(((EY(Init) * ((p252==0)||(p93==1))) * (p90==0)),!(!(EG(!(((p223==0)||(p171==1))))))) * !(EG(!((p80==1))))...166
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t23, t24, t26, t28, t29, t31, t33, t34,...462
(forward)formula 0,0,4.45214,94384,1,0,541,243023,803,126,11962,186971,843
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 171 transition count 488
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 171 transition count 488
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 93 place count 171 transition count 479
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 117 place count 147 transition count 452
Iterating global reduction 1 with 24 rules applied. Total rules applied 141 place count 147 transition count 452
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 147 place count 147 transition count 446
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 163 place count 131 transition count 430
Iterating global reduction 2 with 16 rules applied. Total rules applied 179 place count 131 transition count 430
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 191 place count 119 transition count 418
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 119 transition count 418
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 213 place count 109 transition count 408
Iterating global reduction 2 with 10 rules applied. Total rules applied 223 place count 109 transition count 408
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 231 place count 101 transition count 400
Iterating global reduction 2 with 8 rules applied. Total rules applied 239 place count 101 transition count 400
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 243 place count 101 transition count 396
Applied a total of 243 rules in 25 ms. Remains 101 /213 variables (removed 112) and now considering 396/536 (removed 140) transitions.
[2025-06-04 21:09:55] [INFO ] Flow matrix only has 387 transitions (discarded 9 similar events)
// Phase 1: matrix 387 rows 101 cols
[2025-06-04 21:09:55] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:09:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-04 21:09:56] [INFO ] Flow matrix only has 387 transitions (discarded 9 similar events)
[2025-06-04 21:09:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:09:56] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:09:56] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2025-06-04 21:09:56] [INFO ] Flow matrix only has 387 transitions (discarded 9 similar events)
[2025-06-04 21:09:56] [INFO ] Invariant cache hit.
[2025-06-04 21:09:56] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:00] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:00] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:01] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:01] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:01] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:01] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:01] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:01] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:02] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:02] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:02] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:02] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:02] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:02] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:03] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:03] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:03] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:03] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:03] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:03] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:04] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:04] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:04] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:04] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:04] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:04] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:04] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:04] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:05] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:05] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:05] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:05] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:05] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:05] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:05] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:05] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:06] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:07] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:08] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:08] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:08] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:08] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:09] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:09] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:09] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:09] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:09] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:10] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:10] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:10] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:10] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:11] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:11] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:11] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:11] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:11] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:13] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:13] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:13] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:14] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:14] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:14] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 386/487 variables, 101/169 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 259/428 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/488 variables, and 428 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 395/133 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 67/68 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:29] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:29] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:30] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:30] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:30] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:30] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:31] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:36] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:38] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:38] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:10:41] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 395 unsolved
SMT process timed out in 60572ms, After SMT, problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60574ms
Starting structural reductions in LTL mode, iteration 1 : 101/213 places, 396/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61077 ms. Remains : 101/213 places, 396/536 transitions.
[2025-06-04 21:10:57] [INFO ] Flatten gal took : 25 ms
[2025-06-04 21:10:57] [INFO ] Flatten gal took : 19 ms
[2025-06-04 21:10:57] [INFO ] Input system was already deterministic with 396 transitions.
[2025-06-04 21:10:57] [INFO ] Flatten gal took : 18 ms
[2025-06-04 21:10:57] [INFO ] Flatten gal took : 19 ms
[2025-06-04 21:10:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality18385273645576115086.gal : 6 ms
[2025-06-04 21:10:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality2624795851618196660.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18385273645576115086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2624795851618196660.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1503e+06,0.859975,22356,2,3029,5,39310,6,0,791,24642,0
Converting to forward existential form...Done !
original formula: AX(EG((AX((p149==0)) + (((p19==0)||(p128==1))&&((p88==1)||((p79==0)&&(p135==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((!(EX(!((p149==0)))) + (((p19==0)||(p128==1))&&((p88==1)||((p79==0)&&(p135==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t17, t19, t21, t22, t24, t26, t27, t28, t29, t31,...477
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.05449,111420,1,0,555,276005,808,135,12169,216263,848
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 174 transition count 491
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 174 transition count 491
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 86 place count 174 transition count 483
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 108 place count 152 transition count 458
Iterating global reduction 1 with 22 rules applied. Total rules applied 130 place count 152 transition count 458
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 134 place count 152 transition count 454
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 148 place count 138 transition count 440
Iterating global reduction 2 with 14 rules applied. Total rules applied 162 place count 138 transition count 440
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 174 place count 126 transition count 428
Iterating global reduction 2 with 12 rules applied. Total rules applied 186 place count 126 transition count 428
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 196 place count 116 transition count 418
Iterating global reduction 2 with 10 rules applied. Total rules applied 206 place count 116 transition count 418
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 209 place count 116 transition count 415
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 213 place count 112 transition count 411
Iterating global reduction 3 with 4 rules applied. Total rules applied 217 place count 112 transition count 411
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 219 place count 112 transition count 409
Applied a total of 219 rules in 28 ms. Remains 112 /213 variables (removed 101) and now considering 409/536 (removed 127) transitions.
[2025-06-04 21:11:02] [INFO ] Flow matrix only has 401 transitions (discarded 8 similar events)
// Phase 1: matrix 401 rows 112 cols
[2025-06-04 21:11:02] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:11:02] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-04 21:11:02] [INFO ] Flow matrix only has 401 transitions (discarded 8 similar events)
[2025-06-04 21:11:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:11:02] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:11:02] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2025-06-04 21:11:02] [INFO ] Flow matrix only has 401 transitions (discarded 8 similar events)
[2025-06-04 21:11:02] [INFO ] Invariant cache hit.
[2025-06-04 21:11:02] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:07] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:07] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:07] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:08] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:08] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:08] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:08] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:08] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:08] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:08] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:09] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:09] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:09] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:09] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:09] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:09] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:09] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:09] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:09] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:10] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:10] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:10] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:10] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:10] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:10] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:10] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:10] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:11] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:12] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:13] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:13] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:13] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:13] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:14] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:14] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:14] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:14] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:14] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:15] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:16] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:16] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:16] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:16] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:16] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:16] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:16] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:17] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:17] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:17] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:17] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:17] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:17] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:17] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:18] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:19] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:19] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:19] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:19] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:21] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:21] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:21] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:23] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:25] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:26] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:27] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:27] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:30] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:33] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/513 variables, and 82 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/112 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 408/146 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:36] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:36] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:36] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:36] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:37] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:40] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:41] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:11:43] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (OVERLAPS) 400/512 variables, 112/204 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 259/463 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/513 variables, and 609 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 408/146 constraints, Known Traps: 91/91 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60641ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60644ms
Starting structural reductions in LTL mode, iteration 1 : 112/213 places, 409/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61199 ms. Remains : 112/213 places, 409/536 transitions.
[2025-06-04 21:12:03] [INFO ] Flatten gal took : 16 ms
[2025-06-04 21:12:03] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:12:03] [INFO ] Input system was already deterministic with 409 transitions.
[2025-06-04 21:12:03] [INFO ] Flatten gal took : 21 ms
[2025-06-04 21:12:03] [INFO ] Flatten gal took : 17 ms
[2025-06-04 21:12:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality16971981975748774955.gal : 5 ms
[2025-06-04 21:12:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality5495618882552690714.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16971981975748774955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5495618882552690714.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15031e+06,0.309966,10264,2,2113,5,15765,6,0,849,10656,0
Converting to forward existential form...Done !
original formula: E(EF(((AF((p219==0)) * (p68==1)) * (A((p78!=1) U E(((p195==0)||(p10==1)) U (p66==1))) + (AX((p85==1)) * ((p146==0)||(p235==1)))))) U AG(A...194
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((!(EG(!((p219==0)))) * (p68==1)) * (!((E(!(E(((p195==0)||(p10==1)) U (p66==1))) U (!((p78!...375
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t11, t12, t13, t14, t15, t16, t18, t20, t21, t23, t24, t25, t26, ...500
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.18299,152972,1,0,898,602615,864,337,11413,444124,1301
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 212 transition count 399
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 165 rules applied. Total rules applied 301 place count 76 transition count 370
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 9 rules applied. Total rules applied 310 place count 72 transition count 365
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 312 place count 71 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 312 place count 71 transition count 351
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 338 place count 58 transition count 351
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 348 place count 48 transition count 334
Iterating global reduction 4 with 10 rules applied. Total rules applied 358 place count 48 transition count 334
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 365 place count 48 transition count 327
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 369 place count 44 transition count 319
Iterating global reduction 5 with 4 rules applied. Total rules applied 373 place count 44 transition count 319
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 429 place count 44 transition count 263
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 439 place count 39 transition count 258
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 444 place count 39 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 193 transitions
Redundant transition composition rules discarded 193 transitions
Iterating global reduction 7 with 193 rules applied. Total rules applied 637 place count 39 transition count 60
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 651 place count 32 transition count 53
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 7 with 7 rules applied. Total rules applied 658 place count 25 transition count 46
Applied a total of 658 rules in 91 ms. Remains 25 /213 variables (removed 188) and now considering 46/536 (removed 490) transitions.
[2025-06-04 21:12:09] [INFO ] Flow matrix only has 39 transitions (discarded 7 similar events)
// Phase 1: matrix 39 rows 25 cols
[2025-06-04 21:12:09] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:12:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-04 21:12:09] [INFO ] Flow matrix only has 39 transitions (discarded 7 similar events)
[2025-06-04 21:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:12:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 21:12:10] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:12:10] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2025-06-04 21:12:10] [INFO ] Flow matrix only has 39 transitions (discarded 7 similar events)
[2025-06-04 21:12:10] [INFO ] Invariant cache hit.
[2025-06-04 21:12:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 7/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 38/63 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 69 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2447 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 7/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:12] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 38/63 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 33/102 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/64 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/64 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 103 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3826ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 3827ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/213 places, 46/536 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4027 ms. Remains : 25/213 places, 46/536 transitions.
[2025-06-04 21:12:13] [INFO ] Flatten gal took : 2 ms
[2025-06-04 21:12:13] [INFO ] Flatten gal took : 2 ms
[2025-06-04 21:12:13] [INFO ] Input system was already deterministic with 46 transitions.
[2025-06-04 21:12:13] [INFO ] Flatten gal took : 2 ms
[2025-06-04 21:12:13] [INFO ] Flatten gal took : 2 ms
[2025-06-04 21:12:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality12608965918728879968.gal : 1 ms
[2025-06-04 21:12:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12623335593479045690.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12608965918728879968.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12623335593479045690.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,208,0.014838,4148,2,129,5,812,6,0,139,565,0
Converting to forward existential form...Done !
original formula: AG((AF((p223==1)) + (p51==0)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((p51==0))),!((p223==1)))] = FALSE
Hit Full ! (commute/partial/dont) 43/0/3
(forward)formula 0,0,0.029166,4404,1,0,9,2346,22,4,938,1533,9
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 175 transition count 492
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 175 transition count 492
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 83 place count 175 transition count 485
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 106 place count 152 transition count 458
Iterating global reduction 1 with 23 rules applied. Total rules applied 129 place count 152 transition count 458
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 133 place count 152 transition count 454
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 150 place count 135 transition count 437
Iterating global reduction 2 with 17 rules applied. Total rules applied 167 place count 135 transition count 437
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 180 place count 122 transition count 424
Iterating global reduction 2 with 13 rules applied. Total rules applied 193 place count 122 transition count 424
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 206 place count 109 transition count 411
Iterating global reduction 2 with 13 rules applied. Total rules applied 219 place count 109 transition count 411
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 222 place count 109 transition count 408
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 227 place count 104 transition count 403
Iterating global reduction 3 with 5 rules applied. Total rules applied 232 place count 104 transition count 403
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 234 place count 104 transition count 401
Applied a total of 234 rules in 15 ms. Remains 104 /213 variables (removed 109) and now considering 401/536 (removed 135) transitions.
[2025-06-04 21:12:13] [INFO ] Flow matrix only has 392 transitions (discarded 9 similar events)
// Phase 1: matrix 392 rows 104 cols
[2025-06-04 21:12:13] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:12:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-04 21:12:14] [INFO ] Flow matrix only has 392 transitions (discarded 9 similar events)
[2025-06-04 21:12:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:12:14] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:12:14] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-06-04 21:12:14] [INFO ] Flow matrix only has 392 transitions (discarded 9 similar events)
[2025-06-04 21:12:14] [INFO ] Invariant cache hit.
[2025-06-04 21:12:14] [INFO ] State equation strengthened by 260 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:18] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:18] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:18] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:19] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:19] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:19] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:19] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:19] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:19] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:19] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:19] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:20] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:20] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:20] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:20] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:20] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:20] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:20] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:20] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:20] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:21] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:21] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:21] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:21] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:21] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:21] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:21] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:22] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:22] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:22] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:22] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:22] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:22] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:22] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:23] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:23] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:23] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:23] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:23] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:23] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:25] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:25] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:25] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:25] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:25] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:25] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:25] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:25] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:26] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:26] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:27] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:27] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:27] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:27] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:27] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:28] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:28] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:28] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:28] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:28] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:28] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:29] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:29] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:29] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:31] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:34] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:34] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:35] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:35] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:37] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:37] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:37] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:37] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 11 (OVERLAPS) 391/495 variables, 104/180 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 259/439 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/496 variables, and 439 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 400/138 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:12:48] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (OVERLAPS) 391/495 variables, 104/181 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 259/440 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 138/578 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/496 variables, and 578 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 400/138 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60554ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60555ms
Starting structural reductions in LTL mode, iteration 1 : 104/213 places, 401/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60890 ms. Remains : 104/213 places, 401/536 transitions.
[2025-06-04 21:13:14] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:13:14] [INFO ] Flatten gal took : 15 ms
[2025-06-04 21:13:14] [INFO ] Input system was already deterministic with 401 transitions.
[2025-06-04 21:13:14] [INFO ] Flatten gal took : 15 ms
[2025-06-04 21:13:14] [INFO ] Flatten gal took : 16 ms
[2025-06-04 21:13:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10504156637359552576.gal : 4 ms
[2025-06-04 21:13:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality15062452291128349547.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10504156637359552576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15062452291128349547.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14518e+06,0.987136,24684,2,3149,5,42154,6,0,806,26903,0
Converting to forward existential form...Done !
original formula: (AG((((EX((p137==1)) + E((p11==1) U !(AF((p44==1))))) + ((p74==0)||(p148==1))) + (p194==1))) * !(E(EG(((p47==0)||(p208==1))) U !(A(AF((p3...204
=> equivalent forward existential formula: ([((((FwdU(Init,TRUE) * !((p194==1))) * !(((p74==0)||(p148==1)))) * !(E((p11==1) U !(!(EG(!((p44==1)))))))) * !(...431
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t22, t23, t25, t26, t30, t31, t33,...480
Hit Full ! (commute/partial/dont) 132/0/269
(forward)formula 0,0,12.6603,270112,1,0,702,578709,827,263,12100,582123,1059
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 173 transition count 490
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 173 transition count 490
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 173 transition count 481
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 112 place count 150 transition count 455
Iterating global reduction 1 with 23 rules applied. Total rules applied 135 place count 150 transition count 455
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 141 place count 150 transition count 449
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 154 place count 137 transition count 436
Iterating global reduction 2 with 13 rules applied. Total rules applied 167 place count 137 transition count 436
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 176 place count 128 transition count 427
Iterating global reduction 2 with 9 rules applied. Total rules applied 185 place count 128 transition count 427
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 193 place count 120 transition count 419
Iterating global reduction 2 with 8 rules applied. Total rules applied 201 place count 120 transition count 419
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 203 place count 120 transition count 417
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 116 transition count 413
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 116 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 212 place count 116 transition count 412
Applied a total of 212 rules in 19 ms. Remains 116 /213 variables (removed 97) and now considering 412/536 (removed 124) transitions.
[2025-06-04 21:13:27] [INFO ] Flow matrix only has 403 transitions (discarded 9 similar events)
// Phase 1: matrix 403 rows 116 cols
[2025-06-04 21:13:27] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:13:27] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-04 21:13:27] [INFO ] Flow matrix only has 403 transitions (discarded 9 similar events)
[2025-06-04 21:13:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:13:27] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:13:28] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2025-06-04 21:13:28] [INFO ] Flow matrix only has 403 transitions (discarded 9 similar events)
[2025-06-04 21:13:28] [INFO ] Invariant cache hit.
[2025-06-04 21:13:28] [INFO ] State equation strengthened by 260 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:32] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:32] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:32] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:33] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:33] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:33] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:33] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:33] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:33] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:34] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:34] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:34] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:34] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:34] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:34] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:34] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:35] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:35] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:35] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:35] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:35] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:35] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:35] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:36] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:37] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:37] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:37] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:37] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:37] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:38] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:39] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:40] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:40] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:40] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:41] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:41] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:41] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:41] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:41] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:41] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:42] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:43] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:44] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:44] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:44] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:44] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:44] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:44] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:45] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:46] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:46] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:46] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:47] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:47] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:47] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:47] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:47] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:52] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:52] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:53] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:55] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:55] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:56] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:56] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:56] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:56] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:56] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:13:56] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 116/519 variables, and 80 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/116 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 411/149 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:01] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (OVERLAPS) 402/518 variables, 116/198 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 259/457 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/519 variables, and 606 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 411/149 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60572ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60576ms
Starting structural reductions in LTL mode, iteration 1 : 116/213 places, 412/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60948 ms. Remains : 116/213 places, 412/536 transitions.
[2025-06-04 21:14:28] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:14:28] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:14:28] [INFO ] Input system was already deterministic with 412 transitions.
[2025-06-04 21:14:28] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:14:28] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:14:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15323941538149508384.gal : 3 ms
[2025-06-04 21:14:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2425252099824577461.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15323941538149508384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2425252099824577461.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14929e+06,1.1178,25260,2,3285,5,41972,6,0,867,26616,0
Converting to forward existential form...Done !
original formula: AX(A(((AG(((p242==0)||(p67==1))) + (p159==1)) + (p26==1)) U !((A((p167==1) U (p53==0)) * (p1==0)))))
=> equivalent forward existential formula: ([((((FwdU(EY(Init),!(!((!((E(!((p53==0)) U (!((p167==1)) * !((p53==0)))) + EG(!((p53==0))))) * (p1==0))))) * !(...430
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...467
(forward)formula 0,0,11.3562,221532,1,0,704,548494,846,274,12290,533426,1009
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 172 transition count 489
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 172 transition count 489
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 91 place count 172 transition count 480
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 114 place count 149 transition count 454
Iterating global reduction 1 with 23 rules applied. Total rules applied 137 place count 149 transition count 454
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 143 place count 149 transition count 448
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 158 place count 134 transition count 433
Iterating global reduction 2 with 15 rules applied. Total rules applied 173 place count 134 transition count 433
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 185 place count 122 transition count 421
Iterating global reduction 2 with 12 rules applied. Total rules applied 197 place count 122 transition count 421
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 209 place count 110 transition count 409
Iterating global reduction 2 with 12 rules applied. Total rules applied 221 place count 110 transition count 409
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 223 place count 110 transition count 407
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 230 place count 103 transition count 400
Iterating global reduction 3 with 7 rules applied. Total rules applied 237 place count 103 transition count 400
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 241 place count 103 transition count 396
Applied a total of 241 rules in 16 ms. Remains 103 /213 variables (removed 110) and now considering 396/536 (removed 140) transitions.
[2025-06-04 21:14:40] [INFO ] Flow matrix only has 388 transitions (discarded 8 similar events)
// Phase 1: matrix 388 rows 103 cols
[2025-06-04 21:14:40] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:14:40] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-04 21:14:40] [INFO ] Flow matrix only has 388 transitions (discarded 8 similar events)
[2025-06-04 21:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:14:40] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:14:40] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2025-06-04 21:14:40] [INFO ] Flow matrix only has 388 transitions (discarded 8 similar events)
[2025-06-04 21:14:40] [INFO ] Invariant cache hit.
[2025-06-04 21:14:40] [INFO ] State equation strengthened by 260 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:45] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:45] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:45] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:45] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:46] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:46] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:46] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:46] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:46] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:47] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:47] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:47] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:47] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:47] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:47] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:47] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:47] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:47] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:48] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:48] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:48] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:48] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:48] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:48] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:48] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:48] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:49] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:49] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:49] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:49] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:49] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:49] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:49] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:50] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:50] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:50] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:50] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:50] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:50] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:52] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:52] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:52] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:52] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:52] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:52] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:52] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:53] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:53] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:53] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:54] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:54] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:54] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:55] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:56] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:56] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:57] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:14:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:01] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:03] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:03] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:03] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:05] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:05] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:06] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:06] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:07] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/491 variables, and 79 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/103 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 395/133 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:13] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:13] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:13] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:14] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:17] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:19] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 387/490 variables, 103/188 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 259/447 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 133/580 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/491 variables, and 580 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 395/133 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60548ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Starting structural reductions in LTL mode, iteration 1 : 103/213 places, 396/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60907 ms. Remains : 103/213 places, 396/536 transitions.
[2025-06-04 21:15:41] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:15:41] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:15:41] [INFO ] Input system was already deterministic with 396 transitions.
[2025-06-04 21:15:41] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:15:41] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:15:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9595625811422111481.gal : 3 ms
[2025-06-04 21:15:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16701878099346705215.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9595625811422111481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16701878099346705215.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14928e+06,0.306258,10200,2,2083,5,17271,6,0,800,10899,0
Converting to forward existential form...Done !
original formula: ((AF(AX(FALSE)) * AF(((p182==1) + EF(((p31==0)&&(p23==1)))))) * AF((AG((p110==1)) * (p148==1))))
=> equivalent forward existential formula: (([FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE * [FwdG(Init,!(((p182==1) + E(TRUE U ((p31==0)&&(p23==1))))))] = FALSE...223
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t9, t10, t11, t13, t15, t16, t18, t19, t20, t21, t22, t23, t25, t27, ...461
(forward)formula 0,0,3.5631,80216,1,0,548,195830,810,127,10951,165562,847
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 170 transition count 487
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 170 transition count 487
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 95 place count 170 transition count 478
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 120 place count 145 transition count 450
Iterating global reduction 1 with 25 rules applied. Total rules applied 145 place count 145 transition count 450
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 151 place count 145 transition count 444
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 167 place count 129 transition count 428
Iterating global reduction 2 with 16 rules applied. Total rules applied 183 place count 129 transition count 428
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 196 place count 116 transition count 415
Iterating global reduction 2 with 13 rules applied. Total rules applied 209 place count 116 transition count 415
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 221 place count 104 transition count 403
Iterating global reduction 2 with 12 rules applied. Total rules applied 233 place count 104 transition count 403
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 235 place count 104 transition count 401
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 241 place count 98 transition count 395
Iterating global reduction 3 with 6 rules applied. Total rules applied 247 place count 98 transition count 395
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 249 place count 98 transition count 393
Applied a total of 249 rules in 18 ms. Remains 98 /213 variables (removed 115) and now considering 393/536 (removed 143) transitions.
[2025-06-04 21:15:44] [INFO ] Flow matrix only has 384 transitions (discarded 9 similar events)
// Phase 1: matrix 384 rows 98 cols
[2025-06-04 21:15:44] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:15:44] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 21:15:44] [INFO ] Flow matrix only has 384 transitions (discarded 9 similar events)
[2025-06-04 21:15:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:15:45] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:15:45] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2025-06-04 21:15:45] [INFO ] Flow matrix only has 384 transitions (discarded 9 similar events)
[2025-06-04 21:15:45] [INFO ] Invariant cache hit.
[2025-06-04 21:15:45] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:49] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:49] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:49] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:50] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:50] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:50] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:50] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:51] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:51] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:51] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:51] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:51] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:51] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:51] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:51] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:52] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:52] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:52] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:52] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:52] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:52] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:52] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:52] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:53] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:54] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:54] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:54] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:54] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:56] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:56] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:56] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:56] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:57] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:57] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:57] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:57] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:57] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:57] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:57] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:57] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:57] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:58] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:58] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:58] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:58] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:58] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:58] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:58] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:59] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:59] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:15:59] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:01] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:02] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:02] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:02] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:02] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:02] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:02] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:02] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:04] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:04] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:06] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:06] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:06] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:07] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:07] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:10] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:13] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 98/482 variables, and 84 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/98 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 392/130 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 83/84 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:19] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (OVERLAPS) 383/481 variables, 98/183 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 259/442 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 130/572 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/482 variables, and 572 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 392/130 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60582ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60584ms
Starting structural reductions in LTL mode, iteration 1 : 98/213 places, 393/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60937 ms. Remains : 98/213 places, 393/536 transitions.
[2025-06-04 21:16:45] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:16:45] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:16:45] [INFO ] Input system was already deterministic with 393 transitions.
[2025-06-04 21:16:45] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:16:45] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:16:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality6248583945405362044.gal : 3 ms
[2025-06-04 21:16:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality8760734571540428408.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6248583945405362044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8760734571540428408.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1503e+06,0.889162,21064,2,2751,5,40146,6,0,776,22469,0
Converting to forward existential form...Done !
original formula: EX(!(E(E(((p126==0)||(p1==1)) U (p200==0)) U AF(!(((p115==0)||(p163==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(E(((p126==0)||(p1==1)) U (p200==0)) U !(EG(!(!(((p115==0)||(p163==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t20, t21, t23, t24, t26, t28, t29, t31,...476
(forward)formula 0,0,7.68987,148700,1,0,589,427076,808,157,11826,290021,915
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 212 transition count 403
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 159 rules applied. Total rules applied 291 place count 80 transition count 376
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 7 rules applied. Total rules applied 298 place count 77 transition count 372
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 302 place count 76 transition count 369
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 304 place count 74 transition count 369
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 304 place count 74 transition count 355
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 332 place count 60 transition count 355
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 343 place count 49 transition count 337
Iterating global reduction 5 with 11 rules applied. Total rules applied 354 place count 49 transition count 337
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 361 place count 49 transition count 330
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 365 place count 45 transition count 322
Iterating global reduction 6 with 4 rules applied. Total rules applied 369 place count 45 transition count 322
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 6 with 120 rules applied. Total rules applied 489 place count 45 transition count 202
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 499 place count 40 transition count 197
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 504 place count 40 transition count 192
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 8 with 2 rules applied. Total rules applied 506 place count 39 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 507 place count 39 transition count 190
Drop transitions (Redundant composition of simpler transitions.) removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 9 with 131 rules applied. Total rules applied 638 place count 39 transition count 59
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 652 place count 32 transition count 52
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 658 place count 26 transition count 46
Applied a total of 658 rules in 53 ms. Remains 26 /213 variables (removed 187) and now considering 46/536 (removed 490) transitions.
[2025-06-04 21:16:53] [INFO ] Flow matrix only has 39 transitions (discarded 7 similar events)
// Phase 1: matrix 39 rows 26 cols
[2025-06-04 21:16:53] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:16:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-04 21:16:53] [INFO ] Flow matrix only has 39 transitions (discarded 7 similar events)
[2025-06-04 21:16:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:16:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 21:16:53] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:16:53] [INFO ] Redundant transitions in 1 ms returned []
Running 35 sub problems to find dead transitions.
[2025-06-04 21:16:53] [INFO ] Flow matrix only has 39 transitions (discarded 7 similar events)
[2025-06-04 21:16:53] [INFO ] Invariant cache hit.
[2025-06-04 21:16:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 7/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 38/64 variables, 26/50 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1/65 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 70 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2996 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 7/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:16:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 38/64 variables, 26/73 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 35/108 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 1/65 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/65 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 109 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5005ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 5005ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/213 places, 46/536 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5184 ms. Remains : 26/213 places, 46/536 transitions.
[2025-06-04 21:16:58] [INFO ] Flatten gal took : 1 ms
[2025-06-04 21:16:58] [INFO ] Flatten gal took : 1 ms
[2025-06-04 21:16:58] [INFO ] Input system was already deterministic with 46 transitions.
[2025-06-04 21:16:58] [INFO ] Flatten gal took : 2 ms
[2025-06-04 21:16:58] [INFO ] Flatten gal took : 1 ms
[2025-06-04 21:16:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality12175239900905592337.gal : 1 ms
[2025-06-04 21:16:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality4305382575685343757.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12175239900905592337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4305382575685343757.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,146,0.014704,4228,2,147,5,853,6,0,143,631,0
Converting to forward existential form...Done !
original formula: EF(((p204==1) * AG((p24==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p204==1)) * !(E(TRUE U !((p24==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t16, t19, t35, t36, t37, t38, t39...265
(forward)formula 0,0,0.047532,5380,1,0,112,5889,107,54,1094,5304,128
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 169 transition count 485
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 169 transition count 485
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 97 place count 169 transition count 476
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 124 place count 142 transition count 445
Iterating global reduction 1 with 27 rules applied. Total rules applied 151 place count 142 transition count 445
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 157 place count 142 transition count 439
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 175 place count 124 transition count 421
Iterating global reduction 2 with 18 rules applied. Total rules applied 193 place count 124 transition count 421
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 207 place count 110 transition count 407
Iterating global reduction 2 with 14 rules applied. Total rules applied 221 place count 110 transition count 407
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 235 place count 96 transition count 393
Iterating global reduction 2 with 14 rules applied. Total rules applied 249 place count 96 transition count 393
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 252 place count 96 transition count 390
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 260 place count 88 transition count 382
Iterating global reduction 3 with 8 rules applied. Total rules applied 268 place count 88 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 272 place count 88 transition count 378
Applied a total of 272 rules in 16 ms. Remains 88 /213 variables (removed 125) and now considering 378/536 (removed 158) transitions.
[2025-06-04 21:16:58] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
// Phase 1: matrix 370 rows 88 cols
[2025-06-04 21:16:58] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:16:58] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 21:16:58] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2025-06-04 21:16:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:16:59] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:16:59] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2025-06-04 21:16:59] [INFO ] Flow matrix only has 370 transitions (discarded 8 similar events)
[2025-06-04 21:16:59] [INFO ] Invariant cache hit.
[2025-06-04 21:16:59] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:03] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:04] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:04] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:04] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:04] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:04] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:04] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:05] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:05] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:05] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:05] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:05] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:05] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:05] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:05] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:05] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:06] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:06] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:06] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:06] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:06] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:06] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:06] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:06] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:07] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:08] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:09] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:09] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:10] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:10] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:11] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:13] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:13] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:13] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:13] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:14] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:15] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:15] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:16] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:16] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:16] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:16] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:16] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:16] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (OVERLAPS) 369/457 variables, 88/154 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 259/413 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:28] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:28] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:28] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 457/458 variables, and 416 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 377/115 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:35] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:17:37] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (OVERLAPS) 369/457 variables, 88/159 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 259/418 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 115/533 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/458 variables, and 533 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 377/115 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60550ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60552ms
Starting structural reductions in LTL mode, iteration 1 : 88/213 places, 378/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60919 ms. Remains : 88/213 places, 378/536 transitions.
[2025-06-04 21:17:59] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:17:59] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:17:59] [INFO ] Input system was already deterministic with 378 transitions.
[2025-06-04 21:17:59] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:17:59] [INFO ] Flatten gal took : 13 ms
[2025-06-04 21:17:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality14353333632591218194.gal : 3 ms
[2025-06-04 21:17:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13943079610692872298.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14353333632591218194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13943079610692872298.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13698e+06,0.864115,22272,2,2634,5,33772,6,0,722,21534,0
Converting to forward existential form...Done !
original formula: EX(EX(EG(EF(((p0==0)&&(p40==1))))))
=> equivalent forward existential formula: [FwdG(EY(EY(Init)),E(TRUE U ((p0==0)&&(p40==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...410
(forward)formula 0,1,10.8669,234372,1,0,665,516896,774,246,11430,468749,966
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 133 place count 212 transition count 402
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 162 rules applied. Total rules applied 295 place count 79 transition count 373
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 9 rules applied. Total rules applied 304 place count 75 transition count 368
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 308 place count 74 transition count 365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 310 place count 72 transition count 365
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 310 place count 72 transition count 351
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 338 place count 58 transition count 351
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 348 place count 48 transition count 334
Iterating global reduction 5 with 10 rules applied. Total rules applied 358 place count 48 transition count 334
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 365 place count 48 transition count 327
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 369 place count 44 transition count 319
Iterating global reduction 6 with 4 rules applied. Total rules applied 373 place count 44 transition count 319
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 6 with 120 rules applied. Total rules applied 493 place count 44 transition count 199
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 503 place count 39 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 508 place count 39 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 131 transitions
Redundant transition composition rules discarded 131 transitions
Iterating global reduction 8 with 131 rules applied. Total rules applied 639 place count 39 transition count 58
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 653 place count 32 transition count 51
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 659 place count 26 transition count 45
Applied a total of 659 rules in 41 ms. Remains 26 /213 variables (removed 187) and now considering 45/536 (removed 491) transitions.
[2025-06-04 21:18:10] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
// Phase 1: matrix 38 rows 26 cols
[2025-06-04 21:18:10] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:18:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-04 21:18:10] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
[2025-06-04 21:18:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:18:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 21:18:10] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:18:10] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-04 21:18:10] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
[2025-06-04 21:18:10] [INFO ] Invariant cache hit.
[2025-06-04 21:18:10] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:11] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 37/63 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/63 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/63 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/63 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 1/64 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/64 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/64 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 16 (OVERLAPS) 0/64 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 80 constraints, problems are : Problem set: 0 solved, 44 unsolved in 4131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 37/63 variables, 26/73 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 44/123 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 1/64 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/64 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 124 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6275ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 6275ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/213 places, 45/536 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6422 ms. Remains : 26/213 places, 45/536 transitions.
[2025-06-04 21:18:17] [INFO ] Flatten gal took : 2 ms
[2025-06-04 21:18:17] [INFO ] Flatten gal took : 1 ms
[2025-06-04 21:18:17] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 966 steps (58 resets) in 11 ms. (80 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 21:18:17] [INFO ] Flatten gal took : 2 ms
[2025-06-04 21:18:17] [INFO ] Flatten gal took : 1 ms
[2025-06-04 21:18:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7995118767975139959.gal : 0 ms
[2025-06-04 21:18:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8009296691784383612.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7995118767975139959.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8009296691784383612.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 171 transition count 487
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 171 transition count 487
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 92 place count 171 transition count 479
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 118 place count 145 transition count 449
Iterating global reduction 1 with 26 rules applied. Total rules applied 144 place count 145 transition count 449
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 149 place count 145 transition count 444
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 167 place count 127 transition count 426
Iterating global reduction 2 with 18 rules applied. Total rules applied 185 place count 127 transition count 426
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 199 place count 113 transition count 412
Iterating global reduction 2 with 14 rules applied. Total rules applied 213 place count 113 transition count 412
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 226 place count 100 transition count 399
Iterating global reduction 2 with 13 rules applied. Total rules applied 239 place count 100 transition count 399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 241 place count 100 transition count 397
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 248 place count 93 transition count 390
Iterating global reduction 3 with 7 rules applied. Total rules applied 255 place count 93 transition count 390
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 258 place count 93 transition count 387
Applied a total of 258 rules in 17 ms. Remains 93 /213 variables (removed 120) and now considering 387/536 (removed 149) transitions.
[2025-06-04 21:18:17] [INFO ] Flow matrix only has 378 transitions (discarded 9 similar events)
// Phase 1: matrix 378 rows 93 cols
[2025-06-04 21:18:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:18:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 21:18:17] [INFO ] Flow matrix only has 378 transitions (discarded 9 similar events)
[2025-06-04 21:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:18:17] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:18:17] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2025-06-04 21:18:17] [INFO ] Flow matrix only has 378 transitions (discarded 9 similar events)
[2025-06-04 21:18:17] [INFO ] Invariant cache hit.
[2025-06-04 21:18:17] [INFO ] State equation strengthened by 260 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:21] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:22] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:22] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:22] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:22] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:22] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:22] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:22] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:23] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:23] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:23] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:23] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:23] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:23] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:23] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:23] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:23] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:24] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:24] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:24] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:24] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:24] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:24] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:25] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:25] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:25] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:25] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:25] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:25] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:25] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:25] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:25] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:26] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:26] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:26] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:26] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:26] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:26] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:29] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:29] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:29] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:29] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:29] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:29] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:29] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:29] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:30] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:31] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:31] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:31] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:31] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:32] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:32] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:32] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:33] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:33] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:34] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:34] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:34] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:35] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:37] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 9 (OVERLAPS) 377/470 variables, 93/159 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 259/418 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:47] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/471 variables, and 419 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 386/124 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:51] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:51] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:51] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:51] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:51] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:18:53] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 377/470 variables, 93/166 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 259/425 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 124/549 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/471 variables, and 549 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 386/124 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60700ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60702ms
Starting structural reductions in LTL mode, iteration 1 : 93/213 places, 387/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61070 ms. Remains : 93/213 places, 387/536 transitions.
[2025-06-04 21:19:18] [INFO ] Flatten gal took : 22 ms
[2025-06-04 21:19:18] [INFO ] Flatten gal took : 22 ms
[2025-06-04 21:19:18] [INFO ] Input system was already deterministic with 387 transitions.
[2025-06-04 21:19:18] [INFO ] Flatten gal took : 22 ms
[2025-06-04 21:19:18] [INFO ] Flatten gal took : 22 ms
[2025-06-04 21:19:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality7769686842546924507.gal : 6 ms
[2025-06-04 21:19:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality14542298762376668306.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7769686842546924507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14542298762376668306.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13698e+06,1.10118,22188,2,2660,5,32925,6,0,748,20999,0
Converting to forward existential form...Done !
original formula: A((((p173==0)||(p152==1))&&((p173==0)||(p20==1))) U (!(EX((E(((p86==0)||(p152==1)) U (p112==0)) * EF((p200==1))))) + (p84==1)))
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX((E(((p86==0)||(p152==1)) U (p112==0)) * E(TRUE U (p200==1))))) + (p84==1)))))) * !(E(!((!...388
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33, t34,...429
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,13.1995,277884,1,0,760,837398,801,323,11709,607440,1108
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 536/536 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 174 transition count 492
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 174 transition count 492
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 86 place count 174 transition count 484
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 108 place count 152 transition count 459
Iterating global reduction 1 with 22 rules applied. Total rules applied 130 place count 152 transition count 459
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 136 place count 152 transition count 453
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 147 place count 141 transition count 442
Iterating global reduction 2 with 11 rules applied. Total rules applied 158 place count 141 transition count 442
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 166 place count 133 transition count 434
Iterating global reduction 2 with 8 rules applied. Total rules applied 174 place count 133 transition count 434
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 182 place count 125 transition count 426
Iterating global reduction 2 with 8 rules applied. Total rules applied 190 place count 125 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 125 transition count 425
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 195 place count 121 transition count 421
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 121 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 121 transition count 420
Applied a total of 200 rules in 14 ms. Remains 121 /213 variables (removed 92) and now considering 420/536 (removed 116) transitions.
[2025-06-04 21:19:31] [INFO ] Flow matrix only has 411 transitions (discarded 9 similar events)
// Phase 1: matrix 411 rows 121 cols
[2025-06-04 21:19:31] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:19:31] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-04 21:19:31] [INFO ] Flow matrix only has 411 transitions (discarded 9 similar events)
[2025-06-04 21:19:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:19:32] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-06-04 21:19:32] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2025-06-04 21:19:32] [INFO ] Flow matrix only has 411 transitions (discarded 9 similar events)
[2025-06-04 21:19:32] [INFO ] Invariant cache hit.
[2025-06-04 21:19:32] [INFO ] State equation strengthened by 260 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:39] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:40] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:40] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:40] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:40] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:41] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:41] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:41] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:41] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:41] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:42] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:42] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:42] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:42] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:42] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:42] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:43] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:43] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:43] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:43] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:44] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:44] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:44] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:44] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:44] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:44] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:44] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:44] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:45] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:45] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:45] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:45] [INFO ] Deduced a trap composed of 16 places in 251 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:46] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:46] [INFO ] Deduced a trap composed of 16 places in 245 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:46] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:46] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:47] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:49] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:49] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:49] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:52] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:52] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:52] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:52] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:52] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:52] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:52] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:53] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:53] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:53] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:53] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:53] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:55] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:56] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:56] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:56] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:56] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:56] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:57] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:57] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:57] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:57] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:57] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:57] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:58] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:58] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:58] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:19:58] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:00] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:00] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:01] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:01] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/532 variables, and 74 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/121 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 419/157 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:07] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:08] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:08] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:09] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:09] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:14] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:20:14] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/532 variables, and 82 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/121 constraints, ReadFeed: 0/260 constraints, PredecessorRefiner: 262/157 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60909ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60912ms
Starting structural reductions in LTL mode, iteration 1 : 121/213 places, 420/536 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61351 ms. Remains : 121/213 places, 420/536 transitions.
[2025-06-04 21:20:33] [INFO ] Flatten gal took : 23 ms
[2025-06-04 21:20:33] [INFO ] Flatten gal took : 21 ms
[2025-06-04 21:20:33] [INFO ] Input system was already deterministic with 420 transitions.
[2025-06-04 21:20:33] [INFO ] Flatten gal took : 22 ms
[2025-06-04 21:20:33] [INFO ] Flatten gal took : 22 ms
[2025-06-04 21:20:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality10088911899879162512.gal : 5 ms
[2025-06-04 21:20:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality15046208337448227238.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10088911899879162512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15046208337448227238.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15134e+06,1.10847,22096,2,3231,5,38767,6,0,895,24350,0
Converting to forward existential form...Done !
original formula: (EG((EX((EG((p126!=1)) * ((p243==0)||(p0==1)))) + EG(EX(((p196==0)||(p156==1)))))) * (AX(((p231==1)||(p18==1))) + !(A(EX(A((p176==1) U ((...213
=> equivalent forward existential formula: ([(Init * !(EG((EX((EG((p126!=1)) * ((p243==0)||(p0==1)))) + EG(EX(((p196==0)||(p156==1))))))))] = FALSE * [(EY(...481
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t30, t31,...495
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.16384,166620,1,0,659,526555,882,209,12822,365648,1024
FORMULA StigmergyCommit-PT-06a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 21:20:41] [INFO ] Flatten gal took : 14 ms
[2025-06-04 21:20:41] [INFO ] Flatten gal took : 14 ms
Total runtime 763515 ms.
BK_STOP 1749072041639
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="StigmergyCommit-PT-06a"
export BK_EXAMINATION="CTLCardinality"
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 StigmergyCommit-PT-06a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490600065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06a.tgz
mv StigmergyCommit-PT-06a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;