About the Execution of ITS-Tools for CANInsertWithFailure-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2065650.00 | 0.00 | 0.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 9 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813600261.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 CANInsertWithFailure-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813600261
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 698K 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 CANInsertWithFailure-PT-010-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748742997897
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-01 01:56:40] [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-01 01:56:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:56:40] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2025-06-01 01:56:40] [INFO ] Transformed 324 places.
[2025-06-01 01:56:40] [INFO ] Transformed 660 transitions.
[2025-06-01 01:56:40] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 438 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 660 rows 324 cols
[2025-06-01 01:56:40] [INFO ] Computed 13 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 10, 1, 1, 1, 1, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 10000 steps (47 resets) in 99 ms. (100 steps per ms)
FORMULA CANInsertWithFailure-PT-010-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (54 resets) in 119 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 7] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2025-06-01 01:56:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:41] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2025-06-01 01:56:41] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 8 ms returned sat
[2025-06-01 01:56:41] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2025-06-01 01:56:42] [INFO ] State equation strengthened by 190 read => feed constraints.
[2025-06-01 01:56:42] [INFO ] [Real]Added 190 Read/Feed constraints in 84 ms returned sat
[2025-06-01 01:56:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2025-06-01 01:56:42] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:56:42] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-06-01 01:56:42] [INFO ] [Nat]Added 190 Read/Feed constraints in 165 ms returned sat
[2025-06-01 01:56:43] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 82 ms.
[2025-06-01 01:56:43] [INFO ] Added : 47 causal constraints over 10 iterations in 722 ms. Result :sat
Minimization took 544 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:44] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-06-01 01:56:44] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:56:44] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2025-06-01 01:56:44] [INFO ] [Real]Added 190 Read/Feed constraints in 44 ms returned sat
[2025-06-01 01:56:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-06-01 01:56:45] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:56:45] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-06-01 01:56:45] [INFO ] [Nat]Added 190 Read/Feed constraints in 233 ms returned sat
[2025-06-01 01:56:45] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 95 ms.
[2025-06-01 01:56:46] [INFO ] Added : 54 causal constraints over 11 iterations in 857 ms. Result :sat
Minimization took 533 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:47] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-06-01 01:56:47] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:56:47] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2025-06-01 01:56:47] [INFO ] [Real]Added 190 Read/Feed constraints in 51 ms returned sat
[2025-06-01 01:56:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-06-01 01:56:47] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:56:48] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-01 01:56:48] [INFO ] [Nat]Added 190 Read/Feed constraints in 165 ms returned sat
[2025-06-01 01:56:48] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 87 ms.
[2025-06-01 01:56:49] [INFO ] Added : 55 causal constraints over 11 iterations in 834 ms. Result :sat
Minimization took 559 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:49] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-06-01 01:56:49] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:56:50] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2025-06-01 01:56:50] [INFO ] [Real]Added 190 Read/Feed constraints in 57 ms returned sat
[2025-06-01 01:56:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-06-01 01:56:50] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:56:50] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2025-06-01 01:56:50] [INFO ] [Nat]Added 190 Read/Feed constraints in 147 ms returned sat
[2025-06-01 01:56:51] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 83 ms.
[2025-06-01 01:56:51] [INFO ] Added : 38 causal constraints over 8 iterations in 646 ms. Result :sat
Minimization took 562 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:52] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-06-01 01:56:52] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:56:52] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-06-01 01:56:52] [INFO ] [Real]Added 190 Read/Feed constraints in 49 ms returned sat
[2025-06-01 01:56:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-06-01 01:56:52] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:56:53] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2025-06-01 01:56:53] [INFO ] [Nat]Added 190 Read/Feed constraints in 229 ms returned sat
[2025-06-01 01:56:53] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 81 ms.
[2025-06-01 01:56:54] [INFO ] Added : 55 causal constraints over 11 iterations in 802 ms. Result :sat
Minimization took 569 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:55] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-06-01 01:56:55] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:56:55] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-01 01:56:55] [INFO ] [Real]Added 190 Read/Feed constraints in 50 ms returned sat
[2025-06-01 01:56:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-06-01 01:56:55] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:56:55] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2025-06-01 01:56:56] [INFO ] [Nat]Added 190 Read/Feed constraints in 176 ms returned sat
[2025-06-01 01:56:56] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 84 ms.
[2025-06-01 01:56:56] [INFO ] Added : 46 causal constraints over 10 iterations in 765 ms. Result :sat
Minimization took 556 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:57] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-06-01 01:56:57] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:56:57] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-06-01 01:56:58] [INFO ] [Real]Added 190 Read/Feed constraints in 49 ms returned sat
[2025-06-01 01:56:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:56:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2025-06-01 01:56:58] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:56:58] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2025-06-01 01:56:58] [INFO ] [Nat]Added 190 Read/Feed constraints in 187 ms returned sat
[2025-06-01 01:56:58] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 87 ms.
[2025-06-01 01:56:59] [INFO ] Added : 55 causal constraints over 11 iterations in 783 ms. Result :sat
Minimization took 560 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:57:00] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-06-01 01:57:00] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:57:00] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2025-06-01 01:57:00] [INFO ] [Real]Added 190 Read/Feed constraints in 48 ms returned sat
[2025-06-01 01:57:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:57:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-06-01 01:57:00] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:57:01] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2025-06-01 01:57:01] [INFO ] [Nat]Added 190 Read/Feed constraints in 122 ms returned sat
[2025-06-01 01:57:01] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 80 ms.
[2025-06-01 01:57:01] [INFO ] Added : 37 causal constraints over 8 iterations in 605 ms. Result :sat
Minimization took 550 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:57:02] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-06-01 01:57:02] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:57:02] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2025-06-01 01:57:03] [INFO ] [Real]Added 190 Read/Feed constraints in 46 ms returned sat
[2025-06-01 01:57:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:57:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2025-06-01 01:57:03] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:57:03] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2025-06-01 01:57:03] [INFO ] [Nat]Added 190 Read/Feed constraints in 123 ms returned sat
[2025-06-01 01:57:03] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 100 ms.
[2025-06-01 01:57:04] [INFO ] Added : 44 causal constraints over 9 iterations in 705 ms. Result :sat
Minimization took 556 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:57:05] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2025-06-01 01:57:05] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 01:57:05] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2025-06-01 01:57:05] [INFO ] [Real]Added 190 Read/Feed constraints in 47 ms returned sat
[2025-06-01 01:57:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 01:57:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2025-06-01 01:57:05] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:05] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2025-06-01 01:57:06] [INFO ] [Nat]Added 190 Read/Feed constraints in 257 ms returned sat
[2025-06-01 01:57:06] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 84 ms.
[2025-06-01 01:57:07] [INFO ] Added : 92 causal constraints over 19 iterations in 1293 ms. Result :sat
Minimization took 550 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 7] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 7] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 254 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 283 place count 182 transition count 519
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 3 with 53 rules applied. Total rules applied 336 place count 182 transition count 466
Partial Free-agglomeration rule applied 131 times.
Drop transitions (Partial Free agglomeration) removed 131 transitions
Iterating global reduction 3 with 131 rules applied. Total rules applied 467 place count 182 transition count 466
Applied a total of 467 rules in 254 ms. Remains 182 /324 variables (removed 142) and now considering 466/660 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 182/324 places, 466/660 transitions.
// Phase 1: matrix 466 rows 182 cols
[2025-06-01 01:57:08] [INFO ] Computed 12 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 7] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (16881 resets) in 3375 ms. (296 steps per ms)
BEST_FIRST walk for 10000007 steps (15318 resets) in 5630 ms. (1775 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 9] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2025-06-01 01:57:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:17] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:17] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:17] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2025-06-01 01:57:17] [INFO ] State equation strengthened by 377 read => feed constraints.
[2025-06-01 01:57:17] [INFO ] [Real]Added 377 Read/Feed constraints in 58 ms returned sat
[2025-06-01 01:57:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-01 01:57:17] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:18] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-06-01 01:57:18] [INFO ] [Nat]Added 377 Read/Feed constraints in 91 ms returned sat
[2025-06-01 01:57:18] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 65 ms.
[2025-06-01 01:57:18] [INFO ] Added : 14 causal constraints over 3 iterations in 349 ms. Result :sat
Minimization took 951 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:19] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-01 01:57:19] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:19] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-06-01 01:57:19] [INFO ] [Real]Added 377 Read/Feed constraints in 58 ms returned sat
[2025-06-01 01:57: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-01 01:57:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 01:57:19] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:20] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-06-01 01:57:20] [INFO ] [Nat]Added 377 Read/Feed constraints in 85 ms returned sat
[2025-06-01 01:57:20] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 63 ms.
[2025-06-01 01:57:20] [INFO ] Added : 8 causal constraints over 2 iterations in 223 ms. Result :sat
Minimization took 791 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:21] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:21] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:21] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2025-06-01 01:57:21] [INFO ] [Real]Added 377 Read/Feed constraints in 69 ms returned sat
[2025-06-01 01:57:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:21] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:21] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-06-01 01:57:22] [INFO ] [Nat]Added 377 Read/Feed constraints in 147 ms returned sat
[2025-06-01 01:57:22] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 58 ms.
[2025-06-01 01:57:22] [INFO ] Added : 11 causal constraints over 3 iterations in 261 ms. Result :sat
Minimization took 807 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:23] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 01:57:23] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:23] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-06-01 01:57:23] [INFO ] [Real]Added 377 Read/Feed constraints in 48 ms returned sat
[2025-06-01 01:57:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 01:57:23] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:23] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2025-06-01 01:57:23] [INFO ] [Nat]Added 377 Read/Feed constraints in 85 ms returned sat
[2025-06-01 01:57:23] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 36 ms.
[2025-06-01 01:57:24] [INFO ] Added : 16 causal constraints over 4 iterations in 233 ms. Result :sat
Minimization took 935 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:25] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 01:57:25] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:25] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2025-06-01 01:57:25] [INFO ] [Real]Added 377 Read/Feed constraints in 56 ms returned sat
[2025-06-01 01:57:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-01 01:57:25] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:25] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2025-06-01 01:57:25] [INFO ] [Nat]Added 377 Read/Feed constraints in 83 ms returned sat
[2025-06-01 01:57:25] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 49 ms.
[2025-06-01 01:57:25] [INFO ] Added : 10 causal constraints over 2 iterations in 175 ms. Result :sat
Minimization took 920 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:26] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 01:57:26] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:27] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-06-01 01:57:27] [INFO ] [Real]Added 377 Read/Feed constraints in 65 ms returned sat
[2025-06-01 01:57: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-01 01:57:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 01:57:27] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:27] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2025-06-01 01:57:27] [INFO ] [Nat]Added 377 Read/Feed constraints in 84 ms returned sat
[2025-06-01 01:57:27] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 54 ms.
[2025-06-01 01:57:27] [INFO ] Added : 15 causal constraints over 3 iterations in 254 ms. Result :sat
Minimization took 903 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:28] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 01:57:28] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:28] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-06-01 01:57:28] [INFO ] [Real]Added 377 Read/Feed constraints in 59 ms returned sat
[2025-06-01 01:57:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:29] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:29] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-06-01 01:57:29] [INFO ] [Nat]Added 377 Read/Feed constraints in 120 ms returned sat
[2025-06-01 01:57:29] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 47 ms.
[2025-06-01 01:57:29] [INFO ] Added : 6 causal constraints over 2 iterations in 214 ms. Result :sat
Minimization took 939 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:30] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:30] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:30] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2025-06-01 01:57:30] [INFO ] [Real]Added 377 Read/Feed constraints in 73 ms returned sat
[2025-06-01 01:57:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:31] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:31] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-06-01 01:57:31] [INFO ] [Nat]Added 377 Read/Feed constraints in 106 ms returned sat
[2025-06-01 01:57:31] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 51 ms.
[2025-06-01 01:57:31] [INFO ] Added : 6 causal constraints over 2 iterations in 198 ms. Result :sat
Minimization took 936 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:32] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 01:57:32] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:32] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-06-01 01:57:32] [INFO ] [Real]Added 377 Read/Feed constraints in 69 ms returned sat
[2025-06-01 01:57:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:33] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:33] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2025-06-01 01:57:33] [INFO ] [Nat]Added 377 Read/Feed constraints in 96 ms returned sat
[2025-06-01 01:57:33] [INFO ] Computed and/alt/rep : 323/952/323 causal constraints (skipped 133 transitions) in 50 ms.
[2025-06-01 01:57:33] [INFO ] Added : 10 causal constraints over 2 iterations in 214 ms. Result :sat
Minimization took 995 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:34] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 01:57:34] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:34] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-06-01 01:57:34] [INFO ] [Real]Added 377 Read/Feed constraints in 56 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 9] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 9]
FORMULA CANInsertWithFailure-PT-010-UpperBounds-15 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 9 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 182 transition count 466
Applied a total of 25 rules in 47 ms. Remains 182 /182 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 182/182 places, 466/466 transitions.
// Phase 1: matrix 466 rows 182 cols
[2025-06-01 01:57:34] [INFO ] Computed 12 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (17362 resets) in 3231 ms. (309 steps per ms)
BEST_FIRST walk for 9000008 steps (15015 resets) in 5368 ms. (1676 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
[2025-06-01 01:57:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:43] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 01:57:43] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:43] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2025-06-01 01:57:43] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 01:57:43] [INFO ] [Real]Added 402 Read/Feed constraints in 66 ms returned sat
[2025-06-01 01:57:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:44] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:44] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-06-01 01:57:44] [INFO ] [Nat]Added 402 Read/Feed constraints in 130 ms returned sat
[2025-06-01 01:57:44] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 50 ms.
[2025-06-01 01:57:44] [INFO ] Added : 13 causal constraints over 3 iterations in 280 ms. Result :sat
Minimization took 869 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:45] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 01:57:45] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:45] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2025-06-01 01:57:45] [INFO ] [Real]Added 402 Read/Feed constraints in 77 ms returned sat
[2025-06-01 01:57:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 01:57:46] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:46] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-01 01:57:46] [INFO ] [Nat]Added 402 Read/Feed constraints in 101 ms returned sat
[2025-06-01 01:57:46] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 48 ms.
[2025-06-01 01:57:46] [INFO ] Added : 3 causal constraints over 1 iterations in 193 ms. Result :sat
Minimization took 924 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:47] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-01 01:57:47] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:47] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2025-06-01 01:57:47] [INFO ] [Real]Added 402 Read/Feed constraints in 63 ms returned sat
[2025-06-01 01:57:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 01:57:47] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:48] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2025-06-01 01:57:48] [INFO ] [Nat]Added 402 Read/Feed constraints in 124 ms returned sat
[2025-06-01 01:57:48] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 51 ms.
[2025-06-01 01:57:48] [INFO ] Added : 9 causal constraints over 2 iterations in 201 ms. Result :sat
Minimization took 719 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:49] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:49] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:49] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2025-06-01 01:57:49] [INFO ] [Real]Added 402 Read/Feed constraints in 76 ms returned sat
[2025-06-01 01:57:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 01:57:49] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:49] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-06-01 01:57:49] [INFO ] [Nat]Added 402 Read/Feed constraints in 109 ms returned sat
[2025-06-01 01:57:50] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 53 ms.
[2025-06-01 01:57:50] [INFO ] Added : 8 causal constraints over 2 iterations in 226 ms. Result :sat
Minimization took 919 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:51] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:51] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:51] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2025-06-01 01:57:51] [INFO ] [Real]Added 402 Read/Feed constraints in 76 ms returned sat
[2025-06-01 01:57:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 01:57:51] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:51] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2025-06-01 01:57:51] [INFO ] [Nat]Added 402 Read/Feed constraints in 108 ms returned sat
[2025-06-01 01:57:52] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 51 ms.
[2025-06-01 01:57:52] [INFO ] Added : 9 causal constraints over 2 iterations in 205 ms. Result :sat
Minimization took 907 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:53] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 01:57:53] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 01:57:53] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-06-01 01:57:53] [INFO ] [Real]Added 402 Read/Feed constraints in 50 ms returned sat
[2025-06-01 01:57:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 01:57:53] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:53] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-06-01 01:57:53] [INFO ] [Nat]Added 402 Read/Feed constraints in 81 ms returned sat
[2025-06-01 01:57:53] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 43 ms.
[2025-06-01 01:57:53] [INFO ] Added : 10 causal constraints over 2 iterations in 181 ms. Result :sat
Minimization took 549 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:54] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:54] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:54] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2025-06-01 01:57:54] [INFO ] [Real]Added 402 Read/Feed constraints in 80 ms returned sat
[2025-06-01 01:57:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 01:57:54] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:55] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-06-01 01:57:55] [INFO ] [Nat]Added 402 Read/Feed constraints in 155 ms returned sat
[2025-06-01 01:57:55] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 51 ms.
[2025-06-01 01:57:55] [INFO ] Added : 18 causal constraints over 4 iterations in 333 ms. Result :sat
Minimization took 808 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:56] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:56] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:56] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2025-06-01 01:57:56] [INFO ] [Real]Added 402 Read/Feed constraints in 76 ms returned sat
[2025-06-01 01:57:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-01 01:57:56] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:57] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-01 01:57:57] [INFO ] [Nat]Added 402 Read/Feed constraints in 74 ms returned sat
[2025-06-01 01:57:57] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 43 ms.
[2025-06-01 01:57:57] [INFO ] Added : 7 causal constraints over 2 iterations in 191 ms. Result :sat
Minimization took 612 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:58] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:58] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:58] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-06-01 01:57:58] [INFO ] [Real]Added 402 Read/Feed constraints in 72 ms returned sat
[2025-06-01 01:57:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 01:57:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 01:57:58] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:58] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-06-01 01:57:58] [INFO ] [Nat]Added 402 Read/Feed constraints in 97 ms returned sat
[2025-06-01 01:57:58] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 51 ms.
[2025-06-01 01:57:59] [INFO ] Added : 8 causal constraints over 2 iterations in 217 ms. Result :sat
Minimization took 925 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 9 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Applied a total of 0 rules in 18 ms. Remains 182 /182 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 182/182 places, 466/466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Applied a total of 0 rules in 12 ms. Remains 182 /182 variables (removed 0) and now considering 466/466 (removed 0) transitions.
[2025-06-01 01:58:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:00] [INFO ] Implicit Places using invariants in 433 ms returned []
[2025-06-01 01:58:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:58:00] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 01:58:02] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 2744 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:58:02] [INFO ] Redundant transitions in 55 ms returned []
Running 456 sub problems to find dead transitions.
[2025-06-01 01:58:02] [INFO ] Invariant cache hit.
[2025-06-01 01:58:02] [INFO ] State equation strengthened by 402 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:07] [INFO ] Deduced a trap composed of 2 places in 199 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:07] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:07] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:07] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:07] [INFO ] Deduced a trap composed of 14 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-01 01:58:07] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:08] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:08] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:08] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:08] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:08] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:08] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:09] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:09] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:09] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:09] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:09] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:09] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:09] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:10] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 2 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 2 places in 142 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 15 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-01 01:58:12] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:13] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:13] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:13] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:17] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:17] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:17] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:17] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:17] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:17] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:17] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:18] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:18] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:19] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:19] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:19] [INFO ] Deduced a trap composed of 15 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-01 01:58:19] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:19] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:19] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:20] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:20] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:20] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:20] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:20] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:20] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:21] [INFO ] Deduced a trap composed of 16 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-01 01:58:21] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:21] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:21] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:21] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:21] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:21] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:21] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:21] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:21] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:22] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:22] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:22] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:22] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:24] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:24] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:24] [INFO ] Deduced a trap composed of 15 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-01 01:58:24] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 19/91 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:26] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:26] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:26] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:28] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/648 variables, and 96 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/182 constraints, ReadFeed: 0/402 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:36] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 6 (OVERLAPS) 466/647 variables, 181/279 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 402/681 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/648 variables, and 1137 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30129 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 181/182 constraints, ReadFeed: 402/402 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 60550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63398 ms. Remains : 182/182 places, 466/466 transitions.
RANDOM walk for 40000 steps (696 resets) in 1796 ms. (22 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
[2025-06-01 01:59:04] [INFO ] Flatten gal took : 245 ms
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
[2025-06-01 01:59:04] [INFO ] Flatten gal took : 78 ms
[2025-06-01 01:59:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2205952868965457109.gal : 28 ms
[2025-06-01 01:59:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17417350781276883074.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/ReachabilityCardinality2205952868965457109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17417350781276883074.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/ReachabilityCardinality17417350781276883074.prop.
SDD proceeding with computation,18 properties remain. new max is 4
SDD size :1 after 39
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :39 after 41
SDD proceeding with computation,18 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :42 after 54
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :54 after 62
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :62 after 66
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :66 after 90
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :90 after 120
SDD proceeding with computation,18 properties remain. new max is 1024
SDD size :120 after 912
SDD proceeding with computation,18 properties remain. new max is 2048
SDD size :912 after 5214
SDD proceeding with computation,18 properties remain. new max is 4096
SDD size :5214 after 17812
Interrupted probabilistic random walk after 523052 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 18
Probabilistic random walk after 523052 steps, saw 71383 distinct states, run finished after 3007 ms. (steps per millisecond=173 ) properties seen :0
[2025-06-01 01:59:07] [INFO ] Invariant cache hit.
[2025-06-01 01:59:07] [INFO ] State equation strengthened by 402 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 151/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:07] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 4 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:07] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 2 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/3 constraints. Problems are: Problem set: 9 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 18/178 variables, 9/12 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 9 unsolved
SDD proceeding with computation,18 properties remain. new max is 8192
SDD size :17812 after 38369
At refinement iteration 6 (OVERLAPS) 2/180 variables, 2/14 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/14 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 466/646 variables, 180/194 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 402/596 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/596 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/648 variables, 2/598 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/598 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/598 constraints. Problems are: Problem set: 9 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 598 constraints, problems are : Problem set: 9 solved, 9 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 402/402 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 151/160 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/3 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 18/178 variables, 9/12 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/180 variables, 2/14 constraints. Problems are: Problem set: 9 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:09] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/15 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/15 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 466/646 variables, 180/195 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 402/597 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 9/606 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 0/606 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/648 variables, 2/608 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/608 constraints. Problems are: Problem set: 9 solved, 9 unsolved
SDD proceeding with computation,18 properties remain. new max is 16384
At refinement iteration 15 (OVERLAPS) 0/648 variables, 0/608 constraints. Problems are: Problem set: 9 solved, 9 unsolved
No progress, stopping.
SDD size :38369 after 109449
After SMT solving in domain Int declared 648/648 variables, and 608 constraints, problems are : Problem set: 9 solved, 9 unsolved in 3685 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 402/402 constraints, PredecessorRefiner: 9/18 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5302ms problems are : Problem set: 9 solved, 9 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 9 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Applied a total of 0 rules in 18 ms. Remains 182 /182 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 182/182 places, 466/466 transitions.
RANDOM walk for 40000 steps (696 resets) in 617 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (68 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (66 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (63 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (68 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (64 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (67 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 606491 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 9
Probabilistic random walk after 606491 steps, saw 80544 distinct states, run finished after 3004 ms. (steps per millisecond=201 ) properties seen :0
[2025-06-01 01:59:16] [INFO ] Invariant cache hit.
[2025-06-01 01:59:16] [INFO ] State equation strengthened by 402 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 151/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 18/178 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/180 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 466/646 variables, 180/192 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 402/594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/648 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/648 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/648 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 596 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 402/402 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 151/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:17] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:18] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 18/178 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/180 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:18] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:18] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:18] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:18] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:18] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:18] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,18 properties remain. new max is 32768
SDD size :109449 after 325053
[2025-06-01 01:59:18] [INFO ] Deduced a trap composed of 15 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-01 01:59:19] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 466/646 variables, 180/202 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 402/604 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 9/613 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/648 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/648 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/648 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 615 constraints, problems are : Problem set: 0 solved, 9 unsolved in 6189 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 182/182 constraints, ReadFeed: 402/402 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7774ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 691 ms.
Support contains 9 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Applied a total of 0 rules in 11 ms. Remains 182 /182 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 182/182 places, 466/466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Applied a total of 0 rules in 9 ms. Remains 182 /182 variables (removed 0) and now considering 466/466 (removed 0) transitions.
[2025-06-01 01:59:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:59:25] [INFO ] Implicit Places using invariants in 436 ms returned []
[2025-06-01 01:59:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:59:25] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 01:59:27] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2296 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 01:59:27] [INFO ] Redundant transitions in 4 ms returned []
Running 456 sub problems to find dead transitions.
[2025-06-01 01:59:27] [INFO ] Invariant cache hit.
[2025-06-01 01:59:27] [INFO ] State equation strengthened by 402 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 2 places in 154 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:30] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:31] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:31] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:31] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:31] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:31] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:31] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:31] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:31] [INFO ] Deduced a trap composed of 15 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-01 01:59:31] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:31] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:32] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:32] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 2 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:33] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:34] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:34] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:34] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:34] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 11 ms to minimize.
SDD proceeding with computation,18 properties remain. new max is 65536
SDD size :325053 after 1.38028e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 16 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-01 01:59:37] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:38] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:39] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:39] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:39] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:39] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:39] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:40] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:40] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:40] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:40] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:40] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:40] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:40] [INFO ] Deduced a trap composed of 15 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-01 01:59:41] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:41] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:41] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:41] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:41] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:41] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:41] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:42] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:42] [INFO ] Deduced a trap composed of 15 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-01 01:59:42] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:42] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:42] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:42] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:42] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:43] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:43] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:44] [INFO ] Deduced a trap composed of 15 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-01 01:59:44] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:44] [INFO ] Deduced a trap composed of 15 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-01 01:59:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 19/91 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:46] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:46] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:46] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:47] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:48] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:54] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2025-06-01 01:59:54] [INFO ] Flatten gal took : 39 ms
[2025-06-01 01:59:54] [INFO ] Applying decomposition
[2025-06-01 01:59:54] [INFO ] Flatten gal took : 36 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/graph4990209630693312195.txt' '-o' '/tmp/graph4990209630693312195.bin' '-w' '/tmp/graph4990209630693312195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4990209630693312195.bin' '-l' '-1' '-v' '-w' '/tmp/graph4990209630693312195.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:59:54] [INFO ] Decomposing Gal with order
[2025-06-01 01:59:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:59:55] [INFO ] Removed a total of 346 redundant transitions.
[2025-06-01 01:59:55] [INFO ] Flatten gal took : 190 ms
[2025-06-01 01:59:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 53 ms.
[2025-06-01 01:59:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8394875928775925884.gal : 18 ms
[2025-06-01 01:59:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18008466482657679308.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/ReachabilityCardinality8394875928775925884.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18008466482657679308.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality18008466482657679308.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 43
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :43 after 43
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :43 after 43
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :43 after 43
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :43 after 48
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :48 after 930
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :930 after 18167
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :18167 after 198571
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/648 variables, and 97 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/182 constraints, ReadFeed: 0/402 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:58] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 3 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :198571 after 1.68158e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:59:59] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (OVERLAPS) 466/647 variables, 181/280 constraints. Problems are: Problem set: 0 solved, 456 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1.68158e+06 after 7.43597e+07
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 402/682 constraints. Problems are: Problem set: 23 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 433/1115 constraints. Problems are: Problem set: 23 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/648 variables, and 1115 constraints, problems are : Problem set: 23 solved, 433 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 181/182 constraints, ReadFeed: 402/402 constraints, PredecessorRefiner: 433/456 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 23 solved, 433 unsolved
Search for dead transitions found 23 dead transitions in 60148ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 182/182 places, 443/466 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 169 transition count 417
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 169 transition count 417
Applied a total of 26 rules in 22 ms. Remains 169 /182 variables (removed 13) and now considering 417/443 (removed 26) transitions.
// Phase 1: matrix 417 rows 169 cols
[2025-06-01 02:00:27] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:00:27] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-06-01 02:00:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:00:27] [INFO ] State equation strengthened by 366 read => feed constraints.
[2025-06-01 02:00:29] [INFO ] Implicit Places using invariants and state equation in 2186 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2606 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 168/182 places, 417/466 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 166 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 165 transition count 420
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 165 transition count 414
Applied a total of 12 rules in 69 ms. Remains 165 /168 variables (removed 3) and now considering 414/417 (removed 3) transitions.
// Phase 1: matrix 414 rows 165 cols
[2025-06-01 02:00:29] [INFO ] Computed 11 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:00:30] [INFO ] Implicit Places using invariants in 466 ms returned []
[2025-06-01 02:00:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:00:30] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:00:31] [INFO ] Implicit Places using invariants and state equation in 1420 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 165/182 places, 414/466 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 67061 ms. Remains : 165/182 places, 414/466 transitions.
RANDOM walk for 40000 steps (734 resets) in 408 ms. (97 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (67 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (65 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (65 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (67 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (67 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (68 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (68 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (67 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (67 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 626882 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 9
Probabilistic random walk after 626882 steps, saw 81568 distinct states, run finished after 3011 ms. (steps per millisecond=208 ) properties seen :0
[2025-06-01 02:00:35] [INFO ] Invariant cache hit.
[2025-06-01 02:00:35] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 145/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 9/163 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem MIN6 is UNSAT
Problem MIN7 is UNSAT
At refinement iteration 5 (OVERLAPS) 414/577 variables, 163/174 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 356/530 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/530 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/579 variables, 2/532 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 0/532 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/579 variables, 0/532 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 579/579 variables, and 532 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1393 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 165/165 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 147/154 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:36] [INFO ] Deduced a trap composed of 2 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:36] [INFO ] Deduced a trap composed of 2 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:37] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:37] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:37] [INFO ] Deduced a trap composed of 2 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:37] [INFO ] Deduced a trap composed of 2 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:37] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:37] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:37] [INFO ] Deduced a trap composed of 2 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:37] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:38] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:38] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:38] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:38] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 14/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/163 variables, 9/25 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 414/577 variables, 163/188 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 356/544 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 7/551 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 0/551 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 2/579 variables, 2/553 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 0/553 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/579 variables, 0/553 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 579/579 variables, and 553 constraints, problems are : Problem set: 2 solved, 7 unsolved in 7347 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 165/165 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8766ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 414/414 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 163 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 163 transition count 410
Applied a total of 6 rules in 40 ms. Remains 163 /165 variables (removed 2) and now considering 410/414 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 163/165 places, 410/414 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA CANInsertWithFailure-PT-010-UpperBounds-13 1 TECHNIQUES REACHABILITY_MIN
FORMULA CANInsertWithFailure-PT-010-UpperBounds-12 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10]
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 466 rows 182 cols
[2025-06-01 02:00:44] [INFO ] Computed 12 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (175 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:00:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:00:44] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 02:00:44] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:00:44] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-01 02:00:44] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 02:00:44] [INFO ] [Real]Added 402 Read/Feed constraints in 63 ms returned sat
[2025-06-01 02:00:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:00:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 02:00:44] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 02:00:44] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2025-06-01 02:00:44] [INFO ] [Nat]Added 402 Read/Feed constraints in 120 ms returned sat
[2025-06-01 02:00:44] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 28 ms.
[2025-06-01 02:00:45] [INFO ] Added : 13 causal constraints over 3 iterations in 262 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 177 transition count 461
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 177 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 176 transition count 460
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 176 transition count 460
Applied a total of 16 rules in 33 ms. Remains 176 /182 variables (removed 6) and now considering 460/466 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 176/182 places, 460/466 transitions.
// Phase 1: matrix 460 rows 176 cols
[2025-06-01 02:00:45] [INFO ] Computed 12 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (17867 resets) in 3159 ms. (316 steps per ms)
BEST_FIRST walk for 1000001 steps (1695 resets) in 968 ms. (1031 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:00:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:00:49] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 02:00:49] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:00:50] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-06-01 02:00:50] [INFO ] State equation strengthened by 416 read => feed constraints.
[2025-06-01 02:00:50] [INFO ] [Real]Added 416 Read/Feed constraints in 86 ms returned sat
[2025-06-01 02:00:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:00:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 02:00:50] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:00:50] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2025-06-01 02:00:50] [INFO ] [Nat]Added 416 Read/Feed constraints in 100 ms returned sat
[2025-06-01 02:00:50] [INFO ] Computed and/alt/rep : 311/977/311 causal constraints (skipped 139 transitions) in 50 ms.
[2025-06-01 02:00:50] [INFO ] Added : 8 causal constraints over 2 iterations in 236 ms. Result :sat
Minimization took 800 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 460/460 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 176/176 places, 460/460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 460/460 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2025-06-01 02:00:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:00:52] [INFO ] Implicit Places using invariants in 386 ms returned []
[2025-06-01 02:00:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:00:52] [INFO ] State equation strengthened by 416 read => feed constraints.
[2025-06-01 02:00:53] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:00:53] [INFO ] Redundant transitions in 4 ms returned []
Running 450 sub problems to find dead transitions.
[2025-06-01 02:00:53] [INFO ] Invariant cache hit.
[2025-06-01 02:00:53] [INFO ] State equation strengthened by 416 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:57] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:58] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:58] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:58] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:58] [INFO ] Deduced a trap composed of 2 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:58] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:58] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:58] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 14 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-01 02:00:59] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:00:59] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 15 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-01 02:01:00] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 2 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 2 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:09] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:09] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:09] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:09] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:09] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:09] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:10] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:12] [INFO ] Deduced a trap composed of 15 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-01 02:01:12] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:12] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:12] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:14] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:14] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:16] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:16] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:16] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:16] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:16] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:17] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:17] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:18] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:18] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:19] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:21] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:23] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/636 variables, and 94 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/176 constraints, ReadFeed: 0/416 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:01:29] [INFO ] Deduced a trap composed of 16 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-01 02:01:30] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (OVERLAPS) 460/635 variables, 175/271 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Problem TDEAD153 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 416/687 constraints. Problems are: Problem set: 25 solved, 425 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/635 variables, 425/1112 constraints. Problems are: Problem set: 25 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/636 variables, and 1112 constraints, problems are : Problem set: 25 solved, 425 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 175/176 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 425/450 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 25 solved, 425 unsolved
Search for dead transitions found 25 dead transitions in 60155ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 176/176 places, 435/460 transitions.
Graph (complete) has 761 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 161 transition count 407
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 161 transition count 407
Applied a total of 29 rules in 11 ms. Remains 161 /176 variables (removed 15) and now considering 407/435 (removed 28) transitions.
// Phase 1: matrix 407 rows 161 cols
[2025-06-01 02:01:54] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:01:54] [INFO ] Implicit Places using invariants in 192 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 195 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 160/176 places, 407/460 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 159 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 159 transition count 406
Applied a total of 10 rules in 21 ms. Remains 159 /160 variables (removed 1) and now considering 406/407 (removed 1) transitions.
// Phase 1: matrix 406 rows 159 cols
[2025-06-01 02:01:54] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:01:54] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-06-01 02:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:01:54] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-06-01 02:01:56] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2560 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 158/176 places, 406/460 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 155 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 155 transition count 401
Applied a total of 14 rules in 26 ms. Remains 155 /158 variables (removed 3) and now considering 401/406 (removed 5) transitions.
// Phase 1: matrix 401 rows 155 cols
[2025-06-01 02:01:56] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:01:57] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-01 02:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:01:57] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:01:58] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 1922 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 155/176 places, 401/460 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 67033 ms. Remains : 155/176 places, 401/460 transitions.
[2025-06-01 02:01:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20669 resets) in 2399 ms. (416 steps per ms)
BEST_FIRST walk for 1000001 steps (1875 resets) in 526 ms. (1897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:02:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:02:01] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-06-01 02:02:01] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 02:02:01] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2025-06-01 02:02:01] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:02:01] [INFO ] [Real]Added 356 Read/Feed constraints in 47 ms returned sat
[2025-06-01 02:02:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:02:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-06-01 02:02:01] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 02:02:02] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-06-01 02:02:02] [INFO ] [Nat]Added 356 Read/Feed constraints in 78 ms returned sat
[2025-06-01 02:02:02] [INFO ] Computed and/alt/rep : 250/824/250 causal constraints (skipped 141 transitions) in 33 ms.
[2025-06-01 02:02:02] [INFO ] Added : 7 causal constraints over 2 iterations in 149 ms. Result :sat
Minimization took 474 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 12 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-06-01 02:02:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:02:03] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-01 02:02:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:02:03] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:02:04] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:02:05] [INFO ] Redundant transitions in 16 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 02:02:05] [INFO ] Invariant cache hit.
[2025-06-01 02:02:05] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/556 variables, and 521 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 401/555 variables, 154/165 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 356/521 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 391/912 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/556 variables, and 912 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62200 ms. Remains : 155/155 places, 401/401 transitions.
[2025-06-01 02:03:05] [INFO ] Flatten gal took : 77 ms
RANDOM walk for 40000 steps (827 resets) in 398 ms. (100 steps per ms) remains 2/2 properties
[2025-06-01 02:03:05] [INFO ] Flatten gal took : 43 ms
[2025-06-01 02:03:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11066051023450074603.gal : 7 ms
[2025-06-01 02:03:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17439062817841247188.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/ReachabilityCardinality11066051023450074603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17439062817841247188.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
BEST_FIRST walk for 40004 steps (72 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (76 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17439062817841247188.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 44
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :44 after 46
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :46 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 73
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :73 after 403
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :403 after 518
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :518 after 2001
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2001 after 4515
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4515 after 12829
Interrupted probabilistic random walk after 846464 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :0 out of 2
Probabilistic random walk after 846464 steps, saw 109193 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
[2025-06-01 02:03:08] [INFO ] Invariant cache hit.
[2025-06-01 02:03:08] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/227 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/235 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:03:08] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/235 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 285/520 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 236/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 36/556 variables, 36/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/556 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/556 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/227 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 3/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/235 variables, 8/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 8/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/235 variables, 1/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/235 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 285/520 variables, 74/251 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 236/487 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/556 variables, 36/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/556 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/556 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 874ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 20 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 155/155 places, 401/401 transitions.
RANDOM walk for 40000 steps (819 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (68 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12829 after 164896
Interrupted probabilistic random walk after 1145222 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :0 out of 1
Probabilistic random walk after 1145222 steps, saw 145772 distinct states, run finished after 3003 ms. (steps per millisecond=381 ) properties seen :0
[2025-06-01 02:03:12] [INFO ] Invariant cache hit.
[2025-06-01 02:03:12] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/227 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/235 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 285/520 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 236/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/556 variables, 36/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 149/201 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 110/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/227 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/235 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/235 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 285/520 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 236/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/556 variables, 36/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/556 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/556 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 718ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-06-01 02:03:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:13] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-01 02:03:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:03:13] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:03:15] [INFO ] Implicit Places using invariants and state equation in 1821 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:03:15] [INFO ] Redundant transitions in 8 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 02:03:15] [INFO ] Invariant cache hit.
[2025-06-01 02:03:15] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :164896 after 3.73296e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:03:33] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/556 variables, and 521 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 401/555 variables, 154/165 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 356/521 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Detected timeout of ITS tools.
[2025-06-01 02:03:55] [INFO ] Flatten gal took : 23 ms
[2025-06-01 02:03:55] [INFO ] Applying decomposition
[2025-06-01 02:03:55] [INFO ] Flatten gal took : 38 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/graph399382715926039692.txt' '-o' '/tmp/graph399382715926039692.bin' '-w' '/tmp/graph399382715926039692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph399382715926039692.bin' '-l' '-1' '-v' '-w' '/tmp/graph399382715926039692.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:03:55] [INFO ] Decomposing Gal with order
[2025-06-01 02:03:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:03:55] [INFO ] Removed a total of 329 redundant transitions.
[2025-06-01 02:03:55] [INFO ] Flatten gal took : 76 ms
[2025-06-01 02:03:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 318 labels/synchronizations in 30 ms.
[2025-06-01 02:03:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13283603675749138342.gal : 12 ms
[2025-06-01 02:03:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11105800187331232588.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/ReachabilityCardinality13283603675749138342.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11105800187331232588.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality11105800187331232588.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 154
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :154 after 154
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :154 after 154
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :154 after 154
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :154 after 316
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :316 after 414
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :414 after 8811
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8811 after 148891
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :148891 after 206385
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 391/912 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :206385 after 9.94318e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/556 variables, and 912 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62111 ms. Remains : 155/155 places, 401/401 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 327 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 2 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 348 transitions.
Graph (complete) has 106 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 15 ms. Remains 2 /155 variables (removed 153) and now considering 3/401 (removed 398) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2025-06-01 02:04:15] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:04:15] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:04:15] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:04:15] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:04:15] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:04:15] [INFO ] Flatten gal took : 0 ms
[2025-06-01 02:04:15] [INFO ] Flatten gal took : 1 ms
[2025-06-01 02:04:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12042957831352269419.gal : 0 ms
[2025-06-01 02:04:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17857192016223359514.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/ReachabilityCardinality12042957831352269419.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17857192016223359514.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/ReachabilityCardinality17857192016223359514.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,9,0.002236,3880,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
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,2,0.002552,4136,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 90 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02 in 211229 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 466 rows 182 cols
[2025-06-01 02:04:15] [INFO ] Computed 12 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (169 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (16 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:04:15] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:04:15] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-01 02:04:15] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-06-01 02:04:15] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 02:04:15] [INFO ] [Real]Added 402 Read/Feed constraints in 76 ms returned sat
[2025-06-01 02:04:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:04:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 02:04:15] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:04:15] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-06-01 02:04:16] [INFO ] [Nat]Added 402 Read/Feed constraints in 101 ms returned sat
[2025-06-01 02:04:16] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 51 ms.
[2025-06-01 02:04:16] [INFO ] Added : 3 causal constraints over 1 iterations in 203 ms. Result :sat
Minimization took 507 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 177 transition count 461
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 177 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 176 transition count 460
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 176 transition count 460
Applied a total of 16 rules in 41 ms. Remains 176 /182 variables (removed 6) and now considering 460/466 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 176/182 places, 460/466 transitions.
// Phase 1: matrix 460 rows 176 cols
[2025-06-01 02:04:16] [INFO ] Computed 12 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (17876 resets) in 2883 ms. (346 steps per ms)
BEST_FIRST walk for 1000000 steps (1692 resets) in 569 ms. (1754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:04:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:04:20] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-01 02:04:20] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-01 02:04:20] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-01 02:04:20] [INFO ] State equation strengthened by 416 read => feed constraints.
[2025-06-01 02:04:20] [INFO ] [Real]Added 416 Read/Feed constraints in 79 ms returned sat
[2025-06-01 02:04:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:04:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 02:04:20] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 02:04:20] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-01 02:04:20] [INFO ] [Nat]Added 416 Read/Feed constraints in 89 ms returned sat
[2025-06-01 02:04:21] [INFO ] Computed and/alt/rep : 312/986/312 causal constraints (skipped 138 transitions) in 47 ms.
[2025-06-01 02:04:21] [INFO ] Added : 3 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 837 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 460/460 transitions.
Applied a total of 0 rules in 7 ms. Remains 176 /176 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 176/176 places, 460/460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 460/460 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2025-06-01 02:04:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:22] [INFO ] Implicit Places using invariants in 387 ms returned []
[2025-06-01 02:04:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:04:22] [INFO ] State equation strengthened by 416 read => feed constraints.
[2025-06-01 02:04:25] [INFO ] Implicit Places using invariants and state equation in 2763 ms returned []
Implicit Place search using SMT with State Equation took 3152 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:04:25] [INFO ] Redundant transitions in 7 ms returned []
Running 450 sub problems to find dead transitions.
[2025-06-01 02:04:25] [INFO ] Invariant cache hit.
[2025-06-01 02:04:25] [INFO ] State equation strengthened by 416 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 2 places in 178 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:30] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:31] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:31] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:32] [INFO ] Deduced a trap composed of 14 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-01 02:04:32] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:32] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:32] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:32] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:32] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:32] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:32] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:32] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:33] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:34] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:37] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:37] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:37] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:37] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:38] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:39] [INFO ] Deduced a trap composed of 15 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-01 02:04:39] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:39] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:39] [INFO ] Deduced a trap composed of 16 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-01 02:04:39] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:40] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:40] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:40] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:40] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:40] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:41] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:42] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:43] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:43] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:45] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:47] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:04:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/636 variables, and 93 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/176 constraints, ReadFeed: 0/416 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 81/93 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (OVERLAPS) 460/635 variables, 175/268 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Problem TDEAD153 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 416/684 constraints. Problems are: Problem set: 25 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 425/1109 constraints. Problems are: Problem set: 25 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/636 variables, and 1109 constraints, problems are : Problem set: 25 solved, 425 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 175/176 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 425/450 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 25 solved, 425 unsolved
Search for dead transitions found 25 dead transitions in 60176ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 176/176 places, 435/460 transitions.
Graph (complete) has 761 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 161 transition count 407
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 161 transition count 407
Applied a total of 29 rules in 17 ms. Remains 161 /176 variables (removed 15) and now considering 407/435 (removed 28) transitions.
// Phase 1: matrix 407 rows 161 cols
[2025-06-01 02:05:25] [INFO ] Computed 12 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:25] [INFO ] Implicit Places using invariants in 309 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 160/176 places, 407/460 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 159 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 159 transition count 406
Applied a total of 10 rules in 30 ms. Remains 159 /160 variables (removed 1) and now considering 406/407 (removed 1) transitions.
// Phase 1: matrix 406 rows 159 cols
[2025-06-01 02:05:25] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:26] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-06-01 02:05:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:26] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-06-01 02:05:30] [INFO ] Implicit Places using invariants and state equation in 4399 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4666 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 158/176 places, 406/460 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 155 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 155 transition count 401
Applied a total of 14 rules in 26 ms. Remains 155 /158 variables (removed 3) and now considering 401/406 (removed 5) transitions.
// Phase 1: matrix 401 rows 155 cols
[2025-06-01 02:05:30] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:30] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-01 02:05:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:30] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:05:32] [INFO ] Implicit Places using invariants and state equation in 2194 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 155/176 places, 401/460 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 70766 ms. Remains : 155/176 places, 401/460 transitions.
[2025-06-01 02:05:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20642 resets) in 3030 ms. (329 steps per ms)
BEST_FIRST walk for 1000001 steps (1846 resets) in 556 ms. (1795 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:05:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:05:36] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-06-01 02:05:36] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 02:05:36] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-06-01 02:05:36] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:05:36] [INFO ] [Real]Added 356 Read/Feed constraints in 43 ms returned sat
[2025-06-01 02:05:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:05:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-06-01 02:05:36] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 02:05:36] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-06-01 02:05:36] [INFO ] [Nat]Added 356 Read/Feed constraints in 49 ms returned sat
[2025-06-01 02:05:36] [INFO ] Computed and/alt/rep : 251/833/251 causal constraints (skipped 140 transitions) in 28 ms.
[2025-06-01 02:05:37] [INFO ] Added : 6 causal constraints over 2 iterations in 165 ms. Result :sat
Minimization took 445 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-06-01 02:05:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:37] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-06-01 02:05:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:05:38] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:05:40] [INFO ] Implicit Places using invariants and state equation in 2520 ms returned []
Implicit Place search using SMT with State Equation took 2772 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:05:40] [INFO ] Redundant transitions in 3 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 02:05:40] [INFO ] Invariant cache hit.
[2025-06-01 02:05:40] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/556 variables, and 520 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 391/911 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/556 variables, and 911 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62878 ms. Remains : 155/155 places, 401/401 transitions.
[2025-06-01 02:06:40] [INFO ] Flatten gal took : 48 ms
[2025-06-01 02:06:40] [INFO ] Flatten gal took : 27 ms
[2025-06-01 02:06:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18268174918699867558.gal : 3 ms
[2025-06-01 02:06:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17114209144318882107.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/ReachabilityCardinality18268174918699867558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17114209144318882107.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/ReachabilityCardinality17114209144318882107.prop.
RANDOM walk for 40000 steps (821 resets) in 430 ms. (92 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (72 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
BEST_FIRST walk for 40004 steps (72 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 38
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :38 after 43
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :43 after 45
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :45 after 47
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :47 after 66
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :66 after 423
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :423 after 562
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :562 after 4266
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4266 after 6808
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6808 after 53173
Interrupted probabilistic random walk after 846902 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :0 out of 2
Probabilistic random walk after 846902 steps, saw 109230 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
[2025-06-01 02:06:43] [INFO ] Invariant cache hit.
[2025-06-01 02:06:43] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 112/148 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 69/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/174 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/182 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 325/507 variables, 72/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 277/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/507 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 49/556 variables, 49/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/36 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 112/148 variables, 21/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 69/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/174 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 1/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/182 variables, 8/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 8/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:06:44] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 1/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 325/507 variables, 72/197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/507 variables, 277/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/556 variables, 49/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/556 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/556 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1097ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 155/155 places, 401/401 transitions.
RANDOM walk for 40000 steps (825 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (74 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :53173 after 147069
Interrupted probabilistic random walk after 1127742 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :0 out of 1
Probabilistic random walk after 1127742 steps, saw 143124 distinct states, run finished after 3001 ms. (steps per millisecond=375 ) properties seen :0
[2025-06-01 02:06:47] [INFO ] Invariant cache hit.
[2025-06-01 02:06:47] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 112/148 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 69/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/174 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/182 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 325/507 variables, 72/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 277/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/507 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 49/556 variables, 49/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 112/148 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 69/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/174 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/174 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/182 variables, 8/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:06:48] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 325/507 variables, 72/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/507 variables, 277/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/556 variables, 49/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/556 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/556 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 641ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 11 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-06-01 02:06:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:06:48] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-01 02:06:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:06:48] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:06:51] [INFO ] Implicit Places using invariants and state equation in 2398 ms returned []
Implicit Place search using SMT with State Equation took 2537 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:06:51] [INFO ] Redundant transitions in 3 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 02:06:51] [INFO ] Invariant cache hit.
[2025-06-01 02:06:51] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :147069 after 829970
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/556 variables, and 520 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Detected timeout of ITS tools.
[2025-06-01 02:07:30] [INFO ] Flatten gal took : 19 ms
[2025-06-01 02:07:30] [INFO ] Applying decomposition
[2025-06-01 02:07:30] [INFO ] Flatten gal took : 15 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/graph7894337076886133023.txt' '-o' '/tmp/graph7894337076886133023.bin' '-w' '/tmp/graph7894337076886133023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7894337076886133023.bin' '-l' '-1' '-v' '-w' '/tmp/graph7894337076886133023.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:07:30] [INFO ] Decomposing Gal with order
[2025-06-01 02:07:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:07:30] [INFO ] Removed a total of 330 redundant transitions.
[2025-06-01 02:07:30] [INFO ] Flatten gal took : 51 ms
[2025-06-01 02:07:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 23 ms.
[2025-06-01 02:07:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9881553436907388409.gal : 12 ms
[2025-06-01 02:07:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6570413389873956697.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/ReachabilityCardinality9881553436907388409.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6570413389873956697.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality6570413389873956697.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 135
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :135 after 135
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :135 after 163
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :163 after 7009
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7009 after 87892
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :87892 after 2.43325e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 391/911 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SMT process timed out in 60093ms, After SMT, problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62652 ms. Remains : 155/155 places, 401/401 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 328 edges and 155 vertex of which 114 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 111 places
Drop transitions (Empty/Sink Transition effects.) removed 267 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 347 transitions.
Graph (complete) has 108 edges and 44 vertex of which 13 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 11 transition count 11
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 43 place count 3 transition count 3
Iterating global reduction 3 with 8 rules applied. Total rules applied 51 place count 3 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 3 transition count 3
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 2 transition count 2
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 2 transition count 2
Applied a total of 54 rules in 5 ms. Remains 2 /155 variables (removed 153) and now considering 2/401 (removed 399) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2025-06-01 02:07:51] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:07:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 02:07:51] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:07:51] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-01 02:07:51] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2025-06-01 02:07:51] [INFO ] Flatten gal took : 1 ms
[2025-06-01 02:07:51] [INFO ] Flatten gal took : 0 ms
[2025-06-01 02:07:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13534448721141676238.gal : 0 ms
[2025-06-01 02:07:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality969500276043184531.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/ReachabilityCardinality13534448721141676238.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality969500276043184531.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/ReachabilityCardinality969500276043184531.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,5,0.001968,3880,2,7,7,32,6,0,13,18,0
Total reachable state count : 5
Verifying 1 reachability properties.
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,0.002324,4136,2,3,7,32,7,0,16,18,0
Over-approximation ignoring read arcs solved 0 properties in 50 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07 in 216015 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-08
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 466 rows 182 cols
[2025-06-01 02:07:51] [INFO ] Computed 12 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (173 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (17 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:07:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:07:51] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-01 02:07:51] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:07:51] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-06-01 02:07:51] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 02:07:51] [INFO ] [Real]Added 402 Read/Feed constraints in 47 ms returned sat
[2025-06-01 02:07:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:07:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:07:51] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:07:51] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-01 02:07:51] [INFO ] [Nat]Added 402 Read/Feed constraints in 85 ms returned sat
[2025-06-01 02:07:51] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 29 ms.
[2025-06-01 02:07:52] [INFO ] Added : 9 causal constraints over 2 iterations in 175 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 177 transition count 461
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 177 transition count 461
Applied a total of 13 rules in 25 ms. Remains 177 /182 variables (removed 5) and now considering 461/466 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 177/182 places, 461/466 transitions.
// Phase 1: matrix 461 rows 177 cols
[2025-06-01 02:07:52] [INFO ] Computed 12 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (17920 resets) in 3420 ms. (292 steps per ms)
BEST_FIRST walk for 1000001 steps (1703 resets) in 651 ms. (1533 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:07:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:07:56] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-01 02:07:56] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:07:56] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2025-06-01 02:07:56] [INFO ] State equation strengthened by 415 read => feed constraints.
[2025-06-01 02:07:57] [INFO ] [Real]Added 415 Read/Feed constraints in 84 ms returned sat
[2025-06-01 02:07: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-01 02:07:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 02:07:57] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 02:07:57] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-06-01 02:07:57] [INFO ] [Nat]Added 415 Read/Feed constraints in 109 ms returned sat
[2025-06-01 02:07:57] [INFO ] Computed and/alt/rep : 312/977/312 causal constraints (skipped 139 transitions) in 48 ms.
[2025-06-01 02:07:57] [INFO ] Added : 6 causal constraints over 2 iterations in 242 ms. Result :sat
Minimization took 832 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 177/177 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 6 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2025-06-01 02:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:07:58] [INFO ] Implicit Places using invariants in 400 ms returned []
[2025-06-01 02:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:07:59] [INFO ] State equation strengthened by 415 read => feed constraints.
[2025-06-01 02:08:00] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:08:00] [INFO ] Redundant transitions in 5 ms returned []
Running 451 sub problems to find dead transitions.
[2025-06-01 02:08:00] [INFO ] Invariant cache hit.
[2025-06-01 02:08:00] [INFO ] State equation strengthened by 415 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:04] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:04] [INFO ] Deduced a trap composed of 2 places in 168 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:04] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:05] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:06] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:07] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:08] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:08] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:08] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:09] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:09] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:09] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:09] [INFO ] Deduced a trap composed of 15 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-01 02:08:09] [INFO ] Deduced a trap composed of 15 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-01 02:08:09] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:09] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:10] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:11] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:14] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:14] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:14] [INFO ] Deduced a trap composed of 15 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-01 02:08:14] [INFO ] Deduced a trap composed of 16 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-01 02:08:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:15] [INFO ] Deduced a trap composed of 16 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-01 02:08:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:16] [INFO ] Deduced a trap composed of 15 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-01 02:08:16] [INFO ] Deduced a trap composed of 16 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-01 02:08:16] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:19] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:19] [INFO ] Deduced a trap composed of 15 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-01 02:08:20] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:20] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:20] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:20] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:24] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:24] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:24] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:25] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:26] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:26] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:26] [INFO ] Deduced a trap composed of 15 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-01 02:08:28] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/638 variables, and 91 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/177 constraints, ReadFeed: 0/415 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:34] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:35] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:08:35] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (OVERLAPS) 461/637 variables, 176/270 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD308 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 415/685 constraints. Problems are: Problem set: 3 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/638 variables, and 1133 constraints, problems are : Problem set: 3 solved, 448 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 448/451 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 3 solved, 448 unsolved
Search for dead transitions found 3 dead transitions in 60135ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/177 places, 458/461 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 176 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 176 transition count 456
Applied a total of 2 rules in 9 ms. Remains 176 /177 variables (removed 1) and now considering 456/458 (removed 2) transitions.
// Phase 1: matrix 456 rows 176 cols
[2025-06-01 02:09:01] [INFO ] Computed 12 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:09:01] [INFO ] Implicit Places using invariants in 434 ms returned []
[2025-06-01 02:09:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:09:01] [INFO ] State equation strengthened by 411 read => feed constraints.
[2025-06-01 02:09:04] [INFO ] Implicit Places using invariants and state equation in 3194 ms returned []
Implicit Place search using SMT with State Equation took 3629 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 176/177 places, 456/461 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66162 ms. Remains : 176/177 places, 456/461 transitions.
[2025-06-01 02:09:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (17909 resets) in 2799 ms. (357 steps per ms)
BEST_FIRST walk for 1000001 steps (1729 resets) in 562 ms. (1776 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:09:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:09:08] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:09:08] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:09:08] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-06-01 02:09:08] [INFO ] State equation strengthened by 411 read => feed constraints.
[2025-06-01 02:09:08] [INFO ] [Real]Added 411 Read/Feed constraints in 53 ms returned sat
[2025-06-01 02:09:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:09:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 02:09:08] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-01 02:09:08] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2025-06-01 02:09:08] [INFO ] [Nat]Added 411 Read/Feed constraints in 92 ms returned sat
[2025-06-01 02:09:08] [INFO ] Computed and/alt/rep : 316/1050/316 causal constraints (skipped 130 transitions) in 47 ms.
[2025-06-01 02:09:08] [INFO ] Added : 9 causal constraints over 2 iterations in 207 ms. Result :sat
Minimization took 1040 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 456/456 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 176/176 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 456/456 transitions.
Applied a total of 0 rules in 6 ms. Remains 176 /176 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2025-06-01 02:09:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:09:10] [INFO ] Implicit Places using invariants in 365 ms returned []
[2025-06-01 02:09:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:09:10] [INFO ] State equation strengthened by 411 read => feed constraints.
[2025-06-01 02:09:12] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 2563 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:09:12] [INFO ] Redundant transitions in 4 ms returned []
Running 446 sub problems to find dead transitions.
[2025-06-01 02:09:12] [INFO ] Invariant cache hit.
[2025-06-01 02:09:12] [INFO ] State equation strengthened by 411 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:16] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:16] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:16] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:16] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:16] [INFO ] Deduced a trap composed of 15 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-01 02:09:17] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 2 places in 173 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:17] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:18] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:19] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 14 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-01 02:09:21] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:26] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:26] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:26] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:26] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:26] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 15 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-01 02:09:27] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:28] [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-01 02:09:28] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 15/87 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/632 variables, and 93 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/176 constraints, ReadFeed: 0/411 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 81/93 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:45] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:09:46] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (OVERLAPS) 456/631 variables, 175/270 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Problem TDEAD307 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 411/681 constraints. Problems are: Problem set: 20 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 426/1107 constraints. Problems are: Problem set: 20 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/632 variables, and 1107 constraints, problems are : Problem set: 20 solved, 426 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 175/176 constraints, ReadFeed: 411/411 constraints, PredecessorRefiner: 426/446 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 20 solved, 426 unsolved
Search for dead transitions found 20 dead transitions in 60096ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 176/176 places, 436/456 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 164 transition count 412
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 164 transition count 412
Applied a total of 24 rules in 9 ms. Remains 164 /176 variables (removed 12) and now considering 412/436 (removed 24) transitions.
// Phase 1: matrix 412 rows 164 cols
[2025-06-01 02:10:12] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:10:13] [INFO ] Implicit Places using invariants in 399 ms returned []
[2025-06-01 02:10:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:10:13] [INFO ] State equation strengthened by 379 read => feed constraints.
[2025-06-01 02:10:16] [INFO ] Implicit Places using invariants and state equation in 3415 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3832 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 163/176 places, 412/456 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 161 transition count 410
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 160 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 160 transition count 407
Applied a total of 14 rules in 20 ms. Remains 160 /163 variables (removed 3) and now considering 407/412 (removed 5) transitions.
// Phase 1: matrix 407 rows 160 cols
[2025-06-01 02:10:16] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:10:16] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-06-01 02:10:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:10:17] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-06-01 02:10:18] [INFO ] Implicit Places using invariants and state equation in 2053 ms returned []
Implicit Place search using SMT with State Equation took 2370 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 160/176 places, 407/456 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 68912 ms. Remains : 160/176 places, 407/456 transitions.
[2025-06-01 02:10:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (18923 resets) in 2397 ms. (417 steps per ms)
BEST_FIRST walk for 1000001 steps (1776 resets) in 559 ms. (1785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:10:21] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-01 02:10:22] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-06-01 02:10:22] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-06-01 02:10:22] [INFO ] [Real]Added 367 Read/Feed constraints in 57 ms returned sat
[2025-06-01 02:10:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:10:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-01 02:10:22] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-06-01 02:10:22] [INFO ] [Nat]Added 367 Read/Feed constraints in 52 ms returned sat
[2025-06-01 02:10:22] [INFO ] Computed and/alt/rep : 283/970/283 causal constraints (skipped 114 transitions) in 30 ms.
[2025-06-01 02:10:22] [INFO ] Added : 9 causal constraints over 2 iterations in 150 ms. Result :sat
Minimization took 789 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 160/160 places, 407/407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2025-06-01 02:10:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:10:23] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-06-01 02:10:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:10:23] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-06-01 02:10:25] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned []
Implicit Place search using SMT with State Equation took 2518 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:10:25] [INFO ] Redundant transitions in 3 ms returned []
Running 397 sub problems to find dead transitions.
[2025-06-01 02:10:25] [INFO ] Invariant cache hit.
[2025-06-01 02:10:25] [INFO ] State equation strengthened by 367 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:28] [INFO ] Deduced a trap composed of 2 places in 174 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:28] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:29] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:30] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:32] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:32] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:32] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:33] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:34] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:35] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:35] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:36] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:37] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:37] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:37] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:37] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:37] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:37] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:39] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:39] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:39] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:39] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:39] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:39] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:39] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:39] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:40] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:40] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:40] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:40] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:40] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:40] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:40] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:40] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:41] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:41] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:41] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:41] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 15 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-01 02:10:47] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:47] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:51] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:52] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:52] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:52] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:52] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:52] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:52] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:53] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:53] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:53] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:54] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 15 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-01 02:10:55] [INFO ] Deduced a trap composed of 15 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-01 02:10:55] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:55] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 14 ms to minimize.
SMT process timed out in 30066ms, After SMT, problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 30067ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32601 ms. Remains : 160/160 places, 407/407 transitions.
[2025-06-01 02:10:55] [INFO ] Flatten gal took : 22 ms
[2025-06-01 02:10:56] [INFO ] Flatten gal took : 22 ms
[2025-06-01 02:10:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13443173745465822534.gal : 6 ms
[2025-06-01 02:10:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality463842917163807899.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/ReachabilityCardinality13443173745465822534.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality463842917163807899.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
RANDOM walk for 40000 steps (749 resets) in 335 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (68 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (68 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality463842917163807899.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 43
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :43 after 45
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 46
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :46 after 56
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :56 after 87
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :87 after 495
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :495 after 1966
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1966 after 4422
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4422 after 10360
Interrupted probabilistic random walk after 742733 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 2
Probabilistic random walk after 742733 steps, saw 96579 distinct states, run finished after 3006 ms. (steps per millisecond=247 ) properties seen :0
[2025-06-01 02:10:59] [INFO ] Invariant cache hit.
[2025-06-01 02:10:59] [INFO ] State equation strengthened by 367 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 148/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 2 places in 179 ms of which 11 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:00] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:00] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:00] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:00] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:00] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:01] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:01] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:01] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:01] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 13/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/158 variables, 9/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 407/565 variables, 158/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 367/549 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/549 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/567 variables, 2/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/567 variables, 0/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 551 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2703 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 160/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/149 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 13/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/158 variables, 9/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 407/565 variables, 158/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 367/549 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 1/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/567 variables, 2/552 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/567 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 552 constraints, problems are : Problem set: 1 solved, 1 unsolved in 578 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 160/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3292ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 160/160 places, 407/407 transitions.
RANDOM walk for 40000 steps (752 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (68 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10360 after 173074
Interrupted probabilistic random walk after 1051291 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 1
Probabilistic random walk after 1051291 steps, saw 134413 distinct states, run finished after 3004 ms. (steps per millisecond=349 ) properties seen :0
[2025-06-01 02:11:05] [INFO ] Invariant cache hit.
[2025-06-01 02:11:05] [INFO ] State equation strengthened by 367 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:05] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/158 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 407/565 variables, 158/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 367/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/567 variables, 2/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/567 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 539 constraints, problems are : Problem set: 0 solved, 1 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 160/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:06] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/158 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 407/565 variables, 158/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 367/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/567 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/567 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 541 constraints, problems are : Problem set: 0 solved, 1 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 160/160 constraints, ReadFeed: 367/367 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1156ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 160/160 places, 407/407 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 407/407 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 407/407 (removed 0) transitions.
[2025-06-01 02:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:11:07] [INFO ] Implicit Places using invariants in 498 ms returned []
[2025-06-01 02:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:11:07] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-06-01 02:11:08] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:11:08] [INFO ] Redundant transitions in 3 ms returned []
Running 397 sub problems to find dead transitions.
[2025-06-01 02:11:08] [INFO ] Invariant cache hit.
[2025-06-01 02:11:08] [INFO ] State equation strengthened by 367 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:10] [INFO ] Deduced a trap composed of 2 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:10] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:10] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:11] [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-01 02:11:11] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:11] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:11] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:11] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:11] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:11] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:12] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :173074 after 1.49958e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:13] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:13] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:13] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:13] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:14] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:15] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:16] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:16] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:16] [INFO ] Deduced a trap composed of 15 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-01 02:11:16] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:17] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:17] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:17] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:17] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:17] [INFO ] Deduced a trap composed of 15 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-01 02:11:17] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:17] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:17] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:19] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:19] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:19] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:19] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:21] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:26] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:26] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:26] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:26] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:26] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:26] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:27] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:27] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:27] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:27] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.49958e+06 after 3.55003e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:30] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:31] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:31] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:31] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:31] [INFO ] Deduced a trap composed of 16 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-01 02:11:31] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:32] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:32] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:32] [INFO ] Deduced a trap composed of 16 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-01 02:11:32] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:33] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:34] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:35] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:35] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:35] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 159/567 variables, and 110 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/160 constraints, ReadFeed: 0/367 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 99/99 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 99/110 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:41] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:42] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:43] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:43] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:44] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2025-06-01 02:11:46] [INFO ] Flatten gal took : 22 ms
[2025-06-01 02:11:46] [INFO ] Applying decomposition
[2025-06-01 02:11:46] [INFO ] Flatten gal took : 22 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/graph4559349385155948277.txt' '-o' '/tmp/graph4559349385155948277.bin' '-w' '/tmp/graph4559349385155948277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4559349385155948277.bin' '-l' '-1' '-v' '-w' '/tmp/graph4559349385155948277.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:11:46] [INFO ] Decomposing Gal with order
[2025-06-01 02:11:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:11:46] [INFO ] Removed a total of 324 redundant transitions.
[2025-06-01 02:11:46] [INFO ] Flatten gal took : 64 ms
[2025-06-01 02:11:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 28 ms.
[2025-06-01 02:11:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7884424756431588138.gal : 12 ms
[2025-06-01 02:11:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13582013173274734558.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/ReachabilityCardinality7884424756431588138.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13582013173274734558.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality13582013173274734558.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 49
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :49 after 68
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :68 after 536
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :536 after 19884
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :19884 after 304130
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 7/117 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:49] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:49] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :304130 after 2.36343e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:51] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:51] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:51] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:52] [INFO ] Deduced a trap composed of 2 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:52] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:11:59] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:02] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:02] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:03] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:03] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:07] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 159/567 variables, and 130 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/160 constraints, ReadFeed: 0/367 constraints, PredecessorRefiner: 0/397 constraints, Known Traps: 119/119 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62191 ms. Remains : 160/160 places, 407/407 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 347 edges and 160 vertex of which 117 / 160 are part of one of the 3 SCC in 1 ms
Free SCC test removed 114 places
Drop transitions (Empty/Sink Transition effects.) removed 271 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 350 transitions.
Graph (complete) has 115 edges and 46 vertex of which 16 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 16 transition count 20
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 8 transition count 12
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 5 transition count 9
Applied a total of 50 rules in 8 ms. Remains 5 /160 variables (removed 155) and now considering 9/407 (removed 398) transitions.
Running SMT prover for 1 properties.
[2025-06-01 02:12:08] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2025-06-01 02:12:08] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:12:08] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:12:08] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:12:08] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:12:08] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:12:08] [INFO ] Flatten gal took : 1 ms
[2025-06-01 02:12:08] [INFO ] Flatten gal took : 1 ms
[2025-06-01 02:12:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12597071505381400263.gal : 1 ms
[2025-06-01 02:12:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12752837912627875244.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/ReachabilityCardinality12597071505381400263.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12752837912627875244.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/ReachabilityCardinality12752837912627875244.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 18
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 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,179,0.006245,4136,2,33,8,487,6,0,29,543,0
Total reachable state count : 179
Verifying 1 reachability properties.
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,30,0.006597,4264,2,13,8,487,7,0,32,543,0
Over-approximation ignoring read arcs solved 0 properties in 98 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-08 in 257736 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 466 rows 182 cols
[2025-06-01 02:12:09] [INFO ] Computed 12 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (176 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:12:09] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 02:12:09] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:12:09] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-06-01 02:12:09] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 02:12:09] [INFO ] [Real]Added 402 Read/Feed constraints in 49 ms returned sat
[2025-06-01 02:12:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:12:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:12:09] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:12:09] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2025-06-01 02:12:09] [INFO ] [Nat]Added 402 Read/Feed constraints in 80 ms returned sat
[2025-06-01 02:12:09] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 46 ms.
[2025-06-01 02:12:09] [INFO ] Added : 8 causal constraints over 2 iterations in 175 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 178 transition count 462
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 178 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 177 transition count 461
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 177 transition count 461
Applied a total of 15 rules in 23 ms. Remains 177 /182 variables (removed 5) and now considering 461/466 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 177/182 places, 461/466 transitions.
// Phase 1: matrix 461 rows 177 cols
[2025-06-01 02:12:10] [INFO ] Computed 12 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (17872 resets) in 2876 ms. (347 steps per ms)
BEST_FIRST walk for 1000001 steps (1710 resets) in 552 ms. (1808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:12:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:12:13] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:12:13] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:12:13] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-06-01 02:12:13] [INFO ] State equation strengthened by 415 read => feed constraints.
[2025-06-01 02:12:14] [INFO ] [Real]Added 415 Read/Feed constraints in 51 ms returned sat
[2025-06-01 02:12:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:12:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:12:14] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:12:14] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-06-01 02:12:14] [INFO ] [Nat]Added 415 Read/Feed constraints in 57 ms returned sat
[2025-06-01 02:12:14] [INFO ] Computed and/alt/rep : 313/982/313 causal constraints (skipped 138 transitions) in 27 ms.
[2025-06-01 02:12:14] [INFO ] Added : 9 causal constraints over 3 iterations in 193 ms. Result :sat
Minimization took 972 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 177/177 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2025-06-01 02:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:15] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-01 02:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:12:16] [INFO ] State equation strengthened by 415 read => feed constraints.
[2025-06-01 02:12:17] [INFO ] Implicit Places using invariants and state equation in 1671 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:12:17] [INFO ] Redundant transitions in 4 ms returned []
Running 451 sub problems to find dead transitions.
[2025-06-01 02:12:17] [INFO ] Invariant cache hit.
[2025-06-01 02:12:17] [INFO ] State equation strengthened by 415 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:21] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:21] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:21] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:21] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:21] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:21] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:21] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:22] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:22] [INFO ] Deduced a trap composed of 2 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:22] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:22] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:24] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:24] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:24] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:25] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:25] [INFO ] Deduced a trap composed of 15 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-01 02:12:25] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:25] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:27] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:27] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:29] [INFO ] Deduced a trap composed of 2 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:29] [INFO ] Deduced a trap composed of 2 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:29] [INFO ] Deduced a trap composed of 2 places in 162 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:29] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:29] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:30] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:30] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:30] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:30] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:30] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:30] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:30] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:30] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:31] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:31] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:31] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:31] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:31] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:31] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:31] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:35] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:35] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:35] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:35] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:35] [INFO ] Deduced a trap composed of 15 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-01 02:12:35] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:36] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:36] [INFO ] Deduced a trap composed of 17 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-01 02:12:36] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:36] [INFO ] Deduced a trap composed of 15 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-01 02:12:36] [INFO ] Deduced a trap composed of 15 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-01 02:12:36] [INFO ] Deduced a trap composed of 15 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-01 02:12:38] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:38] [INFO ] Deduced a trap composed of 15 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-01 02:12:39] [INFO ] Deduced a trap composed of 15 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-01 02:12:40] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:40] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:40] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:41] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:41] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:42] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:42] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:42] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:42] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:42] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:43] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:43] [INFO ] Deduced a trap composed of 14 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-01 02:12:43] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:43] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:43] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:43] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:44] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:44] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:44] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:45] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:46] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:47] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:47] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/638 variables, and 90 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/177 constraints, ReadFeed: 0/415 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:49] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:49] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:53] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:57] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:12:57] [INFO ] Deduced a trap composed of 15 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-01 02:12:59] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 6 (OVERLAPS) 461/637 variables, 176/274 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 415/689 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/638 variables, and 1140 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 451 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62208 ms. Remains : 177/177 places, 461/461 transitions.
[2025-06-01 02:13:17] [INFO ] Flatten gal took : 31 ms
[2025-06-01 02:13:17] [INFO ] Flatten gal took : 67 ms
RANDOM walk for 40000 steps (704 resets) in 278 ms. (143 steps per ms) remains 2/2 properties
[2025-06-01 02:13:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14450367194485983423.gal : 18 ms
[2025-06-01 02:13:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16495659228246928825.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/ReachabilityCardinality14450367194485983423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16495659228246928825.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (64 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
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
BEST_FIRST walk for 40004 steps (66 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality16495659228246928825.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 39
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :39 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 45
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :45 after 62
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :62 after 66
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :66 after 75
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :75 after 105
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :105 after 810
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :810 after 1132
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1132 after 16622
Interrupted probabilistic random walk after 799187 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 2
Probabilistic random walk after 799187 steps, saw 104995 distinct states, run finished after 3003 ms. (steps per millisecond=266 ) properties seen :0
[2025-06-01 02:13:20] [INFO ] Invariant cache hit.
[2025-06-01 02:13:20] [INFO ] State equation strengthened by 415 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:20] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 5 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :16622 after 35868
[2025-06-01 02:13:20] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/173 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/175 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:21] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:21] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:21] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:21] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:21] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:21] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:21] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:22] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 8/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 461/636 variables, 175/197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 415/612 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 0/612 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/638 variables, 2/614 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/638 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/638 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 638/638 variables, and 614 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1513 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/177 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/173 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/175 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 8/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:22] [INFO ] Deduced a trap composed of 2 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:22] [INFO ] Deduced a trap composed of 2 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:22] [INFO ] Deduced a trap composed of 2 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:22] [INFO ] Deduced a trap composed of 2 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:23] [INFO ] Deduced a trap composed of 2 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:23] [INFO ] Deduced a trap composed of 2 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:23] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:23] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :35868 after 189407
[2025-06-01 02:13:23] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:23] [INFO ] Deduced a trap composed of 14 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-01 02:13:24] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:24] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:24] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:24] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:24] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 461/636 variables, 175/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 415/627 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 1/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/636 variables, 0/628 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/638 variables, 2/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/638 variables, 0/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/638 variables, 0/630 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 638/638 variables, and 630 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/177 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4296ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 177/177 places, 461/461 transitions.
RANDOM walk for 40000 steps (719 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (67 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1028222 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 1
Probabilistic random walk after 1028222 steps, saw 134218 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
[2025-06-01 02:13:28] [INFO ] Invariant cache hit.
[2025-06-01 02:13:28] [INFO ] State equation strengthened by 415 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/173 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/175 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 461/636 variables, 175/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/636 variables, 415/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/638 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/638 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/638 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 638/638 variables, and 610 constraints, problems are : Problem set: 0 solved, 1 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/177 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/173 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/175 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:29] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:29] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:29] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:29] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:29] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:29] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 461/636 variables, 175/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 415/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/636 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/638 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/638 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/638 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 638/638 variables, and 627 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2409 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 177/177 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2975ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 177/177 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2025-06-01 02:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:31] [INFO ] Implicit Places using invariants in 391 ms returned []
[2025-06-01 02:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:13:31] [INFO ] State equation strengthened by 415 read => feed constraints.
[2025-06-01 02:13:33] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:13:33] [INFO ] Redundant transitions in 5 ms returned []
Running 451 sub problems to find dead transitions.
[2025-06-01 02:13:33] [INFO ] Invariant cache hit.
[2025-06-01 02:13:33] [INFO ] State equation strengthened by 415 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:36] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:37] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:37] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:38] [INFO ] Deduced a trap composed of 14 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-01 02:13:39] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32768
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :189407 after 1.49157e+06
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:41] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 2 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:44] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 17 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-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:48] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:49] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:50] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:51] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:51] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:51] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:52] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:52] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:53] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:54] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:54] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:54] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:55] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:55] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:55] [INFO ] Deduced a trap composed of 16 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-01 02:13:56] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:56] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:56] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:57] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:57] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:57] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:57] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:13:58] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:14:00] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/638 variables, and 96 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/177 constraints, ReadFeed: 0/415 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.49157e+06 after 5.37295e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Detected timeout of ITS tools.
[2025-06-01 02:14:07] [INFO ] Flatten gal took : 27 ms
[2025-06-01 02:14:07] [INFO ] Applying decomposition
[2025-06-01 02:14:07] [INFO ] Flatten gal took : 14 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/graph6407104889033973410.txt' '-o' '/tmp/graph6407104889033973410.bin' '-w' '/tmp/graph6407104889033973410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6407104889033973410.bin' '-l' '-1' '-v' '-w' '/tmp/graph6407104889033973410.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:14:07] [INFO ] Decomposing Gal with order
[2025-06-01 02:14:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:14:08] [INFO ] Removed a total of 346 redundant transitions.
[2025-06-01 02:14:08] [INFO ] Flatten gal took : 34 ms
[2025-06-01 02:14:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 11 ms.
[2025-06-01 02:14:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4028112552252845258.gal : 4 ms
[2025-06-01 02:14:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17051889617049973468.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/ReachabilityCardinality4028112552252845258.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17051889617049973468.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality17051889617049973468.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 459
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :459 after 831
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :831 after 136249
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:14:10] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:14:10] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 451 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :136249 after 1.00129e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 5 (OVERLAPS) 461/637 variables, 176/274 constraints. Problems are: Problem set: 0 solved, 451 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.00129e+06 after 2.55967e+07
Problem TDEAD156 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 415/689 constraints. Problems are: Problem set: 14 solved, 437 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/638 variables, and 1126 constraints, problems are : Problem set: 14 solved, 437 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 437/451 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 14 solved, 437 unsolved
Search for dead transitions found 14 dead transitions in 60136ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/177 places, 447/461 transitions.
Graph (complete) has 772 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 165 transition count 425
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 165 transition count 425
Applied a total of 23 rules in 16 ms. Remains 165 /177 variables (removed 12) and now considering 425/447 (removed 22) transitions.
// Phase 1: matrix 425 rows 165 cols
[2025-06-01 02:14:33] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:33] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-01 02:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:33] [INFO ] State equation strengthened by 390 read => feed constraints.
[2025-06-01 02:14:35] [INFO ] Implicit Places using invariants and state equation in 2481 ms returned []
Implicit Place search using SMT with State Equation took 2688 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 165/177 places, 425/461 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64787 ms. Remains : 165/177 places, 425/461 transitions.
RANDOM walk for 40000 steps (702 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (64 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1102585 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 1
Probabilistic random walk after 1102585 steps, saw 141507 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
[2025-06-01 02:14:39] [INFO ] Invariant cache hit.
[2025-06-01 02:14:39] [INFO ] State equation strengthened by 390 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/177 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 99/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/196 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/205 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 279/484 variables, 59/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 248/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/589 variables, 62/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/589 variables, 43/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/589 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/590 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/590 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/590 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 566 constraints, problems are : Problem set: 0 solved, 1 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 165/165 constraints, ReadFeed: 390/390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/177 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 99/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/196 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/205 variables, 9/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 279/484 variables, 59/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 248/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/484 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 105/589 variables, 62/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/589 variables, 43/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/589 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/590 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/590 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/590 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/590 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 165/165 constraints, ReadFeed: 390/390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 874ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 425/425 transitions.
Applied a total of 0 rules in 9 ms. Remains 165 /165 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 165/165 places, 425/425 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 425/425 transitions.
Applied a total of 0 rules in 11 ms. Remains 165 /165 variables (removed 0) and now considering 425/425 (removed 0) transitions.
[2025-06-01 02:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:40] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-01 02:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:14:40] [INFO ] State equation strengthened by 390 read => feed constraints.
[2025-06-01 02:14:42] [INFO ] Implicit Places using invariants and state equation in 2479 ms returned []
Implicit Place search using SMT with State Equation took 2692 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:14:42] [INFO ] Redundant transitions in 4 ms returned []
Running 415 sub problems to find dead transitions.
[2025-06-01 02:14:42] [INFO ] Invariant cache hit.
[2025-06-01 02:14:42] [INFO ] State equation strengthened by 390 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:14:44] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:14:46] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (OVERLAPS) 425/589 variables, 164/177 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Detected timeout of ITS tools.
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 390/567 constraints. Problems are: Problem set: 11 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/590 variables, and 567 constraints, problems are : Problem set: 11 solved, 404 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/165 constraints, ReadFeed: 390/390 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 404 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 11/11 constraints. Problems are: Problem set: 11 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 2/13 constraints. Problems are: Problem set: 11 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 11 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 425/589 variables, 164/177 constraints. Problems are: Problem set: 11 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 390/567 constraints. Problems are: Problem set: 11 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 404/971 constraints. Problems are: Problem set: 11 solved, 404 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 1)
(t2 0)
(t3 1)
(t4 0)
(t5 1)
(t6 0)
(t7 1)
(t8 0)
(t9 0)
(t10 0)
(t11 0)
(t12 0)
(t13 0)
(t14 0)
(t15 0)
(t16 0)
(t17 0)
(t18 0)
(t19 2)
(t20 0)
(t21 1)
(t22 0)
(t23 0)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 2)
(t31 0)
(t32 0)
(t33 0)
(t34 0)
(t35 0)
(t36 0)
(t37 0)
(t38 0)
(t39 0)
(t40 3)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/590 variables, and 971 constraints, problems are : Problem set: 11 solved, 404 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 164/165 constraints, ReadFeed: 390/390 constraints, PredecessorRefiner: 404/415 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 11 solved, 404 unsolved
Search for dead transitions found 11 dead transitions in 60078ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 165/165 places, 414/425 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 162 transition count 408
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 162 transition count 408
Applied a total of 6 rules in 12 ms. Remains 162 /165 variables (removed 3) and now considering 408/414 (removed 6) transitions.
// Phase 1: matrix 408 rows 162 cols
[2025-06-01 02:15:42] [INFO ] Computed 12 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:15:42] [INFO ] Implicit Places using invariants in 189 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 205 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 161/165 places, 408/425 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 160 transition count 407
Applied a total of 10 rules in 27 ms. Remains 160 /161 variables (removed 1) and now considering 407/408 (removed 1) transitions.
// Phase 1: matrix 407 rows 160 cols
[2025-06-01 02:15:43] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:15:43] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-01 02:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:15:43] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-06-01 02:15:46] [INFO ] Implicit Places using invariants and state equation in 3570 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3726 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 159/165 places, 407/425 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 157 transition count 405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 156 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 156 transition count 402
Applied a total of 14 rules in 23 ms. Remains 156 /159 variables (removed 3) and now considering 402/407 (removed 5) transitions.
// Phase 1: matrix 402 rows 156 cols
[2025-06-01 02:15:46] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:15:46] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-01 02:15:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:15:47] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-06-01 02:15:48] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 156/165 places, 402/425 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 69034 ms. Remains : 156/165 places, 402/425 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09 in 219987 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 466 rows 182 cols
[2025-06-01 02:15:48] [INFO ] Computed 12 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (174 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (15 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:15:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:15:49] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 02:15:49] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:15:49] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2025-06-01 02:15:49] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 02:15:49] [INFO ] [Real]Added 402 Read/Feed constraints in 49 ms returned sat
[2025-06-01 02:15:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:15:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:15:49] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:15:49] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2025-06-01 02:15:49] [INFO ] [Nat]Added 402 Read/Feed constraints in 70 ms returned sat
[2025-06-01 02:15:49] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 30 ms.
[2025-06-01 02:15:49] [INFO ] Added : 9 causal constraints over 2 iterations in 135 ms. Result :sat
Minimization took 502 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 178 transition count 462
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 178 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 177 transition count 461
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 177 transition count 461
Applied a total of 15 rules in 18 ms. Remains 177 /182 variables (removed 5) and now considering 461/466 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 177/182 places, 461/466 transitions.
// Phase 1: matrix 461 rows 177 cols
[2025-06-01 02:15:50] [INFO ] Computed 12 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (17784 resets) in 2584 ms. (386 steps per ms)
BEST_FIRST walk for 1000001 steps (1702 resets) in 586 ms. (1703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:15:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:15:53] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 02:15:53] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:15:53] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2025-06-01 02:15:53] [INFO ] State equation strengthened by 415 read => feed constraints.
[2025-06-01 02:15:53] [INFO ] [Real]Added 415 Read/Feed constraints in 53 ms returned sat
[2025-06-01 02:15:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:15:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:15:53] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:15:53] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2025-06-01 02:15:53] [INFO ] [Nat]Added 415 Read/Feed constraints in 64 ms returned sat
[2025-06-01 02:15:53] [INFO ] Computed and/alt/rep : 313/982/313 causal constraints (skipped 138 transitions) in 30 ms.
[2025-06-01 02:15:54] [INFO ] Added : 8 causal constraints over 2 iterations in 139 ms. Result :sat
Minimization took 730 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 177/177 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2025-06-01 02:15:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:15:55] [INFO ] Implicit Places using invariants in 419 ms returned []
[2025-06-01 02:15:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:15:55] [INFO ] State equation strengthened by 415 read => feed constraints.
[2025-06-01 02:15:57] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:15:57] [INFO ] Redundant transitions in 4 ms returned []
Running 451 sub problems to find dead transitions.
[2025-06-01 02:15:57] [INFO ] Invariant cache hit.
[2025-06-01 02:15:57] [INFO ] State equation strengthened by 415 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:00] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:00] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:00] [INFO ] Deduced a trap composed of 15 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-01 02:16:00] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:00] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:00] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:00] [INFO ] Deduced a trap composed of 2 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:00] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:00] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:01] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:01] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:01] [INFO ] Deduced a trap composed of 14 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-01 02:16:01] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:01] [INFO ] Deduced a trap composed of 14 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-01 02:16:01] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:01] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:01] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:01] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:02] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 14 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-01 02:16:03] [INFO ] Deduced a trap composed of 15 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-01 02:16:03] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:03] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:04] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:04] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:04] [INFO ] Deduced a trap composed of 15 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-01 02:16:04] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:04] [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-01 02:16:04] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:07] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:08] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:09] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:09] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:09] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:09] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:09] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:10] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:10] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:11] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:13] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:17] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:16:18] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/638 variables, and 93 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/177 constraints, ReadFeed: 0/415 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 81/93 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (OVERLAPS) 461/637 variables, 176/269 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Problem TDEAD156 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 415/684 constraints. Problems are: Problem set: 25 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 426/1110 constraints. Problems are: Problem set: 25 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/638 variables, and 1110 constraints, problems are : Problem set: 25 solved, 426 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 426/451 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 25 solved, 426 unsolved
Search for dead transitions found 25 dead transitions in 60091ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/177 places, 436/461 transitions.
Graph (complete) has 761 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 162 transition count 408
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 162 transition count 408
Applied a total of 29 rules in 7 ms. Remains 162 /177 variables (removed 15) and now considering 408/436 (removed 28) transitions.
// Phase 1: matrix 408 rows 162 cols
[2025-06-01 02:16:57] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:16:57] [INFO ] Implicit Places using invariants in 162 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 161/177 places, 408/461 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 160 transition count 407
Applied a total of 10 rules in 16 ms. Remains 160 /161 variables (removed 1) and now considering 407/408 (removed 1) transitions.
// Phase 1: matrix 407 rows 160 cols
[2025-06-01 02:16:57] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:16:57] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-01 02:16:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:16:57] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-06-01 02:17:00] [INFO ] Implicit Places using invariants and state equation in 2848 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3056 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 159/177 places, 407/461 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 157 transition count 405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 156 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 156 transition count 402
Applied a total of 14 rules in 18 ms. Remains 156 /159 variables (removed 3) and now considering 402/407 (removed 5) transitions.
// Phase 1: matrix 402 rows 156 cols
[2025-06-01 02:17:00] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:17:00] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-01 02:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:17:00] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-06-01 02:17:03] [INFO ] Implicit Places using invariants and state equation in 2674 ms returned []
Implicit Place search using SMT with State Equation took 2868 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 156/177 places, 402/461 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 68582 ms. Remains : 156/177 places, 402/461 transitions.
[2025-06-01 02:17:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20575 resets) in 2536 ms. (394 steps per ms)
BEST_FIRST walk for 1000001 steps (1860 resets) in 556 ms. (1795 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:17:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:17:06] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-01 02:17:06] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 02:17:06] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-06-01 02:17:06] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-06-01 02:17:06] [INFO ] [Real]Added 355 Read/Feed constraints in 44 ms returned sat
[2025-06-01 02:17:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:17:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-01 02:17:06] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 02:17:06] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2025-06-01 02:17:06] [INFO ] [Nat]Added 355 Read/Feed constraints in 57 ms returned sat
[2025-06-01 02:17:07] [INFO ] Computed and/alt/rep : 252/829/252 causal constraints (skipped 140 transitions) in 25 ms.
[2025-06-01 02:17:07] [INFO ] Added : 9 causal constraints over 2 iterations in 118 ms. Result :sat
Minimization took 392 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-06-01 02:17:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:17:07] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-01 02:17:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:17:07] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-06-01 02:17:10] [INFO ] Implicit Places using invariants and state equation in 2724 ms returned []
Implicit Place search using SMT with State Equation took 2907 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:17:10] [INFO ] Redundant transitions in 3 ms returned []
Running 392 sub problems to find dead transitions.
[2025-06-01 02:17:10] [INFO ] Invariant cache hit.
[2025-06-01 02:17:10] [INFO ] State equation strengthened by 355 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/558 variables, and 520 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 392/912 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SMT process timed out in 60071ms, After SMT, problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62993 ms. Remains : 156/156 places, 402/402 transitions.
[2025-06-01 02:18:10] [INFO ] Flatten gal took : 12 ms
[2025-06-01 02:18:10] [INFO ] Flatten gal took : 13 ms
[2025-06-01 02:18:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1540131281440585969.gal : 2 ms
[2025-06-01 02:18:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13534001426333751935.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/ReachabilityCardinality1540131281440585969.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13534001426333751935.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/ReachabilityCardinality13534001426333751935.prop.
RANDOM walk for 40000 steps (814 resets) in 345 ms. (115 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 19
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :19 after 24
BEST_FIRST walk for 40004 steps (70 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :24 after 25
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :25 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 52
BEST_FIRST walk for 40004 steps (72 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :52 after 176
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :176 after 260
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :260 after 2545
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2545 after 4894
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4894 after 26326
Interrupted probabilistic random walk after 844522 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :0 out of 2
Probabilistic random walk after 844522 steps, saw 109211 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
[2025-06-01 02:18:13] [INFO ] Invariant cache hit.
[2025-06-01 02:18:13] [INFO ] State equation strengthened by 355 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:18:13] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 284/509 variables, 70/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 231/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 21 (OVERLAPS) 49/558 variables, 43/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/558 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :26326 after 82833
At refinement iteration 19 (OVERLAPS) 284/509 variables, 70/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 231/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/558 variables, 43/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 6/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/558 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 927ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 402/402 transitions.
RANDOM walk for 40000 steps (810 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (69 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1126423 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :0 out of 1
Probabilistic random walk after 1126423 steps, saw 143273 distinct states, run finished after 3001 ms. (steps per millisecond=375 ) properties seen :0
[2025-06-01 02:18:17] [INFO ] Invariant cache hit.
[2025-06-01 02:18:17] [INFO ] State equation strengthened by 355 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 284/509 variables, 70/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/558 variables, 43/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/558 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:18:18] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 284/509 variables, 70/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 231/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/558 variables, 43/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 6/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/558 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 759ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-06-01 02:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:18] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-01 02:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:18:18] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-06-01 02:18:21] [INFO ] Implicit Places using invariants and state equation in 2628 ms returned []
Implicit Place search using SMT with State Equation took 2779 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:18:21] [INFO ] Redundant transitions in 3 ms returned []
Running 392 sub problems to find dead transitions.
[2025-06-01 02:18:21] [INFO ] Invariant cache hit.
[2025-06-01 02:18:21] [INFO ] State equation strengthened by 355 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :82833 after 667545
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/558 variables, and 520 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :667545 after 5.86167e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Detected timeout of ITS tools.
[2025-06-01 02:19:00] [INFO ] Flatten gal took : 12 ms
[2025-06-01 02:19:00] [INFO ] Applying decomposition
[2025-06-01 02:19:00] [INFO ] Flatten gal took : 10 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/graph7560401875470095728.txt' '-o' '/tmp/graph7560401875470095728.bin' '-w' '/tmp/graph7560401875470095728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7560401875470095728.bin' '-l' '-1' '-v' '-w' '/tmp/graph7560401875470095728.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:19:00] [INFO ] Decomposing Gal with order
[2025-06-01 02:19:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:19:00] [INFO ] Removed a total of 339 redundant transitions.
[2025-06-01 02:19:00] [INFO ] Flatten gal took : 44 ms
[2025-06-01 02:19:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 8 ms.
[2025-06-01 02:19:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5000725245642167014.gal : 4 ms
[2025-06-01 02:19:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15534479219114370012.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/ReachabilityCardinality5000725245642167014.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15534479219114370012.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality15534479219114370012.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 154
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :154 after 156
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :156 after 159
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :159 after 161
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :161 after 170
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :170 after 221
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :221 after 8282
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8282 after 104994
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 392/912 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :104994 after 5.64078e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SMT process timed out in 60079ms, After SMT, problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62875 ms. Remains : 156/156 places, 402/402 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 328 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 349 transitions.
Graph (complete) has 106 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 5 ms. Remains 2 /156 variables (removed 154) and now considering 3/402 (removed 399) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2025-06-01 02:19:21] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:19:21] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:19:21] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-01 02:19:21] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:19:21] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:19:21] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:19:21] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:19:21] [INFO ] Flatten gal took : 1 ms
[2025-06-01 02:19:21] [INFO ] Flatten gal took : 0 ms
[2025-06-01 02:19:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10196975391480144073.gal : 0 ms
[2025-06-01 02:19:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11325122646495515544.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/ReachabilityCardinality10196975391480144073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11325122646495515544.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/ReachabilityCardinality11325122646495515544.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,9,0.002357,3880,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
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,2,0.002675,4136,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 82 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10 in 212521 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 466 rows 182 cols
[2025-06-01 02:19:21] [INFO ] Computed 12 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (177 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (14 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:19:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:19:21] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:19:21] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:19:21] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-06-01 02:19:21] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 02:19:21] [INFO ] [Real]Added 402 Read/Feed constraints in 46 ms returned sat
[2025-06-01 02:19:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:19:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:19:21] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:19:21] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2025-06-01 02:19:22] [INFO ] [Nat]Added 402 Read/Feed constraints in 72 ms returned sat
[2025-06-01 02:19:22] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 30 ms.
[2025-06-01 02:19:22] [INFO ] Added : 10 causal constraints over 2 iterations in 147 ms. Result :sat
Minimization took 504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 178 transition count 462
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 178 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 177 transition count 461
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 177 transition count 461
Applied a total of 15 rules in 20 ms. Remains 177 /182 variables (removed 5) and now considering 461/466 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 177/182 places, 461/466 transitions.
// Phase 1: matrix 461 rows 177 cols
[2025-06-01 02:19:22] [INFO ] Computed 12 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (17821 resets) in 2469 ms. (404 steps per ms)
BEST_FIRST walk for 1000001 steps (1700 resets) in 559 ms. (1785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:19:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:19:25] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-01 02:19:25] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:19:25] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-06-01 02:19:25] [INFO ] State equation strengthened by 415 read => feed constraints.
[2025-06-01 02:19:26] [INFO ] [Real]Added 415 Read/Feed constraints in 52 ms returned sat
[2025-06-01 02:19: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-01 02:19:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:19:26] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:19:26] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-01 02:19:26] [INFO ] [Nat]Added 415 Read/Feed constraints in 57 ms returned sat
[2025-06-01 02:19:26] [INFO ] Computed and/alt/rep : 313/982/313 causal constraints (skipped 138 transitions) in 28 ms.
[2025-06-01 02:19:26] [INFO ] Added : 14 causal constraints over 3 iterations in 187 ms. Result :sat
Minimization took 698 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 5 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 177/177 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 461/461 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2025-06-01 02:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:27] [INFO ] Implicit Places using invariants in 413 ms returned []
[2025-06-01 02:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:19:27] [INFO ] State equation strengthened by 415 read => feed constraints.
[2025-06-01 02:19:29] [INFO ] Implicit Places using invariants and state equation in 1996 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:19:29] [INFO ] Redundant transitions in 4 ms returned []
Running 451 sub problems to find dead transitions.
[2025-06-01 02:19:29] [INFO ] Invariant cache hit.
[2025-06-01 02:19:29] [INFO ] State equation strengthened by 415 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 2 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:34] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:34] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:34] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:35] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 14 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-01 02:19:36] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:40] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:40] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:40] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:40] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:40] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:40] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:41] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:42] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:42] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:42] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:42] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:42] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:43] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:45] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:46] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:46] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:46] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:46] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:47] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:48] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:48] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:48] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:48] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:48] [INFO ] Deduced a trap composed of 16 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-01 02:19:50] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:50] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:51] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:52] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:19:52] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 11/94 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/638 variables, and 94 constraints, problems are : Problem set: 0 solved, 451 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/177 constraints, ReadFeed: 0/415 constraints, PredecessorRefiner: 451/451 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 451 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 82/94 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 451 unsolved
At refinement iteration 4 (OVERLAPS) 461/637 variables, 176/270 constraints. Problems are: Problem set: 0 solved, 451 unsolved
Problem TDEAD156 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 415/685 constraints. Problems are: Problem set: 25 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 426/1111 constraints. Problems are: Problem set: 25 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/638 variables, and 1111 constraints, problems are : Problem set: 25 solved, 426 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 176/177 constraints, ReadFeed: 415/415 constraints, PredecessorRefiner: 426/451 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 25 solved, 426 unsolved
Search for dead transitions found 25 dead transitions in 60109ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 177/177 places, 436/461 transitions.
Graph (complete) has 761 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 162 transition count 408
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 162 transition count 408
Applied a total of 29 rules in 7 ms. Remains 162 /177 variables (removed 15) and now considering 408/436 (removed 28) transitions.
// Phase 1: matrix 408 rows 162 cols
[2025-06-01 02:20:29] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:29] [INFO ] Implicit Places using invariants in 230 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 231 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 161/177 places, 408/461 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 160 transition count 407
Applied a total of 10 rules in 14 ms. Remains 160 /161 variables (removed 1) and now considering 407/408 (removed 1) transitions.
// Phase 1: matrix 407 rows 160 cols
[2025-06-01 02:20:30] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:30] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-01 02:20:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:30] [INFO ] State equation strengthened by 367 read => feed constraints.
[2025-06-01 02:20:33] [INFO ] Implicit Places using invariants and state equation in 3073 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3258 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 159/177 places, 407/461 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 157 transition count 405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 156 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 156 transition count 402
Applied a total of 14 rules in 18 ms. Remains 156 /159 variables (removed 3) and now considering 402/407 (removed 5) transitions.
// Phase 1: matrix 402 rows 156 cols
[2025-06-01 02:20:33] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:33] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-01 02:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:33] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-06-01 02:20:35] [INFO ] Implicit Places using invariants and state equation in 1976 ms returned []
Implicit Place search using SMT with State Equation took 2138 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 156/177 places, 402/461 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 68203 ms. Remains : 156/177 places, 402/461 transitions.
[2025-06-01 02:20:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20630 resets) in 2528 ms. (395 steps per ms)
BEST_FIRST walk for 1000001 steps (1892 resets) in 557 ms. (1792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:20:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:20:38] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-06-01 02:20:38] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 02:20:38] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-06-01 02:20:38] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-06-01 02:20:38] [INFO ] [Real]Added 355 Read/Feed constraints in 53 ms returned sat
[2025-06-01 02:20:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:20:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-06-01 02:20:38] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 02:20:38] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2025-06-01 02:20:38] [INFO ] [Nat]Added 355 Read/Feed constraints in 51 ms returned sat
[2025-06-01 02:20:39] [INFO ] Computed and/alt/rep : 252/829/252 causal constraints (skipped 140 transitions) in 27 ms.
[2025-06-01 02:20:39] [INFO ] Added : 17 causal constraints over 5 iterations in 208 ms. Result :sat
Minimization took 482 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-06-01 02:20:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:39] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-01 02:20:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:20:40] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-06-01 02:20:41] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2195 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:20:41] [INFO ] Redundant transitions in 3 ms returned []
Running 392 sub problems to find dead transitions.
[2025-06-01 02:20:41] [INFO ] Invariant cache hit.
[2025-06-01 02:20:41] [INFO ] State equation strengthened by 355 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/558 variables, and 520 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 392/912 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/558 variables, and 912 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62286 ms. Remains : 156/156 places, 402/402 transitions.
[2025-06-01 02:21:42] [INFO ] Flatten gal took : 10 ms
[2025-06-01 02:21:42] [INFO ] Flatten gal took : 9 ms
[2025-06-01 02:21:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15223015188127610330.gal : 3 ms
[2025-06-01 02:21:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7335508442082788150.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/ReachabilityCardinality15223015188127610330.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7335508442082788150.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/ReachabilityCardinality7335508442082788150.prop.
RANDOM walk for 40000 steps (826 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
BEST_FIRST walk for 40003 steps (73 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 43
BEST_FIRST walk for 40003 steps (71 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :43 after 46
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :46 after 51
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :51 after 58
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :58 after 88
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :88 after 494
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :494 after 2056
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2056 after 4633
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4633 after 13075
Interrupted probabilistic random walk after 842531 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 2
Probabilistic random walk after 842531 steps, saw 108881 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2025-06-01 02:21:45] [INFO ] Invariant cache hit.
[2025-06-01 02:21:45] [INFO ] State equation strengthened by 355 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 284/509 variables, 70/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 49/558 variables, 43/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/558 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/558 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :13075 after 80101
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:21:45] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 284/509 variables, 70/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 231/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/558 variables, 43/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 6/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/558 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1118ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 402/402 transitions.
RANDOM walk for 40000 steps (825 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (73 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1117622 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :0 out of 1
Probabilistic random walk after 1117622 steps, saw 141781 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
[2025-06-01 02:21:49] [INFO ] Invariant cache hit.
[2025-06-01 02:21:49] [INFO ] State equation strengthened by 355 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 284/509 variables, 70/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/509 variables, 231/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/509 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/558 variables, 43/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/558 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/558 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/37 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/190 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/217 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/225 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:21:49] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 284/509 variables, 70/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/509 variables, 231/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/509 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 49/558 variables, 43/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/558 variables, 6/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/558 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/558 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 811ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 156/156 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2025-06-01 02:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:21:50] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-01 02:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:21:50] [INFO ] State equation strengthened by 355 read => feed constraints.
[2025-06-01 02:21:52] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:21:52] [INFO ] Redundant transitions in 4 ms returned []
Running 392 sub problems to find dead transitions.
[2025-06-01 02:21:52] [INFO ] Invariant cache hit.
[2025-06-01 02:21:52] [INFO ] State equation strengthened by 355 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :80101 after 4.09139e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 557/558 variables, and 520 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 402/557 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 355/520 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Detected timeout of ITS tools.
[2025-06-01 02:22:32] [INFO ] Flatten gal took : 10 ms
[2025-06-01 02:22:32] [INFO ] Applying decomposition
[2025-06-01 02:22:32] [INFO ] Flatten gal took : 10 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/graph10663499476257308927.txt' '-o' '/tmp/graph10663499476257308927.bin' '-w' '/tmp/graph10663499476257308927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10663499476257308927.bin' '-l' '-1' '-v' '-w' '/tmp/graph10663499476257308927.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:22:32] [INFO ] Decomposing Gal with order
[2025-06-01 02:22:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:22:32] [INFO ] Removed a total of 329 redundant transitions.
[2025-06-01 02:22:32] [INFO ] Flatten gal took : 54 ms
[2025-06-01 02:22:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 6 ms.
[2025-06-01 02:22:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4884067836318789438.gal : 9 ms
[2025-06-01 02:22:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18217369531265041439.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/ReachabilityCardinality4884067836318789438.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18217369531265041439.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality18217369531265041439.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 107
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :107 after 107
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :107 after 107
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :107 after 183
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :183 after 293
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :293 after 3967
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3967 after 6683
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6683 after 86066
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :86066 after 647787
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 392/912 constraints. Problems are: Problem set: 0 solved, 392 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :647787 after 2.90212e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/558 variables, and 912 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/156 constraints, ReadFeed: 355/355 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62400 ms. Remains : 156/156 places, 402/402 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 328 edges and 156 vertex of which 116 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 113 places
Drop transitions (Empty/Sink Transition effects.) removed 269 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 349 transitions.
Graph (complete) has 106 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 3 ms. Remains 2 /156 variables (removed 154) and now considering 3/402 (removed 399) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2025-06-01 02:22:52] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:22:52] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:22:52] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-01 02:22:52] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:22:52] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:22:52] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:22:52] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:22:52] [INFO ] Flatten gal took : 1 ms
[2025-06-01 02:22:52] [INFO ] Flatten gal took : 0 ms
[2025-06-01 02:22:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3469904323493416976.gal : 0 ms
[2025-06-01 02:22:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8906061093050730367.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/ReachabilityCardinality3469904323493416976.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8906061093050730367.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/ReachabilityCardinality8906061093050730367.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,9,0.003124,3880,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
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,2,0.003577,4136,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 90 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11 in 211226 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 466 rows 182 cols
[2025-06-01 02:22:52] [INFO ] Computed 12 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (170 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (17 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:22:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 02:22:52] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:22:52] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:22:52] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-06-01 02:22:52] [INFO ] State equation strengthened by 402 read => feed constraints.
[2025-06-01 02:22:53] [INFO ] [Real]Added 402 Read/Feed constraints in 46 ms returned sat
[2025-06-01 02:22: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-01 02:22:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:22:53] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:22:53] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2025-06-01 02:22:53] [INFO ] [Nat]Added 402 Read/Feed constraints in 63 ms returned sat
[2025-06-01 02:22:53] [INFO ] Computed and/alt/rep : 316/940/316 causal constraints (skipped 140 transitions) in 30 ms.
[2025-06-01 02:22:53] [INFO ] Added : 8 causal constraints over 2 iterations in 134 ms. Result :sat
Minimization took 503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 466/466 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 177 transition count 461
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 177 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 176 transition count 460
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 176 transition count 460
Applied a total of 16 rules in 21 ms. Remains 176 /182 variables (removed 6) and now considering 460/466 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 176/182 places, 460/466 transitions.
// Phase 1: matrix 460 rows 176 cols
[2025-06-01 02:22:53] [INFO ] Computed 12 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (17800 resets) in 2607 ms. (383 steps per ms)
BEST_FIRST walk for 1000001 steps (1689 resets) in 586 ms. (1703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:22:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:22:57] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-01 02:22:57] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-01 02:22:57] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-06-01 02:22:57] [INFO ] State equation strengthened by 416 read => feed constraints.
[2025-06-01 02:22:57] [INFO ] [Real]Added 416 Read/Feed constraints in 51 ms returned sat
[2025-06-01 02:22: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-01 02:22:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 02:22:57] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-01 02:22:57] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2025-06-01 02:22:57] [INFO ] [Nat]Added 416 Read/Feed constraints in 63 ms returned sat
[2025-06-01 02:22:57] [INFO ] Computed and/alt/rep : 312/986/312 causal constraints (skipped 138 transitions) in 29 ms.
[2025-06-01 02:22:57] [INFO ] Added : 8 causal constraints over 2 iterations in 141 ms. Result :sat
Minimization took 576 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 460/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 176/176 places, 460/460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 460/460 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 460/460 (removed 0) transitions.
[2025-06-01 02:22:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:22:58] [INFO ] Implicit Places using invariants in 411 ms returned []
[2025-06-01 02:22:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:22:59] [INFO ] State equation strengthened by 416 read => feed constraints.
[2025-06-01 02:23:00] [INFO ] Implicit Places using invariants and state equation in 1987 ms returned []
Implicit Place search using SMT with State Equation took 2399 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:23:00] [INFO ] Redundant transitions in 4 ms returned []
Running 450 sub problems to find dead transitions.
[2025-06-01 02:23:00] [INFO ] Invariant cache hit.
[2025-06-01 02:23:00] [INFO ] State equation strengthened by 416 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:03] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:03] [INFO ] Deduced a trap composed of 2 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-01 02:23:03] [INFO ] Deduced a trap composed of 14 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-01 02:23:04] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:04] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:04] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:04] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:04] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:04] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:05] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:05] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:05] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:05] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:05] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:06] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:06] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:06] [INFO ] Deduced a trap composed of 2 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:06] [INFO ] Deduced a trap composed of 2 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-01 02:23:06] [INFO ] Deduced a trap composed of 2 places in 104 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:06] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:06] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:06] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 14 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-01 02:23:07] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:07] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:08] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:08] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:08] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:08] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:08] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:10] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:10] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:10] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:10] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:11] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:12] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:12] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:12] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:12] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:13] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:15] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:15] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:15] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:15] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:16] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:16] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:16] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:16] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:17] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:17] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:17] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:20] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:24] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:24] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:24] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:26] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/636 variables, and 95 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/176 constraints, ReadFeed: 0/416 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 83/95 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:23:32] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (OVERLAPS) 460/635 variables, 175/271 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Problem TDEAD153 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 416/687 constraints. Problems are: Problem set: 25 solved, 425 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/635 variables, 425/1112 constraints. Problems are: Problem set: 25 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 635/636 variables, and 1112 constraints, problems are : Problem set: 25 solved, 425 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 175/176 constraints, ReadFeed: 416/416 constraints, PredecessorRefiner: 425/450 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 25 solved, 425 unsolved
Search for dead transitions found 25 dead transitions in 60100ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 176/176 places, 435/460 transitions.
Graph (complete) has 761 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 161 transition count 407
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 161 transition count 407
Applied a total of 29 rules in 7 ms. Remains 161 /176 variables (removed 15) and now considering 407/435 (removed 28) transitions.
// Phase 1: matrix 407 rows 161 cols
[2025-06-01 02:24:00] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:24:01] [INFO ] Implicit Places using invariants in 211 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 212 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 160/176 places, 407/460 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 159 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 159 transition count 406
Applied a total of 10 rules in 15 ms. Remains 159 /160 variables (removed 1) and now considering 406/407 (removed 1) transitions.
// Phase 1: matrix 406 rows 159 cols
[2025-06-01 02:24:01] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:24:01] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-01 02:24:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:24:01] [INFO ] State equation strengthened by 368 read => feed constraints.
[2025-06-01 02:24:03] [INFO ] Implicit Places using invariants and state equation in 2570 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2769 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 158/176 places, 406/460 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 156 transition count 404
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 155 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 155 transition count 401
Applied a total of 14 rules in 17 ms. Remains 155 /158 variables (removed 3) and now considering 401/406 (removed 5) transitions.
// Phase 1: matrix 401 rows 155 cols
[2025-06-01 02:24:04] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:24:04] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-01 02:24:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:24:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:24:06] [INFO ] Implicit Places using invariants and state equation in 2541 ms returned []
Implicit Place search using SMT with State Equation took 2726 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 155/176 places, 401/460 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 68260 ms. Remains : 155/176 places, 401/460 transitions.
[2025-06-01 02:24:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20626 resets) in 2543 ms. (393 steps per ms)
BEST_FIRST walk for 1000001 steps (1854 resets) in 562 ms. (1776 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2025-06-01 02:24:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:24:09] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-06-01 02:24:09] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 02:24:10] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-06-01 02:24:10] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:24:10] [INFO ] [Real]Added 356 Read/Feed constraints in 43 ms returned sat
[2025-06-01 02:24:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 02:24:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-01 02:24:10] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 02:24:10] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-06-01 02:24:10] [INFO ] [Nat]Added 356 Read/Feed constraints in 87 ms returned sat
[2025-06-01 02:24:10] [INFO ] Computed and/alt/rep : 251/833/251 causal constraints (skipped 140 transitions) in 28 ms.
[2025-06-01 02:24:10] [INFO ] Added : 22 causal constraints over 6 iterations in 383 ms. Result :sat
Minimization took 350 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-06-01 02:24:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:24:11] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-01 02:24:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:24:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:24:13] [INFO ] Implicit Places using invariants and state equation in 2526 ms returned []
Implicit Place search using SMT with State Equation took 2722 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:24:13] [INFO ] Redundant transitions in 3 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 02:24:13] [INFO ] Invariant cache hit.
[2025-06-01 02:24:13] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/556 variables, and 520 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 391/911 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/556 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 912 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62825 ms. Remains : 155/155 places, 401/401 transitions.
[2025-06-01 02:25:13] [INFO ] Flatten gal took : 10 ms
[2025-06-01 02:25:13] [INFO ] Flatten gal took : 10 ms
[2025-06-01 02:25:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12692245829109643626.gal : 2 ms
[2025-06-01 02:25:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9882608385834475741.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/ReachabilityCardinality12692245829109643626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9882608385834475741.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/ReachabilityCardinality9882608385834475741.prop.
RANDOM walk for 40000 steps (825 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (76 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (72 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 45
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :45 after 47
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :47 after 64
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :64 after 87
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :87 after 502
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :502 after 2069
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2069 after 4691
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4691 after 25146
Interrupted probabilistic random walk after 897298 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 2
Probabilistic random walk after 897298 steps, saw 115667 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
[2025-06-01 02:25:17] [INFO ] Invariant cache hit.
[2025-06-01 02:25:17] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/55 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 150/205 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/231 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/239 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 281/520 variables, 73/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 234/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 36/556 variables, 36/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :25146 after 71573
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/55 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 150/205 variables, 30/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 112/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/231 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 3/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/239 variables, 8/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 8/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:17] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 1/180 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 281/520 variables, 73/253 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 234/487 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/556 variables, 36/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/556 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/556 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 931ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 155/155 places, 401/401 transitions.
RANDOM walk for 40000 steps (825 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (73 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1130042 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :0 out of 1
Probabilistic random walk after 1130042 steps, saw 143400 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
[2025-06-01 02:25:21] [INFO ] Invariant cache hit.
[2025-06-01 02:25:21] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/55 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 150/205 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/231 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/239 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 281/520 variables, 73/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 234/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 36/556 variables, 36/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/556 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/55 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 150/205 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/231 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/239 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 02:25:21] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 281/520 variables, 73/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 234/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/556 variables, 36/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/556 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/556 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 777ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 155/155 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2025-06-01 02:25:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:25:22] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-01 02:25:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 02:25:22] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:25:24] [INFO ] Implicit Places using invariants and state equation in 2624 ms returned []
Implicit Place search using SMT with State Equation took 2811 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 02:25:24] [INFO ] Redundant transitions in 4 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 02:25:24] [INFO ] Invariant cache hit.
[2025-06-01 02:25:24] [INFO ] State equation strengthened by 356 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :71573 after 1.4353e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/556 variables, and 520 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/555 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 356/520 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Detected timeout of ITS tools.
[2025-06-01 02:26:04] [INFO ] Flatten gal took : 9 ms
[2025-06-01 02:26:04] [INFO ] Applying decomposition
[2025-06-01 02:26:04] [INFO ] Flatten gal took : 9 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/graph14999852647122095460.txt' '-o' '/tmp/graph14999852647122095460.bin' '-w' '/tmp/graph14999852647122095460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14999852647122095460.bin' '-l' '-1' '-v' '-w' '/tmp/graph14999852647122095460.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:26:04] [INFO ] Decomposing Gal with order
[2025-06-01 02:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:26:04] [INFO ] Removed a total of 328 redundant transitions.
[2025-06-01 02:26:04] [INFO ] Flatten gal took : 38 ms
[2025-06-01 02:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 6 ms.
[2025-06-01 02:26:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1407319255316989948.gal : 4 ms
[2025-06-01 02:26:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3217319809798483817.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/ReachabilityCardinality1407319255316989948.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3217319809798483817.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality3217319809798483817.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :32 after 32
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :32 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 86
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :86 after 4377
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4377 after 146687
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :146687 after 494654
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 391/911 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :494654 after 9.16481e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/556 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 912 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62908 ms. Remains : 155/155 places, 401/401 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 327 edges and 155 vertex of which 115 / 155 are part of one of the 3 SCC in 0 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 268 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 348 transitions.
Graph (complete) has 106 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 2 transition count 3
Applied a total of 51 rules in 7 ms. Remains 2 /155 variables (removed 153) and now considering 3/401 (removed 398) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2025-06-01 02:26:24] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:26:24] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 02:26:24] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:26:24] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:26:24] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:26:24] [INFO ] Flatten gal took : 1 ms
[2025-06-01 02:26:24] [INFO ] Flatten gal took : 0 ms
[2025-06-01 02:26:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18128364811778185029.gal : 0 ms
[2025-06-01 02:26:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16884612039179681639.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/ReachabilityCardinality18128364811778185029.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16884612039179681639.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/ReachabilityCardinality16884612039179681639.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 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,9,0.005548,3880,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
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,2,0.005917,4136,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 100 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14 in 212207 ms.
[2025-06-01 02:26:24] [INFO ] Flatten gal took : 10 ms
[2025-06-01 02:26:24] [INFO ] Applying decomposition
[2025-06-01 02:26:24] [INFO ] Flatten gal took : 10 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/graph17985988420043759676.txt' '-o' '/tmp/graph17985988420043759676.bin' '-w' '/tmp/graph17985988420043759676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17985988420043759676.bin' '-l' '-1' '-v' '-w' '/tmp/graph17985988420043759676.weights' '-q' '0' '-e' '0.001'
[2025-06-01 02:26:25] [INFO ] Decomposing Gal with order
[2025-06-01 02:26:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 02:26:25] [INFO ] Removed a total of 346 redundant transitions.
[2025-06-01 02:26:25] [INFO ] Flatten gal took : 30 ms
[2025-06-01 02:26:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 231 labels/synchronizations in 6 ms.
[2025-06-01 02:26:25] [INFO ] Time to serialize gal into /tmp/UpperBounds8238115589907701892.gal : 5 ms
[2025-06-01 02:26:25] [INFO ] Time to serialize properties into /tmp/UpperBounds4304585176777170638.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/UpperBounds8238115589907701892.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4304585176777170638.prop' '--nowitness'
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 ...283
Loading property file /tmp/UpperBounds4304585176777170638.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\_flat,2.57229e+09,259.161,2395408,129526,9835,3.84914e+06,79632,968,6.93648e+06,461,1.32959e+06,0
Total reachable state count : 2572287657
Verifying 7 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-02 :0 <= u2.Node6requestsent1 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-02 1 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
CANInsertWithFailure-PT-010-UpperBounds-02,0,274.046,2395408,1,0,3.84914e+06,79632,1102,6.93648e+06,494,1.32959e+06,2393
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-07 :0 <= i1.u1.Node0requestsent8 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-07 1 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
CANInsertWithFailure-PT-010-UpperBounds-07,0,274.099,2395408,1,0,3.84914e+06,79632,1123,6.93648e+06,494,1.32959e+06,2435
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-08 :0 <= i11.u19.Node2GiveAnswer9 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-08 1 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
CANInsertWithFailure-PT-010-UpperBounds-08,0,274.423,2395408,1,0,3.84914e+06,79632,1155,6.93648e+06,500,1.32959e+06,3054
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-09 :0 <= i7.u11.Node5GiveAnswer4 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-09 1 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
CANInsertWithFailure-PT-010-UpperBounds-09,0,274.971,2395408,1,0,3.84914e+06,79632,1182,6.93648e+06,504,1.32959e+06,3243
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-10 :0 <= i8.u13.Node6GiveAnswer3 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-10 1 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
CANInsertWithFailure-PT-010-UpperBounds-10,0,277.688,2395408,1,0,3.84914e+06,79632,1212,6.93648e+06,517,1.32959e+06,3542
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-11 :0 <= u2.Node1GiveAnswer3 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-11 1 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
CANInsertWithFailure-PT-010-UpperBounds-11,0,277.693,2395408,1,0,3.84914e+06,79632,1229,6.93648e+06,522,1.32959e+06,3633
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-14 :0 <= i5.u7.Node3requestsent2 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-14 1 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
CANInsertWithFailure-PT-010-UpperBounds-14,0,277.703,2395408,1,0,3.84914e+06,79632,1251,6.93648e+06,524,1.32959e+06,3750
Total runtime 2063272 ms.
BK_STOP 1748745063547
--------------------
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="CANInsertWithFailure-PT-010"
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 CANInsertWithFailure-PT-010, 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 r030-smll-174853813600261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 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 ;