About the Execution of ITS-Tools for SafeBus-COL-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 442038.00 | 0.00 | 0.00 | 1 1 5 1 1 5 6 1 6 1 1 6 1 6 1 5 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264700717.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 SafeBus-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264700717
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SafeBus-COL-06-UpperBounds-00
FORMULA_NAME SafeBus-COL-06-UpperBounds-01
FORMULA_NAME SafeBus-COL-06-UpperBounds-02
FORMULA_NAME SafeBus-COL-06-UpperBounds-03
FORMULA_NAME SafeBus-COL-06-UpperBounds-04
FORMULA_NAME SafeBus-COL-06-UpperBounds-05
FORMULA_NAME SafeBus-COL-06-UpperBounds-06
FORMULA_NAME SafeBus-COL-06-UpperBounds-07
FORMULA_NAME SafeBus-COL-06-UpperBounds-08
FORMULA_NAME SafeBus-COL-06-UpperBounds-09
FORMULA_NAME SafeBus-COL-06-UpperBounds-10
FORMULA_NAME SafeBus-COL-06-UpperBounds-11
FORMULA_NAME SafeBus-COL-06-UpperBounds-12
FORMULA_NAME SafeBus-COL-06-UpperBounds-13
FORMULA_NAME SafeBus-COL-06-UpperBounds-14
FORMULA_NAME SafeBus-COL-06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749153370059
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-05 19:56:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 19:56:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 19:56:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-05 19:56:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 19:56:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 541 ms
[2025-06-05 19:56:11] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2025-06-05 19:56:11] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2025-06-05 19:56:11] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2025-06-05 19:56:11] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2025-06-05 19:56:12] [INFO ] Computed 7 invariants in 8 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 6, 0, 1, 6, 1, 0, 1, 0] Max Struct:[1, 1, 6, 1, 1, 6, 6, 5, 6, 1, 1, 6, 1, 6, 1, 6]
FORMULA SafeBus-COL-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-05 19:56:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-06-05 19:56:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 19:56:12] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-05 19:56:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-05 19:56:12] [INFO ] Added : 12 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 8 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Added 3 Read/Feed constraints in 7 ms returned sat
[2025-06-05 19:56:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-05 19:56:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-05 19:56:12] [INFO ] Added : 6 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 10 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:56:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:56:12] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-05 19:56:12] [INFO ] Added : 8 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:56:12] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:56:12] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-05 19:56:12] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-05 19:56:12] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:12] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:56:13] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:56:13] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-05 19:56:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-05 19:56:13] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-05 19:56:13] [INFO ] Added : 8 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 1, 1, 6, 6, 5, 1, 6, 6]
Domain [It(6), It(6)] of place AMC breaks symmetries in sort It
[2025-06-05 19:56:13] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 34 ms.
[2025-06-05 19:56:13] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 1, 1, 6, 6, 5, 1, 6, 6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 1, 1, 6, 6, 5, 1, 6, 6]
[2025-06-05 19:56:13] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2025-06-05 19:56:13] [INFO ] Computed 29 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 1, 1, 6, 6, 5, 1, 6, 6]
RANDOM walk for 10000 steps (2 resets) in 73 ms. (135 steps per ms)
FORMULA SafeBus-COL-06-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 1, 5] Max Struct:[6, 6, 5, 6]
[2025-06-05 19:56:13] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-05 19:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 6 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-05 19:56:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 5 ms returned sat
[2025-06-05 19:56:13] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-05 19:56:13] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:56:13] [INFO ] [Nat]Added 43 Read/Feed constraints in 62 ms returned sat
[2025-06-05 19:56:13] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 27 ms.
[2025-06-05 19:56:13] [INFO ] Added : 1 causal constraints over 1 iterations in 67 ms. Result :sat
Minimization took 98 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:14] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-05 19:56:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 99 ms returned sat
[2025-06-05 19:56:14] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 20 ms.
[2025-06-05 19:56:14] [INFO ] Added : 1 causal constraints over 1 iterations in 74 ms. Result :sat
Minimization took 98 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:14] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 3 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:14] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Real]Added 43 Read/Feed constraints in 10 ms returned sat
[2025-06-05 19:56:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:56:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 3 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-05 19:56:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 44 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:14] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 10 ms to minimize.
[2025-06-05 19:56:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 124 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 1, 5] Max Struct:[6, 6, 1, 5]
FORMULA SafeBus-COL-06-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 53 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 138/138 places, 451/451 transitions.
[2025-06-05 19:56:15] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-05 19:56:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2474 ms. (404 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1743 ms. (1146 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2025-06-05 19:56:19] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-05 19:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:56:19] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:19] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2025-06-05 19:56:19] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-05 19:56:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:56:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:19] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2025-06-05 19:56:19] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-06-05 19:56:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:56:19] [INFO ] [Nat]Added 43 Read/Feed constraints in 61 ms returned sat
[2025-06-05 19:56:19] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 21 ms.
[2025-06-05 19:56:19] [INFO ] Added : 1 causal constraints over 1 iterations in 58 ms. Result :sat
Minimization took 95 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:56:19] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:19] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2025-06-05 19:56:19] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-06-05 19:56:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:56:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:20] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2025-06-05 19:56:20] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-05 19:56:20] [INFO ] [Nat]Added 43 Read/Feed constraints in 94 ms returned sat
[2025-06-05 19:56:20] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 22 ms.
[2025-06-05 19:56:20] [INFO ] Added : 1 causal constraints over 1 iterations in 61 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 19 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 23 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2025-06-05 19:56:20] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2025-06-05 19:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:56:20] [INFO ] Implicit Places using invariants in 168 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 173 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 132/138 places, 451/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 565
Applied a total of 12 rules in 71 ms. Remains 126 /132 variables (removed 6) and now considering 565/451 (removed -114) transitions.
[2025-06-05 19:56:20] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2025-06-05 19:56:20] [INFO ] Computed 23 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:56:20] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-05 19:56:20] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-05 19:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:56:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:56:21] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/138 places, 565/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 932 ms. Remains : 126/138 places, 565/451 transitions.
[2025-06-05 19:56:21] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-05 19:56:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 3150 ms. (317 steps per ms)
BEST_FIRST walk for 2000000 steps (4 resets) in 2072 ms. (964 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2025-06-05 19:56:26] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-05 19:56:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:56:26] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:26] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 4 ms returned sat
[2025-06-05 19:56:26] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-05 19:56:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:56:26] [INFO ] [Real]Added 43 Read/Feed constraints in 15 ms returned sat
[2025-06-05 19:56:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:56:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-05 19:56:26] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 4 ms returned sat
[2025-06-05 19:56:26] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-06-05 19:56:26] [INFO ] [Nat]Added 43 Read/Feed constraints in 92 ms returned sat
[2025-06-05 19:56:27] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 49 ms.
[2025-06-05 19:56:27] [INFO ] Added : 6 causal constraints over 2 iterations in 109 ms. Result :sat
Minimization took 212 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:56:27] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:27] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:56:27] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-05 19:56:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:56:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:56:27] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 2 ms returned sat
[2025-06-05 19:56:27] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-05 19:56:27] [INFO ] [Nat]Added 43 Read/Feed constraints in 78 ms returned sat
[2025-06-05 19:56:27] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 45 ms.
[2025-06-05 19:56:27] [INFO ] Added : 1 causal constraints over 1 iterations in 85 ms. Result :sat
Minimization took 193 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 58 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 126/126 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 34 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2025-06-05 19:56:28] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-05 19:56:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:56:28] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-05 19:56:28] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-05 19:56:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:56:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:56:28] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:56:28] [INFO ] Redundant transitions in 36 ms returned []
Running 559 sub problems to find dead transitions.
[2025-06-05 19:56:28] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2025-06-05 19:56:28] [INFO ] Invariant cache hit.
[2025-06-05 19:56:28] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 6 solved, 553 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:31] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:32] [INFO ] Deduced a trap composed of 13 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 19:56:32] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:32] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:32] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:32] [INFO ] Deduced a trap composed of 19 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 19:56:33] [INFO ] Deduced a trap composed of 19 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 19:56:33] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:33] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:33] [INFO ] Deduced a trap composed of 19 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 19:56:33] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:33] [INFO ] Deduced a trap composed of 19 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 19:56:34] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:34] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:34] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:34] [INFO ] Deduced a trap composed of 19 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 19:56:34] [INFO ] Deduced a trap composed of 19 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 19:56:34] [INFO ] Deduced a trap composed of 19 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 19:56:34] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 19/42 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:36] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/43 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:39] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:39] [INFO ] Deduced a trap composed of 37 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 19:56:40] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:40] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:40] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:40] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 6/49 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/175 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/218 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:56:50] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/219 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 523 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 27/50 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/50 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 356/482 variables, 126/176 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 43/219 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 523/742 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 742 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/559 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60976ms problems are : Problem set: 36 solved, 523 unsolved
Search for dead transitions found 36 dead transitions in 60989ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 529/565 transitions.
Applied a total of 0 rules in 27 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:57:29] [INFO ] Redundant transitions in 10 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61780 ms. Remains : 126/126 places, 529/565 transitions.
[2025-06-05 19:57:29] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:57:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2994 ms. (333 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1961 ms. (1019 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2025-06-05 19:57:34] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:57:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:57:34] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:57:34] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:57:34] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-05 19:57:34] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:57:35] [INFO ] [Real]Added 43 Read/Feed constraints in 15 ms returned sat
[2025-06-05 19:57:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:57:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:57:35] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:57:35] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-05 19:57:35] [INFO ] [Nat]Added 43 Read/Feed constraints in 71 ms returned sat
[2025-06-05 19:57:35] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 27 ms.
[2025-06-05 19:57:35] [INFO ] Added : 7 causal constraints over 2 iterations in 98 ms. Result :sat
Minimization took 234 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:57:35] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:57:35] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:57:35] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-05 19:57:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:57:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:57:35] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:57:35] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-06-05 19:57:35] [INFO ] [Nat]Added 43 Read/Feed constraints in 63 ms returned sat
[2025-06-05 19:57:35] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 39 ms.
[2025-06-05 19:57:35] [INFO ] Added : 1 causal constraints over 1 iterations in 79 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2025-06-05 19:57:36] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:57:36] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-05 19:57:36] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:57:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:57:36] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:57:37] [INFO ] Redundant transitions in 7 ms returned []
Running 523 sub problems to find dead transitions.
[2025-06-05 19:57:37] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:57:37] [INFO ] Invariant cache hit.
[2025-06-05 19:57:37] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:39] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:40] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:40] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:40] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:40] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:40] [INFO ] Deduced a trap composed of 19 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 19:57:40] [INFO ] Deduced a trap composed of 19 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 19:57:40] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:40] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:41] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:41] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:41] [INFO ] Deduced a trap composed of 19 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 19:57:41] [INFO ] Deduced a trap composed of 37 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 19:57:41] [INFO ] Deduced a trap composed of 37 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 19:57:41] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:41] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:42] [INFO ] Deduced a trap composed of 37 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 19:57:42] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 356/482 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 43/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:50] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:57:50] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 212 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 356/482 variables, 126/169 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 43/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 523/735 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 735 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60686ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61436 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 997 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 376 ms. (106 steps per ms) remains 4/4 properties
[2025-06-05 19:58:38] [INFO ] Flatten gal took : 320 ms
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
[2025-06-05 19:58:38] [INFO ] Flatten gal took : 147 ms
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
[2025-06-05 19:58:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10039929246548068083.gal : 32 ms
[2025-06-05 19:58:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2456920969408200285.prop : 4 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/ReachabilityCardinality10039929246548068083.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2456920969408200285.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2456920969408200285.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 26
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :26 after 41
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :41 after 102
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :102 after 516
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :516 after 648
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :648 after 1211
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1211 after 3142
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3142 after 9876
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :9876 after 79309
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :79309 after 88894
Interrupted probabilistic random walk after 427379 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 4
Probabilistic random walk after 427379 steps, saw 189900 distinct states, run finished after 3004 ms. (steps per millisecond=142 ) properties seen :0
[2025-06-05 19:58:41] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:58:41] [INFO ] Invariant cache hit.
[2025-06-05 19:58:41] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:42] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:42] [INFO ] Deduced a trap composed of 19 places in 254 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:42] [INFO ] Deduced a trap composed of 19 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 19:58:42] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:42] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :88894 after 111441
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 197 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 4/197 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/197 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/482 variables, 2/199 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/200 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/201 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/201 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/482 variables, 0/201 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 201 constraints, problems are : Problem set: 2 solved, 2 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2400ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :111441 after 213605
Interrupted probabilistic random walk after 502843 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 2
Probabilistic random walk after 502843 steps, saw 221311 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2025-06-05 19:58:47] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:58:47] [INFO ] Invariant cache hit.
[2025-06-05 19:58:47] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:47] [INFO ] Deduced a trap composed of 19 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 19:58:47] [INFO ] Deduced a trap composed of 19 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 19:58:47] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 195 constraints, problems are : Problem set: 0 solved, 2 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/482 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 197 constraints, problems are : Problem set: 0 solved, 2 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 855ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 24 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 26 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2025-06-05 19:58:48] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:58:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:58:48] [INFO ] Implicit Places using invariants in 271 ms returned []
[2025-06-05 19:58:48] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:58:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:58:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:58:48] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:58:48] [INFO ] Redundant transitions in 3 ms returned []
Running 523 sub problems to find dead transitions.
[2025-06-05 19:58:48] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:58:48] [INFO ] Invariant cache hit.
[2025-06-05 19:58:48] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:51] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:52] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:52] [INFO ] Deduced a trap composed of 13 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 19:58:52] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:52] [INFO ] Deduced a trap composed of 19 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 19:58:52] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:52] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:52] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:53] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:53] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:53] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:53] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 131072
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :213605 after 545555
[2025-06-05 19:58:53] [INFO ] Deduced a trap composed of 37 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 19:58:53] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:53] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:54] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:54] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:58:54] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 356/482 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 43/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:59:02] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:59:02] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :545555 after 1.34543e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 212 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 356/482 variables, 126/169 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 43/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Detected timeout of ITS tools.
[2025-06-05 19:59:28] [INFO ] Flatten gal took : 65 ms
[2025-06-05 19:59:28] [INFO ] Applying decomposition
[2025-06-05 19:59:28] [INFO ] Flatten gal took : 47 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/graph16339714383748901305.txt' '-o' '/tmp/graph16339714383748901305.bin' '-w' '/tmp/graph16339714383748901305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16339714383748901305.bin' '-l' '-1' '-v' '-w' '/tmp/graph16339714383748901305.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:59:28] [INFO ] Decomposing Gal with order
[2025-06-05 19:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:59:29] [INFO ] Removed a total of 11 redundant transitions.
[2025-06-05 19:59:29] [INFO ] Flatten gal took : 63 ms
[2025-06-05 19:59:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2025-06-05 19:59:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17183632565229341045.gal : 7 ms
[2025-06-05 19:59:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14330164623370182678.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17183632565229341045.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14330164623370182678.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14330164623370182678.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 25
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25 after 77
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :77 after 672
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :672 after 1044
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1044 after 1665
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1665 after 2848
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2848 after 17257
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 523/735 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :100573 after 109903
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :405407 after 429499
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 735 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60705ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60712ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61556 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 203 place count 96 transition count 296
Iterating global reduction 1 with 30 rules applied. Total rules applied 233 place count 96 transition count 296
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 94 transition count 295
Graph (trivial) has 19 edges and 94 vertex of which 8 / 94 are part of one of the 1 SCC in 1 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 237 place count 87 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 400 place count 87 transition count 132
Applied a total of 400 rules in 39 ms. Remains 87 /126 variables (removed 39) and now considering 132/529 (removed 397) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 87 cols
[2025-06-05 19:59:49] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 19:59:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-05 19:59:49] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:59:49] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 19:59:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-05 19:59:49] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:59:49] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-05 19:59:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-05 19:59:49] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-05 19:59:49] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-05 19:59:49] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-05 19:59:49] [INFO ] Flatten gal took : 16 ms
[2025-06-05 19:59:49] [INFO ] Flatten gal took : 19 ms
[2025-06-05 19:59:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3626332935275429469.gal : 1 ms
[2025-06-05 19:59:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11480675151628351726.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/ReachabilityCardinality3626332935275429469.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11480675151628351726.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11480675151628351726.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 42
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :42 after 102
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :102 after 203
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :203 after 449
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :449 after 966
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :966 after 3140
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3140 after 16033
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :16033 after 24404
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :24404 after 42969
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,163980,2.9526,106188,2,53323,19,362671,6,0,483,219617,0
Total reachable state count : 163980
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,2.96783,106188,2,88,19,362671,7,0,513,219617,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,2.98358,106188,2,88,19,362671,8,0,542,219617,0
Over-approximation ignoring read arcs solved 0 properties in 3326 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA SafeBus-COL-06-UpperBounds-05 5 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[5] Max Struct:[6]
Starting property specific reduction for SafeBus-COL-06-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2025-06-05 19:59:53] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2025-06-05 19:59:53] [INFO ] Computed 23 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2025-06-05 19:59:53] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:59:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:59:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:59:53] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:59:53] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-05 19:59:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:59:53] [INFO ] [Real]Added 43 Read/Feed constraints in 23 ms returned sat
[2025-06-05 19:59:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:59:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:59:53] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:59:53] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-06-05 19:59:53] [INFO ] [Nat]Added 43 Read/Feed constraints in 68 ms returned sat
[2025-06-05 19:59:53] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 22 ms.
[2025-06-05 19:59:53] [INFO ] Added : 7 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 211 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 23 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 126/126 places, 529/529 transitions.
[2025-06-05 19:59:53] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:59:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 2843 ms. (351 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1059 ms. (943 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2025-06-05 19:59:57] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:59:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:59:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:59:57] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:59:57] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-05 19:59:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:59:57] [INFO ] [Real]Added 43 Read/Feed constraints in 18 ms returned sat
[2025-06-05 19:59:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:59:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-05 19:59:57] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 19:59:57] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2025-06-05 19:59:58] [INFO ] [Nat]Added 43 Read/Feed constraints in 69 ms returned sat
[2025-06-05 19:59:58] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 25 ms.
[2025-06-05 19:59:58] [INFO ] Added : 7 causal constraints over 2 iterations in 93 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 21 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 20 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2025-06-05 19:59:58] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:59:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:59:58] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-05 19:59:58] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:59:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:59:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-05 19:59:59] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:59:59] [INFO ] Redundant transitions in 5 ms returned []
Running 523 sub problems to find dead transitions.
[2025-06-05 19:59:59] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 19:59:59] [INFO ] Invariant cache hit.
[2025-06-05 19:59:59] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:01] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:02] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:02] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:02] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:02] [INFO ] Deduced a trap composed of 19 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 20:00:02] [INFO ] Deduced a trap composed of 19 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 20:00:02] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:02] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:03] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:03] [INFO ] Deduced a trap composed of 19 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 20:00:03] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:03] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:03] [INFO ] Deduced a trap composed of 37 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 20:00:03] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:04] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:04] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:04] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:04] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 356/482 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 43/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:12] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:00:12] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 212 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 356/482 variables, 126/169 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 43/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 523/735 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 735 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60637ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61333 ms. Remains : 126/126 places, 529/529 transitions.
[2025-06-05 20:00:59] [INFO ] Flatten gal took : 26 ms
[2025-06-05 20:00:59] [INFO ] Flatten gal took : 59 ms
[2025-06-05 20:00:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12152173344412879250.gal : 5 ms
[2025-06-05 20:00:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1577484756652933381.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/ReachabilityCardinality12152173344412879250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1577484756652933381.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality1577484756652933381.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 12
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 41
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :41 after 102
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :102 after 516
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :516 after 648
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :648 after 1211
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1211 after 3142
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3142 after 9876
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9876 after 79309
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :79309 after 88894
Interrupted probabilistic random walk after 544653 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 2
Probabilistic random walk after 544653 steps, saw 238732 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2025-06-05 20:01:03] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 20:01:03] [INFO ] Invariant cache hit.
[2025-06-05 20:01:03] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:03] [INFO ] Deduced a trap composed of 19 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 20:01:03] [INFO ] Deduced a trap composed of 19 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 20:01:03] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 195 constraints, problems are : Problem set: 0 solved, 2 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/482 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 197 constraints, problems are : Problem set: 0 solved, 2 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 862ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :88894 after 111441
Interrupted probabilistic random walk after 564422 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 2
Probabilistic random walk after 564422 steps, saw 246980 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
[2025-06-05 20:01:07] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 20:01:07] [INFO ] Invariant cache hit.
[2025-06-05 20:01:07] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:07] [INFO ] Deduced a trap composed of 19 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 20:01:07] [INFO ] Deduced a trap composed of 19 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 20:01:07] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 195 constraints, problems are : Problem set: 0 solved, 2 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/482 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 197 constraints, problems are : Problem set: 0 solved, 2 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 825ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 20 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2025-06-05 20:01:08] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 20:01:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:01:08] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-05 20:01:08] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 20:01:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:01:08] [INFO ] State equation strengthened by 43 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :111441 after 213605
[2025-06-05 20:01:08] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:01:08] [INFO ] Redundant transitions in 4 ms returned []
Running 523 sub problems to find dead transitions.
[2025-06-05 20:01:08] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2025-06-05 20:01:08] [INFO ] Invariant cache hit.
[2025-06-05 20:01:08] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:10] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:11] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:11] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:11] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:12] [INFO ] Deduced a trap composed of 19 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 20:01:12] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:12] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:12] [INFO ] Deduced a trap composed of 19 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 20:01:12] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:12] [INFO ] Deduced a trap composed of 19 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 20:01:12] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:13] [INFO ] Deduced a trap composed of 19 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 20:01:13] [INFO ] Deduced a trap composed of 37 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 20:01:13] [INFO ] Deduced a trap composed of 37 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 20:01:13] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:13] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:13] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:13] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :213605 after 545555
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 356/482 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 43/210 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:21] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:01:21] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 212 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :545555 after 1.34543e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 4 (OVERLAPS) 356/482 variables, 126/169 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 43/212 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Detected timeout of ITS tools.
[2025-06-05 20:01:50] [INFO ] Flatten gal took : 26 ms
[2025-06-05 20:01:50] [INFO ] Applying decomposition
[2025-06-05 20:01:50] [INFO ] Flatten gal took : 25 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/graph4474592652361805474.txt' '-o' '/tmp/graph4474592652361805474.bin' '-w' '/tmp/graph4474592652361805474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4474592652361805474.bin' '-l' '-1' '-v' '-w' '/tmp/graph4474592652361805474.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:01:50] [INFO ] Decomposing Gal with order
[2025-06-05 20:01:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:01:50] [INFO ] Removed a total of 77 redundant transitions.
[2025-06-05 20:01:50] [INFO ] Flatten gal took : 48 ms
[2025-06-05 20:01:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 3 ms.
[2025-06-05 20:01:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4299379245472593604.gal : 5 ms
[2025-06-05 20:01:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5790363836955190122.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/ReachabilityCardinality4299379245472593604.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5790363836955190122.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5790363836955190122.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :19 after 25
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :25 after 53
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :53 after 171
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :171 after 1299
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1299 after 2061
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2061 after 16347
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :16347 after 22639
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 523/735 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :100573 after 115604
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :405407 after 441069
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 735 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60800ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 60803ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61478 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 203 place count 96 transition count 296
Iterating global reduction 1 with 30 rules applied. Total rules applied 233 place count 96 transition count 296
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 94 transition count 295
Graph (trivial) has 19 edges and 94 vertex of which 8 / 94 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 237 place count 87 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 400 place count 87 transition count 132
Applied a total of 400 rules in 18 ms. Remains 87 /126 variables (removed 39) and now considering 132/529 (removed 397) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 87 cols
[2025-06-05 20:02:09] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 20:02:09] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-05 20:02:09] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2025-06-05 20:02:09] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 20:02:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-05 20:02:09] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 4 ms returned sat
[2025-06-05 20:02:09] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-05 20:02:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-05 20:02:09] [INFO ] After 11ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-05 20:02:09] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-05 20:02:09] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-05 20:02:09] [INFO ] Flatten gal took : 10 ms
[2025-06-05 20:02:09] [INFO ] Flatten gal took : 4 ms
[2025-06-05 20:02:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16274269658443281239.gal : 1 ms
[2025-06-05 20:02:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18113860986513848595.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/ReachabilityCardinality16274269658443281239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18113860986513848595.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality18113860986513848595.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 42
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :42 after 102
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :102 after 203
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :203 after 449
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :449 after 966
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :966 after 3140
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3140 after 16033
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :16033 after 24404
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :24404 after 42969
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,163980,3.02034,105408,2,53323,19,362671,6,0,483,219617,0
Total reachable state count : 163980
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,3.03629,105408,2,88,19,362671,7,0,513,219617,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,3.05349,105408,2,88,19,362671,8,0,542,219617,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 3302 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[6]
Ending property specific reduction for SafeBus-COL-06-UpperBounds-02 in 139818 ms.
[2025-06-05 20:02:12] [INFO ] Flatten gal took : 21 ms
[2025-06-05 20:02:12] [INFO ] Applying decomposition
[2025-06-05 20:02:12] [INFO ] Flatten gal took : 21 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/graph16894497716837028568.txt' '-o' '/tmp/graph16894497716837028568.bin' '-w' '/tmp/graph16894497716837028568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16894497716837028568.bin' '-l' '-1' '-v' '-w' '/tmp/graph16894497716837028568.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:02:12] [INFO ] Decomposing Gal with order
[2025-06-05 20:02:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:02:13] [INFO ] Removed a total of 1339 redundant transitions.
[2025-06-05 20:02:13] [INFO ] Flatten gal took : 97 ms
[2025-06-05 20:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 16 ms.
[2025-06-05 20:02:13] [INFO ] Time to serialize gal into /tmp/UpperBounds10276441292272936600.gal : 4 ms
[2025-06-05 20:02:13] [INFO ] Time to serialize properties into /tmp/UpperBounds7647044967564651666.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/UpperBounds10276441292272936600.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7647044967564651666.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds7647044967564651666.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,6.44639e+06,78.5099,1954572,2,182344,5,5.263e+06,6,0,836,5.665e+06,0
Total reachable state count : 6446388
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property SafeBus-COL-06-UpperBounds-02 :0 <= gi0.gu10.wait_msg_0+gi0.gu10.wait_msg_1+gi0.gu10.wait_msg_2+gi0.gu10.wait_msg_3+gi0.gu10.wait_msg_4+gi0...176
FORMULA SafeBus-COL-06-UpperBounds-02 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SafeBus-COL-06-UpperBounds-02,0,78.697,1954572,1,0,7,5.263e+06,9,1,1192,5.665e+06,4
Total runtime 440744 ms.
BK_STOP 1749153812097
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="SafeBus-COL-06"
export BK_EXAMINATION="UpperBounds"
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 SafeBus-COL-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889264700717"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-06.tgz
mv SafeBus-COL-06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;