About the Execution of ITS-Tools for StigmergyElection-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 706836.00 | 0.00 | 0.00 | TTFTTTFTTTTFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491000257.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 StigmergyElection-PT-08a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491000257
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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.8K 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 5.3M 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 StigmergyElection-PT-08a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2023-15
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-00
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-01
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-02
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-03
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-04
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-05
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-06
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-07
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-08
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-09
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-10
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1749163833672
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-05 22:50:36] [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-05 22:50:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 22:50:37] [INFO ] Load time of PNML (sax parser for PT used): 870 ms
[2025-06-05 22:50:37] [INFO ] Transformed 114 places.
[2025-06-05 22:50:37] [INFO ] Transformed 6882 transitions.
[2025-06-05 22:50:37] [INFO ] Found NUPN structural information;
[2025-06-05 22:50:37] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 1521 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 664/664 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 660
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 110 transition count 658
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 110 transition count 658
Applied a total of 8 rules in 116 ms. Remains 110 /114 variables (removed 4) and now considering 658/664 (removed 6) transitions.
[2025-06-05 22:50:38] [INFO ] Flow matrix only has 637 transitions (discarded 21 similar events)
// Phase 1: matrix 637 rows 110 cols
[2025-06-05 22:50:38] [INFO ] Computed 7 invariants in 61 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:50:39] [INFO ] Implicit Places using invariants in 689 ms returned []
[2025-06-05 22:50:39] [INFO ] Flow matrix only has 637 transitions (discarded 21 similar events)
[2025-06-05 22:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:50:39] [INFO ] State equation strengthened by 549 read => feed constraints.
[2025-06-05 22:50:42] [INFO ] Implicit Places using invariants and state equation in 3480 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4306 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/114 places, 658/664 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 658/658 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4468 ms. Remains : 109/114 places, 658/664 transitions.
Support contains 66 out of 109 places after structural reductions.
[2025-06-05 22:50:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-05 22:50:43] [INFO ] Flatten gal took : 210 ms
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 22:50:43] [INFO ] Flatten gal took : 112 ms
[2025-06-05 22:50:43] [INFO ] Input system was already deterministic with 658 transitions.
Support contains 61 out of 109 places (down from 66) after GAL structural reductions.
RANDOM walk for 40000 steps (30 resets) in 5991 ms. (6 steps per ms) remains 0/47 properties
[2025-06-05 22:50:45] [INFO ] Flatten gal took : 90 ms
[2025-06-05 22:50:46] [INFO ] Flatten gal took : 88 ms
[2025-06-05 22:50:46] [INFO ] Input system was already deterministic with 658 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 108 transition count 627
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 78 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 77 transition count 626
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 62 place count 77 transition count 612
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 90 place count 63 transition count 612
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 103 place count 50 transition count 592
Iterating global reduction 3 with 13 rules applied. Total rules applied 116 place count 50 transition count 592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 50 transition count 591
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 117 place count 50 transition count 590
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 49 transition count 590
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 126 place count 42 transition count 576
Iterating global reduction 4 with 7 rules applied. Total rules applied 133 place count 42 transition count 576
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 4 with 254 rules applied. Total rules applied 387 place count 42 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 248 transitions
Redundant transition composition rules discarded 248 transitions
Iterating global reduction 5 with 248 rules applied. Total rules applied 635 place count 42 transition count 74
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 651 place count 34 transition count 66
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 652 place count 34 transition count 66
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 660 place count 26 transition count 58
Applied a total of 660 rules in 404 ms. Remains 26 /109 variables (removed 83) and now considering 58/658 (removed 600) transitions.
[2025-06-05 22:50:46] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
// Phase 1: matrix 50 rows 26 cols
[2025-06-05 22:50:46] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:50:47] [INFO ] Implicit Places using invariants in 425 ms returned []
[2025-06-05 22:50:47] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
[2025-06-05 22:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:50:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 22:50:47] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:50:47] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2025-06-05 22:50:47] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
[2025-06-05 22:50:47] [INFO ] Invariant cache hit.
[2025-06-05 22:50:47] [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) 8/26 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-05 22:50:48] [INFO ] Deduced a trap composed of 3 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-05 22:50:48] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:48] [INFO ] Deduced a trap composed of 3 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-05 22:50:48] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:48] [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-05 22:50:48] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:48] [INFO ] Deduced a trap composed of 3 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-05 22:50:49] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:49] [INFO ] Deduced a trap composed of 3 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-05 22:50:49] [INFO ] Deduced a trap composed of 3 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-05 22:50:49] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:49] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:49] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:49] [INFO ] Deduced a trap composed of 3 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-05 22:50:49] [INFO ] Deduced a trap composed of 3 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-05 22:50:49] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:49] [INFO ] Deduced a trap composed of 3 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-05 22:50:49] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:49] [INFO ] Deduced a trap composed of 3 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-05 22:50:49] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:49] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:50] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:50] [INFO ] Deduced a trap composed of 3 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-05 22:50:50] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:50] [INFO ] Deduced a trap composed of 3 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-05 22:50:50] [INFO ] Deduced a trap composed of 3 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-05 22:50:50] [INFO ] Deduced a trap composed of 3 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-05 22:50:50] [INFO ] Deduced a trap composed of 3 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-05 22:50:50] [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-05 22:50:50] [INFO ] Deduced a trap composed of 3 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-05 22:50:50] [INFO ] Deduced a trap composed of 3 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-05 22:50:50] [INFO ] Deduced a trap composed of 3 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-05 22:50:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 49/75 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:51] [INFO ] Deduced a trap composed of 3 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-05 22:50:51] [INFO ] Deduced a trap composed of 3 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-05 22:50:51] [INFO ] Deduced a trap composed of 3 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-05 22:50:51] [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-05 22:50:51] [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-05 22:50:51] [INFO ] Deduced a trap composed of 3 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-05 22:50:51] [INFO ] Deduced a trap composed of 3 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-05 22:50:51] [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-05 22:50:51] [INFO ] Deduced a trap composed of 3 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-05 22:50:51] [INFO ] Deduced a trap composed of 3 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-05 22:50:51] [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-05 22:50:51] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:52] [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-05 22:50:52] [INFO ] Deduced a trap composed of 3 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-05 22:50:52] [INFO ] Deduced a trap composed of 3 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-05 22:50:52] [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-05 22:50:52] [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-05 22:50:52] [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-05 22:50:52] [INFO ] Deduced a trap composed of 3 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-05 22:50:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:52] [INFO ] Deduced a trap composed of 3 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-05 22:50:52] [INFO ] Deduced a trap composed of 3 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-05 22:50:52] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 1/76 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/76 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 84 constraints, problems are : Problem set: 0 solved, 33 unsolved in 6030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 56/56 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) 8/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:50:54] [INFO ] Deduced a trap composed of 5 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-05 22:50:54] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 49/75 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 33/118 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/76 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/76 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 119 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8194ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 8201ms
Starting structural reductions in SI_CTL mode, iteration 1 : 26/109 places, 58/658 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9410 ms. Remains : 26/109 places, 58/658 transitions.
[2025-06-05 22:50:55] [INFO ] Flatten gal took : 7 ms
[2025-06-05 22:50:55] [INFO ] Flatten gal took : 5 ms
[2025-06-05 22:50:55] [INFO ] Input system was already deterministic with 58 transitions.
RANDOM walk for 497 steps (13 resets) in 21 ms. (22 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 22:50:55] [INFO ] Flatten gal took : 4 ms
[2025-06-05 22:50:55] [INFO ] Flatten gal took : 4 ms
[2025-06-05 22:50:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6155440449568634880.gal : 3 ms
[2025-06-05 22:50:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5974359204651782359.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/ReachabilityCardinality6155440449568634880.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5974359204651782359.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 : 109/109 places, 658/658 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 89 transition count 632
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 89 transition count 632
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 52 place count 77 transition count 614
Iterating global reduction 0 with 12 rules applied. Total rules applied 64 place count 77 transition count 614
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 71 transition count 608
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 71 transition count 608
Applied a total of 76 rules in 33 ms. Remains 71 /109 variables (removed 38) and now considering 608/658 (removed 50) transitions.
[2025-06-05 22:50:56] [INFO ] Flow matrix only has 598 transitions (discarded 10 similar events)
// Phase 1: matrix 598 rows 71 cols
[2025-06-05 22:50:56] [INFO ] Computed 1 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:50:56] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-05 22:50:56] [INFO ] Flow matrix only has 598 transitions (discarded 10 similar events)
[2025-06-05 22:50:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:50:56] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 22:50:56] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 607 sub problems to find dead transitions.
[2025-06-05 22:50:56] [INFO ] Flow matrix only has 598 transitions (discarded 10 similar events)
[2025-06-05 22:50:56] [INFO ] Invariant cache hit.
[2025-06-05 22:50:56] [INFO ] State equation strengthened by 517 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/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:05] [INFO ] Deduced a trap composed of 9 places in 444 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:05] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:05] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:06] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:06] [INFO ] Deduced a trap composed of 9 places in 594 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:07] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:07] [INFO ] Deduced a trap composed of 9 places in 516 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:07] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:08] [INFO ] Deduced a trap composed of 9 places in 552 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:08] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:09] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:09] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:09] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:10] [INFO ] Deduced a trap composed of 9 places in 627 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:10] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:10] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:11] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:11] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:11] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:11] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:12] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:12] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:12] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:13] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:13] [INFO ] Deduced a trap composed of 9 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-05 22:51:13] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:13] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:13] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:13] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:13] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:13] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:14] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:14] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:14] [INFO ] Deduced a trap composed of 10 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-05 22:51:14] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:15] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:15] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:15] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:16] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:16] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:18] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:21] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:21] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:21] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:21] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:21] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:21] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:22] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:22] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:22] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:22] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:22] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:22] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:22] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:22] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:23] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:23] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:24] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:24] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:24] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:24] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:24] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:24] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:25] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:25] [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-05 22:51:25] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:28] [INFO ] Deduced a trap composed of 10 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-05 22:51:28] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:28] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 71/669 variables, and 70 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/71 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 607/88 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 69/70 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:34] [INFO ] Deduced a trap composed of 11 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-05 22:51:34] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:34] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:34] [INFO ] Deduced a trap composed of 10 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-05 22:51:34] [INFO ] Deduced a trap composed of 10 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-05 22:51:34] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:35] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:35] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:35] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:35] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:35] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:35] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:35] [INFO ] Deduced a trap composed of 9 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-05 22:51:39] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:39] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 15/85 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:43] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:54] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:51:54] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 71/669 variables, and 88 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/71 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/88 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62017ms problems are : Problem set: 0 solved, 607 unsolved
Search for dead transitions found 0 dead transitions in 62038ms
Starting structural reductions in LTL mode, iteration 1 : 71/109 places, 608/658 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62834 ms. Remains : 71/109 places, 608/658 transitions.
[2025-06-05 22:51:58] [INFO ] Flatten gal took : 61 ms
[2025-06-05 22:51:59] [INFO ] Flatten gal took : 59 ms
[2025-06-05 22:51:59] [INFO ] Input system was already deterministic with 608 transitions.
[2025-06-05 22:51:59] [INFO ] Flatten gal took : 56 ms
[2025-06-05 22:51:59] [INFO ] Flatten gal took : 57 ms
[2025-06-05 22:51:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality6861685955309866549.gal : 34 ms
[2025-06-05 22:51:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality5427426535905125612.ctl : 9 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/CTLCardinality6861685955309866549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5427426535905125612.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,446356,3.88579,73916,2,5025,5,81307,6,0,882,51645,0
Converting to forward existential form...Done !
original formula: (A(!(((p5==0)||(p80==1))) U (p24==0)) * EG(EF(AX(FALSE))))
=> equivalent forward existential formula: [FwdG((Init * !((E(!((p24==0)) U (!(!(((p5==0)||(p80==1)))) * !((p24==0)))) + EG(!((p24==0)))))),E(TRUE U !(EX(!...176
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,...409
(forward)formula 0,0,11.0248,180084,1,0,733,311229,1238,97,21828,216942,1239
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-02 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 : 109/109 places, 658/658 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 88 transition count 630
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 88 transition count 630
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 74 transition count 610
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 74 transition count 610
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 69 transition count 605
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 69 transition count 605
Applied a total of 80 rules in 29 ms. Remains 69 /109 variables (removed 40) and now considering 605/658 (removed 53) transitions.
[2025-06-05 22:52:10] [INFO ] Flow matrix only has 596 transitions (discarded 9 similar events)
// Phase 1: matrix 596 rows 69 cols
[2025-06-05 22:52:10] [INFO ] Computed 1 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:52:10] [INFO ] Implicit Places using invariants in 203 ms returned []
[2025-06-05 22:52:10] [INFO ] Flow matrix only has 596 transitions (discarded 9 similar events)
[2025-06-05 22:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:52:11] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 22:52:11] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2025-06-05 22:52:11] [INFO ] Flow matrix only has 596 transitions (discarded 9 similar events)
[2025-06-05 22:52:11] [INFO ] Invariant cache hit.
[2025-06-05 22:52:11] [INFO ] State equation strengthened by 517 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:18] [INFO ] Deduced a trap composed of 9 places in 378 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:18] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:19] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:19] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:19] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:20] [INFO ] Deduced a trap composed of 9 places in 325 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:20] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:20] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:21] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:21] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:21] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:21] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:22] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:22] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:22] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:23] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:23] [INFO ] Deduced a trap composed of 10 places in 389 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:23] [INFO ] Deduced a trap composed of 11 places in 387 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:24] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:24] [INFO ] Deduced a trap composed of 9 places in 380 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:25] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:25] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:25] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:25] [INFO ] Deduced a trap composed of 9 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-05 22:52:25] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:25] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:25] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:26] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:26] [INFO ] Deduced a trap composed of 10 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-05 22:52:26] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:26] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:26] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:26] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:26] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:26] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:27] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:27] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:27] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:27] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:27] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:30] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:30] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:30] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:30] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:30] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:31] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:31] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:31] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:31] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:32] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:32] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:32] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:32] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:32] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:34] [INFO ] Deduced a trap composed of 10 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-05 22:52:34] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:35] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:35] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:36] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:36] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:36] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:36] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:37] [INFO ] Deduced a trap composed of 9 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-05 22:52:37] [INFO ] Deduced a trap composed of 9 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-05 22:52:39] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:39] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:39] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:39] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:40] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:40] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:40] [INFO ] Deduced a trap composed of 9 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-05 22:52:40] [INFO ] Deduced a trap composed of 10 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-05 22:52:40] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:41] [INFO ] Deduced a trap composed of 10 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-05 22:52:41] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:41] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 69/665 variables, and 77 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/69 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 604/85 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:46] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:46] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:46] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:46] [INFO ] Deduced a trap composed of 10 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-05 22:52:46] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:46] [INFO ] Deduced a trap composed of 12 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-05 22:52:47] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:47] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:47] [INFO ] Deduced a trap composed of 11 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-05 22:52:47] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:47] [INFO ] Deduced a trap composed of 10 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-05 22:52:47] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:47] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:48] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:48] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:48] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:52] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:52] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:52:52] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:01] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:04] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:11] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:11] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 69/665 variables, and 100 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/69 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/85 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61627ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 61633ms
Starting structural reductions in LTL mode, iteration 1 : 69/109 places, 605/658 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62449 ms. Remains : 69/109 places, 605/658 transitions.
[2025-06-05 22:53:13] [INFO ] Flatten gal took : 33 ms
[2025-06-05 22:53:13] [INFO ] Flatten gal took : 33 ms
[2025-06-05 22:53:13] [INFO ] Input system was already deterministic with 605 transitions.
[2025-06-05 22:53:13] [INFO ] Flatten gal took : 65 ms
[2025-06-05 22:53:13] [INFO ] Flatten gal took : 66 ms
[2025-06-05 22:53:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality14873088211699990112.gal : 53 ms
[2025-06-05 22:53:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality16089537879376086010.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/CTLCardinality14873088211699990112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16089537879376086010.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,438162,4.02752,77152,2,5705,5,99570,6,0,872,61323,0
Converting to forward existential form...Done !
original formula: AX(((AF((EX((p18==1)) + ((p68==0)&&(p62==1)))) * EF((p21==0))) * (p58==0)))
=> equivalent forward existential formula: (([FwdG(EY(Init),!((EX((p18==1)) + ((p68==0)&&(p62==1)))))] = FALSE * [(EY(Init) * !(E(TRUE U (p21==0))))] = FAL...196
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t17, t18, t19, t20, t21, t23, t25, t26, t28, t30,...419
(forward)formula 0,1,14.4331,251180,1,0,778,428654,1231,132,22602,293103,1273
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 90 transition count 633
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 90 transition count 633
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 80 transition count 618
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 80 transition count 618
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 75 transition count 613
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 75 transition count 613
Applied a total of 68 rules in 20 ms. Remains 75 /109 variables (removed 34) and now considering 613/658 (removed 45) transitions.
[2025-06-05 22:53:28] [INFO ] Flow matrix only has 603 transitions (discarded 10 similar events)
// Phase 1: matrix 603 rows 75 cols
[2025-06-05 22:53:28] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:53:28] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-05 22:53:28] [INFO ] Flow matrix only has 603 transitions (discarded 10 similar events)
[2025-06-05 22:53:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:53:28] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 22:53:28] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
Running 612 sub problems to find dead transitions.
[2025-06-05 22:53:28] [INFO ] Flow matrix only has 603 transitions (discarded 10 similar events)
[2025-06-05 22:53:28] [INFO ] Invariant cache hit.
[2025-06-05 22:53:28] [INFO ] State equation strengthened by 517 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:35] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:35] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:35] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:35] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:36] [INFO ] Deduced a trap composed of 10 places in 316 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:36] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:36] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:37] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:37] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:38] [INFO ] Deduced a trap composed of 9 places in 354 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:38] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:38] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:38] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:39] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:39] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:39] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:39] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:40] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:40] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:40] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:41] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:41] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:41] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:41] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:42] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:42] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:42] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:42] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:42] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:43] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:43] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:43] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:43] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:44] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:44] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:44] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:44] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:45] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:45] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:45] [INFO ] Deduced a trap composed of 12 places in 397 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:49] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:49] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:49] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:49] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:49] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:50] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:50] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:50] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:50] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:50] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:51] [INFO ] Deduced a trap composed of 12 places in 327 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:51] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:52] [INFO ] Deduced a trap composed of 12 places in 368 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:52] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:52] [INFO ] Deduced a trap composed of 12 places in 314 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:52] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:53] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:53] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:53] [INFO ] Deduced a trap composed of 12 places in 350 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:53] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:54] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:54] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:54] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:55] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:55] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:55] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:55] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:56] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:56] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:56] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:58] [INFO ] Deduced a trap composed of 11 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-05 22:53:58] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:58] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:59] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 612 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:59] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:59] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:59] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:53:59] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:00] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 4 ms to minimize.
SMT process timed out in 31221ms, After SMT, problems are : Problem set: 0 solved, 612 unsolved
Search for dead transitions found 0 dead transitions in 31227ms
Starting structural reductions in LTL mode, iteration 1 : 75/109 places, 613/658 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32111 ms. Remains : 75/109 places, 613/658 transitions.
[2025-06-05 22:54:00] [INFO ] Flatten gal took : 52 ms
[2025-06-05 22:54:00] [INFO ] Flatten gal took : 54 ms
[2025-06-05 22:54:00] [INFO ] Input system was already deterministic with 613 transitions.
[2025-06-05 22:54:00] [INFO ] Flatten gal took : 31 ms
[2025-06-05 22:54:00] [INFO ] Flatten gal took : 35 ms
[2025-06-05 22:54:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9059379444693948072.gal : 12 ms
[2025-06-05 22:54:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality3285787423756357462.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/CTLCardinality9059379444693948072.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3285787423756357462.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,456597,3.01899,55740,2,4257,5,81841,6,0,903,45076,0
Converting to forward existential form...Done !
original formula: EG(((EX(AG((p25==0))) + EX(EF((p112==0)))) + (AX(FALSE) + ((p34==0)&&((((p32==0)||(p43==1))||((p112==0)||(p28==0)))||(((p14==1)||(p95==0)...172
=> equivalent forward existential formula: [FwdG(Init,((EX(!(E(TRUE U !((p25==0))))) + EX(E(TRUE U (p112==0)))) + (!(EX(!(FALSE))) + ((p34==0)&&((((p32==0)...239
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t10, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t27, t29, t30,...424
(forward)formula 0,1,22.4334,368084,1,0,795,626446,1243,134,23165,384639,1329
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 92 transition count 637
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 92 transition count 637
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 82 transition count 623
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 82 transition count 623
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 78 transition count 619
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 78 transition count 619
Applied a total of 62 rules in 15 ms. Remains 78 /109 variables (removed 31) and now considering 619/658 (removed 39) transitions.
[2025-06-05 22:54:23] [INFO ] Flow matrix only has 607 transitions (discarded 12 similar events)
// Phase 1: matrix 607 rows 78 cols
[2025-06-05 22:54:23] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:54:23] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-05 22:54:23] [INFO ] Flow matrix only has 607 transitions (discarded 12 similar events)
[2025-06-05 22:54:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:54:23] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 22:54:23] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2025-06-05 22:54:23] [INFO ] Flow matrix only has 607 transitions (discarded 12 similar events)
[2025-06-05 22:54:23] [INFO ] Invariant cache hit.
[2025-06-05 22:54:23] [INFO ] State equation strengthened by 517 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:32] [INFO ] Deduced a trap composed of 9 places in 397 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:32] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:33] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:33] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:33] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:34] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:34] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:34] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:34] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:35] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:35] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:35] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:36] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:36] [INFO ] Deduced a trap composed of 12 places in 326 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:36] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:37] [INFO ] Deduced a trap composed of 12 places in 389 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:37] [INFO ] Deduced a trap composed of 12 places in 321 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:37] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:38] [INFO ] Deduced a trap composed of 9 places in 305 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:38] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:39] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:39] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:39] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:39] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:39] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:40] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:40] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:40] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:40] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:40] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:41] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:41] [INFO ] Deduced a trap composed of 9 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-05 22:54:41] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:41] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:41] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:42] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:42] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:42] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:42] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:42] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:46] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:46] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:46] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:46] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:46] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:47] [INFO ] Deduced a trap composed of 13 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-05 22:54:47] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:47] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:47] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:47] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:48] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:48] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:48] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:48] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:48] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:48] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:49] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:49] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:49] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:49] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:51] [INFO ] Deduced a trap composed of 9 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-05 22:54:51] [INFO ] Deduced a trap composed of 9 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-05 22:54:51] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:51] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:51] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:51] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:52] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:52] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:52] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:52] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:52] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:53] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:53] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:53] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:53] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 78/685 variables, and 76 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/78 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 618/99 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:59] [INFO ] Deduced a trap composed of 10 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-05 22:54:59] [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-05 22:54:59] [INFO ] Deduced a trap composed of 9 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-05 22:54:59] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:59] [INFO ] Deduced a trap composed of 9 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-05 22:54:59] [INFO ] Deduced a trap composed of 10 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-05 22:54:59] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:54:59] [INFO ] Deduced a trap composed of 10 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-05 22:55:00] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:00] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:00] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:00] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:00] [INFO ] Deduced a trap composed of 12 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-05 22:55:01] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:01] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:01] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:01] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:02] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:06] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:07] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:11] [INFO ] Deduced a trap composed of 9 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-05 22:55:12] [INFO ] Deduced a trap composed of 12 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-05 22:55:12] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:12] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:13] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:13] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:16] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:17] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:19] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:19] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 78/685 variables, and 106 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/78 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/99 constraints, Known Traps: 105/105 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61220ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 61225ms
Starting structural reductions in LTL mode, iteration 1 : 78/109 places, 619/658 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61950 ms. Remains : 78/109 places, 619/658 transitions.
[2025-06-05 22:55:25] [INFO ] Flatten gal took : 25 ms
[2025-06-05 22:55:25] [INFO ] Flatten gal took : 27 ms
[2025-06-05 22:55:25] [INFO ] Input system was already deterministic with 619 transitions.
[2025-06-05 22:55:25] [INFO ] Flatten gal took : 46 ms
[2025-06-05 22:55:25] [INFO ] Flatten gal took : 44 ms
[2025-06-05 22:55:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16561873171722993244.gal : 7 ms
[2025-06-05 22:55:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality18160001598995157641.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/CTLCardinality16561873171722993244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18160001598995157641.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,461717,2.89667,54304,2,4216,5,81415,6,0,919,44758,0
Converting to forward existential form...Done !
original formula: (EX((EX((((p38==0)&&(p111==1))||((p33==0)&&(p42==1)))) * EF((p19==1)))) * (EG(((p59==0)&&(p74==1))) + EF((p61==1))))
=> equivalent forward existential formula: ([FwdG((Init * EX((EX((((p38==0)&&(p111==1))||((p33==0)&&(p42==1)))) * E(TRUE U (p19==1))))),((p59==0)&&(p74==1)...291
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t22, t24, t26, t27, t29, t31, t32,...419
(forward)formula 0,1,23.9622,388736,1,0,792,654544,1258,137,23033,404982,1330
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 639
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 639
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 85 transition count 627
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 85 transition count 627
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 82 transition count 624
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 82 transition count 624
Applied a total of 54 rules in 30 ms. Remains 82 /109 variables (removed 27) and now considering 624/658 (removed 34) transitions.
[2025-06-05 22:55:49] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
// Phase 1: matrix 612 rows 82 cols
[2025-06-05 22:55:49] [INFO ] Computed 1 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:55:49] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-05 22:55:49] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
[2025-06-05 22:55:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:55:49] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 22:55:50] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 623 sub problems to find dead transitions.
[2025-06-05 22:55:50] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
[2025-06-05 22:55:50] [INFO ] Invariant cache hit.
[2025-06-05 22:55:50] [INFO ] State equation strengthened by 517 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:59] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:55:59] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:00] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:00] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:00] [INFO ] Deduced a trap composed of 9 places in 326 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:01] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:01] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:01] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:01] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:02] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:02] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:02] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:02] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:03] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:03] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:03] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:03] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:03] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:04] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:04] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:05] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:05] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:05] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:06] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:06] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:06] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:06] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:06] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:07] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:07] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:07] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:07] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:07] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:07] [INFO ] Deduced a trap composed of 14 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-05 22:56:08] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:08] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:08] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:09] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:09] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:09] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:14] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:14] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:14] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:14] [INFO ] Deduced a trap composed of 9 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-05 22:56:14] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:15] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:15] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:15] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:16] [INFO ] Deduced a trap composed of 12 places in 349 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:16] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:16] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:17] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:17] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:17] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:17] [INFO ] Deduced a trap composed of 9 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-05 22:56:17] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:17] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:17] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:17] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:18] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:19] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:19] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:19] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:19] [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-05 22:56:19] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:19] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:19] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:20] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:20] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:20] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:20] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:20] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:21] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:21] [INFO ] Deduced a trap composed of 12 places in 330 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:21] [INFO ] Deduced a trap composed of 12 places in 313 ms of which 20 ms to minimize.
SMT process timed out in 31812ms, After SMT, problems are : Problem set: 0 solved, 623 unsolved
Search for dead transitions found 0 dead transitions in 31816ms
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 624/658 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32478 ms. Remains : 82/109 places, 624/658 transitions.
[2025-06-05 22:56:22] [INFO ] Flatten gal took : 42 ms
[2025-06-05 22:56:22] [INFO ] Flatten gal took : 54 ms
[2025-06-05 22:56:22] [INFO ] Input system was already deterministic with 624 transitions.
[2025-06-05 22:56:22] [INFO ] Flatten gal took : 45 ms
[2025-06-05 22:56:22] [INFO ] Flatten gal took : 47 ms
[2025-06-05 22:56:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16764259076153055913.gal : 11 ms
[2025-06-05 22:56:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4515320207324047529.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/CTLCardinality16764259076153055913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4515320207324047529.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,462358,3.5655,67136,2,5284,5,116191,6,0,940,65403,0
Converting to forward existential form...Done !
original formula: E(!(((AX(EX(((p25==0)||(p83==1)))) * !(E(((p19==0)||(p111==1)) U ((p102==0)||(p100==1))))) * (E(((p60==0)||(p25==1)) U (p3==0)) * AX((p5=...258
=> equivalent forward existential formula: [(FwdU(Init,!(((!(EX(!(EX(((p25==0)||(p83==1)))))) * !(E(((p19==0)||(p111==1)) U ((p102==0)||(p100==1))))) * (E(...322
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t12, t13, t15, t16, t18, t19, t21, t23, t24, t26, t28, ...433
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,17.4579,299536,1,0,849,677496,1269,150,21875,445602,1378
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 90 transition count 632
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 90 transition count 632
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 53 place count 75 transition count 610
Iterating global reduction 0 with 15 rules applied. Total rules applied 68 place count 75 transition count 610
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 68 transition count 603
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 68 transition count 603
Applied a total of 82 rules in 13 ms. Remains 68 /109 variables (removed 41) and now considering 603/658 (removed 55) transitions.
[2025-06-05 22:56:39] [INFO ] Flow matrix only has 592 transitions (discarded 11 similar events)
// Phase 1: matrix 592 rows 68 cols
[2025-06-05 22:56:39] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:56:40] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-05 22:56:40] [INFO ] Flow matrix only has 592 transitions (discarded 11 similar events)
[2025-06-05 22:56:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:56:40] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 22:56:40] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2025-06-05 22:56:40] [INFO ] Flow matrix only has 592 transitions (discarded 11 similar events)
[2025-06-05 22:56:40] [INFO ] Invariant cache hit.
[2025-06-05 22:56:40] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:48] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:49] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:49] [INFO ] Deduced a trap composed of 9 places in 310 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:49] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:49] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:50] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:50] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:50] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:50] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:51] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:51] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:51] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:51] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:52] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:52] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:52] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:52] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:53] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:53] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:53] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:54] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:54] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:54] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:54] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:55] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:55] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:55] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:55] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:55] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:55] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:56] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:56] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:56] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:56] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:56] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:56] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:57] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:57] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:57] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:57] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:56:59] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:00] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:00] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:00] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:00] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:00] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:00] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:03] [INFO ] Deduced a trap composed of 10 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-05 22:57:03] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:03] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:03] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:04] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:04] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:07] [INFO ] Deduced a trap composed of 10 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-05 22:57:07] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:08] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:10] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 68/660 variables, and 60 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/68 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 602/83 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:15] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:15] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:15] [INFO ] Deduced a trap composed of 10 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-05 22:57:16] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:16] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:16] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:16] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:16] [INFO ] Deduced a trap composed of 10 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-05 22:57:16] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:16] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:17] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:17] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:17] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:17] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:17] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:18] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:18] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:22] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:23] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:23] [INFO ] Deduced a trap composed of 9 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-05 22:57:23] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:23] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:57:23] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 6 (OVERLAPS) 591/659 variables, 68/151 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 516/667 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 750 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 602/83 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61275ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 61279ms
Starting structural reductions in LTL mode, iteration 1 : 68/109 places, 603/658 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62052 ms. Remains : 68/109 places, 603/658 transitions.
[2025-06-05 22:57:41] [INFO ] Flatten gal took : 25 ms
[2025-06-05 22:57:42] [INFO ] Flatten gal took : 27 ms
[2025-06-05 22:57:42] [INFO ] Input system was already deterministic with 603 transitions.
[2025-06-05 22:57:42] [INFO ] Flatten gal took : 27 ms
[2025-06-05 22:57:42] [INFO ] Flatten gal took : 27 ms
[2025-06-05 22:57:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2042641673404342854.gal : 11 ms
[2025-06-05 22:57:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality8752800332259411969.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/CTLCardinality2042641673404342854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8752800332259411969.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,397202,3.4996,67804,2,4210,5,65938,6,0,860,42682,0
Converting to forward existential form...Done !
original formula: EF((EX(AF((p8==1))) * AX(EF((p78==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(!(EG(!((p8==1)))))) * !(EX(!(E(TRUE U (p78==1))))))] != FALSE
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,...354
(forward)formula 0,0,23.1224,392188,1,0,745,471414,1223,115,22831,269935,1276
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 109 transition count 635
Reduce places removed 23 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 26 rules applied. Total rules applied 49 place count 86 transition count 632
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 83 transition count 632
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 52 place count 83 transition count 621
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 74 place count 72 transition count 621
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 82 place count 64 transition count 609
Iterating global reduction 3 with 8 rules applied. Total rules applied 90 place count 64 transition count 609
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 94 place count 60 transition count 601
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 60 transition count 601
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 105 place count 60 transition count 594
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 121 place count 52 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 434 transitions
Redundant transition composition rules discarded 434 transitions
Iterating global reduction 4 with 434 rules applied. Total rules applied 555 place count 52 transition count 152
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 4 with 14 rules applied. Total rules applied 569 place count 45 transition count 145
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 572 place count 45 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 573 place count 45 transition count 144
Applied a total of 573 rules in 137 ms. Remains 45 /109 variables (removed 64) and now considering 144/658 (removed 514) transitions.
[2025-06-05 22:58:05] [INFO ] Flow matrix only has 132 transitions (discarded 12 similar events)
// Phase 1: matrix 132 rows 45 cols
[2025-06-05 22:58:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:58:05] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-05 22:58:05] [INFO ] Flow matrix only has 132 transitions (discarded 12 similar events)
[2025-06-05 22:58:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:58:05] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 22:58:05] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 22:58:05] [INFO ] Redundant transitions in 8 ms returned []
Running 143 sub problems to find dead transitions.
[2025-06-05 22:58:05] [INFO ] Flow matrix only has 132 transitions (discarded 12 similar events)
[2025-06-05 22:58:05] [INFO ] Invariant cache hit.
[2025-06-05 22:58:05] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:07] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:07] [INFO ] Deduced a trap composed of 5 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-05 22:58:07] [INFO ] Deduced a trap composed of 4 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-05 22:58:07] [INFO ] Deduced a trap composed of 4 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-05 22:58:07] [INFO ] Deduced a trap composed of 4 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-05 22:58:07] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:07] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:07] [INFO ] Deduced a trap composed of 6 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-05 22:58:08] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:08] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:08] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:08] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:08] [INFO ] Deduced a trap composed of 8 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-05 22:58:08] [INFO ] Deduced a trap composed of 4 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-05 22:58:08] [INFO ] Deduced a trap composed of 6 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-05 22:58:08] [INFO ] Deduced a trap composed of 6 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-05 22:58:08] [INFO ] Deduced a trap composed of 6 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-05 22:58:08] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:09] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:09] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:09] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:09] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:09] [INFO ] Deduced a trap composed of 6 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-05 22:58:09] [INFO ] Deduced a trap composed of 4 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-05 22:58:09] [INFO ] Deduced a trap composed of 7 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-05 22:58:09] [INFO ] Deduced a trap composed of 6 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-05 22:58:09] [INFO ] Deduced a trap composed of 4 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-05 22:58:09] [INFO ] Deduced a trap composed of 4 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-05 22:58:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:09] [INFO ] Deduced a trap composed of 4 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-05 22:58:10] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:10] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:10] [INFO ] Deduced a trap composed of 4 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-05 22:58:10] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:10] [INFO ] Deduced a trap composed of 6 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-05 22:58:10] [INFO ] Deduced a trap composed of 4 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-05 22:58:10] [INFO ] Deduced a trap composed of 4 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-05 22:58:10] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:10] [INFO ] Deduced a trap composed of 4 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-05 22:58:10] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:11] [INFO ] Deduced a trap composed of 7 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-05 22:58:11] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:11] [INFO ] Deduced a trap composed of 8 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-05 22:58:11] [INFO ] Deduced a trap composed of 9 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-05 22:58:11] [INFO ] Deduced a trap composed of 9 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-05 22:58:11] [INFO ] Deduced a trap composed of 6 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-05 22:58:11] [INFO ] Deduced a trap composed of 6 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-05 22:58:11] [INFO ] Deduced a trap composed of 6 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-05 22:58:11] [INFO ] Deduced a trap composed of 4 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-05 22:58:11] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:12] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:12] [INFO ] Deduced a trap composed of 7 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-05 22:58:12] [INFO ] Deduced a trap composed of 7 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-05 22:58:12] [INFO ] Deduced a trap composed of 7 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-05 22:58:12] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:13] [INFO ] Deduced a trap composed of 7 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-05 22:58:13] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:13] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:14] [INFO ] Deduced a trap composed of 6 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-05 22:58:14] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:15] [INFO ] Deduced a trap composed of 9 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-05 22:58:15] [INFO ] Deduced a trap composed of 10 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-05 22:58:15] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:16] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (OVERLAPS) 131/176 variables, 45/113 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 85/198 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:19] [INFO ] Deduced a trap composed of 6 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-05 22:58:19] [INFO ] Deduced a trap composed of 6 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-05 22:58:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 15 (OVERLAPS) 1/177 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 17 (OVERLAPS) 0/177 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 202 constraints, problems are : Problem set: 0 solved, 143 unsolved in 23890 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:58:31] [INFO ] Deduced a trap composed of 8 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-05 22:58:31] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 131/176 variables, 45/118 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 85/203 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 143/346 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/177 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 177/177 variables, and 347 constraints, problems are : Problem set: 0 solved, 143 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54181ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 54182ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/109 places, 144/658 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54569 ms. Remains : 45/109 places, 144/658 transitions.
[2025-06-05 22:59:00] [INFO ] Flatten gal took : 11 ms
[2025-06-05 22:59:00] [INFO ] Flatten gal took : 12 ms
[2025-06-05 22:59:00] [INFO ] Input system was already deterministic with 144 transitions.
[2025-06-05 22:59:00] [INFO ] Flatten gal took : 11 ms
[2025-06-05 22:59:00] [INFO ] Flatten gal took : 10 ms
[2025-06-05 22:59:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality4389229442696050416.gal : 2 ms
[2025-06-05 22:59:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality11684946332733788371.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/CTLCardinality4389229442696050416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11684946332733788371.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,8053,0.089167,6356,2,469,5,4604,6,0,309,2857,0
Converting to forward existential form...Done !
original formula: EF((((p87==1) + AG((EF(((p18==1)&&((p99==0)||(p32==1)))) * AF((p45==1))))) + (((p78==0)&&(p98==1))&&(((p33==0)||(p94==1))&&((p51==1)||((p...177
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * (p87==1))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U ((p18==1)&&((p99==0)||(p3...315
(forward)formula 0,1,0.090139,6484,1,0,7,4604,8,1,312,2857,1
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 637
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 637
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 84 transition count 622
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 84 transition count 622
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 79 transition count 617
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 79 transition count 617
Applied a total of 60 rules in 17 ms. Remains 79 /109 variables (removed 30) and now considering 617/658 (removed 41) transitions.
[2025-06-05 22:59:00] [INFO ] Flow matrix only has 604 transitions (discarded 13 similar events)
// Phase 1: matrix 604 rows 79 cols
[2025-06-05 22:59:00] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:59:00] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-05 22:59:00] [INFO ] Flow matrix only has 604 transitions (discarded 13 similar events)
[2025-06-05 22:59:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:59:00] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 22:59:01] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-06-05 22:59:01] [INFO ] Flow matrix only has 604 transitions (discarded 13 similar events)
[2025-06-05 22:59:01] [INFO ] Invariant cache hit.
[2025-06-05 22:59:01] [INFO ] State equation strengthened by 517 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:10] [INFO ] Deduced a trap composed of 9 places in 360 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:10] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:10] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:11] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:11] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:11] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:11] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:11] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:12] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:12] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:12] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:12] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:12] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:12] [INFO ] Deduced a trap composed of 9 places in 324 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:13] [INFO ] Deduced a trap composed of 9 places in 305 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:13] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:13] [INFO ] Deduced a trap composed of 9 places in 350 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:14] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:14] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:14] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:15] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:15] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:16] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:16] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:16] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:16] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:17] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:17] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:17] [INFO ] Deduced a trap composed of 11 places in 277 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:17] [INFO ] Deduced a trap composed of 11 places in 274 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:18] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:18] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:18] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:18] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:18] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:18] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:19] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:19] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:19] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:19] [INFO ] Deduced a trap composed of 12 places in 314 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:22] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:22] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:22] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:22] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:22] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:23] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:23] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:23] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:23] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:23] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:23] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:24] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:24] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:24] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:24] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:24] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:25] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:25] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:25] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:25] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:26] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:26] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:26] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:27] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:27] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:27] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:27] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:27] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:27] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:28] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:28] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:28] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:31] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:31] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:32] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 3 ms to minimize.
SMT process timed out in 31360ms, After SMT, problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 31369ms
Starting structural reductions in LTL mode, iteration 1 : 79/109 places, 617/658 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32207 ms. Remains : 79/109 places, 617/658 transitions.
[2025-06-05 22:59:32] [INFO ] Flatten gal took : 40 ms
[2025-06-05 22:59:32] [INFO ] Flatten gal took : 45 ms
[2025-06-05 22:59:32] [INFO ] Input system was already deterministic with 617 transitions.
[2025-06-05 22:59:32] [INFO ] Flatten gal took : 43 ms
[2025-06-05 22:59:32] [INFO ] Flatten gal took : 45 ms
[2025-06-05 22:59:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality17985619756358747266.gal : 10 ms
[2025-06-05 22:59:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality10494888930224326609.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/CTLCardinality17985619756358747266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10494888930224326609.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,454551,3.69659,65304,2,4838,5,91425,6,0,914,49572,0
Converting to forward existential form...Done !
original formula: (AF(((AX(A(EX(((p25==0)||(p106==1))) U EG((p13==1)))) * (!(A((p69==1) U (p34==1))) + (p22==0))) * !(E(EF(((p36==0)||(p28==1))) U (p57==0)...184
=> equivalent forward existential formula: ([FwdG(Init,!(((!(EX(!(!((E(!(EG((p13==1))) U (!(EX(((p25==0)||(p106==1)))) * !(EG((p13==1))))) + EG(!(EG((p13==...361
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t22, t24, t26, t27, t30, t31, t32, t33...405
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,15.095,232004,1,0,747,367536,1257,114,23404,255911,1271
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 90 transition count 633
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 90 transition count 633
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 77 transition count 614
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 77 transition count 614
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 71 transition count 608
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 71 transition count 608
Applied a total of 76 rules in 9 ms. Remains 71 /109 variables (removed 38) and now considering 608/658 (removed 50) transitions.
[2025-06-05 22:59:47] [INFO ] Flow matrix only has 598 transitions (discarded 10 similar events)
// Phase 1: matrix 598 rows 71 cols
[2025-06-05 22:59:47] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:59:48] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-05 22:59:48] [INFO ] Flow matrix only has 598 transitions (discarded 10 similar events)
[2025-06-05 22:59:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 22:59:48] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 22:59:48] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
Running 607 sub problems to find dead transitions.
[2025-06-05 22:59:48] [INFO ] Flow matrix only has 598 transitions (discarded 10 similar events)
[2025-06-05 22:59:48] [INFO ] Invariant cache hit.
[2025-06-05 22:59:48] [INFO ] State equation strengthened by 517 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:56] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:57] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:57] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:57] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:57] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:58] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:58] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:58] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:59] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:59] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:59] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 22:59:59] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:00] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:00] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:00] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:00] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:00] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:00] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:00] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:00] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:01] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:01] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:02] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:02] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:02] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:02] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:02] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:03] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:03] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:03] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:04] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:04] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:04] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:05] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:05] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:05] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:06] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:06] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:06] [INFO ] Deduced a trap composed of 9 places in 273 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:06] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:09] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:09] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:10] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:10] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:10] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:10] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:10] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:10] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:10] [INFO ] Deduced a trap composed of 10 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-05 23:00:11] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:11] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:11] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:11] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:11] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:12] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:12] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:12] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:12] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:12] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:12] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:13] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:13] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:13] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:14] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:14] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:14] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:14] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:14] [INFO ] Deduced a trap composed of 10 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-05 23:00:15] [INFO ] Deduced a trap composed of 12 places in 373 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:15] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:15] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:18] [INFO ] Deduced a trap composed of 15 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-05 23:00:18] [INFO ] Deduced a trap composed of 10 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-05 23:00:18] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:19] [INFO ] Deduced a trap composed of 9 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-05 23:00:19] [INFO ] Deduced a trap composed of 9 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-05 23:00:19] [INFO ] Deduced a trap composed of 10 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-05 23:00:20] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 7 ms to minimize.
SMT process timed out in 31391ms, After SMT, problems are : Problem set: 0 solved, 607 unsolved
Search for dead transitions found 0 dead transitions in 31395ms
Starting structural reductions in LTL mode, iteration 1 : 71/109 places, 608/658 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32147 ms. Remains : 71/109 places, 608/658 transitions.
[2025-06-05 23:00:20] [INFO ] Flatten gal took : 38 ms
[2025-06-05 23:00:20] [INFO ] Flatten gal took : 45 ms
[2025-06-05 23:00:20] [INFO ] Input system was already deterministic with 608 transitions.
[2025-06-05 23:00:20] [INFO ] Flatten gal took : 43 ms
[2025-06-05 23:00:20] [INFO ] Flatten gal took : 43 ms
[2025-06-05 23:00:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality4084455166921416247.gal : 10 ms
[2025-06-05 23:00:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6909494510288533763.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/CTLCardinality4084455166921416247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6909494510288533763.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,446356,3.97211,73968,2,5149,5,81871,6,0,882,51437,0
Converting to forward existential form...Done !
original formula: (!(E(EX(((p43==0)||(p55==1))) U (p46==1))) * AG(((p11==0)||(p44==1))))
=> equivalent forward existential formula: ([(FwdU(Init,EX(((p43==0)||(p55==1)))) * (p46==1))] = FALSE * [(FwdU(Init,TRUE) * !(((p11==0)||(p44==1))))] = FA...159
(forward)formula 0,0,3.9775,73968,1,0,7,81871,9,2,893,51437,1
FORMULA StigmergyElection-PT-08a-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 108 transition count 627
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 78 transition count 627
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 60 place count 78 transition count 613
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 88 place count 64 transition count 613
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 52 transition count 595
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 52 transition count 595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 52 transition count 594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 113 place count 52 transition count 593
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 51 transition count 593
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 121 place count 45 transition count 581
Iterating global reduction 3 with 6 rules applied. Total rules applied 127 place count 45 transition count 581
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 3 with 126 rules applied. Total rules applied 253 place count 45 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 368 transitions
Redundant transition composition rules discarded 368 transitions
Iterating global reduction 4 with 368 rules applied. Total rules applied 621 place count 45 transition count 87
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 637 place count 37 transition count 79
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 645 place count 29 transition count 71
Applied a total of 645 rules in 67 ms. Remains 29 /109 variables (removed 80) and now considering 71/658 (removed 587) transitions.
[2025-06-05 23:00:24] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 29 cols
[2025-06-05 23:00:24] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:00:24] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-05 23:00:24] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2025-06-05 23:00:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:00:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 23:00:24] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 23:00:24] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2025-06-05 23:00:24] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2025-06-05 23:00:24] [INFO ] Invariant cache hit.
[2025-06-05 23:00:24] [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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:24] [INFO ] Deduced a trap composed of 3 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-05 23:00:24] [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-05 23:00:24] [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-05 23:00:24] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:25] [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-05 23:00:25] [INFO ] Deduced a trap composed of 3 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-05 23:00:25] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:25] [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-05 23:00:25] [INFO ] Deduced a trap composed of 5 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-05 23:00:25] [INFO ] Deduced a trap composed of 3 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-05 23:00:25] [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-05 23:00:25] [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-05 23:00:25] [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-05 23:00:25] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:25] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:25] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:25] [INFO ] Deduced a trap composed of 5 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-05 23:00:25] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:25] [INFO ] Deduced a trap composed of 3 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-05 23:00:25] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:25] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:25] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:26] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:26] [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-05 23:00:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:26] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:26] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:26] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:26] [INFO ] Deduced a trap composed of 3 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-05 23:00:26] [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-05 23:00:26] [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-05 23:00:26] [INFO ] Deduced a trap composed of 3 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-05 23:00:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 61/90 variables, 29/63 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:27] [INFO ] Deduced a trap composed of 3 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-05 23:00:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:27] [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-05 23:00:27] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:27] [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-05 23:00:27] [INFO ] Deduced a trap composed of 3 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-05 23:00:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:27] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:27] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:27] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:27] [INFO ] Deduced a trap composed of 3 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-05 23:00:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:27] [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-05 23:00:27] [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-05 23:00:27] [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-05 23:00:27] [INFO ] Deduced a trap composed of 3 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-05 23:00:27] [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-05 23:00:27] [INFO ] Deduced a trap composed of 5 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-05 23:00:27] [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-05 23:00:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:28] [INFO ] Deduced a trap composed of 3 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-05 23:00:28] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:28] [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-05 23:00:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 1/91 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 0/91 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 88 constraints, problems are : Problem set: 0 solved, 39 unsolved in 5479 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:30] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 61/90 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 39/127 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 128 constraints, problems are : Problem set: 0 solved, 39 unsolved in 4181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9677ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 9677ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/109 places, 71/658 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9874 ms. Remains : 29/109 places, 71/658 transitions.
[2025-06-05 23:00:34] [INFO ] Flatten gal took : 5 ms
[2025-06-05 23:00:34] [INFO ] Flatten gal took : 5 ms
[2025-06-05 23:00:34] [INFO ] Input system was already deterministic with 71 transitions.
[2025-06-05 23:00:34] [INFO ] Flatten gal took : 5 ms
[2025-06-05 23:00:34] [INFO ] Flatten gal took : 5 ms
[2025-06-05 23:00:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality5796214826659225992.gal : 7 ms
[2025-06-05 23:00:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4854795882054473272.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/CTLCardinality5796214826659225992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4854795882054473272.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,530,0.048838,4704,2,170,5,1804,6,0,178,1066,0
Converting to forward existential form...Done !
original formula: EG(!(A(AF((p93==1)) U (p47==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((p47==1)) U (!(!(EG(!((p93==1))))) * !((p47==1)))) + EG(!((p47==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t21...280
(forward)formula 0,1,0.176705,5856,1,0,146,7572,165,68,2286,7788,183
FORMULA StigmergyElection-PT-08a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 94 transition count 639
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 94 transition count 639
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 85 transition count 626
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 85 transition count 626
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 82 transition count 623
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 82 transition count 623
Applied a total of 54 rules in 14 ms. Remains 82 /109 variables (removed 27) and now considering 623/658 (removed 35) transitions.
[2025-06-05 23:00:34] [INFO ] Flow matrix only has 610 transitions (discarded 13 similar events)
// Phase 1: matrix 610 rows 82 cols
[2025-06-05 23:00:34] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:00:34] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-05 23:00:34] [INFO ] Flow matrix only has 610 transitions (discarded 13 similar events)
[2025-06-05 23:00:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:00:34] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 23:00:35] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Running 622 sub problems to find dead transitions.
[2025-06-05 23:00:35] [INFO ] Flow matrix only has 610 transitions (discarded 13 similar events)
[2025-06-05 23:00:35] [INFO ] Invariant cache hit.
[2025-06-05 23:00:35] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:44] [INFO ] Deduced a trap composed of 9 places in 375 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:44] [INFO ] Deduced a trap composed of 9 places in 365 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:45] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:45] [INFO ] Deduced a trap composed of 12 places in 330 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:45] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:46] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:46] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:46] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:47] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:47] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:47] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:47] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:48] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:48] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:48] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:48] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:48] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:49] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:49] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:49] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:50] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:50] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:50] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:51] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:51] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:51] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:51] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:51] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:51] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:51] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:52] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:52] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:52] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:52] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:52] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:53] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:53] [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-05 23:00:53] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:53] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:53] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:57] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:57] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:57] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:58] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:58] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:58] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:58] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:58] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:58] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:59] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:59] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:59] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:00:59] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:00] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:00] [INFO ] Deduced a trap composed of 12 places in 342 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:00] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:01] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:01] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:01] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:01] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:02] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:02] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:02] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:02] [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-05 23:01:02] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:03] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:03] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:03] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:03] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:04] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:04] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:04] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:04] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:05] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:05] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:05] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:05] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:05] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:05] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 4 ms to minimize.
(s23 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82/692 variables, and 81 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/82 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 622/103 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:12] [INFO ] Deduced a trap composed of 10 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-05 23:01:12] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:12] [INFO ] Deduced a trap composed of 10 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-05 23:01:12] [INFO ] Deduced a trap composed of 9 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-05 23:01:12] [INFO ] Deduced a trap composed of 10 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-05 23:01:12] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:12] [INFO ] Deduced a trap composed of 14 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-05 23:01:12] [INFO ] Deduced a trap composed of 12 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-05 23:01:12] [INFO ] Deduced a trap composed of 9 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-05 23:01:13] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:13] [INFO ] Deduced a trap composed of 12 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-05 23:01:13] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:13] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:13] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:13] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:13] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:14] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:15] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:15] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:15] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:18] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:18] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:19] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:19] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:01:32] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 82/692 variables, and 106 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/82 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/103 constraints, Known Traps: 104/104 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61451ms problems are : Problem set: 0 solved, 622 unsolved
Search for dead transitions found 0 dead transitions in 61455ms
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 623/658 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62181 ms. Remains : 82/109 places, 623/658 transitions.
[2025-06-05 23:01:36] [INFO ] Flatten gal took : 34 ms
[2025-06-05 23:01:36] [INFO ] Flatten gal took : 38 ms
[2025-06-05 23:01:36] [INFO ] Input system was already deterministic with 623 transitions.
[2025-06-05 23:01:36] [INFO ] Flatten gal took : 43 ms
[2025-06-05 23:01:36] [INFO ] Flatten gal took : 44 ms
[2025-06-05 23:01:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality4155034940977333135.gal : 10 ms
[2025-06-05 23:01:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality3463377970416057661.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/CTLCardinality4155034940977333135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3463377970416057661.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,461975,3.61825,64440,2,5047,5,89809,6,0,936,48658,0
Converting to forward existential form...Done !
original formula: (EX(((p12==0) + A(EX(AX((p43==1))) U (!(((p78==0)||(p70==1))) + A(((p99==0)||(p56==1)) U (p51==1)))))) * EF((((p11==1)||(p37==1)) * EX(((...190
=> equivalent forward existential formula: [(EY((FwdU((Init * EX(((p12==0) + !((E(!((!(((p78==0)||(p70==1))) + !((E(!((p51==1)) U (!(((p99==0)||(p56==1))) ...536
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t16, t17, t18, t19, t21, t22, t24, t25, t27, t29, t30, t32,...419
Detected timeout of ITS tools.
[2025-06-05 23:02:06] [INFO ] Flatten gal took : 27 ms
[2025-06-05 23:02:06] [INFO ] Applying decomposition
[2025-06-05 23:02:07] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7453529100794418159.txt' '-o' '/tmp/graph7453529100794418159.bin' '-w' '/tmp/graph7453529100794418159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7453529100794418159.bin' '-l' '-1' '-v' '-w' '/tmp/graph7453529100794418159.weights' '-q' '0' '-e' '0.001'
[2025-06-05 23:02:07] [INFO ] Decomposing Gal with order
[2025-06-05 23:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 23:02:07] [INFO ] Removed a total of 3604 redundant transitions.
[2025-06-05 23:02:07] [INFO ] Flatten gal took : 388 ms
[2025-06-05 23:02:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 112 ms.
[2025-06-05 23:02:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality4747763360229330217.gal : 19 ms
[2025-06-05 23:02:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality16175667512906477021.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/CTLCardinality4747763360229330217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16175667512906477021.ctl'
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 -...263
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,461975,0.218923,7456,487,154,4960,632,926,8336,97,1769,0
Converting to forward existential form...Done !
original formula: (EX(((i6.i1.u0.p12==0) + A(EX(AX((i0.u10.p43==1))) U (!(((i5.u20.p78==0)||(i3.u17.p70==1))) + A(((i1.u24.p99==0)||(i0.u13.p56==1)) U (i3....276
=> equivalent forward existential formula: [(EY((FwdU((Init * EX(((i6.i1.u0.p12==0) + !((E(!((!(((i5.u20.p78==0)||(i3.u17.p70==1))) + !((E(!((i3.u12.p51==1...734
Reverse transition relation is NOT exact ! Due to transitions t604, t607, t609, t611, t614, t617, t619, t621, i0.t65, i0.t32, i0.t30, i0.u3.t56, i1.t43, i1...545
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,0.86561,24864,1,0,31186,1754,9353,107372,486,6206,78339
FORMULA StigmergyElection-PT-08a-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 658/658 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 108 transition count 625
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 76 transition count 625
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 64 place count 76 transition count 611
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 92 place count 62 transition count 611
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 103 place count 51 transition count 594
Iterating global reduction 2 with 11 rules applied. Total rules applied 114 place count 51 transition count 594
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 120 place count 45 transition count 582
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 45 transition count 582
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 189 place count 45 transition count 519
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 3 with 2 rules applied. Total rules applied 191 place count 44 transition count 518
Drop transitions (Redundant composition of simpler transitions.) removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 3 with 416 rules applied. Total rules applied 607 place count 44 transition count 102
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 623 place count 36 transition count 94
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 631 place count 28 transition count 86
Applied a total of 631 rules in 74 ms. Remains 28 /109 variables (removed 81) and now considering 86/658 (removed 572) transitions.
[2025-06-05 23:02:08] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
// Phase 1: matrix 77 rows 28 cols
[2025-06-05 23:02:08] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:02:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-05 23:02:09] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
[2025-06-05 23:02:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:02:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 23:02:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 23:02:09] [INFO ] Redundant transitions in 2 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-05 23:02:09] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
[2025-06-05 23:02:09] [INFO ] Invariant cache hit.
[2025-06-05 23:02:09] [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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 8/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:09] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:09] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:09] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:09] [INFO ] Deduced a trap composed of 3 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-05 23:02:09] [INFO ] Deduced a trap composed of 3 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-05 23:02:09] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:09] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:09] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:09] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:09] [INFO ] Deduced a trap composed of 3 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-05 23:02:10] [INFO ] Deduced a trap composed of 3 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-05 23:02:10] [INFO ] Deduced a trap composed of 3 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-05 23:02:10] [INFO ] Deduced a trap composed of 3 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-05 23:02:10] [INFO ] Deduced a trap composed of 3 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-05 23:02:10] [INFO ] Deduced a trap composed of 3 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-05 23:02:10] [INFO ] Deduced a trap composed of 4 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-05 23:02:10] [INFO ] Deduced a trap composed of 5 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-05 23:02:10] [INFO ] Deduced a trap composed of 5 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-05 23:02:10] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:10] [INFO ] Deduced a trap composed of 3 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-05 23:02:10] [INFO ] Deduced a trap composed of 4 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-05 23:02:10] [INFO ] Deduced a trap composed of 3 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-05 23:02:10] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:11] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:11] [INFO ] Deduced a trap composed of 3 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-05 23:02:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:11] [INFO ] Deduced a trap composed of 3 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-05 23:02:11] [INFO ] Deduced a trap composed of 3 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-05 23:02:11] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:11] [INFO ] Deduced a trap composed of 3 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-05 23:02:11] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 76/104 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:11] [INFO ] Deduced a trap composed of 3 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-05 23:02:11] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:11] [INFO ] Deduced a trap composed of 3 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-05 23:02:12] [INFO ] Deduced a trap composed of 3 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-05 23:02:12] [INFO ] Deduced a trap composed of 3 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-05 23:02:12] [INFO ] Deduced a trap composed of 3 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-05 23:02: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-05 23:02:12] [INFO ] Deduced a trap composed of 3 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-05 23:02:12] [INFO ] Deduced a trap composed of 3 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-05 23:02:12] [INFO ] Deduced a trap composed of 3 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-05 23:02:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:12] [INFO ] Deduced a trap composed of 3 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-05 23:02:12] [INFO ] Deduced a trap composed of 4 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-05 23:02:12] [INFO ] Deduced a trap composed of 4 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-05 23:02:12] [INFO ] Deduced a trap composed of 3 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-05 23:02:12] [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-05 23:02:12] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:12] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:12] [INFO ] Deduced a trap composed of 5 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-05 23:02:12] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:13] [INFO ] Deduced a trap composed of 4 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-05 23:02:13] [INFO ] Deduced a trap composed of 4 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-05 23:02:13] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:13] [INFO ] Deduced a trap composed of 5 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-05 23:02:13] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/105 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/105 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 87 constraints, problems are : Problem set: 0 solved, 38 unsolved in 6304 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 8/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:02:15] [INFO ] Deduced a trap composed of 5 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-05 23:02:15] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 76/104 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/105 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 127 constraints, problems are : Problem set: 0 solved, 38 unsolved in 4492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10819ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 10820ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/109 places, 86/658 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11027 ms. Remains : 28/109 places, 86/658 transitions.
[2025-06-05 23:02:19] [INFO ] Flatten gal took : 7 ms
[2025-06-05 23:02:19] [INFO ] Flatten gal took : 6 ms
[2025-06-05 23:02:19] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-05 23:02:19] [INFO ] Flatten gal took : 7 ms
[2025-06-05 23:02:19] [INFO ] Flatten gal took : 6 ms
[2025-06-05 23:02:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality314990342779321960.gal : 2 ms
[2025-06-05 23:02:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality11481368025289219185.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/CTLCardinality314990342779321960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11481368025289219185.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,720,0.084527,5224,2,317,5,2645,6,0,189,2180,0
Converting to forward existential form...Done !
original formula: EG(AG(((p91==0)||(p19==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((p91==0)||(p19==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...285
(forward)formula 0,0,0.333494,8040,1,0,165,12980,190,59,3016,12013,212
FORMULA StigmergyElection-PT-08a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-05 23:02:20] [INFO ] Flatten gal took : 50 ms
[2025-06-05 23:02:20] [INFO ] Flatten gal took : 47 ms
Total runtime 704184 ms.
BK_STOP 1749164540508
--------------------
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="StigmergyElection-PT-08a"
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 StigmergyElection-PT-08a, 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-174903491000257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08a.tgz
mv StigmergyElection-PT-08a 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 ;