About the Execution of 2024-gold for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15686.200 | 3600000.00 | 4329476.00 | 10199.60 | 1 ? ? 1 ? 1 1 1 1 1 1 1 1 ? 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r139-smll-174876533200042.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 gold2024
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200042
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 6.3M 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 MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748899609418
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:26:51] [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-02 21:26:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:26:52] [INFO ] Load time of PNML (sax parser for PT used): 625 ms
[2025-06-02 21:26:52] [INFO ] Transformed 6876 places.
[2025-06-02 21:26:52] [INFO ] Transformed 9571 transitions.
[2025-06-02 21:26:52] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 895 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 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]
[2025-06-02 21:26:52] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2025-06-02 21:26:53] [INFO ] Computed 649 invariants in 817 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:[17, 51, 1, 51, 51, 17, 51, 51, 17, 1, 17, 17, 17, 1, 51, 17]
RANDOM walk for 10000 steps (120 resets) in 202 ms. (49 steps per ms)
BEST_FIRST walk for 160010 steps (544 resets) in 834 ms. (191 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0] Max Struct:[17, 51, 1, 51, 51, 17, 51, 51, 17, 1, 17, 17, 17, 1, 51, 17]
[2025-06-02 21:26:54] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
[2025-06-02 21:26:54] [INFO ] Invariant cache hit.
[2025-06-02 21:26:56] [INFO ] [Real]Absence check using 54 positive place invariants in 182 ms returned sat
[2025-06-02 21:26:56] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 255 ms returned unsat
[2025-06-02 21:26:57] [INFO ] [Real]Absence check using 54 positive place invariants in 172 ms returned sat
[2025-06-02 21:26:58] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 344 ms returned sat
[2025-06-02 21:27:01] [INFO ] [Real]Absence check using state equation in 3387 ms returned unknown
[2025-06-02 21:27:02] [INFO ] [Real]Absence check using 54 positive place invariants in 157 ms returned sat
[2025-06-02 21:27:03] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 341 ms returned sat
[2025-06-02 21:27:06] [INFO ] [Real]Absence check using state equation in 3391 ms returned unknown
[2025-06-02 21:27:07] [INFO ] [Real]Absence check using 54 positive place invariants in 159 ms returned sat
[2025-06-02 21:27:08] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 246 ms returned unsat
[2025-06-02 21:27:09] [INFO ] [Real]Absence check using 54 positive place invariants in 162 ms returned sat
[2025-06-02 21:27:09] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 354 ms returned sat
[2025-06-02 21:27:13] [INFO ] [Real]Absence check using state equation in 3432 ms returned unknown
[2025-06-02 21:27:14] [INFO ] [Real]Absence check using 54 positive place invariants in 153 ms returned sat
[2025-06-02 21:27:14] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 246 ms returned unsat
[2025-06-02 21:27:15] [INFO ] [Real]Absence check using 54 positive place invariants in 157 ms returned sat
[2025-06-02 21:27:16] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 344 ms returned sat
[2025-06-02 21:27:19] [INFO ] [Real]Absence check using state equation in 3483 ms returned unknown
[2025-06-02 21:27:20] [INFO ] [Real]Absence check using 54 positive place invariants in 152 ms returned sat
[2025-06-02 21:27:20] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 242 ms returned unsat
[2025-06-02 21:27:22] [INFO ] [Real]Absence check using 54 positive place invariants in 156 ms returned sat
[2025-06-02 21:27:22] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 250 ms returned unsat
[2025-06-02 21:27:23] [INFO ] [Real]Absence check using 54 positive place invariants in 156 ms returned sat
[2025-06-02 21:27:23] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 349 ms returned sat
[2025-06-02 21:27:27] [INFO ] [Real]Absence check using state equation in 3485 ms returned unknown
[2025-06-02 21:27:28] [INFO ] [Real]Absence check using 54 positive place invariants in 156 ms returned sat
[2025-06-02 21:27:28] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 246 ms returned unsat
[2025-06-02 21:27:30] [INFO ] [Real]Absence check using 54 positive place invariants in 155 ms returned sat
[2025-06-02 21:27:30] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 242 ms returned unsat
[2025-06-02 21:27:31] [INFO ] [Real]Absence check using 54 positive place invariants in 156 ms returned sat
[2025-06-02 21:27:31] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 238 ms returned unsat
[2025-06-02 21:27:32] [INFO ] [Real]Absence check using 54 positive place invariants in 159 ms returned sat
[2025-06-02 21:27:33] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 370 ms returned sat
[2025-06-02 21:27:36] [INFO ] [Real]Absence check using state equation in 3431 ms returned unknown
[2025-06-02 21:27:37] [INFO ] [Real]Absence check using 54 positive place invariants in 165 ms returned sat
[2025-06-02 21:27:38] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 332 ms returned unsat
[2025-06-02 21:27:39] [INFO ] [Real]Absence check using 54 positive place invariants in 156 ms returned sat
[2025-06-02 21:27:40] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 368 ms returned sat
[2025-06-02 21:27:43] [INFO ] [Real]Absence check using state equation in 3294 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0] Max Struct:[1, 51, 1, 1, 51, 1, 51, 1, 1, 1, 1, 1, 1, 1, 1, 17]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 1, 51, 51, 1, 1, 17]
Support contains 7 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.35 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2172 transitions
Trivial Post-agglo rules discarded 2172 transitions
Performed 2172 trivial Post agglomeration. Transition count delta: 2172
Iterating post reduction 0 with 2172 rules applied. Total rules applied 2173 place count 6840 transition count 7399
Reduce places removed 2172 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2175 rules applied. Total rules applied 4348 place count 4668 transition count 7396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4351 place count 4665 transition count 7396
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 4351 place count 4665 transition count 7124
Deduced a syphon composed of 272 places in 14 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 4895 place count 4393 transition count 7124
Discarding 1900 places :
Symmetric choice reduction at 3 with 1900 rule applications. Total rules 6795 place count 2493 transition count 5224
Iterating global reduction 3 with 1900 rules applied. Total rules applied 8695 place count 2493 transition count 5224
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 8695 place count 2493 transition count 5211
Deduced a syphon composed of 13 places in 7 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 8721 place count 2480 transition count 5211
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 8955 place count 2246 transition count 3339
Iterating global reduction 3 with 234 rules applied. Total rules applied 9189 place count 2246 transition count 3339
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 9223 place count 2229 transition count 3322
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 9386 place count 2229 transition count 4797
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 9549 place count 2066 transition count 4797
Partial Free-agglomeration rule applied 51 times.
Drop transitions (Partial Free agglomeration) removed 51 transitions
Iterating global reduction 4 with 51 rules applied. Total rules applied 9600 place count 2066 transition count 4797
Applied a total of 9600 rules in 3328 ms. Remains 2066 /6876 variables (removed 4810) and now considering 4797/9571 (removed 4774) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3353 ms. Remains : 2066/6876 places, 4797/9571 transitions.
[2025-06-02 21:27:46] [INFO ] Flow matrix only has 4400 transitions (discarded 397 similar events)
// Phase 1: matrix 4400 rows 2066 cols
[2025-06-02 21:27:46] [INFO ] Computed 613 invariants in 111 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 2, 2, 1, 1, 1]
RANDOM walk for 1000000 steps (20077 resets) in 24619 ms. (40 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5106114 steps (19802 resets) in 30006 ms. (170 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0, 0] Max Struct:[2, 1, 2, 2, 1, 1]
[2025-06-02 21:28:41] [INFO ] Flow matrix only has 4400 transitions (discarded 397 similar events)
[2025-06-02 21:28:41] [INFO ] Invariant cache hit.
[2025-06-02 21:28:41] [INFO ] [Real]Absence check using 33 positive place invariants in 56 ms returned sat
[2025-06-02 21:28:41] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 143 ms returned sat
[2025-06-02 21:28:43] [INFO ] [Real]Absence check using state equation in 1980 ms returned sat
[2025-06-02 21:28:44] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 21:28:44] [INFO ] [Real]Added 2722 Read/Feed constraints in 710 ms returned sat
[2025-06-02 21:28:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:28:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 53 ms returned sat
[2025-06-02 21:28:45] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 173 ms returned sat
[2025-06-02 21:28:47] [INFO ] [Nat]Absence check using state equation in 2032 ms returned sat
[2025-06-02 21:28:49] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1956 ms returned sat
[2025-06-02 21:28:52] [INFO ] Deduced a trap composed of 186 places in 2838 ms of which 176 ms to minimize.
[2025-06-02 21:28:57] [INFO ] Deduced a trap composed of 364 places in 2926 ms of which 21 ms to minimize.
[2025-06-02 21:29:01] [INFO ] Deduced a trap composed of 357 places in 2962 ms of which 20 ms to minimize.
[2025-06-02 21:29:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 12554 ms
[2025-06-02 21:29:02] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2700 transitions) in 623 ms.
[2025-06-02 21:29:05] [INFO ] Added : 17 causal constraints over 4 iterations in 3034 ms. Result :sat
Minimization took 5359 ms.
[2025-06-02 21:29:11] [INFO ] [Real]Absence check using 33 positive place invariants in 58 ms returned sat
[2025-06-02 21:29:11] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 193 ms returned sat
[2025-06-02 21:29:13] [INFO ] [Real]Absence check using state equation in 1955 ms returned sat
[2025-06-02 21:29:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:29:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 51 ms returned sat
[2025-06-02 21:29:13] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 173 ms returned sat
[2025-06-02 21:29:15] [INFO ] [Nat]Absence check using state equation in 1951 ms returned sat
[2025-06-02 21:29:19] [INFO ] [Nat]Added 2722 Read/Feed constraints in 4089 ms returned sat
[2025-06-02 21:29:23] [INFO ] Deduced a trap composed of 245 places in 3466 ms of which 28 ms to minimize.
[2025-06-02 21:29:27] [INFO ] Deduced a trap composed of 368 places in 3773 ms of which 27 ms to minimize.
[2025-06-02 21:29:31] [INFO ] Deduced a trap composed of 241 places in 4012 ms of which 17 ms to minimize.
[2025-06-02 21:29:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 12044 ms
[2025-06-02 21:29:33] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2700 transitions) in 1627 ms.
[2025-06-02 21:29:36] [INFO ] Added : 23 causal constraints over 5 iterations in 4623 ms. Result :sat
Minimization took 5708 ms.
[2025-06-02 21:29:42] [INFO ] [Real]Absence check using 33 positive place invariants in 80 ms returned sat
[2025-06-02 21:29:42] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 249 ms returned sat
[2025-06-02 21:29:44] [INFO ] [Real]Absence check using state equation in 1753 ms returned sat
[2025-06-02 21:29:45] [INFO ] [Real]Added 2722 Read/Feed constraints in 801 ms returned sat
[2025-06-02 21:29:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:29:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 83 ms returned sat
[2025-06-02 21:29:46] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 271 ms returned sat
[2025-06-02 21:29:48] [INFO ] [Nat]Absence check using state equation in 2342 ms returned sat
[2025-06-02 21:29:51] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2637 ms returned sat
[2025-06-02 21:29:55] [INFO ] Deduced a trap composed of 342 places in 4207 ms of which 28 ms to minimize.
[2025-06-02 21:30:00] [INFO ] Deduced a trap composed of 318 places in 3466 ms of which 22 ms to minimize.
[2025-06-02 21:30:05] [INFO ] Deduced a trap composed of 394 places in 3763 ms of which 18 ms to minimize.
[2025-06-02 21:30:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 14248 ms
[2025-06-02 21:30:06] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2700 transitions) in 676 ms.
[2025-06-02 21:30:08] [INFO ] Added : 16 causal constraints over 4 iterations in 3013 ms. Result :sat
Minimization took 5339 ms.
[2025-06-02 21:30:14] [INFO ] [Real]Absence check using 33 positive place invariants in 47 ms returned sat
[2025-06-02 21:30:14] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 64 ms returned unsat
[2025-06-02 21:30:15] [INFO ] [Real]Absence check using 33 positive place invariants in 50 ms returned sat
[2025-06-02 21:30:15] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 166 ms returned sat
[2025-06-02 21:30:17] [INFO ] [Real]Absence check using state equation in 2222 ms returned sat
[2025-06-02 21:30:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 49 ms returned sat
[2025-06-02 21:30:18] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 186 ms returned sat
[2025-06-02 21:30:19] [INFO ] [Nat]Absence check using state equation in 1903 ms returned sat
[2025-06-02 21:30:23] [INFO ] [Nat]Added 2722 Read/Feed constraints in 3162 ms returned sat
[2025-06-02 21:30:27] [INFO ] Deduced a trap composed of 214 places in 4710 ms of which 31 ms to minimize.
[2025-06-02 21:30:32] [INFO ] Deduced a trap composed of 322 places in 4414 ms of which 30 ms to minimize.
[2025-06-02 21:30:37] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 14026 ms
[2025-06-02 21:30:37] [INFO ] [Real]Absence check using 33 positive place invariants in 49 ms returned sat
[2025-06-02 21:30:37] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 170 ms returned sat
[2025-06-02 21:30:39] [INFO ] [Real]Absence check using state equation in 1982 ms returned sat
[2025-06-02 21:30:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 84 ms returned sat
[2025-06-02 21:30:40] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 268 ms returned sat
[2025-06-02 21:30:42] [INFO ] [Nat]Absence check using state equation in 2048 ms returned sat
[2025-06-02 21:30:44] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1970 ms returned sat
[2025-06-02 21:30:48] [INFO ] Deduced a trap composed of 233 places in 4237 ms of which 30 ms to minimize.
[2025-06-02 21:30:53] [INFO ] Deduced a trap composed of 340 places in 3589 ms of which 30 ms to minimize.
[2025-06-02 21:30:59] [INFO ] Deduced a trap composed of 324 places in 4231 ms of which 30 ms to minimize.
[2025-06-02 21:31:04] [INFO ] Deduced a trap composed of 290 places in 4301 ms of which 31 ms to minimize.
[2025-06-02 21:31:09] [INFO ] Deduced a trap composed of 284 places in 3437 ms of which 17 ms to minimize.
[2025-06-02 21:31:15] [INFO ] Deduced a trap composed of 268 places in 4626 ms of which 30 ms to minimize.
[2025-06-02 21:31:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 32456 ms
[2025-06-02 21:31:17] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2700 transitions) in 411 ms.
[2025-06-02 21:31:20] [INFO ] Added : 16 causal constraints over 4 iterations in 3218 ms. Result :sat
Minimization took 4565 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0, 0] Max Struct:[2, 1, 2, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[2, 1, 2, 1, 1]
Support contains 5 out of 2066 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2066/2066 places, 4797/4797 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2066 transition count 4796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2065 transition count 4796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 2064 transition count 4795
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 2064 transition count 4795
Applied a total of 4 rules in 570 ms. Remains 2064 /2066 variables (removed 2) and now considering 4795/4797 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 2064/2066 places, 4795/4797 transitions.
[2025-06-02 21:31:25] [INFO ] Flow matrix only has 4398 transitions (discarded 397 similar events)
// Phase 1: matrix 4398 rows 2064 cols
[2025-06-02 21:31:25] [INFO ] Computed 613 invariants in 152 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[2, 1, 2, 1, 1]
RANDOM walk for 1000000 steps (20076 resets) in 24715 ms. (40 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3521062 steps (13655 resets) in 20004 ms. (176 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
[2025-06-02 21:32:10] [INFO ] Flow matrix only has 4398 transitions (discarded 397 similar events)
[2025-06-02 21:32:10] [INFO ] Invariant cache hit.
[2025-06-02 21:32:10] [INFO ] [Real]Absence check using 33 positive place invariants in 49 ms returned sat
[2025-06-02 21:32:11] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 230 ms returned sat
[2025-06-02 21:32:13] [INFO ] [Real]Absence check using state equation in 2024 ms returned sat
[2025-06-02 21:32:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:32:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 80 ms returned sat
[2025-06-02 21:32:14] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 275 ms returned sat
[2025-06-02 21:32:15] [INFO ] [Nat]Absence check using state equation in 1920 ms returned sat
[2025-06-02 21:32:15] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 21:32:17] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1702 ms returned sat
[2025-06-02 21:32:22] [INFO ] Deduced a trap composed of 236 places in 4687 ms of which 31 ms to minimize.
[2025-06-02 21:32:28] [INFO ] Deduced a trap composed of 357 places in 4519 ms of which 30 ms to minimize.
[2025-06-02 21:32:33] [INFO ] Deduced a trap composed of 388 places in 4189 ms of which 28 ms to minimize.
[2025-06-02 21:32:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 17029 ms
[2025-06-02 21:32:35] [INFO ] Computed and/alt/rep : 1682/4438/1682 causal constraints (skipped 2699 transitions) in 370 ms.
[2025-06-02 21:32:37] [INFO ] Added : 17 causal constraints over 4 iterations in 2377 ms. Result :sat
Minimization took 5226 ms.
[2025-06-02 21:32:42] [INFO ] [Real]Absence check using 33 positive place invariants in 48 ms returned sat
[2025-06-02 21:32:42] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 172 ms returned sat
[2025-06-02 21:32:44] [INFO ] [Real]Absence check using state equation in 1920 ms returned sat
[2025-06-02 21:32:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:32:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 74 ms returned sat
[2025-06-02 21:32:45] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 217 ms returned sat
[2025-06-02 21:32:47] [INFO ] [Nat]Absence check using state equation in 1840 ms returned sat
[2025-06-02 21:32:50] [INFO ] [Nat]Added 2722 Read/Feed constraints in 3424 ms returned sat
[2025-06-02 21:32:51] [INFO ] Computed and/alt/rep : 1682/4438/1682 causal constraints (skipped 2699 transitions) in 400 ms.
[2025-06-02 21:32:54] [INFO ] Added : 25 causal constraints over 5 iterations in 3075 ms. Result :sat
Minimization took 5211 ms.
[2025-06-02 21:32:59] [INFO ] [Real]Absence check using 33 positive place invariants in 75 ms returned sat
[2025-06-02 21:33:00] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 254 ms returned sat
[2025-06-02 21:33:02] [INFO ] [Real]Absence check using state equation in 2115 ms returned sat
[2025-06-02 21:33:03] [INFO ] [Real]Added 2722 Read/Feed constraints in 721 ms returned sat
[2025-06-02 21:33:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:33:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 80 ms returned sat
[2025-06-02 21:33:04] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 270 ms returned sat
[2025-06-02 21:33:06] [INFO ] [Nat]Absence check using state equation in 2032 ms returned sat
[2025-06-02 21:33:08] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2354 ms returned sat
[2025-06-02 21:33:12] [INFO ] Deduced a trap composed of 274 places in 4407 ms of which 31 ms to minimize.
[2025-06-02 21:33:18] [INFO ] Deduced a trap composed of 381 places in 4404 ms of which 31 ms to minimize.
[2025-06-02 21:33:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 11606 ms
[2025-06-02 21:33:20] [INFO ] Computed and/alt/rep : 1682/4438/1682 causal constraints (skipped 2699 transitions) in 396 ms.
[2025-06-02 21:33:22] [INFO ] Added : 18 causal constraints over 4 iterations in 2434 ms. Result :sat
Minimization took 5071 ms.
[2025-06-02 21:33:27] [INFO ] [Real]Absence check using 33 positive place invariants in 48 ms returned sat
[2025-06-02 21:33:28] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 173 ms returned sat
[2025-06-02 21:33:29] [INFO ] [Real]Absence check using state equation in 1853 ms returned sat
[2025-06-02 21:33:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:33:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 51 ms returned sat
[2025-06-02 21:33:30] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 233 ms returned sat
[2025-06-02 21:33:32] [INFO ] [Nat]Absence check using state equation in 2111 ms returned sat
[2025-06-02 21:33:36] [INFO ] [Nat]Added 2722 Read/Feed constraints in 3612 ms returned sat
[2025-06-02 21:33:39] [INFO ] Deduced a trap composed of 343 places in 3009 ms of which 28 ms to minimize.
[2025-06-02 21:33:44] [INFO ] Deduced a trap composed of 190 places in 4999 ms of which 30 ms to minimize.
[2025-06-02 21:33:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 8673 ms
[2025-06-02 21:33:45] [INFO ] Computed and/alt/rep : 1682/4438/1682 causal constraints (skipped 2699 transitions) in 563 ms.
[2025-06-02 21:33:49] [INFO ] Added : 19 causal constraints over 6 iterations in 4169 ms. Result :sat
Minimization took 5239 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
Support contains 4 out of 2064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2064/2064 places, 4795/4795 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2064 transition count 4794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2063 transition count 4794
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 2063 transition count 4793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 2062 transition count 4793
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 2061 transition count 4792
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 2061 transition count 4792
Applied a total of 6 rules in 671 ms. Remains 2061 /2064 variables (removed 3) and now considering 4792/4795 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 671 ms. Remains : 2061/2064 places, 4792/4795 transitions.
[2025-06-02 21:33:55] [INFO ] Flow matrix only has 4395 transitions (discarded 397 similar events)
// Phase 1: matrix 4395 rows 2061 cols
[2025-06-02 21:33:55] [INFO ] Computed 613 invariants in 93 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
RANDOM walk for 1000000 steps (20083 resets) in 25089 ms. (39 steps per ms)
BEST_FIRST walk for 3545639 steps (13751 resets) in 20004 ms. (177 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
[2025-06-02 21:34:40] [INFO ] Flow matrix only has 4395 transitions (discarded 397 similar events)
[2025-06-02 21:34:40] [INFO ] Invariant cache hit.
[2025-06-02 21:34:40] [INFO ] [Real]Absence check using 33 positive place invariants in 58 ms returned sat
[2025-06-02 21:34:40] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 182 ms returned sat
[2025-06-02 21:34:42] [INFO ] [Real]Absence check using state equation in 2085 ms returned sat
[2025-06-02 21:34:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:34:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 91 ms returned sat
[2025-06-02 21:34:43] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 268 ms returned sat
[2025-06-02 21:34:46] [INFO ] [Nat]Absence check using state equation in 2189 ms returned sat
[2025-06-02 21:34:46] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 21:34:48] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2076 ms returned sat
[2025-06-02 21:34:52] [INFO ] Deduced a trap composed of 219 places in 3918 ms of which 30 ms to minimize.
[2025-06-02 21:34:57] [INFO ] Deduced a trap composed of 344 places in 4603 ms of which 30 ms to minimize.
[2025-06-02 21:35:03] [INFO ] Deduced a trap composed of 398 places in 4132 ms of which 22 ms to minimize.
[2025-06-02 21:35:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 15886 ms
[2025-06-02 21:35:04] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2698 transitions) in 549 ms.
[2025-06-02 21:35:07] [INFO ] Added : 17 causal constraints over 4 iterations in 3080 ms. Result :sat
Minimization took 5658 ms.
[2025-06-02 21:35:13] [INFO ] [Real]Absence check using 33 positive place invariants in 86 ms returned sat
[2025-06-02 21:35:13] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 255 ms returned sat
[2025-06-02 21:35:16] [INFO ] [Real]Absence check using state equation in 2395 ms returned sat
[2025-06-02 21:35:17] [INFO ] [Real]Added 2722 Read/Feed constraints in 985 ms returned sat
[2025-06-02 21:35:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 71 ms returned sat
[2025-06-02 21:35:17] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 166 ms returned sat
[2025-06-02 21:35:20] [INFO ] [Nat]Absence check using state equation in 2228 ms returned sat
[2025-06-02 21:35:24] [INFO ] [Nat]Added 2722 Read/Feed constraints in 4259 ms returned sat
[2025-06-02 21:35:28] [INFO ] Deduced a trap composed of 471 places in 3847 ms of which 19 ms to minimize.
[2025-06-02 21:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4280 ms
[2025-06-02 21:35:29] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2698 transitions) in 606 ms.
[2025-06-02 21:35:33] [INFO ] Added : 26 causal constraints over 6 iterations in 5028 ms. Result :sat
Minimization took 5667 ms.
[2025-06-02 21:35:39] [INFO ] [Real]Absence check using 33 positive place invariants in 84 ms returned sat
[2025-06-02 21:35:40] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 264 ms returned sat
[2025-06-02 21:35:42] [INFO ] [Real]Absence check using state equation in 1984 ms returned sat
[2025-06-02 21:35:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:35:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 91 ms returned sat
[2025-06-02 21:35:43] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 257 ms returned sat
[2025-06-02 21:35:45] [INFO ] [Nat]Absence check using state equation in 2112 ms returned sat
[2025-06-02 21:35:46] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1790 ms returned sat
[2025-06-02 21:35:51] [INFO ] Deduced a trap composed of 285 places in 4576 ms of which 30 ms to minimize.
[2025-06-02 21:35:58] [INFO ] Deduced a trap composed of 176 places in 4690 ms of which 31 ms to minimize.
[2025-06-02 21:35:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 12037 ms
[2025-06-02 21:35:59] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2698 transitions) in 396 ms.
[2025-06-02 21:36:02] [INFO ] Added : 18 causal constraints over 4 iterations in 3100 ms. Result :sat
Minimization took 5521 ms.
[2025-06-02 21:36:08] [INFO ] [Real]Absence check using 33 positive place invariants in 87 ms returned sat
[2025-06-02 21:36:08] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 270 ms returned sat
[2025-06-02 21:36:10] [INFO ] [Real]Absence check using state equation in 2177 ms returned sat
[2025-06-02 21:36:11] [INFO ] [Real]Added 2722 Read/Feed constraints in 424 ms returned sat
[2025-06-02 21:36:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:36:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 91 ms returned sat
[2025-06-02 21:36:11] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 265 ms returned sat
[2025-06-02 21:36:14] [INFO ] [Nat]Absence check using state equation in 2115 ms returned sat
[2025-06-02 21:36:18] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 21:36:19] [INFO ] [Nat]Added 2722 Read/Feed constraints in 5472 ms returned sat
[2025-06-02 21:36:24] [INFO ] Deduced a trap composed of 327 places in 4493 ms of which 30 ms to minimize.
[2025-06-02 21:36:27] [INFO ] Deduced a trap composed of 277 places in 3580 ms of which 28 ms to minimize.
[2025-06-02 21:36:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 8738 ms
[2025-06-02 21:36:28] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2698 transitions) in 590 ms.
[2025-06-02 21:36:35] [INFO ] Deduced a trap composed of 311 places in 3487 ms of which 18 ms to minimize.
[2025-06-02 21:36:40] [INFO ] Deduced a trap composed of 259 places in 5036 ms of which 30 ms to minimize.
[2025-06-02 21:36:45] [INFO ] Deduced a trap composed of 406 places in 4702 ms of which 30 ms to minimize.
[2025-06-02 21:36:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 14546 ms
[2025-06-02 21:36:46] [INFO ] Added : 19 causal constraints over 4 iterations in 18585 ms. Result :sat
Minimization took 5787 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
Support contains 4 out of 2061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2061/2061 places, 4792/4792 transitions.
Applied a total of 0 rules in 188 ms. Remains 2061 /2061 variables (removed 0) and now considering 4792/4792 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 2061/2061 places, 4792/4792 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2061/2061 places, 4792/4792 transitions.
Applied a total of 0 rules in 201 ms. Remains 2061 /2061 variables (removed 0) and now considering 4792/4792 (removed 0) transitions.
[2025-06-02 21:36:52] [INFO ] Flow matrix only has 4395 transitions (discarded 397 similar events)
[2025-06-02 21:36:52] [INFO ] Invariant cache hit.
[2025-06-02 21:37:04] [INFO ] Implicit Places using invariants in 11173 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 107, 108, 120, 130, 138, 144, 148, 150, 169, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 205, 215, 227, 240, 252, 253, 254, 255, 256, 257, 258, 259, 260, 270, 278, 284, 288, 290, 292, 311, 317, 319, 320, 321, 322, 323, 324, 325, 327, 330, 332, 336, 343, 351, 361, 372, 382, 383, 384, 385, 386, 387, 388, 389, 390, 398, 404, 408, 410, 412, 414, 433, 439, 441, 442, 443, 444, 445, 446, 447, 448, 449, 451, 453, 455, 459, 465, 473, 482, 490, 491, 492, 493, 494, 495, 496, 497, 498, 504, 508, 510, 512, 514, 516, 535, 541, 543, 544, 545, 546, 547, 548, 549, 550, 551, 553, 555, 557, 559, 563, 569, 576, 582, 583, 584, 585, 586, 587, 588, 589, 590, 594, 596, 598, 600, 602, 604, 623, 629, 631, 632, 633, 634, 635, 636, 637, 638, 639, 641, 643, 645, 647, 649, 653, 658, 662, 663, 664, 665, 666, 667, 668, 669, 670, 672, 674, 676, 678, 680, 682, 701, 707, 709, 710, 711, 712, 713, 714, 715, 716, 717, 719, 721, 723, 725, 727, 729, 732, 734, 735, 736, 737, 738, 739, 740, 741, 742, 744, 746, 748, 750, 752, 754, 773, 779, 781, 782, 783, 784, 785, 786, 787, 788, 789, 791, 793, 795, 797, 799, 801, 803, 805, 806, 807, 808, 809, 810, 811, 812, 813, 815, 817, 819, 821, 823, 825, 844, 846, 849, 851, 852, 853, 854, 855, 856, 857, 858, 859, 861, 863, 865, 867, 869, 871, 873, 875, 876, 877, 878, 879, 880, 881, 882, 883, 885, 887, 889, 891, 893, 895, 914, 920, 922, 923, 924, 925, 926, 927, 928, 929, 930, 932, 934, 936, 938, 940, 942, 944, 946, 947, 948, 949, 950, 951, 952, 953, 954, 956, 958, 960, 962, 964, 966, 985, 991, 993, 994, 995, 996, 997, 998, 999, 1000, 1001, 1003, 1005, 1007, 1009, 1011, 1013, 1015, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1028, 1030, 1032, 1034, 1036, 1038, 1057, 1063, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1075, 1077, 1079, 1081, 1083, 1085, 1089, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1106, 1108, 1110, 1112, 1114, 1116, 1135, 1141, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1153, 1155, 1157, 1159, 1161, 1165, 1171, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1192, 1196, 1198, 1200, 1202, 1204, 1223, 1229, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1241, 1243, 1245, 1247, 1251, 1257, 1265, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1290, 1296, 1300, 1303, 1305, 1307, 1326, 1332, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1344, 1346, 1348, 1352, 1358, 1366, 1376, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1405, 1413, 1419, 1423, 1425, 1427, 1446, 1452, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1464, 1466, 1470, 1476, 1484, 1494, 1506, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1539, 1549, 1557, 1563, 1567, 1569, 1588, 1590, 1593, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1603, 1605, 1609, 1615, 1623, 1633, 1645, 1659, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1682, 1696, 1708, 1718, 1726, 1732, 1736, 1755]
[2025-06-02 21:37:04] [INFO ] Actually due to overlaps returned [169, 311, 433, 535, 623, 701, 773, 844, 914, 985, 1057, 1135, 1223, 1326, 1446, 1588, 1755, 4, 9, 10, 11, 12, 13, 14, 15, 16, 100, 101, 102, 103, 104, 105, 106, 107, 177, 178, 179, 180, 181, 182, 183, 184, 252, 253, 254, 255, 256, 257, 258, 259, 319, 320, 321, 322, 323, 324, 325, 382, 383, 384, 385, 386, 387, 388, 389, 441, 442, 443, 444, 445, 446, 447, 448, 490, 491, 492, 493, 494, 495, 496, 497, 543, 544, 545, 546, 547, 548, 549, 550, 582, 583, 584, 585, 586, 587, 588, 589, 631, 632, 633, 634, 635, 636, 637, 638, 662, 663, 664, 665, 666, 667, 668, 669, 709, 710, 711, 712, 713, 714, 715, 716, 734, 735, 736, 737, 738, 739, 740, 741, 781, 782, 783, 784, 785, 786, 787, 788, 805, 806, 807, 808, 809, 810, 811, 812, 846, 851, 852, 853, 854, 855, 856, 857, 858, 875, 876, 877, 878, 879, 880, 881, 882, 922, 923, 924, 925, 926, 927, 928, 929, 946, 947, 948, 949, 950, 951, 952, 953, 993, 994, 995, 996, 997, 998, 999, 1000, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1590, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681]
Discarding 291 places :
Implicit Place search using SMT only with invariants took 11191 ms to find 291 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1770/2061 places, 4792/4792 transitions.
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 255 place count 1515 transition count 4537
Iterating global reduction 0 with 255 rules applied. Total rules applied 510 place count 1515 transition count 4537
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 765 place count 1260 transition count 4282
Iterating global reduction 0 with 255 rules applied. Total rules applied 1020 place count 1260 transition count 4282
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1023 place count 1260 transition count 4279
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1026 place count 1257 transition count 4279
Applied a total of 1026 rules in 584 ms. Remains 1257 /1770 variables (removed 513) and now considering 4279/4792 (removed 513) transitions.
[2025-06-02 21:37:04] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
// Phase 1: matrix 3882 rows 1257 cols
[2025-06-02 21:37:04] [INFO ] Computed 322 invariants in 60 ms
[2025-06-02 21:37:12] [INFO ] Implicit Places using invariants in 7712 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 156, 158, 160, 164, 170, 178, 188, 200, 213, 225, 235, 243, 249, 253, 255, 257, 265, 268, 271, 273, 277, 284, 292, 302, 313, 323, 331, 337, 341, 343, 345, 347, 356, 358, 360, 362, 364, 368, 374, 382, 391, 399, 405, 409, 411, 413, 415, 417, 425, 427, 429, 431, 433, 435, 439, 445, 452, 458, 462, 464, 466, 468, 470, 472, 480, 482, 484, 486, 488, 490, 492, 496, 501, 505, 507, 509, 511, 513, 515, 517, 525, 527, 529, 531, 533, 535, 537, 539, 542, 544, 546, 548, 550, 552, 554, 556, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 586, 588, 590, 592, 594, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 622, 624, 626, 628, 630, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 659, 661, 663, 665, 667, 675, 677, 679, 681, 683, 685, 687, 689, 691, 694, 696, 698, 700, 702, 704, 706, 714, 716, 718, 720, 722, 724, 726, 728, 732, 737, 741, 743, 745, 747, 749, 751, 759, 761, 763, 765, 767, 769, 771, 775, 781, 788, 794, 798, 800, 802, 804, 806, 814, 816, 818, 820, 822, 824, 828, 834, 842, 851, 859, 865, 869, 872, 874, 876, 884, 886, 888, 890, 892, 896, 902, 910, 920, 931, 941, 949, 955, 959, 961, 963, 971, 973, 975, 977, 981, 987, 995, 1005, 1017, 1030, 1042, 1052, 1060, 1066, 1070, 1072, 1078, 1080, 1082, 1086, 1092, 1100, 1110, 1122, 1136, 1151, 1165, 1177, 1187, 1195, 1201, 1205]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 7725 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 985/2061 places, 4279/4792 transitions.
Applied a total of 0 rules in 145 ms. Remains 985 /985 variables (removed 0) and now considering 4279/4279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 19852 ms. Remains : 985/2061 places, 4279/4792 transitions.
[2025-06-02 21:37:12] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
// Phase 1: matrix 3882 rows 985 cols
[2025-06-02 21:37:12] [INFO ] Computed 50 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
RANDOM walk for 1000000 steps (21032 resets) in 24266 ms. (41 steps per ms)
BEST_FIRST walk for 4000004 steps (12060 resets) in 17009 ms. (235 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
[2025-06-02 21:37:53] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:37:53] [INFO ] Invariant cache hit.
[2025-06-02 21:37:54] [INFO ] [Real]Absence check using 31 positive place invariants in 43 ms returned sat
[2025-06-02 21:37:54] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2025-06-02 21:37:55] [INFO ] [Real]Absence check using state equation in 1458 ms returned sat
[2025-06-02 21:37:55] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 21:37:56] [INFO ] [Real]Added 2722 Read/Feed constraints in 607 ms returned sat
[2025-06-02 21:37:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:37:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-02 21:37:56] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 6 ms returned sat
[2025-06-02 21:37:58] [INFO ] [Nat]Absence check using state equation in 1553 ms returned sat
[2025-06-02 21:37:59] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1218 ms returned sat
[2025-06-02 21:38:01] [INFO ] Deduced a trap composed of 152 places in 1446 ms of which 16 ms to minimize.
[2025-06-02 21:38:03] [INFO ] Deduced a trap composed of 168 places in 1428 ms of which 15 ms to minimize.
[2025-06-02 21:38:06] [INFO ] Deduced a trap composed of 191 places in 1353 ms of which 15 ms to minimize.
[2025-06-02 21:38:09] [INFO ] Deduced a trap composed of 192 places in 1422 ms of which 13 ms to minimize.
[2025-06-02 21:38:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 11077 ms
[2025-06-02 21:38:10] [INFO ] Computed and/alt/rep : 1345/1954/1345 causal constraints (skipped 2475 transitions) in 326 ms.
[2025-06-02 21:38:12] [INFO ] Added : 15 causal constraints over 3 iterations in 1902 ms. Result :sat
Minimization took 4994 ms.
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 6 ms returned sat
[2025-06-02 21:38:19] [INFO ] [Real]Absence check using state equation in 1511 ms returned sat
[2025-06-02 21:38:20] [INFO ] [Real]Added 2722 Read/Feed constraints in 757 ms returned sat
[2025-06-02 21:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:38:20] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2025-06-02 21:38:22] [INFO ] [Nat]Absence check using state equation in 1693 ms returned sat
[2025-06-02 21:38:24] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2476 ms returned sat
[2025-06-02 21:38:26] [INFO ] Deduced a trap composed of 243 places in 1422 ms of which 15 ms to minimize.
[2025-06-02 21:38:28] [INFO ] Deduced a trap composed of 104 places in 1789 ms of which 8 ms to minimize.
[2025-06-02 21:38:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3650 ms
[2025-06-02 21:38:28] [INFO ] Computed and/alt/rep : 1345/1954/1345 causal constraints (skipped 2475 transitions) in 351 ms.
[2025-06-02 21:38:30] [INFO ] Added : 21 causal constraints over 5 iterations in 2444 ms. Result :sat
Minimization took 4989 ms.
[2025-06-02 21:38:35] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:38:35] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2025-06-02 21:38:37] [INFO ] [Real]Absence check using state equation in 1622 ms returned sat
[2025-06-02 21:38:37] [INFO ] [Real]Added 2722 Read/Feed constraints in 407 ms returned sat
[2025-06-02 21:38:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 41 ms returned sat
[2025-06-02 21:38:38] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2025-06-02 21:38:39] [INFO ] [Nat]Absence check using state equation in 1667 ms returned sat
[2025-06-02 21:38:41] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1211 ms returned sat
[2025-06-02 21:38:42] [INFO ] Deduced a trap composed of 199 places in 1433 ms of which 14 ms to minimize.
[2025-06-02 21:38:45] [INFO ] Deduced a trap composed of 175 places in 1431 ms of which 15 ms to minimize.
[2025-06-02 21:38:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4493 ms
[2025-06-02 21:38:46] [INFO ] Computed and/alt/rep : 1345/1954/1345 causal constraints (skipped 2475 transitions) in 545 ms.
[2025-06-02 21:38:47] [INFO ] Added : 15 causal constraints over 3 iterations in 2040 ms. Result :sat
Minimization took 4987 ms.
[2025-06-02 21:38:52] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:38:52] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2025-06-02 21:38:54] [INFO ] [Real]Absence check using state equation in 1441 ms returned sat
[2025-06-02 21:38:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:38:54] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2025-06-02 21:38:56] [INFO ] [Nat]Absence check using state equation in 1682 ms returned sat
[2025-06-02 21:38:59] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2718 ms returned sat
[2025-06-02 21:39:00] [INFO ] Deduced a trap composed of 210 places in 1423 ms of which 14 ms to minimize.
[2025-06-02 21:39:02] [INFO ] Deduced a trap composed of 68 places in 1781 ms of which 13 ms to minimize.
[2025-06-02 21:39:04] [INFO ] Deduced a trap composed of 69 places in 1912 ms of which 14 ms to minimize.
[2025-06-02 21:39:06] [INFO ] Deduced a trap composed of 67 places in 1728 ms of which 13 ms to minimize.
[2025-06-02 21:39:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7665 ms
[2025-06-02 21:39:07] [INFO ] Computed and/alt/rep : 1345/1954/1345 causal constraints (skipped 2475 transitions) in 531 ms.
[2025-06-02 21:39:08] [INFO ] Added : 13 causal constraints over 3 iterations in 2016 ms. Result :sat
Minimization took 4983 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
Support contains 4 out of 985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4279/4279 transitions.
Applied a total of 0 rules in 142 ms. Remains 985 /985 variables (removed 0) and now considering 4279/4279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 985/985 places, 4279/4279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4279/4279 transitions.
Applied a total of 0 rules in 176 ms. Remains 985 /985 variables (removed 0) and now considering 4279/4279 (removed 0) transitions.
[2025-06-02 21:39:14] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:39:14] [INFO ] Invariant cache hit.
[2025-06-02 21:39:17] [INFO ] Implicit Places using invariants in 3424 ms returned []
[2025-06-02 21:39:17] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:39:17] [INFO ] Invariant cache hit.
[2025-06-02 21:39:19] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 21:39:49] [INFO ] Performed 511/985 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:40:20] [INFO ] Performed 940/985 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-02 21:40:35] [INFO ] Implicit Places using invariants and state equation in 78018 ms returned []
Implicit Place search using SMT with State Equation took 81444 ms to find 0 implicit places.
[2025-06-02 21:40:35] [INFO ] Redundant transitions in 420 ms returned []
Running 4217 sub problems to find dead transitions.
[2025-06-02 21:40:36] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:40:36] [INFO ] Invariant cache hit.
[2025-06-02 21:40:36] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 0.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 0.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 1.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 0.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 0.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/983 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
SMT process timed out in 68800ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 68893ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150982 ms. Remains : 985/985 places, 4279/4279 transitions.
RANDOM walk for 40000 steps (839 resets) in 3395 ms. (11 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (119 resets) in 810 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (119 resets) in 755 ms. (52 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (119 resets) in 1007 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (118 resets) in 898 ms. (44 steps per ms) remains 8/8 properties
[2025-06-02 21:41:46] [INFO ] Flatten gal took : 1259 ms
BEST_FIRST walk for 40003 steps (121 resets) in 1004 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (119 resets) in 974 ms. (41 steps per ms) remains 8/8 properties
[2025-06-02 21:41:47] [INFO ] Flatten gal took : 497 ms
BEST_FIRST walk for 40004 steps (120 resets) in 973 ms. (41 steps per ms) remains 8/8 properties
[2025-06-02 21:41:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10543871960042149944.gal : 233 ms
[2025-06-02 21:41:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12817522486773280581.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10543871960042149944.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12817522486773280581.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (117 resets) in 993 ms. (40 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality12817522486773280581.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :49 after 53
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :53 after 69
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :69 after 92
Interrupted probabilistic random walk after 135729 steps, run timeout after 9001 ms. (steps per millisecond=15 ) properties seen :0 out of 8
Probabilistic random walk after 135729 steps, saw 56793 distinct states, run finished after 9005 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-02 21:41:57] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:41:57] [INFO ] Invariant cache hit.
[2025-06-02 21:41:57] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 884/888 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/888 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 18/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-02 21:41:58] [INFO ] Deduced a trap composed of 180 places in 938 ms of which 10 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :92 after 172
[2025-06-02 21:41:59] [INFO ] Deduced a trap composed of 180 places in 980 ms of which 9 ms to minimize.
[2025-06-02 21:42:00] [INFO ] Deduced a trap composed of 90 places in 1001 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 35/941 variables, 3/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/941 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 28/969 variables, 28/37 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/969 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 16/985 variables, 16/53 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/985 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SMT process timed out in 5122ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4279/4279 transitions.
Applied a total of 0 rules in 156 ms. Remains 985 /985 variables (removed 0) and now considering 4279/4279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 985/985 places, 4279/4279 transitions.
RANDOM walk for 40000 steps (839 resets) in 3502 ms. (11 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 606 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (119 resets) in 636 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 611 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 670 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (119 resets) in 590 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 599 ms. (66 steps per ms) remains 6/6 properties
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :172 after 489
Interrupted probabilistic random walk after 90008 steps, run timeout after 6001 ms. (steps per millisecond=14 ) properties seen :0 out of 6
Probabilistic random walk after 90008 steps, saw 37797 distinct states, run finished after 6001 ms. (steps per millisecond=14 ) properties seen :0
[2025-06-02 21:42:10] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:42:10] [INFO ] Invariant cache hit.
[2025-06-02 21:42:10] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 884/888 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/888 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/941 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/941 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 28/969 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/969 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 16/985 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/985 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 3882/4867 variables, 985/1035 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4867 variables, 2722/3757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4867 variables, 0/3757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/4867 variables, 0/3757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4867/4867 variables, and 3757 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4326 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 985/985 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 884/888 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/888 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-02 21:42:16] [INFO ] Deduced a trap composed of 90 places in 1058 ms of which 9 ms to minimize.
[2025-06-02 21:42:17] [INFO ] Deduced a trap composed of 83 places in 1020 ms of which 8 ms to minimize.
[2025-06-02 21:42:18] [INFO ] Deduced a trap composed of 100 places in 1024 ms of which 8 ms to minimize.
[2025-06-02 21:42:19] [INFO ] Deduced a trap composed of 224 places in 1035 ms of which 9 ms to minimize.
[2025-06-02 21:42:20] [INFO ] Deduced a trap composed of 84 places in 1024 ms of which 8 ms to minimize.
[2025-06-02 21:42:21] [INFO ] Deduced a trap composed of 132 places in 1027 ms of which 8 ms to minimize.
[2025-06-02 21:42:22] [INFO ] Deduced a trap composed of 115 places in 1027 ms of which 18 ms to minimize.
[2025-06-02 21:42:23] [INFO ] Deduced a trap composed of 132 places in 924 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/906 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 35/941 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-02 21:42:24] [INFO ] Deduced a trap composed of 5 places in 1114 ms of which 9 ms to minimize.
[2025-06-02 21:42:26] [INFO ] Deduced a trap composed of 69 places in 1101 ms of which 9 ms to minimize.
[2025-06-02 21:42:27] [INFO ] Deduced a trap composed of 27 places in 1113 ms of which 8 ms to minimize.
[2025-06-02 21:42:28] [INFO ] Deduced a trap composed of 27 places in 1123 ms of which 9 ms to minimize.
[2025-06-02 21:42:29] [INFO ] Deduced a trap composed of 82 places in 1006 ms of which 8 ms to minimize.
[2025-06-02 21:42:30] [INFO ] Deduced a trap composed of 57 places in 950 ms of which 8 ms to minimize.
[2025-06-02 21:42:31] [INFO ] Deduced a trap composed of 46 places in 1137 ms of which 9 ms to minimize.
[2025-06-02 21:42:32] [INFO ] Deduced a trap composed of 76 places in 1121 ms of which 9 ms to minimize.
[2025-06-02 21:42:33] [INFO ] Deduced a trap composed of 78 places in 1035 ms of which 8 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :489 after 1335
[2025-06-02 21:42:34] [INFO ] Deduced a trap composed of 84 places in 1131 ms of which 9 ms to minimize.
[2025-06-02 21:42:36] [INFO ] Deduced a trap composed of 71 places in 1112 ms of which 8 ms to minimize.
[2025-06-02 21:42:37] [INFO ] Deduced a trap composed of 98 places in 1119 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:42:38] [INFO ] Flatten gal took : 180 ms
[2025-06-02 21:42:38] [INFO ] Applying decomposition
[2025-06-02 21:42:38] [INFO ] Flatten gal took : 172 ms
[2025-06-02 21:42:38] [INFO ] Deduced a trap composed of 63 places in 1115 ms of which 9 ms to minimize.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7680029031045979424.txt' '-o' '/tmp/graph7680029031045979424.bin' '-w' '/tmp/graph7680029031045979424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7680029031045979424.bin' '-l' '-1' '-v' '-w' '/tmp/graph7680029031045979424.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:42:39] [INFO ] Decomposing Gal with order
[2025-06-02 21:42:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:42:39] [INFO ] Deduced a trap composed of 76 places in 973 ms of which 9 ms to minimize.
[2025-06-02 21:42:40] [INFO ] Deduced a trap composed of 71 places in 977 ms of which 9 ms to minimize.
[2025-06-02 21:42:40] [INFO ] Removed a total of 8103 redundant transitions.
[2025-06-02 21:42:41] [INFO ] Flatten gal took : 1544 ms
[2025-06-02 21:42:41] [INFO ] Deduced a trap composed of 189 places in 968 ms of which 9 ms to minimize.
[2025-06-02 21:42:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2761 labels/synchronizations in 417 ms.
[2025-06-02 21:42:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4645123877117495797.gal : 54 ms
[2025-06-02 21:42:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14575214283379842621.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4645123877117495797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14575214283379842621.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2025-06-02 21:42:42] [INFO ] Deduced a trap composed of 74 places in 948 ms of which 8 ms to minimize.
Loading property file /tmp/ReachabilityCardinality14575214283379842621.prop.
[2025-06-02 21:42:43] [INFO ] Deduced a trap composed of 83 places in 1136 ms of which 8 ms to minimize.
[2025-06-02 21:42:44] [INFO ] Deduced a trap composed of 100 places in 1113 ms of which 8 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 404
[2025-06-02 21:42:45] [INFO ] Deduced a trap composed of 86 places in 1151 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/941 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-02 21:42:46] [INFO ] Deduced a trap composed of 56 places in 1084 ms of which 9 ms to minimize.
[2025-06-02 21:42:48] [INFO ] Deduced a trap composed of 75 places in 1108 ms of which 8 ms to minimize.
[2025-06-02 21:42:49] [INFO ] Deduced a trap composed of 76 places in 1113 ms of which 8 ms to minimize.
[2025-06-02 21:42:50] [INFO ] Deduced a trap composed of 82 places in 1136 ms of which 8 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :404 after 1019
[2025-06-02 21:42:51] [INFO ] Deduced a trap composed of 96 places in 1136 ms of which 9 ms to minimize.
[2025-06-02 21:42:52] [INFO ] Deduced a trap composed of 82 places in 1146 ms of which 9 ms to minimize.
[2025-06-02 21:42:53] [INFO ] Deduced a trap composed of 85 places in 1156 ms of which 8 ms to minimize.
[2025-06-02 21:42:55] [INFO ] Deduced a trap composed of 131 places in 1117 ms of which 9 ms to minimize.
[2025-06-02 21:42:56] [INFO ] Deduced a trap composed of 130 places in 1147 ms of which 8 ms to minimize.
[2025-06-02 21:42:57] [INFO ] Deduced a trap composed of 94 places in 1084 ms of which 8 ms to minimize.
[2025-06-02 21:42:58] [INFO ] Deduced a trap composed of 94 places in 1087 ms of which 9 ms to minimize.
[2025-06-02 21:42:59] [INFO ] Deduced a trap composed of 96 places in 1128 ms of which 9 ms to minimize.
[2025-06-02 21:43:00] [INFO ] Deduced a trap composed of 76 places in 1007 ms of which 8 ms to minimize.
SMT process timed out in 50150ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4279/4279 transitions.
Applied a total of 0 rules in 141 ms. Remains 985 /985 variables (removed 0) and now considering 4279/4279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 985/985 places, 4279/4279 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4279/4279 transitions.
Applied a total of 0 rules in 138 ms. Remains 985 /985 variables (removed 0) and now considering 4279/4279 (removed 0) transitions.
[2025-06-02 21:43:00] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:43:00] [INFO ] Invariant cache hit.
[2025-06-02 21:43:03] [INFO ] Implicit Places using invariants in 2158 ms returned []
[2025-06-02 21:43:03] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:43:03] [INFO ] Invariant cache hit.
[2025-06-02 21:43:04] [INFO ] State equation strengthened by 2722 read => feed constraints.
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1019 after 3127
Detected timeout of ITS tools.
[2025-06-02 21:43:35] [INFO ] Performed 505/985 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:44:06] [INFO ] Performed 949/985 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2025-06-02 21:44:17] [INFO ] Implicit Places using invariants and state equation in 74509 ms returned []
Implicit Place search using SMT with State Equation took 76668 ms to find 0 implicit places.
[2025-06-02 21:44:17] [INFO ] Redundant transitions in 350 ms returned []
Running 4217 sub problems to find dead transitions.
[2025-06-02 21:44:18] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:44:18] [INFO ] Invariant cache hit.
[2025-06-02 21:44:18] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/983 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
SMT process timed out in 69559ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 69626ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146811 ms. Remains : 985/985 places, 4279/4279 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 2, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
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:[2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2]
[2025-06-02 21:45:27] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:45:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 10000 steps (210 resets) in 382 ms. (26 steps per ms)
BEST_FIRST walk for 10001 steps (30 resets) in 72 ms. (137 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2025-06-02 21:45:28] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:45:28] [INFO ] Invariant cache hit.
[2025-06-02 21:45:28] [INFO ] [Real]Absence check using 31 positive place invariants in 40 ms returned sat
[2025-06-02 21:45:28] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2025-06-02 21:45:29] [INFO ] [Real]Absence check using state equation in 1402 ms returned sat
[2025-06-02 21:45:29] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 21:45:30] [INFO ] [Real]Added 2722 Read/Feed constraints in 614 ms returned sat
[2025-06-02 21:45:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:45:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-02 21:45:30] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2025-06-02 21:45:32] [INFO ] [Nat]Absence check using state equation in 1363 ms returned sat
[2025-06-02 21:45:32] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 21:45:33] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1209 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4279/4279 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 985 transition count 4278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 984 transition count 4278
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 984 transition count 4278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 983 transition count 4277
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 983 transition count 4277
Applied a total of 5 rules in 452 ms. Remains 983 /985 variables (removed 2) and now considering 4277/4279 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 983/985 places, 4277/4279 transitions.
[2025-06-02 21:45:33] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2025-06-02 21:45:33] [INFO ] Computed 50 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 1000000 steps (21031 resets) in 23004 ms. (43 steps per ms)
BEST_FIRST walk for 1000001 steps (3023 resets) in 4200 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2025-06-02 21:46:01] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 21:46:01] [INFO ] Invariant cache hit.
[2025-06-02 21:46:01] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:46:01] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2025-06-02 21:46:02] [INFO ] [Real]Absence check using state equation in 1279 ms returned sat
[2025-06-02 21:46:02] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 21:46:03] [INFO ] [Real]Added 2722 Read/Feed constraints in 415 ms returned sat
[2025-06-02 21:46:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:46:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:46:03] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 9 ms returned sat
[2025-06-02 21:46:04] [INFO ] [Nat]Absence check using state equation in 1323 ms returned sat
[2025-06-02 21:46:05] [INFO ] [Nat]Added 2722 Read/Feed constraints in 935 ms returned sat
[2025-06-02 21:46:07] [INFO ] Deduced a trap composed of 135 places in 1373 ms of which 14 ms to minimize.
[2025-06-02 21:46:09] [INFO ] Deduced a trap composed of 168 places in 1518 ms of which 14 ms to minimize.
[2025-06-02 21:46:11] [INFO ] Deduced a trap composed of 185 places in 1012 ms of which 10 ms to minimize.
[2025-06-02 21:46:12] [INFO ] Deduced a trap composed of 191 places in 1147 ms of which 11 ms to minimize.
[2025-06-02 21:46:14] [INFO ] Deduced a trap composed of 176 places in 1458 ms of which 13 ms to minimize.
[2025-06-02 21:46:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 9705 ms
[2025-06-02 21:46:15] [INFO ] Computed and/alt/rep : 1342/1949/1342 causal constraints (skipped 2475 transitions) in 537 ms.
[2025-06-02 21:46:17] [INFO ] Added : 13 causal constraints over 3 iterations in 2040 ms. Result :sat
Minimization took 5124 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 139 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 136 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2025-06-02 21:46:22] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 21:46:22] [INFO ] Invariant cache hit.
[2025-06-02 21:46:25] [INFO ] Implicit Places using invariants in 2620 ms returned []
[2025-06-02 21:46:25] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 21:46:25] [INFO ] Invariant cache hit.
[2025-06-02 21:46:27] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 21:46:57] [INFO ] Performed 507/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:47:24] [INFO ] Implicit Places using invariants and state equation in 58626 ms returned []
Implicit Place search using SMT with State Equation took 61247 ms to find 0 implicit places.
[2025-06-02 21:47:24] [INFO ] Redundant transitions in 301 ms returned []
Running 4215 sub problems to find dead transitions.
[2025-06-02 21:47:24] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 21:47:24] [INFO ] Invariant cache hit.
[2025-06-02 21:47:24] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 69604ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 69660ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131358 ms. Remains : 983/983 places, 4277/4277 transitions.
[2025-06-02 21:48:34] [INFO ] Flatten gal took : 442 ms
RANDOM walk for 40000 steps (839 resets) in 2606 ms. (15 steps per ms) remains 2/2 properties
[2025-06-02 21:48:34] [INFO ] Flatten gal took : 431 ms
[2025-06-02 21:48:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14122291728419031294.gal : 58 ms
[2025-06-02 21:48:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1644111647438636619.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14122291728419031294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1644111647438636619.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (118 resets) in 696 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (118 resets) in 610 ms. (65 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality1644111647438636619.prop.
Interrupted probabilistic random walk after 49194 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 49194 steps, saw 20811 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-02 21:48:38] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 21:48:38] [INFO ] Invariant cache hit.
[2025-06-02 21:48:38] [INFO ] State equation strengthened by 2722 read => feed constraints.
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
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 884/888 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 21:48:39] [INFO ] Deduced a trap composed of 77 places in 1130 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 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 43
[2025-06-02 21:48:40] [INFO ] Deduced a trap composed of 65 places in 1152 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 52
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :52 after 66
[2025-06-02 21:48:41] [INFO ] Deduced a trap composed of 58 places in 1136 ms of which 9 ms to minimize.
[2025-06-02 21:48:43] [INFO ] Deduced a trap composed of 73 places in 1124 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :66 after 92
[2025-06-02 21:48:44] [INFO ] Deduced a trap composed of 63 places in 1131 ms of which 8 ms to minimize.
SMT process timed out in 6060ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 139 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 983/983 places, 4277/4277 transitions.
RANDOM walk for 40000 steps (840 resets) in 1687 ms. (23 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (118 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
Interrupted probabilistic random walk after 58352 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 58352 steps, saw 24623 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2025-06-02 21:48:48] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 21:48:48] [INFO ] Invariant cache hit.
[2025-06-02 21:48:48] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
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) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/967 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/983 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3879/4862 variables, 983/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4862 variables, 2722/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4862/4862 variables, and 3755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2218 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:48:51] [INFO ] Deduced a trap composed of 5 places in 1118 ms of which 8 ms to minimize.
[2025-06-02 21:48:52] [INFO ] Deduced a trap composed of 27 places in 1089 ms of which 9 ms to minimize.
[2025-06-02 21:48:53] [INFO ] Deduced a trap composed of 63 places in 1092 ms of which 9 ms to minimize.
[2025-06-02 21:48:54] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/967 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 16/983 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
At refinement iteration 14 (OVERLAPS) 3879/4862 variables, 983/1037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 2722/3759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4862 variables, 1/3760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:48:57] [INFO ] Deduced a trap composed of 201 places in 937 ms of which 9 ms to minimize.
[2025-06-02 21:48:59] [INFO ] Deduced a trap composed of 173 places in 946 ms of which 9 ms to minimize.
[2025-06-02 21:49:00] [INFO ] Deduced a trap composed of 184 places in 947 ms of which 9 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4862 variables, 3/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4862 variables, 0/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4862 variables, 0/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4862/4862 variables, and 3763 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11281 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 13544ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 150 ms.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 138 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 137 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2025-06-02 21:49:02] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 21:49:02] [INFO ] Invariant cache hit.
[2025-06-02 21:49:04] [INFO ] Implicit Places using invariants in 2000 ms returned []
[2025-06-02 21:49:04] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 21:49:04] [INFO ] Invariant cache hit.
[2025-06-02 21:49:05] [INFO ] State equation strengthened by 2722 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
Detected timeout of ITS tools.
[2025-06-02 21:49:25] [INFO ] Flatten gal took : 142 ms
[2025-06-02 21:49:25] [INFO ] Applying decomposition
[2025-06-02 21:49:25] [INFO ] Flatten gal took : 151 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8798239900341592127.txt' '-o' '/tmp/graph8798239900341592127.bin' '-w' '/tmp/graph8798239900341592127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8798239900341592127.bin' '-l' '-1' '-v' '-w' '/tmp/graph8798239900341592127.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:49:25] [INFO ] Decomposing Gal with order
[2025-06-02 21:49:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:49:26] [INFO ] Removed a total of 8284 redundant transitions.
[2025-06-02 21:49:26] [INFO ] Flatten gal took : 649 ms
[2025-06-02 21:49:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2388 labels/synchronizations in 236 ms.
[2025-06-02 21:49:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1906187431101808286.gal : 38 ms
[2025-06-02 21:49:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15420146941160734208.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1906187431101808286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15420146941160734208.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15420146941160734208.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 480
[2025-06-02 21:49:36] [INFO ] Performed 488/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :480 after 3658
[2025-06-02 21:50:06] [INFO ] Performed 978/983 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-02 21:50:07] [INFO ] Implicit Places using invariants and state equation in 63084 ms returned []
Implicit Place search using SMT with State Equation took 65086 ms to find 0 implicit places.
[2025-06-02 21:50:07] [INFO ] Redundant transitions in 303 ms returned []
Running 4215 sub problems to find dead transitions.
[2025-06-02 21:50:07] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 21:50:07] [INFO ] Invariant cache hit.
[2025-06-02 21:50:07] [INFO ] State equation strengthened by 2722 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 69868ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 69969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135509 ms. Remains : 983/983 places, 4277/4277 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01 in 349763 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:51:17] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
// Phase 1: matrix 3882 rows 985 cols
[2025-06-02 21:51:17] [INFO ] Computed 50 invariants in 57 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (209 resets) in 383 ms. (26 steps per ms)
BEST_FIRST walk for 10001 steps (30 resets) in 71 ms. (138 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:51:17] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 21:51:17] [INFO ] Invariant cache hit.
[2025-06-02 21:51:18] [INFO ] [Real]Absence check using 31 positive place invariants in 40 ms returned sat
[2025-06-02 21:51:18] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2025-06-02 21:51:19] [INFO ] [Real]Absence check using state equation in 1546 ms returned sat
[2025-06-02 21:51:19] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 21:51:20] [INFO ] [Real]Added 2722 Read/Feed constraints in 623 ms returned sat
[2025-06-02 21:51:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:51:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:51:20] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2025-06-02 21:51:22] [INFO ] [Nat]Absence check using state equation in 1642 ms returned sat
[2025-06-02 21:51:23] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 21:51:23] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1218 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 985 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node15ThinksNode14ShouldBeNodeMasterToReplaceNode4) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4277/4277 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 984 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 983 transition count 4274
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 983 transition count 4274
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 983 transition count 4272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 981 transition count 4272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 980 transition count 4271
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 980 transition count 4271
Applied a total of 9 rules in 428 ms. Remains 980 /985 variables (removed 5) and now considering 4271/4277 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 980/985 places, 4271/4277 transitions.
[2025-06-02 21:51:24] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
// Phase 1: matrix 3873 rows 980 cols
[2025-06-02 21:51:24] [INFO ] Computed 50 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21027 resets) in 23254 ms. (43 steps per ms)
BEST_FIRST walk for 1000001 steps (3018 resets) in 4185 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:51:51] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
[2025-06-02 21:51:51] [INFO ] Invariant cache hit.
[2025-06-02 21:51:51] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:51:51] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2025-06-02 21:51:52] [INFO ] [Real]Absence check using state equation in 1129 ms returned sat
[2025-06-02 21:51:53] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2025-06-02 21:51:54] [INFO ] [Real]Added 2720 Read/Feed constraints in 1046 ms returned sat
[2025-06-02 21:51:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:51:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 46 ms returned sat
[2025-06-02 21:51:54] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 12 ms returned sat
[2025-06-02 21:51:56] [INFO ] [Nat]Absence check using state equation in 1447 ms returned sat
[2025-06-02 21:51:58] [INFO ] [Nat]Added 2720 Read/Feed constraints in 2185 ms returned sat
[2025-06-02 21:51:59] [INFO ] Deduced a trap composed of 236 places in 1493 ms of which 14 ms to minimize.
[2025-06-02 21:51:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1806 ms
[2025-06-02 21:52:00] [INFO ] Computed and/alt/rep : 1335/1930/1335 causal constraints (skipped 2476 transitions) in 492 ms.
[2025-06-02 21:52:04] [INFO ] Deduced a trap composed of 80 places in 1774 ms of which 14 ms to minimize.
[2025-06-02 21:52:06] [INFO ] Deduced a trap composed of 67 places in 1802 ms of which 13 ms to minimize.
[2025-06-02 21:52:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4343 ms
[2025-06-02 21:52:07] [INFO ] Added : 22 causal constraints over 6 iterations in 7349 ms. Result :sat
Minimization took 5119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4271/4271 transitions.
Applied a total of 0 rules in 139 ms. Remains 980 /980 variables (removed 0) and now considering 4271/4271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 980/980 places, 4271/4271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4271/4271 transitions.
Applied a total of 0 rules in 139 ms. Remains 980 /980 variables (removed 0) and now considering 4271/4271 (removed 0) transitions.
[2025-06-02 21:52:12] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
[2025-06-02 21:52:12] [INFO ] Invariant cache hit.
[2025-06-02 21:52:15] [INFO ] Implicit Places using invariants in 3190 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3195 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/980 places, 4271/4271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 978 transition count 4270
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 4270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 977 transition count 4269
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 977 transition count 4269
Applied a total of 4 rules in 364 ms. Remains 977 /979 variables (removed 2) and now considering 4269/4271 (removed 2) transitions.
[2025-06-02 21:52:16] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
// Phase 1: matrix 3871 rows 977 cols
[2025-06-02 21:52:16] [INFO ] Computed 49 invariants in 65 ms
[2025-06-02 21:52:19] [INFO ] Implicit Places using invariants in 3532 ms returned []
[2025-06-02 21:52:19] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:52:19] [INFO ] Invariant cache hit.
[2025-06-02 21:52:21] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2025-06-02 21:52:51] [INFO ] Performed 423/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:53:21] [INFO ] Performed 662/977 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-02 21:53:37] [INFO ] Implicit Places using invariants and state equation in 77439 ms returned []
Implicit Place search using SMT with State Equation took 80978 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 977/980 places, 4269/4271 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 84678 ms. Remains : 977/980 places, 4269/4271 transitions.
[2025-06-02 21:53:37] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:53:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21031 resets) in 23123 ms. (43 steps per ms)
BEST_FIRST walk for 1000001 steps (3013 resets) in 4595 ms. (217 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:54:05] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:54:05] [INFO ] Invariant cache hit.
[2025-06-02 21:54:05] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:54:05] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 7 ms returned sat
[2025-06-02 21:54:06] [INFO ] [Real]Absence check using state equation in 1460 ms returned sat
[2025-06-02 21:54:06] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2025-06-02 21:54:07] [INFO ] [Real]Added 2720 Read/Feed constraints in 693 ms returned sat
[2025-06-02 21:54:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:54:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:54:07] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 6 ms returned sat
[2025-06-02 21:54:09] [INFO ] [Nat]Absence check using state equation in 1631 ms returned sat
[2025-06-02 21:54:11] [INFO ] [Nat]Added 2720 Read/Feed constraints in 2204 ms returned sat
[2025-06-02 21:54:13] [INFO ] Deduced a trap composed of 235 places in 1516 ms of which 15 ms to minimize.
[2025-06-02 21:54:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1839 ms
[2025-06-02 21:54:13] [INFO ] Computed and/alt/rep : 1334/1922/1334 causal constraints (skipped 2475 transitions) in 544 ms.
[2025-06-02 21:54:15] [INFO ] Added : 19 causal constraints over 4 iterations in 2350 ms. Result :sat
Minimization took 5110 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 211 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 977/977 places, 4269/4269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 213 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
[2025-06-02 21:54:21] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:54:21] [INFO ] Invariant cache hit.
[2025-06-02 21:54:24] [INFO ] Implicit Places using invariants in 3194 ms returned []
[2025-06-02 21:54:24] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:54:24] [INFO ] Invariant cache hit.
[2025-06-02 21:54:26] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2025-06-02 21:54:56] [INFO ] Performed 421/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:55:27] [INFO ] Performed 662/977 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-02 21:55:42] [INFO ] Implicit Places using invariants and state equation in 78369 ms returned []
Implicit Place search using SMT with State Equation took 81564 ms to find 0 implicit places.
[2025-06-02 21:55:43] [INFO ] Redundant transitions in 468 ms returned []
Running 4207 sub problems to find dead transitions.
[2025-06-02 21:55:43] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:55:43] [INFO ] Invariant cache hit.
[2025-06-02 21:55:43] [INFO ] State equation strengthened by 2720 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4207 unsolved
SMT process timed out in 69539ms, After SMT, problems are : Problem set: 0 solved, 4207 unsolved
Search for dead transitions found 0 dead transitions in 69600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151865 ms. Remains : 977/977 places, 4269/4269 transitions.
[2025-06-02 21:56:53] [INFO ] Flatten gal took : 290 ms
[2025-06-02 21:56:53] [INFO ] Flatten gal took : 274 ms
[2025-06-02 21:56:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6504698692244055746.gal : 72 ms
[2025-06-02 21:56:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality489524468520294428.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6504698692244055746.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality489524468520294428.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
RANDOM walk for 40000 steps (840 resets) in 2438 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (117 resets) in 532 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (119 resets) in 481 ms. (82 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality489524468520294428.prop.
Interrupted probabilistic random walk after 48207 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 48207 steps, saw 20409 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-02 21:56:57] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:56:57] [INFO ] Invariant cache hit.
[2025-06-02 21:56:57] [INFO ] State equation strengthened by 2720 read => feed constraints.
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) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:56:58] [INFO ] Deduced a trap composed of 80 places in 931 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
[2025-06-02 21:56:59] [INFO ] Deduced a trap composed of 98 places in 908 ms of which 8 ms to minimize.
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 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 53
[2025-06-02 21:57:00] [INFO ] Deduced a trap composed of 157 places in 1032 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :53 after 69
[2025-06-02 21:57:01] [INFO ] Deduced a trap composed of 227 places in 1016 ms of which 8 ms to minimize.
[2025-06-02 21:57:02] [INFO ] Deduced a trap composed of 111 places in 1035 ms of which 8 ms to minimize.
SMT process timed out in 5333ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 161 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 977/977 places, 4269/4269 transitions.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :69 after 92
RANDOM walk for 40000 steps (840 resets) in 2221 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (118 resets) in 392 ms. (101 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
Interrupted probabilistic random walk after 49518 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 49518 steps, saw 20943 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-02 21:57:06] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:57:06] [INFO ] Invariant cache hit.
[2025-06-02 21:57:06] [INFO ] State equation strengthened by 2720 read => feed constraints.
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) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:57:07] [INFO ] Deduced a trap composed of 80 places in 1056 ms of which 8 ms to minimize.
[2025-06-02 21:57:08] [INFO ] Deduced a trap composed of 98 places in 1082 ms of which 8 ms to minimize.
[2025-06-02 21:57:09] [INFO ] Deduced a trap composed of 157 places in 1068 ms of which 8 ms to minimize.
[2025-06-02 21:57:10] [INFO ] Deduced a trap composed of 227 places in 1016 ms of which 8 ms to minimize.
[2025-06-02 21:57:12] [INFO ] Deduced a trap composed of 111 places in 1018 ms of which 9 ms to minimize.
[2025-06-02 21:57:13] [INFO ] Deduced a trap composed of 122 places in 1027 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
[2025-06-02 21:57:14] [INFO ] Deduced a trap composed of 224 places in 1014 ms of which 9 ms to minimize.
[2025-06-02 21:57:15] [INFO ] Deduced a trap composed of 133 places in 1021 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/933 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/961 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/977 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3871/4848 variables, 977/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4848 variables, 2720/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4848 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4848 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4848/4848 variables, and 3754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11015 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 977/977 constraints, ReadFeed: 2720/2720 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:57:18] [INFO ] Deduced a trap composed of 300 places in 1019 ms of which 8 ms to minimize.
[2025-06-02 21:57:19] [INFO ] Deduced a trap composed of 81 places in 1018 ms of which 9 ms to minimize.
[2025-06-02 21:57:20] [INFO ] Deduced a trap composed of 144 places in 1025 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/933 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:57:21] [INFO ] Deduced a trap composed of 5 places in 955 ms of which 8 ms to minimize.
[2025-06-02 21:57:22] [INFO ] Deduced a trap composed of 140 places in 956 ms of which 9 ms to minimize.
[2025-06-02 21:57:23] [INFO ] Deduced a trap composed of 46 places in 955 ms of which 8 ms to minimize.
[2025-06-02 21:57:24] [INFO ] Deduced a trap composed of 27 places in 950 ms of which 9 ms to minimize.
[2025-06-02 21:57:25] [INFO ] Deduced a trap composed of 57 places in 939 ms of which 8 ms to minimize.
[2025-06-02 21:57:26] [INFO ] Deduced a trap composed of 139 places in 949 ms of which 8 ms to minimize.
[2025-06-02 21:57:27] [INFO ] Deduced a trap composed of 141 places in 947 ms of which 9 ms to minimize.
[2025-06-02 21:57:28] [INFO ] Deduced a trap composed of 46 places in 940 ms of which 9 ms to minimize.
[2025-06-02 21:57:29] [INFO ] Deduced a trap composed of 161 places in 947 ms of which 8 ms to minimize.
[2025-06-02 21:57:30] [INFO ] Deduced a trap composed of 77 places in 1094 ms of which 8 ms to minimize.
[2025-06-02 21:57:31] [INFO ] Deduced a trap composed of 82 places in 1083 ms of which 9 ms to minimize.
[2025-06-02 21:57:32] [INFO ] Deduced a trap composed of 70 places in 1085 ms of which 9 ms to minimize.
[2025-06-02 21:57:34] [INFO ] Deduced a trap composed of 75 places in 1091 ms of which 8 ms to minimize.
[2025-06-02 21:57:34] [INFO ] Deduced a trap composed of 85 places in 951 ms of which 10 ms to minimize.
[2025-06-02 21:57:35] [INFO ] Deduced a trap composed of 46 places in 950 ms of which 8 ms to minimize.
[2025-06-02 21:57:36] [INFO ] Deduced a trap composed of 176 places in 962 ms of which 9 ms to minimize.
[2025-06-02 21:57:37] [INFO ] Deduced a trap composed of 71 places in 949 ms of which 8 ms to minimize.
[2025-06-02 21:57:38] [INFO ] Deduced a trap composed of 88 places in 951 ms of which 8 ms to minimize.
[2025-06-02 21:57:39] [INFO ] Deduced a trap composed of 62 places in 931 ms of which 8 ms to minimize.
[2025-06-02 21:57:40] [INFO ] Deduced a trap composed of 75 places in 939 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2025-06-02 21:57:41] [INFO ] Deduced a trap composed of 187 places in 931 ms of which 9 ms to minimize.
[2025-06-02 21:57:42] [INFO ] Deduced a trap composed of 187 places in 930 ms of which 8 ms to minimize.
[2025-06-02 21:57:43] [INFO ] Deduced a trap composed of 92 places in 928 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:57:43] [INFO ] Flatten gal took : 165 ms
[2025-06-02 21:57:43] [INFO ] Applying decomposition
[2025-06-02 21:57:44] [INFO ] Flatten gal took : 221 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16577728165166018342.txt' '-o' '/tmp/graph16577728165166018342.bin' '-w' '/tmp/graph16577728165166018342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16577728165166018342.bin' '-l' '-1' '-v' '-w' '/tmp/graph16577728165166018342.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:57:44] [INFO ] Decomposing Gal with order
[2025-06-02 21:57:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:57:44] [INFO ] Deduced a trap composed of 118 places in 1100 ms of which 9 ms to minimize.
[2025-06-02 21:57:45] [INFO ] Removed a total of 8288 redundant transitions.
[2025-06-02 21:57:45] [INFO ] Flatten gal took : 754 ms
[2025-06-02 21:57:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2398 labels/synchronizations in 201 ms.
[2025-06-02 21:57:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17649091128449479992.gal : 35 ms
[2025-06-02 21:57:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15428283329035519127.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17649091128449479992.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15428283329035519127.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
[2025-06-02 21:57:46] [INFO ] Deduced a trap composed of 66 places in 1254 ms of which 12 ms to minimize.
Loading property file /tmp/ReachabilityCardinality15428283329035519127.prop.
[2025-06-02 21:57:47] [INFO ] Deduced a trap composed of 71 places in 1092 ms of which 8 ms to minimize.
[2025-06-02 21:57:48] [INFO ] Deduced a trap composed of 63 places in 1139 ms of which 8 ms to minimize.
[2025-06-02 21:57:49] [INFO ] Deduced a trap composed of 74 places in 1140 ms of which 9 ms to minimize.
[2025-06-02 21:57:50] [INFO ] Deduced a trap composed of 64 places in 1138 ms of which 8 ms to minimize.
[2025-06-02 21:57:51] [INFO ] Deduced a trap composed of 76 places in 1144 ms of which 8 ms to minimize.
[2025-06-02 21:57:52] [INFO ] Deduced a trap composed of 92 places in 980 ms of which 9 ms to minimize.
[2025-06-02 21:57:53] [INFO ] Deduced a trap composed of 97 places in 1139 ms of which 8 ms to minimize.
[2025-06-02 21:57:55] [INFO ] Deduced a trap composed of 69 places in 1143 ms of which 8 ms to minimize.
[2025-06-02 21:57:56] [INFO ] Deduced a trap composed of 106 places in 1120 ms of which 8 ms to minimize.
[2025-06-02 21:57:57] [INFO ] Deduced a trap composed of 85 places in 1119 ms of which 9 ms to minimize.
[2025-06-02 21:57:58] [INFO ] Deduced a trap composed of 83 places in 1106 ms of which 9 ms to minimize.
[2025-06-02 21:57:59] [INFO ] Deduced a trap composed of 97 places in 1098 ms of which 9 ms to minimize.
[2025-06-02 21:58:00] [INFO ] Deduced a trap composed of 154 places in 939 ms of which 8 ms to minimize.
[2025-06-02 21:58:01] [INFO ] Deduced a trap composed of 85 places in 966 ms of which 11 ms to minimize.
[2025-06-02 21:58:02] [INFO ] Deduced a trap composed of 95 places in 1102 ms of which 8 ms to minimize.
SMT process timed out in 56315ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 143 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 977/977 places, 4269/4269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 138 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
[2025-06-02 21:58:03] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:58:03] [INFO ] Invariant cache hit.
[2025-06-02 21:58:05] [INFO ] Implicit Places using invariants in 2156 ms returned []
[2025-06-02 21:58:05] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:58:05] [INFO ] Invariant cache hit.
[2025-06-02 21:58:06] [INFO ] State equation strengthened by 2720 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-02 21:58:37] [INFO ] Performed 412/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:59:07] [INFO ] Performed 721/977 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-02 21:59:18] [INFO ] Implicit Places using invariants and state equation in 73274 ms returned []
Implicit Place search using SMT with State Equation took 75432 ms to find 0 implicit places.
[2025-06-02 21:59:18] [INFO ] Redundant transitions in 299 ms returned []
Running 4207 sub problems to find dead transitions.
[2025-06-02 21:59:18] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2025-06-02 21:59:18] [INFO ] Invariant cache hit.
[2025-06-02 21:59:18] [INFO ] State equation strengthened by 2720 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4207 unsolved
SMT process timed out in 70062ms, After SMT, problems are : Problem set: 0 solved, 4207 unsolved
Search for dead transitions found 0 dead transitions in 70110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146000 ms. Remains : 977/977 places, 4269/4269 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02 in 551496 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
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:[2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2]
[2025-06-02 22:00:28] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
// Phase 1: matrix 3882 rows 985 cols
[2025-06-02 22:00:28] [INFO ] Computed 50 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 10000 steps (210 resets) in 385 ms. (25 steps per ms)
BEST_FIRST walk for 10000 steps (30 resets) in 71 ms. (138 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2025-06-02 22:00:29] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 22:00:29] [INFO ] Invariant cache hit.
[2025-06-02 22:00:29] [INFO ] [Real]Absence check using 31 positive place invariants in 37 ms returned sat
[2025-06-02 22:00:29] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2025-06-02 22:00:31] [INFO ] [Real]Absence check using state equation in 1747 ms returned sat
[2025-06-02 22:00:31] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 22:00:32] [INFO ] [Real]Added 2722 Read/Feed constraints in 434 ms returned sat
[2025-06-02 22:00:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 22:00:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 30 ms returned sat
[2025-06-02 22:00:32] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 8 ms returned sat
[2025-06-02 22:00:33] [INFO ] [Nat]Absence check using state equation in 1533 ms returned sat
[2025-06-02 22:00:34] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 22:00:35] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1310 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 985 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4279/4279 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 985 transition count 4278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 984 transition count 4278
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 984 transition count 4278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 983 transition count 4277
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 983 transition count 4277
Applied a total of 5 rules in 632 ms. Remains 983 /985 variables (removed 2) and now considering 4277/4279 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 983/985 places, 4277/4279 transitions.
[2025-06-02 22:00:35] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2025-06-02 22:00:35] [INFO ] Computed 50 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 1000000 steps (21029 resets) in 24229 ms. (41 steps per ms)
BEST_FIRST walk for 1000001 steps (3026 resets) in 4319 ms. (231 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2025-06-02 22:01:04] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 22:01:04] [INFO ] Invariant cache hit.
[2025-06-02 22:01:04] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-02 22:01:04] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 8 ms returned sat
[2025-06-02 22:01:06] [INFO ] [Real]Absence check using state equation in 1431 ms returned sat
[2025-06-02 22:01:06] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 22:01:06] [INFO ] [Real]Added 2722 Read/Feed constraints in 516 ms returned sat
[2025-06-02 22:01:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 22:01:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 35 ms returned sat
[2025-06-02 22:01:07] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2025-06-02 22:01:08] [INFO ] [Nat]Absence check using state equation in 1439 ms returned sat
[2025-06-02 22:01:09] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1359 ms returned sat
[2025-06-02 22:01:11] [INFO ] Deduced a trap composed of 199 places in 1187 ms of which 15 ms to minimize.
[2025-06-02 22:01:14] [INFO ] Deduced a trap composed of 155 places in 1465 ms of which 14 ms to minimize.
[2025-06-02 22:01:16] [INFO ] Deduced a trap composed of 183 places in 1568 ms of which 14 ms to minimize.
[2025-06-02 22:01:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6760 ms
[2025-06-02 22:01:17] [INFO ] Computed and/alt/rep : 1342/1949/1342 causal constraints (skipped 2475 transitions) in 531 ms.
[2025-06-02 22:01:18] [INFO ] Added : 13 causal constraints over 3 iterations in 2121 ms. Result :sat
Minimization took 5137 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 144 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 141 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2025-06-02 22:01:24] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 22:01:24] [INFO ] Invariant cache hit.
[2025-06-02 22:01:27] [INFO ] Implicit Places using invariants in 3089 ms returned []
[2025-06-02 22:01:27] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 22:01:27] [INFO ] Invariant cache hit.
[2025-06-02 22:01:29] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 22:01:59] [INFO ] Performed 458/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 22:02:29] [INFO ] Performed 931/983 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-02 22:02:38] [INFO ] Implicit Places using invariants and state equation in 71637 ms returned []
Implicit Place search using SMT with State Equation took 74729 ms to find 0 implicit places.
[2025-06-02 22:02:39] [INFO ] Redundant transitions in 311 ms returned []
Running 4215 sub problems to find dead transitions.
[2025-06-02 22:02:39] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 22:02:39] [INFO ] Invariant cache hit.
[2025-06-02 22:02:39] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 70815ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 70866ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146063 ms. Remains : 983/983 places, 4277/4277 transitions.
[2025-06-02 22:03:50] [INFO ] Flatten gal took : 304 ms
[2025-06-02 22:03:50] [INFO ] Flatten gal took : 292 ms
[2025-06-02 22:03:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2342520658647716326.gal : 40 ms
[2025-06-02 22:03:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14581931004287362257.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2342520658647716326.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14581931004287362257.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (840 resets) in 2499 ms. (16 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (118 resets) in 540 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (118 resets) in 360 ms. (110 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14581931004287362257.prop.
Interrupted probabilistic random walk after 51207 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 51207 steps, saw 21637 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-02 22:03:54] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 22:03:54] [INFO ] Invariant cache hit.
[2025-06-02 22:03:54] [INFO ] State equation strengthened by 2722 read => feed constraints.
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
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 884/888 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/967 variables, 28/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/983 variables, 16/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3879/4862 variables, 983/1033 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
At refinement iteration 14 (INCLUDED_ONLY) 0/4862 variables, 2722/3755 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4862/4862 variables, and 3755 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2028 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
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) 884/888 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 53
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :53 after 69
[2025-06-02 22:03:57] [INFO ] Deduced a trap composed of 5 places in 1126 ms of which 8 ms to minimize.
[2025-06-02 22:03:58] [INFO ] Deduced a trap composed of 27 places in 1107 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :69 after 92
[2025-06-02 22:03:59] [INFO ] Deduced a trap composed of 85 places in 1123 ms of which 9 ms to minimize.
[2025-06-02 22:04:00] [INFO ] Deduced a trap composed of 146 places in 903 ms of which 9 ms to minimize.
[2025-06-02 22:04:01] [INFO ] Deduced a trap composed of 138 places in 894 ms of which 8 ms to minimize.
SMT process timed out in 7532ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 137 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 983/983 places, 4277/4277 transitions.
RANDOM walk for 40000 steps (840 resets) in 1260 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (118 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
Interrupted probabilistic random walk after 59019 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 1
Probabilistic random walk after 59019 steps, saw 24905 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2025-06-02 22:04:05] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 22:04:05] [INFO ] Invariant cache hit.
[2025-06-02 22:04:05] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
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) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/967 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/983 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3879/4862 variables, 983/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4862 variables, 2722/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4862/4862 variables, and 3755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2022 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:04:08] [INFO ] Deduced a trap composed of 5 places in 1080 ms of which 9 ms to minimize.
[2025-06-02 22:04:09] [INFO ] Deduced a trap composed of 27 places in 1059 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
[2025-06-02 22:04:10] [INFO ] Deduced a trap composed of 85 places in 1064 ms of which 9 ms to minimize.
[2025-06-02 22:04:11] [INFO ] Deduced a trap composed of 146 places in 873 ms of which 9 ms to minimize.
[2025-06-02 22:04:12] [INFO ] Deduced a trap composed of 138 places in 893 ms of which 8 ms to minimize.
[2025-06-02 22:04:13] [INFO ] Deduced a trap composed of 162 places in 906 ms of which 9 ms to minimize.
[2025-06-02 22:04:14] [INFO ] Deduced a trap composed of 141 places in 887 ms of which 8 ms to minimize.
[2025-06-02 22:04:15] [INFO ] Deduced a trap composed of 144 places in 868 ms of which 8 ms to minimize.
[2025-06-02 22:04:16] [INFO ] Deduced a trap composed of 130 places in 877 ms of which 8 ms to minimize.
[2025-06-02 22:04:17] [INFO ] Deduced a trap composed of 143 places in 870 ms of which 10 ms to minimize.
[2025-06-02 22:04:18] [INFO ] Deduced a trap composed of 144 places in 874 ms of which 9 ms to minimize.
[2025-06-02 22:04:18] [INFO ] Deduced a trap composed of 140 places in 875 ms of which 8 ms to minimize.
[2025-06-02 22:04:19] [INFO ] Deduced a trap composed of 156 places in 865 ms of which 9 ms to minimize.
[2025-06-02 22:04:20] [INFO ] Deduced a trap composed of 149 places in 853 ms of which 8 ms to minimize.
[2025-06-02 22:04:21] [INFO ] Deduced a trap composed of 157 places in 863 ms of which 8 ms to minimize.
[2025-06-02 22:04:22] [INFO ] Deduced a trap composed of 160 places in 877 ms of which 9 ms to minimize.
[2025-06-02 22:04:23] [INFO ] Deduced a trap composed of 163 places in 752 ms of which 8 ms to minimize.
[2025-06-02 22:04:24] [INFO ] Deduced a trap composed of 160 places in 893 ms of which 9 ms to minimize.
[2025-06-02 22:04:25] [INFO ] Deduced a trap composed of 142 places in 884 ms of which 9 ms to minimize.
[2025-06-02 22:04:25] [INFO ] Deduced a trap composed of 142 places in 883 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:04:26] [INFO ] Deduced a trap composed of 156 places in 875 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/967 variables, 28/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/967 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 16/983 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3879/4862 variables, 983/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4862 variables, 2722/3776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4862 variables, 1/3777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 22:04:31] [INFO ] Deduced a trap composed of 199 places in 935 ms of which 8 ms to minimize.
[2025-06-02 22:04:33] [INFO ] Deduced a trap composed of 155 places in 989 ms of which 9 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4862 variables, 2/3779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4862 variables, 0/3779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/4862 variables, 0/3779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4862/4862 variables, and 3779 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27599 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 23/23 constraints]
After SMT, in 29664ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 139 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 138 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2025-06-02 22:04:35] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 22:04:35] [INFO ] Invariant cache hit.
[2025-06-02 22:04:37] [INFO ] Implicit Places using invariants in 2125 ms returned []
[2025-06-02 22:04:37] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 22:04:37] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2025-06-02 22:04:38] [INFO ] State equation strengthened by 2722 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-02 22:04:41] [INFO ] Flatten gal took : 134 ms
[2025-06-02 22:04:41] [INFO ] Applying decomposition
[2025-06-02 22:04:41] [INFO ] Flatten gal took : 142 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2216435808542767465.txt' '-o' '/tmp/graph2216435808542767465.bin' '-w' '/tmp/graph2216435808542767465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2216435808542767465.bin' '-l' '-1' '-v' '-w' '/tmp/graph2216435808542767465.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:04:41] [INFO ] Decomposing Gal with order
[2025-06-02 22:04:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:04:42] [INFO ] Removed a total of 8271 redundant transitions.
[2025-06-02 22:04:42] [INFO ] Flatten gal took : 672 ms
[2025-06-02 22:04:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2392 labels/synchronizations in 197 ms.
[2025-06-02 22:04:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11032842649820922505.gal : 34 ms
[2025-06-02 22:04:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8186999796433733504.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11032842649820922505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8186999796433733504.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8186999796433733504.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 482
[2025-06-02 22:05:09] [INFO ] Performed 467/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :482 after 3963
Detected timeout of ITS tools.
[2025-06-02 22:05:39] [INFO ] Performed 948/983 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-02 22:05:45] [INFO ] Implicit Places using invariants and state equation in 67700 ms returned []
Implicit Place search using SMT with State Equation took 69827 ms to find 0 implicit places.
[2025-06-02 22:05:45] [INFO ] Redundant transitions in 305 ms returned []
Running 4215 sub problems to find dead transitions.
[2025-06-02 22:05:45] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2025-06-02 22:05:45] [INFO ] Invariant cache hit.
[2025-06-02 22:05:45] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.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 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 0.0)
(s664 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 69966ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 70015ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140297 ms. Remains : 983/983 places, 4277/4277 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04 in 386631 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-02 22:06:55] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
// Phase 1: matrix 3882 rows 985 cols
[2025-06-02 22:06:55] [INFO ] Computed 50 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (209 resets) in 390 ms. (25 steps per ms)
BEST_FIRST walk for 10000 steps (29 resets) in 72 ms. (136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 22:06:56] [INFO ] Flow matrix only has 3882 transitions (discarded 397 similar events)
[2025-06-02 22:06:56] [INFO ] Invariant cache hit.
[2025-06-02 22:06:56] [INFO ] [Real]Absence check using 31 positive place invariants in 41 ms returned sat
[2025-06-02 22:06:56] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 12 ms returned sat
[2025-06-02 22:06:57] [INFO ] [Real]Absence check using state equation in 1493 ms returned sat
[2025-06-02 22:06:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 22:06:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 22:06:58] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2025-06-02 22:06:59] [INFO ] [Nat]Absence check using state equation in 1325 ms returned sat
[2025-06-02 22:06:59] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-02 22:07:00] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 22:07:00] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1210 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 985 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node13ThinksNode4ShouldBeNodeMasterToReplaceNode12) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 985/985 places, 4277/4277 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 984 transition count 4276
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 984 transition count 4276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 984 transition count 4275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 983 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 982 transition count 4274
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 982 transition count 4274
Applied a total of 6 rules in 440 ms. Remains 982 /985 variables (removed 3) and now considering 4274/4277 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 982/985 places, 4274/4277 transitions.
[2025-06-02 22:07:01] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 982 cols
[2025-06-02 22:07:01] [INFO ] Computed 50 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21029 resets) in 23209 ms. (43 steps per ms)
BEST_FIRST walk for 1000001 steps (3014 resets) in 4205 ms. (237 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 22:07:28] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2025-06-02 22:07:28] [INFO ] Invariant cache hit.
[2025-06-02 22:07:28] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 22:07:28] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 9 ms returned sat
[2025-06-02 22:07:30] [INFO ] [Real]Absence check using state equation in 1291 ms returned sat
[2025-06-02 22:07:30] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2025-06-02 22:07:30] [INFO ] [Real]Added 2721 Read/Feed constraints in 316 ms returned sat
[2025-06-02 22:07:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 22:07:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 27 ms returned sat
[2025-06-02 22:07:30] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2025-06-02 22:07:32] [INFO ] [Nat]Absence check using state equation in 1653 ms returned sat
[2025-06-02 22:07:35] [INFO ] [Nat]Added 2721 Read/Feed constraints in 2644 ms returned sat
[2025-06-02 22:07:36] [INFO ] Deduced a trap composed of 201 places in 1497 ms of which 14 ms to minimize.
[2025-06-02 22:07:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1812 ms
[2025-06-02 22:07:37] [INFO ] Computed and/alt/rep : 1339/1936/1339 causal constraints (skipped 2476 transitions) in 493 ms.
[2025-06-02 22:07:38] [INFO ] Added : 15 causal constraints over 3 iterations in 1739 ms. Result :sat
Minimization took 5122 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4274/4274 transitions.
Applied a total of 0 rules in 174 ms. Remains 982 /982 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 982/982 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4274/4274 transitions.
Applied a total of 0 rules in 230 ms. Remains 982 /982 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2025-06-02 22:07:44] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2025-06-02 22:07:44] [INFO ] Invariant cache hit.
[2025-06-02 22:07:47] [INFO ] Implicit Places using invariants in 3367 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3374 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 981/982 places, 4274/4274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 980 transition count 4273
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 980 transition count 4273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 979 transition count 4272
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 979 transition count 4272
Applied a total of 4 rules in 338 ms. Remains 979 /981 variables (removed 2) and now considering 4272/4274 (removed 2) transitions.
[2025-06-02 22:07:47] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
// Phase 1: matrix 3875 rows 979 cols
[2025-06-02 22:07:47] [INFO ] Computed 49 invariants in 44 ms
[2025-06-02 22:07:50] [INFO ] Implicit Places using invariants in 2984 ms returned []
[2025-06-02 22:07:50] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:07:50] [INFO ] Invariant cache hit.
[2025-06-02 22:07:52] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2025-06-02 22:08:22] [INFO ] Performed 509/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 22:08:56] [INFO ] Performed 945/979 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2025-06-02 22:09:02] [INFO ] Implicit Places using invariants and state equation in 71167 ms returned []
Implicit Place search using SMT with State Equation took 74152 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/982 places, 4272/4274 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 78096 ms. Remains : 979/982 places, 4272/4274 transitions.
[2025-06-02 22:09:02] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:09:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21028 resets) in 23452 ms. (42 steps per ms)
BEST_FIRST walk for 1000001 steps (3016 resets) in 4534 ms. (220 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 22:09:30] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:09:30] [INFO ] Invariant cache hit.
[2025-06-02 22:09:30] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-02 22:09:30] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 7 ms returned sat
[2025-06-02 22:09:31] [INFO ] [Real]Absence check using state equation in 1608 ms returned sat
[2025-06-02 22:09:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 22:09:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2025-06-02 22:09:32] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 7 ms returned sat
[2025-06-02 22:09:34] [INFO ] [Nat]Absence check using state equation in 1953 ms returned sat
[2025-06-02 22:09:34] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2025-06-02 22:09:36] [INFO ] [Nat]Added 2721 Read/Feed constraints in 2174 ms returned sat
[2025-06-02 22:09:37] [INFO ] Deduced a trap composed of 248 places in 1388 ms of which 14 ms to minimize.
[2025-06-02 22:09:39] [INFO ] Deduced a trap composed of 98 places in 1882 ms of which 15 ms to minimize.
[2025-06-02 22:09:41] [INFO ] Deduced a trap composed of 67 places in 1811 ms of which 13 ms to minimize.
[2025-06-02 22:09:43] [INFO ] Deduced a trap composed of 79 places in 1829 ms of which 14 ms to minimize.
[2025-06-02 22:09:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7834 ms
[2025-06-02 22:09:44] [INFO ] Computed and/alt/rep : 1338/1928/1338 causal constraints (skipped 2475 transitions) in 543 ms.
[2025-06-02 22:09:46] [INFO ] Added : 16 causal constraints over 4 iterations in 2404 ms. Result :sat
Minimization took 5123 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 142 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 979/979 places, 4272/4272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 203 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
[2025-06-02 22:09:52] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:09:52] [INFO ] Invariant cache hit.
[2025-06-02 22:09:55] [INFO ] Implicit Places using invariants in 3346 ms returned []
[2025-06-02 22:09:55] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:09:55] [INFO ] Invariant cache hit.
[2025-06-02 22:09:57] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2025-06-02 22:10:27] [INFO ] Performed 499/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 22:10:57] [INFO ] Performed 943/979 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-02 22:11:07] [INFO ] Implicit Places using invariants and state equation in 72600 ms returned []
Implicit Place search using SMT with State Equation took 75947 ms to find 0 implicit places.
[2025-06-02 22:11:08] [INFO ] Redundant transitions in 350 ms returned []
Running 4210 sub problems to find dead transitions.
[2025-06-02 22:11:08] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:11:08] [INFO ] Invariant cache hit.
[2025-06-02 22:11:08] [INFO ] State equation strengthened by 2721 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4210 unsolved
SMT process timed out in 70390ms, After SMT, problems are : Problem set: 0 solved, 4210 unsolved
Search for dead transitions found 0 dead transitions in 70444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146964 ms. Remains : 979/979 places, 4272/4272 transitions.
[2025-06-02 22:12:18] [INFO ] Flatten gal took : 150 ms
[2025-06-02 22:12:19] [INFO ] Flatten gal took : 172 ms
[2025-06-02 22:12:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17699778711905043724.gal : 30 ms
[2025-06-02 22:12:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6130838413476773092.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17699778711905043724.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6130838413476773092.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (839 resets) in 1432 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (120 resets) in 412 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (118 resets) in 423 ms. (94 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6130838413476773092.prop.
Interrupted probabilistic random walk after 51654 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 51654 steps, saw 21831 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-02 22:12:22] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:12:22] [INFO ] Invariant cache hit.
[2025-06-02 22:12:22] [INFO ] State equation strengthened by 2721 read => feed constraints.
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) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 22:12:23] [INFO ] Deduced a trap composed of 177 places in 1094 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 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 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
[2025-06-02 22:12:25] [INFO ] Deduced a trap composed of 247 places in 1197 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 53
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :53 after 69
[2025-06-02 22:12:26] [INFO ] Deduced a trap composed of 137 places in 1068 ms of which 9 ms to minimize.
[2025-06-02 22:12:27] [INFO ] Deduced a trap composed of 182 places in 1039 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :69 after 92
[2025-06-02 22:12:28] [INFO ] Deduced a trap composed of 92 places in 1055 ms of which 8 ms to minimize.
SMT process timed out in 5817ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 139 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 979/979 places, 4272/4272 transitions.
RANDOM walk for 40000 steps (839 resets) in 2337 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (120 resets) in 356 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (118 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
Interrupted probabilistic random walk after 49581 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 49581 steps, saw 20966 distinct states, run finished after 3004 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-02 22:12:32] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:12:32] [INFO ] Invariant cache hit.
[2025-06-02 22:12:32] [INFO ] State equation strengthened by 2721 read => feed constraints.
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) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 22:12:33] [INFO ] Deduced a trap composed of 177 places in 1120 ms of which 9 ms to minimize.
[2025-06-02 22:12:34] [INFO ] Deduced a trap composed of 247 places in 1130 ms of which 8 ms to minimize.
[2025-06-02 22:12:36] [INFO ] Deduced a trap composed of 137 places in 1120 ms of which 8 ms to minimize.
[2025-06-02 22:12:37] [INFO ] Deduced a trap composed of 182 places in 1078 ms of which 9 ms to minimize.
[2025-06-02 22:12:38] [INFO ] Deduced a trap composed of 92 places in 1042 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
[2025-06-02 22:12:39] [INFO ] Deduced a trap composed of 129 places in 1027 ms of which 8 ms to minimize.
[2025-06-02 22:12:40] [INFO ] Deduced a trap composed of 87 places in 1037 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/963 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/979 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4854 variables, 979/1035 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4854 variables, 2721/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4854 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4854 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4854/4854 variables, and 3756 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10485 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 2721/2721 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 22:12:44] [INFO ] Deduced a trap composed of 5 places in 954 ms of which 9 ms to minimize.
[2025-06-02 22:12:45] [INFO ] Deduced a trap composed of 46 places in 913 ms of which 8 ms to minimize.
[2025-06-02 22:12:46] [INFO ] Deduced a trap composed of 160 places in 962 ms of which 10 ms to minimize.
[2025-06-02 22:12:47] [INFO ] Deduced a trap composed of 151 places in 945 ms of which 8 ms to minimize.
[2025-06-02 22:12:47] [INFO ] Deduced a trap composed of 189 places in 955 ms of which 9 ms to minimize.
[2025-06-02 22:12:48] [INFO ] Deduced a trap composed of 153 places in 896 ms of which 9 ms to minimize.
[2025-06-02 22:12:49] [INFO ] Deduced a trap composed of 151 places in 888 ms of which 9 ms to minimize.
[2025-06-02 22:12:50] [INFO ] Deduced a trap composed of 152 places in 917 ms of which 9 ms to minimize.
[2025-06-02 22:12:51] [INFO ] Deduced a trap composed of 157 places in 934 ms of which 9 ms to minimize.
[2025-06-02 22:12:52] [INFO ] Deduced a trap composed of 140 places in 958 ms of which 9 ms to minimize.
[2025-06-02 22:12:53] [INFO ] Deduced a trap composed of 141 places in 933 ms of which 8 ms to minimize.
[2025-06-02 22:12:54] [INFO ] Deduced a trap composed of 140 places in 865 ms of which 9 ms to minimize.
[2025-06-02 22:12:55] [INFO ] Deduced a trap composed of 150 places in 871 ms of which 8 ms to minimize.
[2025-06-02 22:12:56] [INFO ] Deduced a trap composed of 140 places in 877 ms of which 9 ms to minimize.
[2025-06-02 22:12:57] [INFO ] Deduced a trap composed of 139 places in 874 ms of which 8 ms to minimize.
[2025-06-02 22:12:58] [INFO ] Deduced a trap composed of 159 places in 891 ms of which 9 ms to minimize.
[2025-06-02 22:12:58] [INFO ] Deduced a trap composed of 173 places in 880 ms of which 8 ms to minimize.
[2025-06-02 22:12:59] [INFO ] Deduced a trap composed of 161 places in 915 ms of which 8 ms to minimize.
[2025-06-02 22:13:00] [INFO ] Deduced a trap composed of 197 places in 909 ms of which 9 ms to minimize.
[2025-06-02 22:13:01] [INFO ] Deduced a trap composed of 157 places in 900 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 22:13:02] [INFO ] Deduced a trap composed of 160 places in 928 ms of which 9 ms to minimize.
[2025-06-02 22:13:03] [INFO ] Deduced a trap composed of 148 places in 929 ms of which 11 ms to minimize.
[2025-06-02 22:13:04] [INFO ] Deduced a trap composed of 160 places in 920 ms of which 9 ms to minimize.
[2025-06-02 22:13:05] [INFO ] Deduced a trap composed of 46 places in 917 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2025-06-02 22:13:06] [INFO ] Deduced a trap composed of 88 places in 917 ms of which 9 ms to minimize.
[2025-06-02 22:13:07] [INFO ] Deduced a trap composed of 71 places in 917 ms of which 9 ms to minimize.
[2025-06-02 22:13:08] [INFO ] Deduced a trap composed of 144 places in 975 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 22:13:09] [INFO ] Deduced a trap composed of 205 places in 952 ms of which 8 ms to minimize.
[2025-06-02 22:13:09] [INFO ] Flatten gal took : 140 ms
[2025-06-02 22:13:09] [INFO ] Applying decomposition
[2025-06-02 22:13:09] [INFO ] Flatten gal took : 144 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17703544511289798898.txt' '-o' '/tmp/graph17703544511289798898.bin' '-w' '/tmp/graph17703544511289798898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17703544511289798898.bin' '-l' '-1' '-v' '-w' '/tmp/graph17703544511289798898.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:13:09] [INFO ] Decomposing Gal with order
[2025-06-02 22:13:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:13:10] [INFO ] Deduced a trap composed of 223 places in 986 ms of which 9 ms to minimize.
[2025-06-02 22:13:10] [INFO ] Removed a total of 8261 redundant transitions.
[2025-06-02 22:13:10] [INFO ] Flatten gal took : 605 ms
[2025-06-02 22:13:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2489 labels/synchronizations in 195 ms.
[2025-06-02 22:13:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18322589140640785554.gal : 32 ms
[2025-06-02 22:13:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2573890604004066350.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18322589140640785554.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2573890604004066350.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2025-06-02 22:13:11] [INFO ] Deduced a trap composed of 208 places in 799 ms of which 8 ms to minimize.
Loading property file /tmp/ReachabilityCardinality2573890604004066350.prop.
[2025-06-02 22:13:12] [INFO ] Deduced a trap composed of 177 places in 1027 ms of which 10 ms to minimize.
[2025-06-02 22:13:13] [INFO ] Deduced a trap composed of 182 places in 1033 ms of which 10 ms to minimize.
[2025-06-02 22:13:14] [INFO ] Deduced a trap composed of 149 places in 1050 ms of which 10 ms to minimize.
[2025-06-02 22:13:15] [INFO ] Deduced a trap composed of 155 places in 955 ms of which 9 ms to minimize.
[2025-06-02 22:13:16] [INFO ] Deduced a trap composed of 149 places in 922 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/935 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 28/963 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 22:13:17] [INFO ] Deduced a trap composed of 183 places in 996 ms of which 9 ms to minimize.
[2025-06-02 22:13:18] [INFO ] Deduced a trap composed of 98 places in 1116 ms of which 9 ms to minimize.
[2025-06-02 22:13:19] [INFO ] Deduced a trap composed of 72 places in 1112 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/979 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/979 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3875/4854 variables, 979/1073 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4854 variables, 2721/3794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4854 variables, 2/3796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 22:13:28] [INFO ] Deduced a trap composed of 410 places in 902 ms of which 9 ms to minimize.
SMT process timed out in 56057ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 221 ms.
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 139 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 979/979 places, 4272/4272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 138 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
[2025-06-02 22:13:28] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:13:28] [INFO ] Invariant cache hit.
[2025-06-02 22:13:30] [INFO ] Implicit Places using invariants in 1953 ms returned []
[2025-06-02 22:13:30] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:13:30] [INFO ] Invariant cache hit.
[2025-06-02 22:13:32] [INFO ] State equation strengthened by 2721 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-02 22:14:02] [INFO ] Performed 504/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 22:14:34] [INFO ] Performed 945/979 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2025-06-02 22:14:40] [INFO ] Implicit Places using invariants and state equation in 69298 ms returned []
Implicit Place search using SMT with State Equation took 71252 ms to find 0 implicit places.
[2025-06-02 22:14:40] [INFO ] Redundant transitions in 513 ms returned []
Running 4210 sub problems to find dead transitions.
[2025-06-02 22:14:40] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2025-06-02 22:14:40] [INFO ] Invariant cache hit.
[2025-06-02 22:14:40] [INFO ] State equation strengthened by 2721 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4210 unsolved
SMT process timed out in 70394ms, After SMT, problems are : Problem set: 0 solved, 4210 unsolved
Search for dead transitions found 0 dead transitions in 70478ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142403 ms. Remains : 979/979 places, 4272/4272 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13 in 535675 ms.
[2025-06-02 22:15:51] [INFO ] Flatten gal took : 219 ms
[2025-06-02 22:15:51] [INFO ] Applying decomposition
[2025-06-02 22:15:51] [INFO ] Flatten gal took : 225 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15654950980845783027.txt' '-o' '/tmp/graph15654950980845783027.bin' '-w' '/tmp/graph15654950980845783027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15654950980845783027.bin' '-l' '-1' '-v' '-w' '/tmp/graph15654950980845783027.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:15:52] [INFO ] Decomposing Gal with order
[2025-06-02 22:15:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:15:52] [INFO ] Removed a total of 8261 redundant transitions.
[2025-06-02 22:15:52] [INFO ] Flatten gal took : 763 ms
[2025-06-02 22:15:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2767 labels/synchronizations in 181 ms.
[2025-06-02 22:15:53] [INFO ] Time to serialize gal into /tmp/UpperBounds1415782268234830385.gal : 31 ms
[2025-06-02 22:15:53] [INFO ] Time to serialize properties into /tmp/UpperBounds3732053560701290677.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1415782268234830385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3732053560701290677.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds3732053560701290677.prop.
ITS-tools command line returned an error code 137
[2025-06-02 22:25:48] [INFO ] Flatten gal took : 137 ms
[2025-06-02 22:25:48] [INFO ] Time to serialize gal into /tmp/UpperBounds15949639635566627104.gal : 30 ms
[2025-06-02 22:25:48] [INFO ] Time to serialize properties into /tmp/UpperBounds758220867733662411.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15949639635566627104.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds758220867733662411.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds758220867733662411.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="MultiCrashLeafsetExtension-PT-S16C08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, 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 r139-smll-174876533200042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 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 ;