About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FTFFTFFFTFFTFF?T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524300332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524300332
=====================================================================
--------------------
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 booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748972268280
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-06-03 17:37:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 17:37:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 17:37:52] [INFO ] Load time of PNML (sax parser for PT used): 864 ms
[2025-06-03 17:37:52] [INFO ] Transformed 6876 places.
[2025-06-03 17:37:52] [INFO ] Transformed 9571 transitions.
[2025-06-03 17:37:52] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 1159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 6876 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 6840 transition count 9571
Discarding 2155 places :
Symmetric choice reduction at 1 with 2155 rule applications. Total rules 2191 place count 4685 transition count 7416
Iterating global reduction 1 with 2155 rules applied. Total rules applied 4346 place count 4685 transition count 7416
Discarding 1892 places :
Symmetric choice reduction at 1 with 1892 rule applications. Total rules 6238 place count 2793 transition count 5524
Iterating global reduction 1 with 1892 rules applied. Total rules applied 8130 place count 2793 transition count 5524
Discarding 221 places :
Symmetric choice reduction at 1 with 221 rule applications. Total rules 8351 place count 2572 transition count 3756
Iterating global reduction 1 with 221 rules applied. Total rules applied 8572 place count 2572 transition count 3756
Applied a total of 8572 rules in 2430 ms. Remains 2572 /6876 variables (removed 4304) and now considering 3756/9571 (removed 5815) transitions.
[2025-06-03 17:37:55] [INFO ] Flow matrix only has 3484 transitions (discarded 272 similar events)
// Phase 1: matrix 3484 rows 2572 cols
[2025-06-03 17:37:55] [INFO ] Computed 613 invariants in 335 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:38:03] [INFO ] Implicit Places using invariants in 7770 ms returned [4, 8, 12, 14, 16, 20, 22, 26, 28, 33, 40, 49, 63, 76, 93, 109, 125, 127, 129, 131, 133, 135, 139, 141, 156, 167, 176, 183, 191, 226, 233, 236, 237, 238, 239, 240, 241, 242, 243, 244, 247, 252, 259, 268, 279, 292, 306, 320, 321, 322, 323, 324, 325, 326, 327, 328, 339, 348, 355, 360, 363, 365, 400, 407, 410, 411, 412, 413, 414, 415, 416, 417, 418, 420, 423, 428, 435, 444, 455, 467, 479, 480, 481, 482, 483, 484, 485, 486, 487, 496, 503, 508, 511, 513, 515, 550, 557, 560, 561, 562, 563, 564, 565, 566, 567, 568, 570, 572, 575, 580, 587, 596, 606, 616, 617, 618, 619, 620, 621, 622, 623, 624, 631, 636, 639, 641, 643, 645, 680, 687, 690, 691, 692, 693, 694, 695, 696, 697, 698, 700, 702, 704, 707, 712, 719, 727, 735, 736, 737, 738, 739, 740, 741, 742, 743, 748, 751, 753, 755, 757, 759, 794, 801, 804, 805, 806, 807, 808, 809, 810, 811, 812, 814, 816, 818, 820, 823, 828, 834, 840, 841, 842, 844, 845, 846, 847, 848, 853, 855, 857, 859, 861, 863, 898, 905, 908, 909, 910, 911, 912, 913, 914, 915, 916, 918, 921, 923, 925, 927, 930, 934, 938, 939, 940, 941, 942, 943, 944, 945, 946, 948, 950, 952, 954, 956, 958, 993, 1000, 1003, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1013, 1015, 1017, 1019, 1023, 1025, 1027, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1041, 1043, 1045, 1047, 1049, 1051, 1086, 1088, 1092, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1105, 1107, 1109, 1111, 1113, 1115, 1117, 1120, 1121, 1122, 1124, 1125, 1126, 1127, 1128, 1130, 1132, 1134, 1136, 1140, 1142, 1177, 1184, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1197, 1199, 1201, 1203, 1205, 1207, 1209, 1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1222, 1224, 1227, 1229, 1231, 1233, 1268, 1275, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1288, 1290, 1292, 1294, 1296, 1298, 1301, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1317, 1319, 1321, 1323, 1325, 1327, 1362, 1369, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1382, 1384, 1386, 1388, 1390, 1393, 1398, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1418, 1421, 1423, 1425, 1427, 1429, 1464, 1471, 1474, 1475, 1477, 1478, 1479, 1480, 1481, 1482, 1484, 1486, 1488, 1490, 1493, 1500, 1507, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1531, 1536, 1539, 1541, 1543, 1545, 1580, 1587, 1590, 1591, 1593, 1594, 1595, 1596, 1597, 1598, 1600, 1602, 1604, 1607, 1612, 1622, 1631, 1642, 1643, 1644, 1645, 1646, 1647, 1648, 1649, 1650, 1659, 1666, 1671, 1674, 1676, 1679, 1714, 1721, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1734, 1736, 1739, 1744, 1751, 1760, 1771, 1784, 1785, 1786, 1787, 1788, 1789, 1790, 1791, 1792, 1803, 1812, 1819, 1824, 1827, 1829, 1864, 1871, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1884, 1888, 1893, 1900, 1909, 1920, 1933, 1948, 1949, 1950, 1952, 1953, 1954, 1955, 1956, 1969, 1983, 1992, 1999, 2004, 2007, 2044, 2048, 2051, 2053, 2054, 2055, 2056, 2057, 2058, 2059, 2063, 2071, 2078, 2087, 2098, 2111, 2126, 2143, 2144, 2145, 2146, 2148, 2150, 2151, 2166, 2179, 2194, 2203, 2210, 2215, 2251]
[2025-06-03 17:38:03] [INFO ] Actually due to overlaps returned [226, 400, 550, 680, 794, 898, 993, 1086, 1177, 1268, 1362, 1464, 1580, 1714, 1864, 2251, 4, 12, 14, 16, 20, 22, 26, 125, 127, 129, 131, 133, 135, 139, 236, 237, 238, 239, 240, 241, 242, 243, 320, 321, 322, 323, 324, 325, 326, 327, 363, 410, 411, 412, 413, 414, 415, 416, 417, 479, 480, 481, 482, 483, 484, 485, 486, 513, 560, 561, 562, 563, 564, 565, 566, 567, 616, 617, 618, 619, 620, 621, 622, 623, 643, 690, 691, 692, 693, 694, 695, 696, 697, 735, 736, 737, 738, 739, 740, 741, 742, 757, 804, 805, 806, 807, 808, 809, 810, 811, 840, 841, 842, 844, 845, 846, 847, 861, 908, 909, 910, 911, 912, 913, 914, 915, 938, 939, 940, 941, 942, 943, 944, 945, 956, 1003, 1005, 1006, 1007, 1008, 1009, 1010, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1049, 1088, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1120, 1121, 1122, 1124, 1125, 1126, 1127, 1140, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1231, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1325, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1427, 1474, 1475, 1477, 1478, 1479, 1480, 1481, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1543, 1590, 1591, 1593, 1594, 1595, 1596, 1597, 1642, 1643, 1644, 1645, 1646, 1647, 1648, 1649, 1676, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1784, 1785, 1786, 1787, 1788, 1789, 1790, 1791, 1827, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1948, 1949, 1950, 1952, 1953, 1954, 1955, 2044, 2051, 2053, 2054, 2055, 2056, 2057, 2058, 2143, 2144, 2145, 2146, 2148, 2150, 2215]
Discarding 294 places :
Implicit Place search using SMT only with invariants took 7840 ms to find 294 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2278/6876 places, 3756/9571 transitions.
Discarding 244 places :
Symmetric choice reduction at 0 with 244 rule applications. Total rules 244 place count 2034 transition count 3512
Iterating global reduction 0 with 244 rules applied. Total rules applied 488 place count 2034 transition count 3512
Discarding 243 places :
Symmetric choice reduction at 0 with 243 rule applications. Total rules 731 place count 1791 transition count 3269
Iterating global reduction 0 with 243 rules applied. Total rules applied 974 place count 1791 transition count 3269
Discarding 242 places :
Symmetric choice reduction at 0 with 242 rule applications. Total rules 1216 place count 1549 transition count 3027
Iterating global reduction 0 with 242 rules applied. Total rules applied 1458 place count 1549 transition count 3027
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1478 place count 1529 transition count 2867
Iterating global reduction 0 with 20 rules applied. Total rules applied 1498 place count 1529 transition count 2867
Applied a total of 1498 rules in 711 ms. Remains 1529 /2278 variables (removed 749) and now considering 2867/3756 (removed 889) transitions.
[2025-06-03 17:38:03] [INFO ] Flow matrix only has 2595 transitions (discarded 272 similar events)
// Phase 1: matrix 2595 rows 1529 cols
[2025-06-03 17:38:03] [INFO ] Computed 319 invariants in 126 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:38:08] [INFO ] Implicit Places using invariants in 4864 ms returned [7, 21, 26, 33, 42, 56, 69, 86, 102, 127, 142, 153, 162, 169, 177, 218, 221, 224, 229, 236, 245, 256, 269, 283, 297, 308, 317, 324, 329, 333, 349, 351, 353, 356, 361, 368, 377, 388, 400, 412, 421, 428, 433, 436, 439, 448, 451, 453, 455, 458, 463, 470, 479, 489, 498, 505, 510, 513, 515, 518, 528, 530, 532, 534, 536, 539, 544, 551, 559, 566, 571, 574, 576, 578, 581, 590, 592, 594, 596, 598, 600, 603, 608, 614, 621, 626, 628, 630, 632, 635, 646, 648, 650, 653, 655, 657, 659, 662, 666, 669, 671, 673, 675, 677, 680, 689, 693, 695, 697, 699, 701, 705, 707, 709, 712, 714, 716, 718, 720, 723, 732, 734, 736, 738, 740, 742, 744, 746, 748, 752, 754, 756, 758, 760, 765, 776, 778, 780, 782, 784, 786, 788, 790, 792, 794, 796, 798, 801, 803, 806, 815, 817, 819, 821, 823, 825, 827, 829, 832, 836, 839, 841, 843, 845, 848, 857, 859, 861, 863, 865, 867, 869, 872, 877, 883, 888, 891, 893, 895, 898, 907, 911, 913, 915, 917, 919, 922, 929, 936, 944, 951, 956, 959, 961, 964, 975, 979, 981, 983, 985, 988, 993, 1003, 1012, 1022, 1031, 1038, 1043, 1046, 1050, 1061, 1063, 1065, 1067, 1070, 1075, 1082, 1091, 1102, 1114, 1125, 1134, 1141, 1146, 1150, 1159, 1161, 1163, 1167, 1172, 1179, 1188, 1199, 1212, 1228, 1241, 1255, 1264, 1271, 1276, 1279, 1289, 1293, 1297, 1305, 1312, 1321, 1332, 1345, 1360, 1379, 1394, 1407, 1422, 1431, 1438]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 4874 ms to find 256 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1273/6876 places, 2867/9571 transitions.
Applied a total of 0 rules in 122 ms. Remains 1273 /1273 variables (removed 0) and now considering 2867/2867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 16006 ms. Remains : 1273/6876 places, 2867/9571 transitions.
Support contains 59 out of 1273 places after structural reductions.
[2025-06-03 17:38:09] [INFO ] Flatten gal took : 506 ms
[2025-06-03 17:38:10] [INFO ] Flatten gal took : 218 ms
[2025-06-03 17:38:10] [INFO ] Input system was already deterministic with 2867 transitions.
RANDOM walk for 40000 steps (479 resets) in 2943 ms. (13 steps per ms) remains 17/31 properties
BEST_FIRST walk for 4001 steps (12 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 59 ms. (66 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 74 ms. (53 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (12 resets) in 71 ms. (55 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 69 ms. (57 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (12 resets) in 72 ms. (54 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 73 ms. (54 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 60 ms. (65 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 53 ms. (74 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 55 ms. (71 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (12 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (12 resets) in 36 ms. (108 steps per ms) remains 16/17 properties
[2025-06-03 17:38:11] [INFO ] Flow matrix only has 2595 transitions (discarded 272 similar events)
// Phase 1: matrix 2595 rows 1273 cols
[2025-06-03 17:38:11] [INFO ] Computed 63 invariants in 85 ms
[2025-06-03 17:38:11] [INFO ] State equation strengthened by 1035 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 2 (OVERLAPS) 1163/1196 variables, 15/16 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1196 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 3/1199 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1199 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 53/1252 variables, 23/42 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 14/1266 variables, 14/56 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 0/56 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 7/1273 variables, 7/63 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1273 variables, 0/63 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 2595/3868 variables, 1273/1336 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3868 variables, 1035/2371 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3868/3868 variables, and 2371 constraints, problems are : Problem set: 3 solved, 13 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1273/1273 constraints, ReadFeed: 1035/1035 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1166/1192 variables, 13/14 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:19] [INFO ] Deduced a trap composed of 202 places in 1657 ms of which 322 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:21] [INFO ] Deduced a trap composed of 223 places in 1640 ms of which 365 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:23] [INFO ] Deduced a trap composed of 202 places in 1879 ms of which 494 ms to minimize.
SMT process timed out in 11267ms, After SMT, problems are : Problem set: 3 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 26 out of 1273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1273 transition count 2838
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1244 transition count 2838
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 58 place count 1244 transition count 2817
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 100 place count 1223 transition count 2817
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 109 place count 1214 transition count 2780
Iterating global reduction 2 with 9 rules applied. Total rules applied 118 place count 1214 transition count 2780
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 123 place count 1209 transition count 2747
Iterating global reduction 2 with 5 rules applied. Total rules applied 128 place count 1209 transition count 2747
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 1208 transition count 2739
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 1208 transition count 2739
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 188 place count 1179 transition count 2710
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 193 place count 1174 transition count 2705
Iterating global reduction 2 with 5 rules applied. Total rules applied 198 place count 1174 transition count 2705
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 202 place count 1170 transition count 2673
Iterating global reduction 2 with 4 rules applied. Total rules applied 206 place count 1170 transition count 2673
Free-agglomeration rule (complex) applied 144 times.
Iterating global reduction 2 with 144 rules applied. Total rules applied 350 place count 1170 transition count 4307
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 2 with 144 rules applied. Total rules applied 494 place count 1026 transition count 4307
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 503 place count 1026 transition count 4307
Applied a total of 503 rules in 1451 ms. Remains 1026 /1273 variables (removed 247) and now considering 4307/2867 (removed -1440) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1463 ms. Remains : 1026/1273 places, 4307/2867 transitions.
RANDOM walk for 40000 steps (839 resets) in 2251 ms. (17 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (121 resets) in 312 ms. (127 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (119 resets) in 303 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (108 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (117 resets) in 358 ms. (111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (105 resets) in 260 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (105 resets) in 254 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (119 resets) in 269 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (121 resets) in 206 ms. (193 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (118 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (117 resets) in 200 ms. (199 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (120 resets) in 356 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (119 resets) in 291 ms. (136 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 40471 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :0 out of 12
Probabilistic random walk after 40471 steps, saw 17266 distinct states, run finished after 3009 ms. (steps per millisecond=13 ) properties seen :0
[2025-06-03 17:38:29] [INFO ] Flow matrix only has 3910 transitions (discarded 397 similar events)
// Phase 1: matrix 3910 rows 1026 cols
[2025-06-03 17:38:29] [INFO ] Computed 63 invariants in 43 ms
[2025-06-03 17:38:29] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 929/953 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/953 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/956 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/956 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 46/1002 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 16/1018 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1018 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 8/1026 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1026 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 3910/4936 variables, 1026/1089 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/4936 variables, 2722/3811 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4936 variables, 0/3811 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/4936 variables, 0/3811 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4936/4936 variables, and 3811 constraints, problems are : Problem set: 2 solved, 10 unsolved in 16182 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1026/1026 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 929/951 variables, 12/13 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:47] [INFO ] Deduced a trap composed of 108 places in 1636 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:48] [INFO ] Deduced a trap composed of 267 places in 1457 ms of which 394 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:50] [INFO ] Deduced a trap composed of 109 places in 1615 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:52] [INFO ] Deduced a trap composed of 95 places in 1588 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:53] [INFO ] Deduced a trap composed of 95 places in 1413 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:55] [INFO ] Deduced a trap composed of 691 places in 1473 ms of which 357 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:56] [INFO ] Deduced a trap composed of 125 places in 1425 ms of which 176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:58] [INFO ] Deduced a trap composed of 526 places in 1375 ms of which 317 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:38:59] [INFO ] Deduced a trap composed of 140 places in 1457 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:01] [INFO ] Deduced a trap composed of 409 places in 1752 ms of which 591 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:02] [INFO ] Deduced a trap composed of 90 places in 1535 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:04] [INFO ] Deduced a trap composed of 93 places in 1341 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:05] [INFO ] Deduced a trap composed of 95 places in 1397 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:07] [INFO ] Deduced a trap composed of 121 places in 1361 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:08] [INFO ] Deduced a trap composed of 124 places in 1437 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:09] [INFO ] Deduced a trap composed of 126 places in 1298 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:11] [INFO ] Deduced a trap composed of 90 places in 1407 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:12] [INFO ] Deduced a trap composed of 93 places in 1504 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:14] [INFO ] Deduced a trap composed of 95 places in 1622 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:16] [INFO ] Deduced a trap composed of 103 places in 1458 ms of which 166 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/951 variables, 20/33 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:17] [INFO ] Deduced a trap composed of 135 places in 1509 ms of which 176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:19] [INFO ] Deduced a trap composed of 146 places in 1456 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:20] [INFO ] Deduced a trap composed of 103 places in 1613 ms of which 240 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:22] [INFO ] Deduced a trap composed of 127 places in 1444 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:23] [INFO ] Deduced a trap composed of 90 places in 1226 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:25] [INFO ] Deduced a trap composed of 132 places in 1524 ms of which 181 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:26] [INFO ] Deduced a trap composed of 138 places in 1355 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:27] [INFO ] Deduced a trap composed of 134 places in 1394 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:29] [INFO ] Deduced a trap composed of 104 places in 1307 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:30] [INFO ] Deduced a trap composed of 110 places in 1291 ms of which 157 ms to minimize.
SMT process timed out in 61387ms, After SMT, problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22 out of 1026 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 4307/4307 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1026 transition count 4306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1025 transition count 4306
Applied a total of 2 rules in 494 ms. Remains 1025 /1026 variables (removed 1) and now considering 4306/4307 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 1025/1026 places, 4306/4307 transitions.
RANDOM walk for 40000 steps (840 resets) in 1406 ms. (28 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (120 resets) in 202 ms. (197 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (107 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (115 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (108 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (107 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (119 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (120 resets) in 202 ms. (197 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (119 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (121 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (120 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 36400 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :0 out of 10
Probabilistic random walk after 36400 steps, saw 15574 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
[2025-06-03 17:39:34] [INFO ] Flow matrix only has 3909 transitions (discarded 397 similar events)
// Phase 1: matrix 3909 rows 1025 cols
[2025-06-03 17:39:35] [INFO ] Computed 63 invariants in 78 ms
[2025-06-03 17:39:35] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 928/950 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/952 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/952 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 46/998 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/998 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 18/1016 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1016 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 9/1025 variables, 9/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1025 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 3909/4934 variables, 1025/1088 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4934 variables, 2722/3810 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4934 variables, 0/3810 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/4934 variables, 0/3810 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4934/4934 variables, and 3810 constraints, problems are : Problem set: 0 solved, 10 unsolved in 17136 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1025/1025 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 928/950 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:54] [INFO ] Deduced a trap composed of 132 places in 1483 ms of which 213 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:55] [INFO ] Deduced a trap composed of 130 places in 1489 ms of which 197 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:57] [INFO ] Deduced a trap composed of 131 places in 1423 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:58] [INFO ] Deduced a trap composed of 114 places in 1438 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:39:59] [INFO ] Deduced a trap composed of 267 places in 1328 ms of which 385 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:01] [INFO ] Deduced a trap composed of 178 places in 1259 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:02] [INFO ] Deduced a trap composed of 167 places in 1399 ms of which 231 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:03] [INFO ] Deduced a trap composed of 108 places in 1232 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:05] [INFO ] Deduced a trap composed of 124 places in 1341 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:06] [INFO ] Deduced a trap composed of 114 places in 1359 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:07] [INFO ] Deduced a trap composed of 107 places in 1271 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:09] [INFO ] Deduced a trap composed of 690 places in 1338 ms of which 367 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:10] [INFO ] Deduced a trap composed of 94 places in 1332 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:12] [INFO ] Deduced a trap composed of 139 places in 1397 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:13] [INFO ] Deduced a trap composed of 146 places in 1409 ms of which 217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:15] [INFO ] Deduced a trap composed of 409 places in 1589 ms of which 594 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:16] [INFO ] Deduced a trap composed of 124 places in 1350 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:17] [INFO ] Deduced a trap composed of 132 places in 1372 ms of which 202 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:19] [INFO ] Deduced a trap composed of 137 places in 1415 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:20] [INFO ] Deduced a trap composed of 107 places in 1363 ms of which 169 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:22] [INFO ] Deduced a trap composed of 152 places in 1310 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:23] [INFO ] Deduced a trap composed of 157 places in 1309 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:24] [INFO ] Deduced a trap composed of 102 places in 1271 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:26] [INFO ] Deduced a trap composed of 107 places in 1261 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:27] [INFO ] Deduced a trap composed of 102 places in 1253 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:28] [INFO ] Deduced a trap composed of 89 places in 1313 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:30] [INFO ] Deduced a trap composed of 94 places in 1333 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:31] [INFO ] Deduced a trap composed of 101 places in 1493 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:32] [INFO ] Deduced a trap composed of 132 places in 1375 ms of which 180 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:34] [INFO ] Deduced a trap composed of 518 places in 1302 ms of which 326 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:35] [INFO ] Deduced a trap composed of 106 places in 1340 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:36] [INFO ] Deduced a trap composed of 137 places in 1274 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:38] [INFO ] Deduced a trap composed of 523 places in 1249 ms of which 329 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:39] [INFO ] Deduced a trap composed of 520 places in 1274 ms of which 326 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:40] [INFO ] Deduced a trap composed of 106 places in 1281 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:42] [INFO ] Deduced a trap composed of 525 places in 1249 ms of which 325 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:43] [INFO ] Deduced a trap composed of 89 places in 1219 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:44] [INFO ] Deduced a trap composed of 92 places in 1219 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:46] [INFO ] Deduced a trap composed of 94 places in 1298 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:47] [INFO ] Deduced a trap composed of 89 places in 1245 ms of which 88 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/950 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:48] [INFO ] Deduced a trap composed of 133 places in 1342 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:50] [INFO ] Deduced a trap composed of 123 places in 1297 ms of which 116 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/950 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:52] [INFO ] Deduced a trap composed of 92 places in 1267 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:53] [INFO ] Deduced a trap composed of 94 places in 1299 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:54] [INFO ] Deduced a trap composed of 119 places in 1304 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:56] [INFO ] Deduced a trap composed of 122 places in 1233 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:57] [INFO ] Deduced a trap composed of 124 places in 1326 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:58] [INFO ] Deduced a trap composed of 109 places in 1231 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:40:59] [INFO ] Deduced a trap composed of 126 places in 1189 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:41:01] [INFO ] Deduced a trap composed of 112 places in 1259 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:41:02] [INFO ] Deduced a trap composed of 114 places in 1253 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:41:03] [INFO ] Deduced a trap composed of 129 places in 1269 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:41:05] [INFO ] Deduced a trap composed of 131 places in 1280 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:41:06] [INFO ] Deduced a trap composed of 134 places in 1244 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:41:07] [INFO ] Deduced a trap composed of 137 places in 1258 ms of which 131 ms to minimize.
SMT process timed out in 92719ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22 out of 1025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 4306/4306 transitions.
Applied a total of 0 rules in 158 ms. Remains 1025 /1025 variables (removed 0) and now considering 4306/4306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 1025/1025 places, 4306/4306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 4306/4306 transitions.
Applied a total of 0 rules in 157 ms. Remains 1025 /1025 variables (removed 0) and now considering 4306/4306 (removed 0) transitions.
[2025-06-03 17:41:07] [INFO ] Flow matrix only has 3909 transitions (discarded 397 similar events)
[2025-06-03 17:41:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:10] [INFO ] Implicit Places using invariants in 2927 ms returned [7, 124, 426, 465, 495, 584, 625, 801, 841, 846, 911]
[2025-06-03 17:41:10] [INFO ] Actually due to overlaps returned [841, 7, 426, 465, 495, 584, 625, 801, 846, 911]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 2932 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1015/1025 places, 4306/4306 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1011 transition count 4302
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1011 transition count 4302
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1007 transition count 4298
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1007 transition count 4298
Applied a total of 16 rules in 257 ms. Remains 1007 /1015 variables (removed 8) and now considering 4298/4306 (removed 8) transitions.
[2025-06-03 17:41:11] [INFO ] Flow matrix only has 3901 transitions (discarded 397 similar events)
// Phase 1: matrix 3901 rows 1007 cols
[2025-06-03 17:41:11] [INFO ] Computed 53 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:13] [INFO ] Implicit Places using invariants in 2338 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2342 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1006/1025 places, 4298/4306 transitions.
Applied a total of 0 rules in 150 ms. Remains 1006 /1006 variables (removed 0) and now considering 4298/4298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5841 ms. Remains : 1006/1025 places, 4298/4306 transitions.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 441 stabilizing places and 1234 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1273 transition count 2838
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1244 transition count 2838
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 58 place count 1244 transition count 2814
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 106 place count 1220 transition count 2814
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 121 place count 1205 transition count 2757
Iterating global reduction 2 with 15 rules applied. Total rules applied 136 place count 1205 transition count 2757
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 136 place count 1205 transition count 2755
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 1203 transition count 2755
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 148 place count 1195 transition count 2698
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 1195 transition count 2698
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 1194 transition count 2690
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 1194 transition count 2690
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 210 place count 1168 transition count 2664
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 215 place count 1163 transition count 2659
Iterating global reduction 2 with 5 rules applied. Total rules applied 220 place count 1163 transition count 2659
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 225 place count 1158 transition count 2619
Iterating global reduction 2 with 5 rules applied. Total rules applied 230 place count 1158 transition count 2619
Applied a total of 230 rules in 819 ms. Remains 1158 /1273 variables (removed 115) and now considering 2619/2867 (removed 248) transitions.
[2025-06-03 17:41:14] [INFO ] Flow matrix only has 2347 transitions (discarded 272 similar events)
// Phase 1: matrix 2347 rows 1158 cols
[2025-06-03 17:41:14] [INFO ] Computed 63 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:16] [INFO ] Implicit Places using invariants in 1995 ms returned [9, 10, 95, 136, 484, 528, 559, 659, 708, 911, 957, 963, 1036, 1037]
[2025-06-03 17:41:16] [INFO ] Actually due to overlaps returned [957, 9, 10, 95, 484, 528, 559, 659, 708, 911, 963, 1036, 1037]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1998 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1145/1273 places, 2619/2867 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1138 transition count 2612
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1138 transition count 2612
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1131 transition count 2605
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1131 transition count 2605
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1126 transition count 2565
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1126 transition count 2565
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1121 transition count 2560
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 1116 transition count 2555
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 1116 transition count 2555
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1111 transition count 2515
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1111 transition count 2515
Applied a total of 68 rules in 611 ms. Remains 1111 /1145 variables (removed 34) and now considering 2515/2619 (removed 104) transitions.
[2025-06-03 17:41:17] [INFO ] Flow matrix only has 2243 transitions (discarded 272 similar events)
// Phase 1: matrix 2243 rows 1111 cols
[2025-06-03 17:41:17] [INFO ] Computed 50 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:19] [INFO ] Implicit Places using invariants in 2064 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2067 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1110/1273 places, 2515/2867 transitions.
Applied a total of 0 rules in 117 ms. Remains 1110 /1110 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5614 ms. Remains : 1110/1273 places, 2515/2867 transitions.
Stuttering acceptance computed with spot in 361 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 finished in 6072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0 U p1)) U (p0||X(F(p2)))) U X(p3)))'
Support contains 8 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1255 transition count 2807
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1255 transition count 2807
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1244 transition count 2761
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1244 transition count 2761
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1238 transition count 2713
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1238 transition count 2713
Applied a total of 70 rules in 309 ms. Remains 1238 /1273 variables (removed 35) and now considering 2713/2867 (removed 154) transitions.
[2025-06-03 17:41:20] [INFO ] Flow matrix only has 2441 transitions (discarded 272 similar events)
// Phase 1: matrix 2441 rows 1238 cols
[2025-06-03 17:41:20] [INFO ] Computed 63 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:22] [INFO ] Implicit Places using invariants in 2579 ms returned [13, 17, 155, 576, 609, 713, 764, 970, 1017, 1024, 1097, 1098]
[2025-06-03 17:41:22] [INFO ] Actually due to overlaps returned [1017, 13, 17, 576, 609, 713, 764, 970, 1024, 1097, 1098]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2583 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1273 places, 2713/2867 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1217 transition count 2703
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1217 transition count 2703
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1207 transition count 2693
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1207 transition count 2693
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1197 transition count 2683
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1197 transition count 2683
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 1189 transition count 2619
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 1189 transition count 2619
Applied a total of 76 rules in 394 ms. Remains 1189 /1227 variables (removed 38) and now considering 2619/2713 (removed 94) transitions.
[2025-06-03 17:41:23] [INFO ] Flow matrix only has 2347 transitions (discarded 272 similar events)
// Phase 1: matrix 2347 rows 1189 cols
[2025-06-03 17:41:23] [INFO ] Computed 52 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:25] [INFO ] Implicit Places using invariants in 2416 ms returned [153]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2419 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1188/1273 places, 2619/2867 transitions.
Applied a total of 0 rules in 79 ms. Remains 1188 /1188 variables (removed 0) and now considering 2619/2619 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5786 ms. Remains : 1188/1273 places, 2619/2867 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 finished in 6203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1273 transition count 2838
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1244 transition count 2838
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 58 place count 1244 transition count 2815
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 104 place count 1221 transition count 2815
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 118 place count 1207 transition count 2759
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 1207 transition count 2759
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 132 place count 1207 transition count 2757
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 1205 transition count 2757
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 143 place count 1198 transition count 2708
Iterating global reduction 2 with 7 rules applied. Total rules applied 150 place count 1198 transition count 2708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 1197 transition count 2700
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 1197 transition count 2700
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 206 place count 1170 transition count 2673
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 211 place count 1165 transition count 2668
Iterating global reduction 2 with 5 rules applied. Total rules applied 216 place count 1165 transition count 2668
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 221 place count 1160 transition count 2628
Iterating global reduction 2 with 5 rules applied. Total rules applied 226 place count 1160 transition count 2628
Applied a total of 226 rules in 690 ms. Remains 1160 /1273 variables (removed 113) and now considering 2628/2867 (removed 239) transitions.
[2025-06-03 17:41:26] [INFO ] Flow matrix only has 2356 transitions (discarded 272 similar events)
// Phase 1: matrix 2356 rows 1160 cols
[2025-06-03 17:41:26] [INFO ] Computed 63 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:29] [INFO ] Implicit Places using invariants in 2394 ms returned [9, 10, 95, 136, 484, 562, 661, 710, 913, 959, 965, 1038, 1039]
[2025-06-03 17:41:29] [INFO ] Actually due to overlaps returned [959, 9, 10, 95, 484, 562, 661, 710, 913, 965, 1038, 1039]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2397 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1148/1273 places, 2628/2867 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1142 transition count 2622
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1142 transition count 2622
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1136 transition count 2616
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1136 transition count 2616
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1132 transition count 2584
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1132 transition count 2584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 1127 transition count 2579
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 1122 transition count 2574
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 1122 transition count 2574
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1117 transition count 2534
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1117 transition count 2534
Applied a total of 62 rules in 613 ms. Remains 1117 /1148 variables (removed 31) and now considering 2534/2628 (removed 94) transitions.
[2025-06-03 17:41:29] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1117 cols
[2025-06-03 17:41:29] [INFO ] Computed 51 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:31] [INFO ] Implicit Places using invariants in 2092 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2095 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1116/1273 places, 2534/2867 transitions.
Applied a total of 0 rules in 117 ms. Remains 1116 /1116 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5915 ms. Remains : 1116/1273 places, 2534/2867 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 finished in 5971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1273 transition count 2839
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1245 transition count 2839
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 56 place count 1245 transition count 2815
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 1221 transition count 2815
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 118 place count 1207 transition count 2766
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 1207 transition count 2766
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 132 place count 1207 transition count 2764
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 1205 transition count 2764
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 144 place count 1197 transition count 2707
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 1197 transition count 2707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 1196 transition count 2699
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 1196 transition count 2699
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 208 place count 1169 transition count 2672
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 212 place count 1165 transition count 2668
Iterating global reduction 2 with 4 rules applied. Total rules applied 216 place count 1165 transition count 2668
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 220 place count 1161 transition count 2636
Iterating global reduction 2 with 4 rules applied. Total rules applied 224 place count 1161 transition count 2636
Applied a total of 224 rules in 650 ms. Remains 1161 /1273 variables (removed 112) and now considering 2636/2867 (removed 231) transitions.
[2025-06-03 17:41:32] [INFO ] Flow matrix only has 2364 transitions (discarded 272 similar events)
// Phase 1: matrix 2364 rows 1161 cols
[2025-06-03 17:41:32] [INFO ] Computed 63 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:34] [INFO ] Implicit Places using invariants in 2113 ms returned [10, 98, 139, 487, 532, 563, 662, 711, 914, 960, 966, 1039, 1040]
[2025-06-03 17:41:34] [INFO ] Actually due to overlaps returned [960, 10, 98, 487, 532, 563, 662, 711, 914, 966, 1039, 1040]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2116 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1149/1273 places, 2636/2867 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1142 transition count 2629
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1142 transition count 2629
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1135 transition count 2622
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1135 transition count 2622
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1130 transition count 2582
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1130 transition count 2582
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 1126 transition count 2578
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1122 transition count 2574
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1122 transition count 2574
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1118 transition count 2542
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1118 transition count 2542
Applied a total of 62 rules in 607 ms. Remains 1118 /1149 variables (removed 31) and now considering 2542/2636 (removed 94) transitions.
[2025-06-03 17:41:35] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1118 cols
[2025-06-03 17:41:35] [INFO ] Computed 51 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:37] [INFO ] Implicit Places using invariants in 2065 ms returned [137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2071 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1117/1273 places, 2542/2867 transitions.
Applied a total of 0 rules in 116 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5561 ms. Remains : 1117/1273 places, 2542/2867 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 finished in 5696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(!p0)&&(!p1 U (p2||G(!p1))))||G(!p0))))||(!p3&&X(X(X(F(((X(!p0)&&(!p1 U (p2||G(!p1))))||G(!p0))))))))))'
Support contains 10 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1255 transition count 2814
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1255 transition count 2814
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 49 place count 1242 transition count 2752
Iterating global reduction 0 with 13 rules applied. Total rules applied 62 place count 1242 transition count 2752
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1237 transition count 2712
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1237 transition count 2712
Applied a total of 72 rules in 287 ms. Remains 1237 /1273 variables (removed 36) and now considering 2712/2867 (removed 155) transitions.
[2025-06-03 17:41:38] [INFO ] Flow matrix only has 2440 transitions (discarded 272 similar events)
// Phase 1: matrix 2440 rows 1237 cols
[2025-06-03 17:41:38] [INFO ] Computed 63 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:40] [INFO ] Implicit Places using invariants in 2611 ms returned [13, 17, 110, 525, 572, 605, 709, 760, 966, 1020, 1094]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2613 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1226/1273 places, 2712/2867 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1215 transition count 2701
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1215 transition count 2701
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1204 transition count 2690
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1204 transition count 2690
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1193 transition count 2679
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1193 transition count 2679
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 1184 transition count 2607
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 1184 transition count 2607
Applied a total of 84 rules in 366 ms. Remains 1184 /1226 variables (removed 42) and now considering 2607/2712 (removed 105) transitions.
[2025-06-03 17:41:41] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1184 cols
[2025-06-03 17:41:41] [INFO ] Computed 52 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:43] [INFO ] Implicit Places using invariants in 2234 ms returned []
[2025-06-03 17:41:43] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2025-06-03 17:41:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:44] [INFO ] State equation strengthened by 853 read => feed constraints.
[2025-06-03 17:42:14] [INFO ] Performed 837/1184 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 17:42:24] [INFO ] Implicit Places using invariants and state equation in 40871 ms returned []
Implicit Place search using SMT with State Equation took 43120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1184/1273 places, 2607/2867 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46389 ms. Remains : 1184/1273 places, 2607/2867 transitions.
Stuttering acceptance computed with spot in 438 ms :[p0, p0, p0, (AND p0 p1 (NOT p2)), p0, p0, p0, (AND (NOT p2) p0 p1), p0]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
Product exploration explored 100000 steps with 25070 reset in 1231 ms.
Product exploration explored 100000 steps with 25051 reset in 1111 ms.
Computed a total of 352 stabilizing places and 974 stable transitions
Computed a total of 352 stabilizing places and 974 stable transitions
Detected a total of 352/1184 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p3)), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND p2 p3 (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p1) (NOT p3) p0)))), (X (NOT (AND (NOT p2) p1 p3 (NOT p0)))), (X (NOT (OR (AND p2 p3 p0) (AND (NOT p1) p3 p0)))), (X (NOT (AND (NOT p2) p1 p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (OR (AND p2 p3) (AND (NOT p1) p3)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p1) (NOT p3) p0))))), (X (X (NOT (AND (NOT p2) p1 p3 (NOT p0))))), (X (X (NOT (OR (AND p2 p3 p0) (AND (NOT p1) p3 p0))))), (X (X (NOT (AND (NOT p2) p1 p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p2 p3) (AND (NOT p1) p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p2 p3 (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 48 factoid took 174 ms. Reduced automaton from 9 states, 42 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[p0, p0, p0, p0, (AND p1 p0 (NOT p2)), p0]
RANDOM walk for 40000 steps (481 resets) in 565 ms. (70 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (136 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (136 resets) in 667 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (136 resets) in 293 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (136 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (136 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
[2025-06-03 17:42:28] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2025-06-03 17:42:28] [INFO ] Invariant cache hit.
[2025-06-03 17:42:28] [INFO ] State equation strengthened by 853 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 1099/1107 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1107 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/1108 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1108 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/1149 variables, 10/17 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1149 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/1175 variables, 26/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1175 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/1184 variables, 9/52 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2335/3519 variables, 1184/1236 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3519 variables, 853/2089 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3519 variables, 0/2089 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3519 variables, 0/2089 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3519/3519 variables, and 2089 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2862 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1184/1184 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1099/1107 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:32] [INFO ] Deduced a trap composed of 174 places in 1157 ms of which 179 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:33] [INFO ] Deduced a trap composed of 174 places in 1175 ms of which 180 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:35] [INFO ] Deduced a trap composed of 134 places in 1022 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:36] [INFO ] Deduced a trap composed of 134 places in 1140 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:37] [INFO ] Deduced a trap composed of 194 places in 1075 ms of which 195 ms to minimize.
SMT process timed out in 8920ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1184/1184 places, 2607/2607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1184 transition count 2576
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1153 transition count 2576
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 62 place count 1153 transition count 2559
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 96 place count 1136 transition count 2559
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 1135 transition count 2558
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1135 transition count 2558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 98 place count 1135 transition count 2557
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1134 transition count 2557
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1133 transition count 2549
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1133 transition count 2549
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 136 place count 1116 transition count 2532
Free-agglomeration rule (complex) applied 128 times.
Iterating global reduction 2 with 128 rules applied. Total rules applied 264 place count 1116 transition count 2404
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 392 place count 988 transition count 2404
Applied a total of 392 rules in 525 ms. Remains 988 /1184 variables (removed 196) and now considering 2404/2607 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 988/1184 places, 2404/2607 transitions.
RANDOM walk for 40000 steps (717 resets) in 595 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (118 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (115 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (118 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (118 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 61088 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 4
Probabilistic random walk after 61088 steps, saw 25898 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2025-06-03 17:42:41] [INFO ] Flow matrix only has 2007 transitions (discarded 397 similar events)
// Phase 1: matrix 2007 rows 988 cols
[2025-06-03 17:42:41] [INFO ] Computed 52 invariants in 25 ms
[2025-06-03 17:42:41] [INFO ] State equation strengthened by 846 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 904/912 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/912 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/913 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/913 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 40/953 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/979 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/988 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/988 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2007/2995 variables, 988/1040 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2995 variables, 846/1886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2995 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2995 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2995/2995 variables, and 1886 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2377 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 988/988 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 904/912 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:44] [INFO ] Deduced a trap composed of 156 places in 973 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:45] [INFO ] Deduced a trap composed of 133 places in 1004 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:46] [INFO ] Deduced a trap composed of 91 places in 918 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:47] [INFO ] Deduced a trap composed of 101 places in 870 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:48] [INFO ] Deduced a trap composed of 84 places in 943 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:49] [INFO ] Deduced a trap composed of 155 places in 972 ms of which 159 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/912 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:50] [INFO ] Deduced a trap composed of 133 places in 951 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:51] [INFO ] Deduced a trap composed of 84 places in 933 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:52] [INFO ] Deduced a trap composed of 115 places in 960 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:53] [INFO ] Deduced a trap composed of 115 places in 959 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:54] [INFO ] Deduced a trap composed of 91 places in 962 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:55] [INFO ] Deduced a trap composed of 101 places in 897 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:56] [INFO ] Deduced a trap composed of 168 places in 998 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:57] [INFO ] Deduced a trap composed of 85 places in 954 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:58] [INFO ] Deduced a trap composed of 84 places in 938 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:42:59] [INFO ] Deduced a trap composed of 85 places in 917 ms of which 107 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/912 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/913 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/913 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 40/953 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:00] [INFO ] Deduced a trap composed of 5 places in 1022 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:02] [INFO ] Deduced a trap composed of 27 places in 1043 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:03] [INFO ] Deduced a trap composed of 57 places in 1095 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:04] [INFO ] Deduced a trap composed of 58 places in 1113 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:05] [INFO ] Deduced a trap composed of 58 places in 1078 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:06] [INFO ] Deduced a trap composed of 58 places in 1038 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:07] [INFO ] Deduced a trap composed of 58 places in 1056 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:08] [INFO ] Deduced a trap composed of 58 places in 1136 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:09] [INFO ] Deduced a trap composed of 58 places in 1111 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:10] [INFO ] Deduced a trap composed of 58 places in 1059 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:12] [INFO ] Deduced a trap composed of 58 places in 1090 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:13] [INFO ] Deduced a trap composed of 58 places in 1000 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:14] [INFO ] Deduced a trap composed of 46 places in 1012 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:14] [INFO ] Deduced a trap composed of 58 places in 879 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:15] [INFO ] Deduced a trap composed of 57 places in 1029 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:17] [INFO ] Deduced a trap composed of 58 places in 1041 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:18] [INFO ] Deduced a trap composed of 58 places in 1019 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:19] [INFO ] Deduced a trap composed of 27 places in 979 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:20] [INFO ] Deduced a trap composed of 57 places in 1020 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:21] [INFO ] Deduced a trap composed of 57 places in 978 ms of which 108 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/953 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:22] [INFO ] Deduced a trap composed of 57 places in 1030 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:23] [INFO ] Deduced a trap composed of 57 places in 967 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:24] [INFO ] Deduced a trap composed of 57 places in 865 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:25] [INFO ] Deduced a trap composed of 57 places in 1004 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:26] [INFO ] Deduced a trap composed of 62 places in 961 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:26] [INFO ] Deduced a trap composed of 85 places in 831 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:27] [INFO ] Deduced a trap composed of 85 places in 989 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:43:28] [INFO ] Deduced a trap composed of 106 places in 983 ms of which 184 ms to minimize.
SMT process timed out in 47734ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 2404/2404 transitions.
Applied a total of 0 rules in 80 ms. Remains 988 /988 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 988/988 places, 2404/2404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 2404/2404 transitions.
Applied a total of 0 rules in 78 ms. Remains 988 /988 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2025-06-03 17:43:29] [INFO ] Flow matrix only has 2007 transitions (discarded 397 similar events)
[2025-06-03 17:43:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:30] [INFO ] Implicit Places using invariants in 1797 ms returned [888]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1800 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 987/988 places, 2404/2404 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 986 transition count 2403
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 986 transition count 2403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 985 transition count 2402
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 985 transition count 2402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 984 transition count 2394
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 984 transition count 2394
Applied a total of 6 rules in 233 ms. Remains 984 /987 variables (removed 3) and now considering 2394/2404 (removed 10) transitions.
[2025-06-03 17:43:31] [INFO ] Flow matrix only has 1997 transitions (discarded 397 similar events)
// Phase 1: matrix 1997 rows 984 cols
[2025-06-03 17:43:31] [INFO ] Computed 51 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:33] [INFO ] Implicit Places using invariants in 1828 ms returned []
[2025-06-03 17:43:33] [INFO ] Flow matrix only has 1997 transitions (discarded 397 similar events)
[2025-06-03 17:43:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:34] [INFO ] State equation strengthened by 839 read => feed constraints.
[2025-06-03 17:44:02] [INFO ] Implicit Places using invariants and state equation in 29839 ms returned [981]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31674 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 983/988 places, 2394/2404 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 983 transition count 2393
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 982 transition count 2393
Applied a total of 2 rules in 90 ms. Remains 982 /983 variables (removed 1) and now considering 2393/2394 (removed 1) transitions.
[2025-06-03 17:44:02] [INFO ] Flow matrix only has 1996 transitions (discarded 397 similar events)
// Phase 1: matrix 1996 rows 982 cols
[2025-06-03 17:44:02] [INFO ] Computed 50 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:04] [INFO ] Implicit Places using invariants in 1882 ms returned []
[2025-06-03 17:44:04] [INFO ] Flow matrix only has 1996 transitions (discarded 397 similar events)
[2025-06-03 17:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:05] [INFO ] State equation strengthened by 839 read => feed constraints.
[2025-06-03 17:44:35] [INFO ] Performed 918/982 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 17:44:38] [INFO ] Implicit Places using invariants and state equation in 33633 ms returned []
Implicit Place search using SMT with State Equation took 35519 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 982/988 places, 2393/2404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 69396 ms. Remains : 982/988 places, 2393/2404 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p3)), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND p2 p3 (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p1) (NOT p3) p0)))), (X (NOT (AND (NOT p2) p1 p3 (NOT p0)))), (X (NOT (OR (AND p2 p3 p0) (AND (NOT p1) p3 p0)))), (X (NOT (AND (NOT p2) p1 p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (OR (AND p2 p3) (AND (NOT p1) p3)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p1) (NOT p3) p0))))), (X (X (NOT (AND (NOT p2) p1 p3 (NOT p0))))), (X (X (NOT (OR (AND p2 p3 p0) (AND (NOT p1) p3 p0))))), (X (X (NOT (AND (NOT p2) p1 p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p2 p3) (AND (NOT p1) p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p2 p3 (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (OR p1 p2 (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (AND (OR p1 (NOT p0)) (OR (NOT p2) (NOT p0))))), (F p0)]
Knowledge based reduction with 50 factoid took 275 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Stuttering acceptance computed with spot in 229 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Support contains 8 out of 1184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 2607/2607 transitions.
Applied a total of 0 rules in 69 ms. Remains 1184 /1184 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2025-06-03 17:44:39] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1184 cols
[2025-06-03 17:44:39] [INFO ] Computed 52 invariants in 72 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:41] [INFO ] Implicit Places using invariants in 2222 ms returned []
[2025-06-03 17:44:41] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2025-06-03 17:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:42] [INFO ] State equation strengthened by 853 read => feed constraints.
[2025-06-03 17:45:12] [INFO ] Performed 860/1184 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 17:45:19] [INFO ] Implicit Places using invariants and state equation in 37526 ms returned []
Implicit Place search using SMT with State Equation took 39762 ms to find 0 implicit places.
Running 2590 sub problems to find dead transitions.
[2025-06-03 17:45:19] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2025-06-03 17:45:19] [INFO ] Invariant cache hit.
[2025-06-03 17:45:19] [INFO ] State equation strengthened by 853 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.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 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.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 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.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 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.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 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.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 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 1.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 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.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 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.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 1.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 0.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 0.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 1.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 1.0)
(s563 1.0)
(s564 1.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 1.0)
(s575 0.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 0.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 1.0)
(s632 0.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.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 1.0)
(s719 0.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 0.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 1.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 1.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 1.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 1.0)timeout
(s765 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1182 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2590 unsolved
SMT process timed out in 31967ms, After SMT, problems are : Problem set: 0 solved, 2590 unsolved
Search for dead transitions found 0 dead transitions in 31984ms
Finished structural reductions in LTL mode , in 1 iterations and 71835 ms. Remains : 1184/1184 places, 2607/2607 transitions.
Computed a total of 352 stabilizing places and 974 stable transitions
Computed a total of 352 stabilizing places and 974 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (482 resets) in 481 ms. (82 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (136 resets) in 122 ms. (325 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (136 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (136 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
[2025-06-03 17:45:51] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2025-06-03 17:45:51] [INFO ] Invariant cache hit.
[2025-06-03 17:45:51] [INFO ] State equation strengthened by 853 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1103/1107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/1108 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/1149 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1149 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/1175 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1175 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/1184 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2335/3519 variables, 1184/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3519 variables, 853/2089 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3519 variables, 0/2089 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3519 variables, 0/2089 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3519/3519 variables, and 2089 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1184/1184 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1103/1107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:45:55] [INFO ] Deduced a trap composed of 134 places in 1165 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:45:56] [INFO ] Deduced a trap composed of 194 places in 1173 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:45:57] [INFO ] Deduced a trap composed of 146 places in 1140 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:45:58] [INFO ] Deduced a trap composed of 232 places in 1255 ms of which 228 ms to minimize.
SMT process timed out in 7020ms, 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 4 out of 1184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1184/1184 places, 2607/2607 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1184 transition count 2576
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1153 transition count 2576
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 62 place count 1153 transition count 2559
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 96 place count 1136 transition count 2559
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 1135 transition count 2558
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 1135 transition count 2558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 98 place count 1135 transition count 2557
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1134 transition count 2557
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1133 transition count 2549
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1133 transition count 2549
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 136 place count 1116 transition count 2532
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 268 place count 1116 transition count 4276
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 400 place count 984 transition count 4276
Applied a total of 400 rules in 577 ms. Remains 984 /1184 variables (removed 200) and now considering 4276/2607 (removed -1669) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 577 ms. Remains : 984/1184 places, 4276/2607 transitions.
RANDOM walk for 40000 steps (840 resets) in 1507 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (120 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (120 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 46863 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 2
Probabilistic random walk after 46863 steps, saw 19848 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 17:46:02] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 984 cols
[2025-06-03 17:46:02] [INFO ] Computed 52 invariants in 46 ms
[2025-06-03 17:46:02] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 887/891 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/892 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/892 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/949 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/949 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/975 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/975 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/984 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/984 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3878/4862 variables, 984/1036 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4862 variables, 2722/3758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4862 variables, 0/3758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4862 variables, 0/3758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4862/4862 variables, and 3758 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 984/984 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 887/891 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:07] [INFO ] Deduced a trap composed of 98 places in 1230 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:08] [INFO ] Deduced a trap composed of 82 places in 1237 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:09] [INFO ] Deduced a trap composed of 112 places in 1227 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:10] [INFO ] Deduced a trap composed of 81 places in 1203 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:12] [INFO ] Deduced a trap composed of 81 places in 1188 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:13] [INFO ] Deduced a trap composed of 88 places in 1188 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:14] [INFO ] Deduced a trap composed of 130 places in 1183 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:15] [INFO ] Deduced a trap composed of 81 places in 1229 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:17] [INFO ] Deduced a trap composed of 165 places in 1228 ms of which 197 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:18] [INFO ] Deduced a trap composed of 88 places in 1222 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:19] [INFO ] Deduced a trap composed of 153 places in 1279 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:20] [INFO ] Deduced a trap composed of 130 places in 1262 ms of which 160 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/891 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/892 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/892 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 57/949 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:22] [INFO ] Deduced a trap composed of 5 places in 1124 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:23] [INFO ] Deduced a trap composed of 27 places in 1100 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:24] [INFO ] Deduced a trap composed of 62 places in 1174 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:25] [INFO ] Deduced a trap composed of 75 places in 1203 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:27] [INFO ] Deduced a trap composed of 82 places in 1216 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:28] [INFO ] Deduced a trap composed of 75 places in 1139 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:29] [INFO ] Deduced a trap composed of 62 places in 1138 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:30] [INFO ] Deduced a trap composed of 97 places in 1129 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:31] [INFO ] Deduced a trap composed of 27 places in 1092 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:32] [INFO ] Deduced a trap composed of 57 places in 1152 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:34] [INFO ] Deduced a trap composed of 62 places in 1245 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:35] [INFO ] Deduced a trap composed of 104 places in 1207 ms of which 175 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:36] [INFO ] Deduced a trap composed of 85 places in 1187 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:37] [INFO ] Deduced a trap composed of 85 places in 1128 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:38] [INFO ] Deduced a trap composed of 46 places in 1150 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:39] [INFO ] Deduced a trap composed of 92 places in 1113 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:40] [INFO ] Deduced a trap composed of 184 places in 1047 ms of which 199 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:42] [INFO ] Deduced a trap composed of 185 places in 1148 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:43] [INFO ] Deduced a trap composed of 184 places in 1145 ms of which 198 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:44] [INFO ] Deduced a trap composed of 184 places in 1151 ms of which 204 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/949 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:45] [INFO ] Deduced a trap composed of 184 places in 1190 ms of which 196 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:46] [INFO ] Deduced a trap composed of 184 places in 1168 ms of which 203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:48] [INFO ] Deduced a trap composed of 184 places in 1111 ms of which 203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:49] [INFO ] Deduced a trap composed of 191 places in 1123 ms of which 209 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:50] [INFO ] Deduced a trap composed of 194 places in 1126 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:46:51] [INFO ] Deduced a trap composed of 92 places in 1131 ms of which 167 ms to minimize.
SMT process timed out in 48586ms, 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 4 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Applied a total of 0 rules in 150 ms. Remains 984 /984 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 984/984 places, 4276/4276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Applied a total of 0 rules in 152 ms. Remains 984 /984 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2025-06-03 17:46:51] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
[2025-06-03 17:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:46:54] [INFO ] Implicit Places using invariants in 2408 ms returned [117, 815, 884]
[2025-06-03 17:46:54] [INFO ] Actually due to overlaps returned [815, 884]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2413 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 982/984 places, 4276/4276 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 981 transition count 4275
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 981 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 980 transition count 4274
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 980 transition count 4274
Applied a total of 4 rules in 248 ms. Remains 980 /982 variables (removed 2) and now considering 4274/4276 (removed 2) transitions.
[2025-06-03 17:46:54] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
// Phase 1: matrix 3876 rows 980 cols
[2025-06-03 17:46:54] [INFO ] Computed 50 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:46:56] [INFO ] Implicit Places using invariants in 2389 ms returned [117]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2393 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/984 places, 4274/4276 transitions.
Applied a total of 0 rules in 146 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5353 ms. Remains : 979/984 places, 4274/4276 transitions.
RANDOM walk for 40000 steps (840 resets) in 1365 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (118 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (117 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 46879 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 2
Probabilistic random walk after 46879 steps, saw 19852 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 17:47:00] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
// Phase 1: matrix 3876 rows 979 cols
[2025-06-03 17:47:00] [INFO ] Computed 49 invariants in 26 ms
[2025-06-03 17:47:00] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 900/904 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/904 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/905 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/944 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/970 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/970 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/979 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3876/4855 variables, 979/1028 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4855 variables, 2722/3750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4855 variables, 0/3750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4855 variables, 0/3750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4855/4855 variables, and 3750 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2662 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 900/904 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:04] [INFO ] Deduced a trap composed of 86 places in 1206 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:05] [INFO ] Deduced a trap composed of 128 places in 1184 ms of which 175 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:07] [INFO ] Deduced a trap composed of 151 places in 1246 ms of which 180 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:08] [INFO ] Deduced a trap composed of 96 places in 1169 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:09] [INFO ] Deduced a trap composed of 79 places in 1252 ms of which 115 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/904 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/904 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/905 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 39/944 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:11] [INFO ] Deduced a trap composed of 5 places in 1259 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:12] [INFO ] Deduced a trap composed of 27 places in 1225 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:13] [INFO ] Deduced a trap composed of 46 places in 1245 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:15] [INFO ] Deduced a trap composed of 52 places in 1353 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:16] [INFO ] Deduced a trap composed of 58 places in 1316 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:17] [INFO ] Deduced a trap composed of 59 places in 1333 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:19] [INFO ] Deduced a trap composed of 59 places in 1388 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:20] [INFO ] Deduced a trap composed of 58 places in 1260 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:21] [INFO ] Deduced a trap composed of 62 places in 1006 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:22] [INFO ] Deduced a trap composed of 52 places in 1342 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:24] [INFO ] Deduced a trap composed of 59 places in 1326 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:25] [INFO ] Deduced a trap composed of 59 places in 1306 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:26] [INFO ] Deduced a trap composed of 59 places in 1354 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:28] [INFO ] Deduced a trap composed of 59 places in 1263 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:29] [INFO ] Deduced a trap composed of 60 places in 1378 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:30] [INFO ] Deduced a trap composed of 58 places in 1390 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:32] [INFO ] Deduced a trap composed of 59 places in 1322 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:33] [INFO ] Deduced a trap composed of 59 places in 1383 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:35] [INFO ] Deduced a trap composed of 59 places in 1340 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:36] [INFO ] Deduced a trap composed of 59 places in 1329 ms of which 111 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/944 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:37] [INFO ] Deduced a trap composed of 58 places in 1394 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:39] [INFO ] Deduced a trap composed of 46 places in 1340 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:40] [INFO ] Deduced a trap composed of 59 places in 1341 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:41] [INFO ] Deduced a trap composed of 57 places in 1289 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:43] [INFO ] Deduced a trap composed of 62 places in 1286 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:44] [INFO ] Deduced a trap composed of 58 places in 1313 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:45] [INFO ] Deduced a trap composed of 60 places in 1274 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:47] [INFO ] Deduced a trap composed of 63 places in 1307 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:48] [INFO ] Deduced a trap composed of 57 places in 1361 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:49] [INFO ] Deduced a trap composed of 58 places in 1352 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:51] [INFO ] Deduced a trap composed of 60 places in 1383 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:52] [INFO ] Deduced a trap composed of 27 places in 1346 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:54] [INFO ] Deduced a trap composed of 57 places in 1368 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:55] [INFO ] Deduced a trap composed of 46 places in 1298 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:56] [INFO ] Deduced a trap composed of 61 places in 1311 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:58] [INFO ] Deduced a trap composed of 58 places in 1341 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:47:59] [INFO ] Deduced a trap composed of 62 places in 1242 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:00] [INFO ] Deduced a trap composed of 61 places in 1255 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:01] [INFO ] Deduced a trap composed of 62 places in 1240 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:03] [INFO ] Deduced a trap composed of 59 places in 1276 ms of which 112 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/944 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:04] [INFO ] Deduced a trap composed of 62 places in 1315 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:05] [INFO ] Deduced a trap composed of 59 places in 1278 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:07] [INFO ] Deduced a trap composed of 63 places in 1374 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:08] [INFO ] Deduced a trap composed of 61 places in 1334 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:09] [INFO ] Deduced a trap composed of 59 places in 1307 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:11] [INFO ] Deduced a trap composed of 58 places in 1223 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:12] [INFO ] Deduced a trap composed of 59 places in 1351 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:13] [INFO ] Deduced a trap composed of 59 places in 1359 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:15] [INFO ] Deduced a trap composed of 59 places in 1186 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:16] [INFO ] Deduced a trap composed of 59 places in 1342 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:17] [INFO ] Deduced a trap composed of 59 places in 1346 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:48:19] [INFO ] Deduced a trap composed of 59 places in 1288 ms of which 109 ms to minimize.
SMT process timed out in 78688ms, 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 4 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 149 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 150 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2025-06-03 17:48:19] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2025-06-03 17:48:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:48:22] [INFO ] Implicit Places using invariants in 2537 ms returned []
[2025-06-03 17:48:22] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2025-06-03 17:48:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:48:23] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-03 17:48:54] [INFO ] Performed 266/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 17:49:24] [INFO ] Performed 390/979 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 17:49:54] [INFO ] Performed 630/979 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 17:50:24] [INFO ] Performed 939/979 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2025-06-03 17:50:24] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2025-06-03 17:50:24] [INFO ] Implicit Places using invariants and state equation in 122419 ms returned []
Implicit Place search using SMT with State Equation took 124959 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:50:24] [INFO ] Redundant transitions in 461 ms returned []
Running 4212 sub problems to find dead transitions.
[2025-06-03 17:50:24] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2025-06-03 17:50:24] [INFO ] Invariant cache hit.
[2025-06-03 17:50:25] [INFO ] State equation strengthened by 2722 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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/977 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4212 unsolved
SMT process timed out in 36846ms, After SMT, problems are : Problem set: 0 solved, 4212 unsolved
Search for dead transitions found 0 dead transitions in 36865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162463 ms. Remains : 979/979 places, 4274/4274 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Stuttering acceptance computed with spot in 228 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Stuttering acceptance computed with spot in 226 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Product exploration explored 100000 steps with 20000 reset in 982 ms.
Product exploration explored 100000 steps with 20000 reset in 1058 ms.
Applying partial POR strategy [false, false, true, false, false, false]
Stuttering acceptance computed with spot in 226 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Support contains 8 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 2607/2607 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1184 transition count 2607
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 31 place count 1184 transition count 2608
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 48 place count 1184 transition count 2608
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 64 place count 1168 transition count 2591
Deduced a syphon composed of 33 places in 9 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 1168 transition count 2591
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 1167 transition count 2583
Deduced a syphon composed of 33 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 1167 transition count 2583
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 51 places in 2 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 100 place count 1167 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 1166 transition count 2582
Deduced a syphon composed of 50 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 1166 transition count 2582
Deduced a syphon composed of 50 places in 2 ms
Applied a total of 102 rules in 724 ms. Remains 1166 /1184 variables (removed 18) and now considering 2582/2607 (removed 25) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:51:06] [INFO ] Redundant transitions in 329 ms returned []
Running 2565 sub problems to find dead transitions.
[2025-06-03 17:51:06] [INFO ] Flow matrix only has 2310 transitions (discarded 272 similar events)
// Phase 1: matrix 2310 rows 1166 cols
[2025-06-03 17:51:06] [INFO ] Computed 52 invariants in 32 ms
[2025-06-03 17:51:06] [INFO ] State equation strengthened by 846 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.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 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.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 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.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 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.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 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.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 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.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 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.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 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.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 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 0.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 0.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 0.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 1.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 1.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1164 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2565 unsolved
SMT process timed out in 31845ms, After SMT, problems are : Problem set: 0 solved, 2565 unsolved
Search for dead transitions found 0 dead transitions in 31856ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1166/1184 places, 2582/2607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32926 ms. Remains : 1166/1184 places, 2582/2607 transitions.
Built C files in :
/tmp/ltsmin4876074134334281422
[2025-06-03 17:51:38] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4876074134334281422
Running compilation step : cd /tmp/ltsmin4876074134334281422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4876074134334281422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4876074134334281422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 8 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 2607/2607 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1183 transition count 2606
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1183 transition count 2606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1182 transition count 2598
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1182 transition count 2598
Applied a total of 4 rules in 148 ms. Remains 1182 /1184 variables (removed 2) and now considering 2598/2607 (removed 9) transitions.
[2025-06-03 17:51:41] [INFO ] Flow matrix only has 2326 transitions (discarded 272 similar events)
// Phase 1: matrix 2326 rows 1182 cols
[2025-06-03 17:51:41] [INFO ] Computed 52 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:43] [INFO ] Implicit Places using invariants in 2197 ms returned [1057]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2203 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1181/1184 places, 2598/2607 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1180 transition count 2597
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1180 transition count 2597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1179 transition count 2596
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1179 transition count 2596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1178 transition count 2595
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1178 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1177 transition count 2587
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1177 transition count 2587
Applied a total of 8 rules in 379 ms. Remains 1177 /1181 variables (removed 4) and now considering 2587/2598 (removed 11) transitions.
[2025-06-03 17:51:44] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
// Phase 1: matrix 2315 rows 1177 cols
[2025-06-03 17:51:44] [INFO ] Computed 51 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:46] [INFO ] Implicit Places using invariants in 2102 ms returned []
[2025-06-03 17:51:46] [INFO ] Flow matrix only has 2315 transitions (discarded 272 similar events)
[2025-06-03 17:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:47] [INFO ] State equation strengthened by 839 read => feed constraints.
[2025-06-03 17:52:16] [INFO ] Implicit Places using invariants and state equation in 30498 ms returned [1158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 32609 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1176/1184 places, 2587/2607 transitions.
Applied a total of 0 rules in 78 ms. Remains 1176 /1176 variables (removed 0) and now considering 2587/2587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 35417 ms. Remains : 1176/1184 places, 2587/2607 transitions.
Built C files in :
/tmp/ltsmin14425380550920283894
[2025-06-03 17:52:16] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14425380550920283894
Running compilation step : cd /tmp/ltsmin14425380550920283894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14425380550920283894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14425380550920283894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 17:52:20] [INFO ] Flatten gal took : 114 ms
[2025-06-03 17:52:20] [INFO ] Flatten gal took : 108 ms
[2025-06-03 17:52:20] [INFO ] Time to serialize gal into /tmp/LTL8383607827924607526.gal : 41 ms
[2025-06-03 17:52:20] [INFO ] Time to serialize properties into /tmp/LTL13614865320216190133.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8383607827924607526.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15150419836493013537.hoa' '-atoms' '/tmp/LTL13614865320216190133.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13614865320216190133.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15150419836493013537.hoa
Detected timeout of ITS tools.
[2025-06-03 17:52:35] [INFO ] Flatten gal took : 84 ms
[2025-06-03 17:52:35] [INFO ] Flatten gal took : 87 ms
[2025-06-03 17:52:35] [INFO ] Time to serialize gal into /tmp/LTL8474849249587735291.gal : 25 ms
[2025-06-03 17:52:35] [INFO ] Time to serialize properties into /tmp/LTL13356891735001433799.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8474849249587735291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13356891735001433799.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((ThereIsAMasterInTheLeafSet<1)||(Node0WantsToManageTheCrashOfNode15<1))||((Node0HasDetectedCrashOfNode15<1)||(NoNodeMa...1525
Formula 0 simplified : G(F!"(((ThereIsAMasterInTheLeafSet<1)||(Node0WantsToManageTheCrashOfNode15<1))||((Node0HasDetectedCrashOfNode15<1)||(NoNodeManageThe...1287
Detected timeout of ITS tools.
[2025-06-03 17:52:50] [INFO ] Flatten gal took : 85 ms
[2025-06-03 17:52:50] [INFO ] Applying decomposition
[2025-06-03 17:52:50] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4772104269772819206.txt' '-o' '/tmp/graph4772104269772819206.bin' '-w' '/tmp/graph4772104269772819206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4772104269772819206.bin' '-l' '-1' '-v' '-w' '/tmp/graph4772104269772819206.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:52:51] [INFO ] Decomposing Gal with order
[2025-06-03 17:52:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:52:51] [INFO ] Removed a total of 3137 redundant transitions.
[2025-06-03 17:52:52] [INFO ] Flatten gal took : 610 ms
[2025-06-03 17:52:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 182 ms.
[2025-06-03 17:52:52] [INFO ] Time to serialize gal into /tmp/LTL1701467233980678675.gal : 32 ms
[2025-06-03 17:52:52] [INFO ] Time to serialize properties into /tmp/LTL9119517575214534149.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1701467233980678675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9119517575214534149.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((i0.u2.ThereIsAMasterInTheLeafSet<1)||(i0.u1.Node0WantsToManageTheCrashOfNode15<1))||((i17.u24.Node0HasDetectedCrashOf...1795
Formula 0 simplified : G(F!"(((i0.u2.ThereIsAMasterInTheLeafSet<1)||(i0.u1.Node0WantsToManageTheCrashOfNode15<1))||((i17.u24.Node0HasDetectedCrashOfNode15<...1525
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 finished in 689570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&F(p1)))))'
Support contains 5 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1255 transition count 2807
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1255 transition count 2807
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1244 transition count 2754
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1244 transition count 2754
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1239 transition count 2714
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1239 transition count 2714
Applied a total of 68 rules in 290 ms. Remains 1239 /1273 variables (removed 34) and now considering 2714/2867 (removed 153) transitions.
[2025-06-03 17:53:07] [INFO ] Flow matrix only has 2442 transitions (discarded 272 similar events)
// Phase 1: matrix 2442 rows 1239 cols
[2025-06-03 17:53:07] [INFO ] Computed 63 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:53:10] [INFO ] Implicit Places using invariants in 2586 ms returned [13, 17, 110, 153, 527, 574, 607, 711, 762, 968, 1015, 1098, 1099]
[2025-06-03 17:53:10] [INFO ] Actually due to overlaps returned [1015, 13, 17, 110, 527, 574, 607, 711, 762, 968, 1098, 1099]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2588 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1273 places, 2714/2867 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1216 transition count 2703
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1216 transition count 2703
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1205 transition count 2692
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1205 transition count 2692
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1194 transition count 2681
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1194 transition count 2681
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 1185 transition count 2609
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 1185 transition count 2609
Applied a total of 84 rules in 433 ms. Remains 1185 /1227 variables (removed 42) and now considering 2609/2714 (removed 105) transitions.
[2025-06-03 17:53:10] [INFO ] Flow matrix only has 2337 transitions (discarded 272 similar events)
// Phase 1: matrix 2337 rows 1185 cols
[2025-06-03 17:53:10] [INFO ] Computed 51 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:53:13] [INFO ] Implicit Places using invariants in 2357 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2369 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1184/1273 places, 2609/2867 transitions.
Applied a total of 0 rules in 69 ms. Remains 1184 /1184 variables (removed 0) and now considering 2609/2609 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5750 ms. Remains : 1184/1273 places, 2609/2867 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 finished in 5948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1254 transition count 2806
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1254 transition count 2806
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1242 transition count 2745
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1242 transition count 2745
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1237 transition count 2705
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1237 transition count 2705
Applied a total of 72 rules in 286 ms. Remains 1237 /1273 variables (removed 36) and now considering 2705/2867 (removed 162) transitions.
[2025-06-03 17:53:13] [INFO ] Flow matrix only has 2433 transitions (discarded 272 similar events)
// Phase 1: matrix 2433 rows 1237 cols
[2025-06-03 17:53:13] [INFO ] Computed 63 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:53:16] [INFO ] Implicit Places using invariants in 2772 ms returned [13, 17, 110, 153, 525, 572, 605, 709, 969, 1016, 1023, 1096, 1097]
[2025-06-03 17:53:16] [INFO ] Actually due to overlaps returned [1016, 13, 17, 110, 525, 572, 605, 709, 969, 1023, 1096, 1097]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2780 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1225/1273 places, 2705/2867 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1214 transition count 2694
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1214 transition count 2694
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1203 transition count 2683
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1203 transition count 2683
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1192 transition count 2672
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1192 transition count 2672
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 1183 transition count 2600
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 1183 transition count 2600
Applied a total of 84 rules in 361 ms. Remains 1183 /1225 variables (removed 42) and now considering 2600/2705 (removed 105) transitions.
[2025-06-03 17:53:16] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1183 cols
[2025-06-03 17:53:16] [INFO ] Computed 51 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:53:19] [INFO ] Implicit Places using invariants in 2324 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2331 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1273 places, 2600/2867 transitions.
Applied a total of 0 rules in 68 ms. Remains 1182 /1182 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5828 ms. Remains : 1182/1273 places, 2600/2867 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 finished in 5971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Support contains 5 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1255 transition count 2814
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1255 transition count 2814
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 1243 transition count 2753
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 1243 transition count 2753
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 1238 transition count 2713
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 1238 transition count 2713
Applied a total of 70 rules in 290 ms. Remains 1238 /1273 variables (removed 35) and now considering 2713/2867 (removed 154) transitions.
[2025-06-03 17:53:19] [INFO ] Flow matrix only has 2441 transitions (discarded 272 similar events)
// Phase 1: matrix 2441 rows 1238 cols
[2025-06-03 17:53:19] [INFO ] Computed 63 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:53:22] [INFO ] Implicit Places using invariants in 2725 ms returned [13, 17, 110, 153, 527, 574, 607, 711, 762, 969, 1016, 1023, 1096, 1097]
[2025-06-03 17:53:22] [INFO ] Actually due to overlaps returned [1016, 13, 17, 110, 527, 574, 607, 711, 762, 969, 1023, 1096, 1097]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 2731 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1225/1273 places, 2713/2867 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1213 transition count 2701
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1213 transition count 2701
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1201 transition count 2689
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1201 transition count 2689
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1189 transition count 2677
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1189 transition count 2677
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1179 transition count 2597
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1179 transition count 2597
Applied a total of 92 rules in 364 ms. Remains 1179 /1225 variables (removed 46) and now considering 2597/2713 (removed 116) transitions.
[2025-06-03 17:53:22] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1179 cols
[2025-06-03 17:53:22] [INFO ] Computed 50 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:53:24] [INFO ] Implicit Places using invariants in 2210 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2212 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1178/1273 places, 2597/2867 transitions.
Applied a total of 0 rules in 67 ms. Remains 1178 /1178 variables (removed 0) and now considering 2597/2597 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5666 ms. Remains : 1178/1273 places, 2597/2867 transitions.
Stuttering acceptance computed with spot in 150 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Product exploration explored 100000 steps with 1206 reset in 650 ms.
Product exploration explored 100000 steps with 1204 reset in 700 ms.
Computed a total of 346 stabilizing places and 964 stable transitions
Computed a total of 346 stabilizing places and 964 stable transitions
Detected a total of 346/1178 stabilizing places and 964/2597 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 336 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (479 resets) in 576 ms. (69 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (136 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
[2025-06-03 17:53:27] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1178 cols
[2025-06-03 17:53:27] [INFO ] Computed 49 invariants in 25 ms
[2025-06-03 17:53:27] [INFO ] State equation strengthened by 846 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1103 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:28] [INFO ] Deduced a trap composed of 140 places in 910 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:29] [INFO ] Deduced a trap composed of 136 places in 1021 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1103 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/1136 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:30] [INFO ] Deduced a trap composed of 50 places in 1197 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:32] [INFO ] Deduced a trap composed of 68 places in 1150 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:33] [INFO ] Deduced a trap composed of 69 places in 1146 ms of which 138 ms to minimize.
SMT process timed out in 5973ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 2597/2597 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1178 transition count 2566
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1147 transition count 2566
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 62 place count 1147 transition count 2549
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 96 place count 1130 transition count 2549
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 1128 transition count 2540
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1128 transition count 2540
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1127 transition count 2539
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1127 transition count 2539
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1126 transition count 2531
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1126 transition count 2531
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 138 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 269 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 400 place count 978 transition count 4273
Applied a total of 400 rules in 664 ms. Remains 978 /1178 variables (removed 200) and now considering 4273/2597 (removed -1676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 ms. Remains : 978/1178 places, 4273/2597 transitions.
RANDOM walk for 40000 steps (839 resets) in 1391 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (119 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 52590 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 1
Probabilistic random walk after 52590 steps, saw 22206 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 17:53:37] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2025-06-03 17:53:37] [INFO ] Computed 49 invariants in 32 ms
[2025-06-03 17:53:37] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:38] [INFO ] Deduced a trap composed of 95 places in 1088 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:39] [INFO ] Deduced a trap composed of 108 places in 1092 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:40] [INFO ] Deduced a trap composed of 96 places in 1093 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:42] [INFO ] Deduced a trap composed of 80 places in 1109 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:43] [INFO ] Deduced a trap composed of 79 places in 1172 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/962 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/978 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4853 variables, 978/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4853 variables, 2722/3754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4853 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8259 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:46] [INFO ] Deduced a trap composed of 80 places in 1017 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:47] [INFO ] Deduced a trap composed of 87 places in 1055 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:49] [INFO ] Deduced a trap composed of 79 places in 1098 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:50] [INFO ] Deduced a trap composed of 100 places in 1102 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:51] [INFO ] Deduced a trap composed of 103 places in 1076 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:52] [INFO ] Deduced a trap composed of 86 places in 1084 ms of which 31 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/936 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:53] [INFO ] Deduced a trap composed of 5 places in 1042 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:54] [INFO ] Deduced a trap composed of 27 places in 1113 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:55] [INFO ] Deduced a trap composed of 46 places in 1110 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:56] [INFO ] Deduced a trap composed of 46 places in 1138 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:58] [INFO ] Deduced a trap composed of 71 places in 1181 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:53:59] [INFO ] Deduced a trap composed of 62 places in 1080 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:00] [INFO ] Deduced a trap composed of 75 places in 1074 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:01] [INFO ] Deduced a trap composed of 85 places in 1204 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:02] [INFO ] Deduced a trap composed of 85 places in 1143 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:03] [INFO ] Deduced a trap composed of 95 places in 1148 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:05] [INFO ] Deduced a trap composed of 92 places in 1178 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:06] [INFO ] Deduced a trap composed of 92 places in 1168 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:07] [INFO ] Deduced a trap composed of 94 places in 1146 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:08] [INFO ] Deduced a trap composed of 94 places in 1138 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:09] [INFO ] Deduced a trap composed of 85 places in 1137 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:10] [INFO ] Deduced a trap composed of 106 places in 1068 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:12] [INFO ] Deduced a trap composed of 62 places in 1116 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:13] [INFO ] Deduced a trap composed of 85 places in 1161 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:14] [INFO ] Deduced a trap composed of 97 places in 1133 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:15] [INFO ] Deduced a trap composed of 120 places in 1236 ms of which 187 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:16] [INFO ] Deduced a trap composed of 57 places in 1119 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:17] [INFO ] Deduced a trap composed of 88 places in 1149 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:19] [INFO ] Deduced a trap composed of 104 places in 1196 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:20] [INFO ] Deduced a trap composed of 85 places in 992 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:21] [INFO ] Deduced a trap composed of 127 places in 1112 ms of which 204 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:22] [INFO ] Deduced a trap composed of 94 places in 1069 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:23] [INFO ] Deduced a trap composed of 94 places in 1157 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:24] [INFO ] Deduced a trap composed of 46 places in 1059 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:25] [INFO ] Deduced a trap composed of 88 places in 1105 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:26] [INFO ] Deduced a trap composed of 62 places in 1129 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:28] [INFO ] Deduced a trap composed of 104 places in 1192 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:29] [INFO ] Deduced a trap composed of 75 places in 1142 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:30] [INFO ] Deduced a trap composed of 85 places in 1154 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:54:31] [INFO ] Deduced a trap composed of 117 places in 1102 ms of which 194 ms to minimize.
SMT process timed out in 54284ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 151 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 147 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2025-06-03 17:54:31] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 17:54:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:34] [INFO ] Implicit Places using invariants in 2252 ms returned []
[2025-06-03 17:54:34] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 17:54:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:35] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-03 17:55:06] [INFO ] Performed 246/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 17:55:36] [INFO ] Performed 307/978 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 17:56:06] [INFO ] Performed 354/978 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 17:56:37] [INFO ] Performed 416/978 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2025-06-03 17:56:37] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2025-06-03 17:56:37] [INFO ] Implicit Places using invariants and state equation in 122824 ms returned []
Implicit Place search using SMT with State Equation took 125082 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:56:37] [INFO ] Redundant transitions in 404 ms returned []
Running 4211 sub problems to find dead transitions.
[2025-06-03 17:56:37] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 17:56:37] [INFO ] Invariant cache hit.
[2025-06-03 17:56:37] [INFO ] State equation strengthened by 2722 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 36674ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 36685ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162342 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 17 factoid took 580 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 1178 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1178/1178 places, 2597/2597 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1178 transition count 2566
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1147 transition count 2566
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1147 transition count 2550
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1131 transition count 2550
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 130 place count 1113 transition count 2532
Applied a total of 130 rules in 224 ms. Remains 1113 /1178 variables (removed 65) and now considering 2532/2597 (removed 65) transitions.
[2025-06-03 17:57:15] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2025-06-03 17:57:15] [INFO ] Computed 49 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:57:17] [INFO ] Implicit Places using invariants in 1922 ms returned []
[2025-06-03 17:57:17] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2025-06-03 17:57:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:57:18] [INFO ] State equation strengthened by 846 read => feed constraints.
[2025-06-03 17:57:46] [INFO ] Implicit Places using invariants and state equation in 29173 ms returned []
Implicit Place search using SMT with State Equation took 31102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:57:46] [INFO ] Redundant transitions in 156 ms returned []
Running 2515 sub problems to find dead transitions.
[2025-06-03 17:57:46] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2025-06-03 17:57:46] [INFO ] Invariant cache hit.
[2025-06-03 17:57:46] [INFO ] State equation strengthened by 846 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2515 unsolved
SMT process timed out in 31835ms, After SMT, problems are : Problem set: 0 solved, 2515 unsolved
Search for dead transitions found 0 dead transitions in 31841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1113/1178 places, 2532/2597 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63337 ms. Remains : 1113/1178 places, 2532/2597 transitions.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (682 resets) in 341 ms. (116 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (148 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
[2025-06-03 17:58:18] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2025-06-03 17:58:18] [INFO ] Invariant cache hit.
[2025-06-03 17:58:18] [INFO ] State equation strengthened by 846 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:19] [INFO ] Deduced a trap composed of 92 places in 866 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1071 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/1097 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/1113 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1113 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2260/3373 variables, 1113/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3373 variables, 846/2009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3373 variables, 0/2009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3373 variables, 0/2009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3373/3373 variables, and 2009 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2481 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1113/1113 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:22] [INFO ] Deduced a trap composed of 114 places in 824 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:23] [INFO ] Deduced a trap composed of 129 places in 906 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:24] [INFO ] Deduced a trap composed of 119 places in 857 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:24] [INFO ] Deduced a trap composed of 106 places in 905 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:25] [INFO ] Deduced a trap composed of 138 places in 844 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:26] [INFO ] Deduced a trap composed of 88 places in 866 ms of which 32 ms to minimize.
SMT process timed out in 8091ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1112 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1112 transition count 2524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1109 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 978 transition count 4273
Applied a total of 270 rules in 619 ms. Remains 978 /1113 variables (removed 135) and now considering 4273/2532 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 978/1113 places, 4273/2532 transitions.
RANDOM walk for 40000 steps (841 resets) in 1425 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (120 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 50954 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 1
Probabilistic random walk after 50954 steps, saw 21531 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 17:58:30] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2025-06-03 17:58:30] [INFO ] Computed 49 invariants in 40 ms
[2025-06-03 17:58:30] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:32] [INFO ] Deduced a trap composed of 86 places in 1051 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:33] [INFO ] Deduced a trap composed of 79 places in 1049 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:34] [INFO ] Deduced a trap composed of 80 places in 1124 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:35] [INFO ] Deduced a trap composed of 103 places in 1020 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:36] [INFO ] Deduced a trap composed of 96 places in 1043 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:37] [INFO ] Deduced a trap composed of 108 places in 1083 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:38] [INFO ] Deduced a trap composed of 5 places in 1177 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:40] [INFO ] Deduced a trap composed of 27 places in 1205 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:41] [INFO ] Deduced a trap composed of 27 places in 1238 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:42] [INFO ] Deduced a trap composed of 52 places in 1226 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:44] [INFO ] Deduced a trap composed of 57 places in 1330 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:45] [INFO ] Deduced a trap composed of 46 places in 1243 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:46] [INFO ] Deduced a trap composed of 46 places in 1242 ms of which 95 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/962 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/978 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/978 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3875/4853 variables, 978/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 2722/3762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4853 variables, 0/3762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4853 variables, 0/3762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3762 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18781 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:51] [INFO ] Deduced a trap composed of 61 places in 1265 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:52] [INFO ] Deduced a trap composed of 62 places in 1259 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:53] [INFO ] Deduced a trap composed of 62 places in 1243 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:55] [INFO ] Deduced a trap composed of 62 places in 1271 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:56] [INFO ] Deduced a trap composed of 62 places in 1390 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:57] [INFO ] Deduced a trap composed of 62 places in 1204 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:58:59] [INFO ] Deduced a trap composed of 62 places in 1366 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:00] [INFO ] Deduced a trap composed of 62 places in 1377 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:01] [INFO ] Deduced a trap composed of 62 places in 1403 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:03] [INFO ] Deduced a trap composed of 62 places in 1361 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:04] [INFO ] Deduced a trap composed of 62 places in 1399 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:06] [INFO ] Deduced a trap composed of 62 places in 1387 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:07] [INFO ] Deduced a trap composed of 62 places in 1405 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:08] [INFO ] Deduced a trap composed of 62 places in 1386 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:10] [INFO ] Deduced a trap composed of 62 places in 1390 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:11] [INFO ] Deduced a trap composed of 62 places in 1394 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:13] [INFO ] Deduced a trap composed of 62 places in 1249 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:14] [INFO ] Deduced a trap composed of 62 places in 1264 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:15] [INFO ] Deduced a trap composed of 61 places in 1378 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:17] [INFO ] Deduced a trap composed of 61 places in 1331 ms of which 109 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:18] [INFO ] Deduced a trap composed of 61 places in 1336 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:19] [INFO ] Deduced a trap composed of 61 places in 1269 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:21] [INFO ] Deduced a trap composed of 61 places in 1318 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:22] [INFO ] Deduced a trap composed of 61 places in 1372 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:23] [INFO ] Deduced a trap composed of 61 places in 1283 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:24] [INFO ] Deduced a trap composed of 71 places in 1162 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:26] [INFO ] Deduced a trap composed of 59 places in 1413 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:27] [INFO ] Deduced a trap composed of 59 places in 1330 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:29] [INFO ] Deduced a trap composed of 62 places in 1405 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:30] [INFO ] Deduced a trap composed of 46 places in 1428 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:32] [INFO ] Deduced a trap composed of 62 places in 1413 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:33] [INFO ] Deduced a trap composed of 62 places in 1408 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 17:59:34] [INFO ] Deduced a trap composed of 46 places in 1408 ms of which 90 ms to minimize.
SMT process timed out in 64069ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 156 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 163 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2025-06-03 17:59:35] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 17:59:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:59:37] [INFO ] Implicit Places using invariants in 2516 ms returned []
[2025-06-03 17:59:37] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 17:59:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:59:39] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-03 18:00:09] [INFO ] Performed 338/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 18:00:39] [INFO ] Performed 537/978 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 18:01:09] [INFO ] Performed 926/978 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 18:01:31] [INFO ] Implicit Places using invariants and state equation in 113786 ms returned []
Implicit Place search using SMT with State Equation took 116305 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:01:31] [INFO ] Redundant transitions in 396 ms returned []
Running 4211 sub problems to find dead transitions.
[2025-06-03 18:01:31] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 18:01:31] [INFO ] Invariant cache hit.
[2025-06-03 18:01:31] [INFO ] State equation strengthened by 2722 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 36531ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 36541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153436 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 10 factoid took 297 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1711 reset in 624 ms.
Product exploration explored 100000 steps with 1713 reset in 668 ms.
Built C files in :
/tmp/ltsmin8446939663415128068
[2025-06-03 18:02:10] [INFO ] Too many transitions (2532) to apply POR reductions. Disabling POR matrices.
[2025-06-03 18:02:10] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8446939663415128068
Running compilation step : cd /tmp/ltsmin8446939663415128068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8446939663415128068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8446939663415128068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1112 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1111 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1111 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Applied a total of 6 rules in 344 ms. Remains 1110 /1113 variables (removed 3) and now considering 2522/2532 (removed 10) transitions.
[2025-06-03 18:02:13] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2025-06-03 18:02:13] [INFO ] Computed 49 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:02:15] [INFO ] Implicit Places using invariants in 2001 ms returned []
[2025-06-03 18:02:15] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2025-06-03 18:02:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:02:16] [INFO ] State equation strengthened by 839 read => feed constraints.
[2025-06-03 18:02:44] [INFO ] Implicit Places using invariants and state equation in 28384 ms returned [1107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30393 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1109/1113 places, 2522/2532 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1109 transition count 2521
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1108 transition count 2521
Applied a total of 2 rules in 118 ms. Remains 1108 /1109 variables (removed 1) and now considering 2521/2522 (removed 1) transitions.
[2025-06-03 18:02:44] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
// Phase 1: matrix 2249 rows 1108 cols
[2025-06-03 18:02:44] [INFO ] Computed 48 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:02:46] [INFO ] Implicit Places using invariants in 2030 ms returned []
[2025-06-03 18:02:46] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
[2025-06-03 18:02:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:02:47] [INFO ] State equation strengthened by 839 read => feed constraints.
[2025-06-03 18:03:14] [INFO ] Implicit Places using invariants and state equation in 27837 ms returned []
Implicit Place search using SMT with State Equation took 29872 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1113 places, 2521/2532 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60728 ms. Remains : 1108/1113 places, 2521/2532 transitions.
Built C files in :
/tmp/ltsmin16474294043762926780
[2025-06-03 18:03:14] [INFO ] Too many transitions (2521) to apply POR reductions. Disabling POR matrices.
[2025-06-03 18:03:14] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16474294043762926780
Running compilation step : cd /tmp/ltsmin16474294043762926780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16474294043762926780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16474294043762926780;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:03:17] [INFO ] Flatten gal took : 77 ms
[2025-06-03 18:03:17] [INFO ] Flatten gal took : 74 ms
[2025-06-03 18:03:17] [INFO ] Time to serialize gal into /tmp/LTL12378641010895268729.gal : 14 ms
[2025-06-03 18:03:17] [INFO ] Time to serialize properties into /tmp/LTL5437754691671051427.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12378641010895268729.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1029509928474800904.hoa' '-atoms' '/tmp/LTL5437754691671051427.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5437754691671051427.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1029509928474800904.hoa
Detected timeout of ITS tools.
[2025-06-03 18:03:32] [INFO ] Flatten gal took : 63 ms
[2025-06-03 18:03:32] [INFO ] Flatten gal took : 68 ms
[2025-06-03 18:03:32] [INFO ] Time to serialize gal into /tmp/LTL18274219943598812726.gal : 11 ms
[2025-06-03 18:03:32] [INFO ] Time to serialize properties into /tmp/LTL2124053321252626384.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18274219943598812726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2124053321252626384.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((Node15ManageTheCrashOfNode2<1)||(Lx...583
Formula 0 simplified : G(F!"((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtThe...567
Detected timeout of ITS tools.
[2025-06-03 18:03:47] [INFO ] Flatten gal took : 70 ms
[2025-06-03 18:03:47] [INFO ] Applying decomposition
[2025-06-03 18:03:47] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph19436792918530497.txt' '-o' '/tmp/graph19436792918530497.bin' '-w' '/tmp/graph19436792918530497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph19436792918530497.bin' '-l' '-1' '-v' '-w' '/tmp/graph19436792918530497.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:03:48] [INFO ] Decomposing Gal with order
[2025-06-03 18:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:03:48] [INFO ] Removed a total of 3426 redundant transitions.
[2025-06-03 18:03:48] [INFO ] Flatten gal took : 254 ms
[2025-06-03 18:03:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 966 labels/synchronizations in 135 ms.
[2025-06-03 18:03:48] [INFO ] Time to serialize gal into /tmp/LTL8493988952740380972.gal : 27 ms
[2025-06-03 18:03:48] [INFO ] Time to serialize properties into /tmp/LTL7111948497244109973.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8493988952740380972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7111948497244109973.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("((i2.i0.i0.u18.Node15ManageTheCrashOfNode2<1)||(i2.i0.i0.u19.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((i2.i0.i0....738
Formula 0 simplified : G(F!"((i2.i0.i0.u18.Node15ManageTheCrashOfNode2<1)||(i2.i0.i0.u19.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((i2.i0.i0.u18.Node...722
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 644522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(!p1)) U ((X(!p1)&&p2)||G((!p0&&X(!p1)))))))'
Support contains 5 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1256 transition count 2822
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1256 transition count 2822
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 46 place count 1244 transition count 2768
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 1244 transition count 2768
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1238 transition count 2720
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1238 transition count 2720
Applied a total of 70 rules in 293 ms. Remains 1238 /1273 variables (removed 35) and now considering 2720/2867 (removed 147) transitions.
[2025-06-03 18:04:04] [INFO ] Flow matrix only has 2448 transitions (discarded 272 similar events)
// Phase 1: matrix 2448 rows 1238 cols
[2025-06-03 18:04:04] [INFO ] Computed 63 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:04:06] [INFO ] Implicit Places using invariants in 2700 ms returned [13, 17, 110, 153, 525, 572, 712, 763, 970, 1017, 1024, 1097, 1098]
[2025-06-03 18:04:06] [INFO ] Actually due to overlaps returned [1017, 13, 17, 110, 525, 572, 712, 763, 970, 1024, 1097, 1098]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2702 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1226/1273 places, 2720/2867 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1215 transition count 2709
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1215 transition count 2709
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1204 transition count 2698
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1204 transition count 2698
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1193 transition count 2687
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1193 transition count 2687
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 1184 transition count 2615
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 1184 transition count 2615
Applied a total of 84 rules in 369 ms. Remains 1184 /1226 variables (removed 42) and now considering 2615/2720 (removed 105) transitions.
[2025-06-03 18:04:07] [INFO ] Flow matrix only has 2343 transitions (discarded 272 similar events)
// Phase 1: matrix 2343 rows 1184 cols
[2025-06-03 18:04:07] [INFO ] Computed 51 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:04:09] [INFO ] Implicit Places using invariants in 2293 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2299 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1183/1273 places, 2615/2867 transitions.
Applied a total of 0 rules in 70 ms. Remains 1183 /1183 variables (removed 0) and now considering 2615/2615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5733 ms. Remains : 1183/1273 places, 2615/2867 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR p1 (AND p0 (NOT p2))), p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 970 ms.
Product exploration explored 100000 steps with 50000 reset in 963 ms.
Computed a total of 351 stabilizing places and 982 stable transitions
Computed a total of 351 stabilizing places and 982 stable transitions
Detected a total of 351/1183 stabilizing places and 982/2615 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0 p1))), (X (OR p2 (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND p2 p1) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 982 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 finished in 8763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((X(!p0)&&(!p1 U (p2||G(!p1))))||G(!p0))))||(!p3&&X(X(X(F(((X(!p0)&&(!p1 U (p2||G(!p1))))||G(!p0))))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
Stuttering acceptance computed with spot in 393 ms :[p0, p0, p0, (AND p0 p1 (NOT p2)), p0, p0, p0, (AND (NOT p2) p0 p1), p0]
Support contains 10 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1273 transition count 2838
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1244 transition count 2838
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 58 place count 1244 transition count 2815
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 104 place count 1221 transition count 2815
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 117 place count 1208 transition count 2767
Iterating global reduction 2 with 13 rules applied. Total rules applied 130 place count 1208 transition count 2767
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 130 place count 1208 transition count 2766
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 1207 transition count 2766
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 140 place count 1199 transition count 2709
Iterating global reduction 2 with 8 rules applied. Total rules applied 148 place count 1199 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 1198 transition count 2701
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 1198 transition count 2701
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 206 place count 1170 transition count 2673
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 211 place count 1165 transition count 2668
Iterating global reduction 2 with 5 rules applied. Total rules applied 216 place count 1165 transition count 2668
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 220 place count 1161 transition count 2636
Iterating global reduction 2 with 4 rules applied. Total rules applied 224 place count 1161 transition count 2636
Applied a total of 224 rules in 609 ms. Remains 1161 /1273 variables (removed 112) and now considering 2636/2867 (removed 231) transitions.
[2025-06-03 18:04:13] [INFO ] Flow matrix only has 2364 transitions (discarded 272 similar events)
// Phase 1: matrix 2364 rows 1161 cols
[2025-06-03 18:04:13] [INFO ] Computed 63 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:04:16] [INFO ] Implicit Places using invariants in 2138 ms returned [9, 10, 95, 485, 529, 560, 659, 708, 911, 963, 1037]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2141 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1150/1273 places, 2636/2867 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1145 transition count 2631
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1145 transition count 2631
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1140 transition count 2626
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1140 transition count 2626
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1136 transition count 2594
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1136 transition count 2594
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 40 place count 1130 transition count 2588
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1124 transition count 2582
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1124 transition count 2582
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1119 transition count 2542
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1119 transition count 2542
Applied a total of 62 rules in 574 ms. Remains 1119 /1150 variables (removed 31) and now considering 2542/2636 (removed 94) transitions.
[2025-06-03 18:04:16] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1119 cols
[2025-06-03 18:04:16] [INFO ] Computed 52 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:04:18] [INFO ] Implicit Places using invariants in 2032 ms returned []
[2025-06-03 18:04:18] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2025-06-03 18:04:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:04:19] [INFO ] State equation strengthened by 853 read => feed constraints.
[2025-06-03 18:04:49] [INFO ] Implicit Places using invariants and state equation in 31020 ms returned []
Implicit Place search using SMT with State Equation took 33058 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1119/1273 places, 2542/2867 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 36385 ms. Remains : 1119/1273 places, 2542/2867 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
Product exploration explored 100000 steps with 25010 reset in 1005 ms.
Product exploration explored 100000 steps with 24974 reset in 1012 ms.
Computed a total of 304 stabilizing places and 926 stable transitions
Computed a total of 304 stabilizing places and 926 stable transitions
Detected a total of 304/1119 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p3)), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND p2 p3 (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p1) (NOT p3) p0)))), (X (NOT (AND (NOT p2) p1 p3 (NOT p0)))), (X (NOT (OR (AND p2 p3 p0) (AND (NOT p1) p3 p0)))), (X (NOT (AND (NOT p2) p1 p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (OR (AND p2 p3) (AND (NOT p1) p3)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p1) (NOT p3) p0))))), (X (X (NOT (AND (NOT p2) p1 p3 (NOT p0))))), (X (X (NOT (OR (AND p2 p3 p0) (AND (NOT p1) p3 p0))))), (X (X (NOT (AND (NOT p2) p1 p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p2 p3) (AND (NOT p1) p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p2 p3 (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 48 factoid took 164 ms. Reduced automaton from 9 states, 42 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[p0, p0, p0, p0, (AND p1 p0 (NOT p2)), p0]
RANDOM walk for 40000 steps (683 resets) in 448 ms. (89 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (148 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (148 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (148 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (148 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (148 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (148 resets) in 117 ms. (338 steps per ms) remains 6/6 properties
[2025-06-03 18:04:52] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2025-06-03 18:04:52] [INFO ] Invariant cache hit.
[2025-06-03 18:04:52] [INFO ] State equation strengthened by 853 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/1043 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1043 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/1084 variables, 10/17 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/1110 variables, 26/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/1119 variables, 9/52 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1119 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2270/3389 variables, 1119/1171 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3389 variables, 853/2024 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3389 variables, 0/2024 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3389 variables, 0/2024 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3389/3389 variables, and 2024 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2913 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1119/1119 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:56] [INFO ] Deduced a trap composed of 93 places in 1044 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:57] [INFO ] Deduced a trap composed of 129 places in 1040 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:04:58] [INFO ] Deduced a trap composed of 129 places in 1112 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:00] [INFO ] Deduced a trap composed of 113 places in 1067 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:01] [INFO ] Deduced a trap composed of 173 places in 1161 ms of which 223 ms to minimize.
SMT process timed out in 8767ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1119/1119 places, 2542/2542 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1119 transition count 2541
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1118 transition count 2541
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1117 transition count 2540
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1117 transition count 2540
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1116 transition count 2532
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1116 transition count 2532
Free-agglomeration rule (complex) applied 128 times.
Iterating global reduction 0 with 128 rules applied. Total rules applied 134 place count 1116 transition count 2404
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 262 place count 988 transition count 2404
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 263 place count 988 transition count 2404
Applied a total of 263 rules in 495 ms. Remains 988 /1119 variables (removed 131) and now considering 2404/2542 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 988/1119 places, 2404/2542 transitions.
RANDOM walk for 40000 steps (718 resets) in 463 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (117 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (116 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (118 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (115 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 62739 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 4
Probabilistic random walk after 62739 steps, saw 26595 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2025-06-03 18:05:05] [INFO ] Flow matrix only has 2007 transitions (discarded 397 similar events)
// Phase 1: matrix 2007 rows 988 cols
[2025-06-03 18:05:05] [INFO ] Computed 52 invariants in 24 ms
[2025-06-03 18:05:05] [INFO ] State equation strengthened by 846 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 904/912 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/912 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/913 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/913 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 40/953 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/979 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/988 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/988 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2007/2995 variables, 988/1040 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2995 variables, 846/1886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2995 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2995 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2995/2995 variables, and 1886 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2526 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 988/988 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 904/912 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:08] [INFO ] Deduced a trap composed of 84 places in 960 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:09] [INFO ] Deduced a trap composed of 85 places in 936 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:10] [INFO ] Deduced a trap composed of 84 places in 852 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:11] [INFO ] Deduced a trap composed of 101 places in 852 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:12] [INFO ] Deduced a trap composed of 115 places in 973 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:13] [INFO ] Deduced a trap composed of 101 places in 926 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:14] [INFO ] Deduced a trap composed of 133 places in 894 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:15] [INFO ] Deduced a trap composed of 156 places in 915 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:16] [INFO ] Deduced a trap composed of 168 places in 1023 ms of which 204 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:17] [INFO ] Deduced a trap composed of 91 places in 917 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:18] [INFO ] Deduced a trap composed of 115 places in 941 ms of which 145 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/912 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:19] [INFO ] Deduced a trap composed of 85 places in 871 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:20] [INFO ] Deduced a trap composed of 155 places in 976 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:21] [INFO ] Deduced a trap composed of 133 places in 967 ms of which 137 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/912 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:22] [INFO ] Deduced a trap composed of 91 places in 933 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:23] [INFO ] Deduced a trap composed of 84 places in 859 ms of which 113 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/913 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/913 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 40/953 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:24] [INFO ] Deduced a trap composed of 5 places in 1026 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:25] [INFO ] Deduced a trap composed of 27 places in 1008 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:26] [INFO ] Deduced a trap composed of 55 places in 975 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:27] [INFO ] Deduced a trap composed of 56 places in 1038 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:28] [INFO ] Deduced a trap composed of 56 places in 1077 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:30] [INFO ] Deduced a trap composed of 56 places in 1041 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:31] [INFO ] Deduced a trap composed of 56 places in 1086 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:32] [INFO ] Deduced a trap composed of 46 places in 1042 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:33] [INFO ] Deduced a trap composed of 55 places in 1063 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:34] [INFO ] Deduced a trap composed of 56 places in 1057 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:35] [INFO ] Deduced a trap composed of 55 places in 1056 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:36] [INFO ] Deduced a trap composed of 56 places in 1067 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:37] [INFO ] Deduced a trap composed of 75 places in 1021 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:38] [INFO ] Deduced a trap composed of 85 places in 981 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:39] [INFO ] Deduced a trap composed of 85 places in 973 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:40] [INFO ] Deduced a trap composed of 64 places in 992 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:41] [INFO ] Deduced a trap composed of 65 places in 1015 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:42] [INFO ] Deduced a trap composed of 62 places in 997 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:43] [INFO ] Deduced a trap composed of 65 places in 989 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:44] [INFO ] Deduced a trap composed of 95 places in 1019 ms of which 154 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/953 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:45] [INFO ] Deduced a trap composed of 46 places in 1036 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:46] [INFO ] Deduced a trap composed of 56 places in 1032 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:47] [INFO ] Deduced a trap composed of 56 places in 1034 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:48] [INFO ] Deduced a trap composed of 56 places in 1051 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:50] [INFO ] Deduced a trap composed of 56 places in 1084 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:51] [INFO ] Deduced a trap composed of 57 places in 1113 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:52] [INFO ] Deduced a trap composed of 71 places in 1002 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:05:53] [INFO ] Deduced a trap composed of 56 places in 1026 ms of which 115 ms to minimize.
SMT process timed out in 48038ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 2404/2404 transitions.
Applied a total of 0 rules in 88 ms. Remains 988 /988 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 988/988 places, 2404/2404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 2404/2404 transitions.
Applied a total of 0 rules in 88 ms. Remains 988 /988 variables (removed 0) and now considering 2404/2404 (removed 0) transitions.
[2025-06-03 18:05:53] [INFO ] Flow matrix only has 2007 transitions (discarded 397 similar events)
[2025-06-03 18:05:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:05:55] [INFO ] Implicit Places using invariants in 1897 ms returned [889]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1899 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 987/988 places, 2404/2404 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 986 transition count 2403
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 986 transition count 2403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 985 transition count 2402
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 985 transition count 2402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 984 transition count 2394
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 984 transition count 2394
Applied a total of 6 rules in 261 ms. Remains 984 /987 variables (removed 3) and now considering 2394/2404 (removed 10) transitions.
[2025-06-03 18:05:55] [INFO ] Flow matrix only has 1997 transitions (discarded 397 similar events)
// Phase 1: matrix 1997 rows 984 cols
[2025-06-03 18:05:55] [INFO ] Computed 51 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:05:57] [INFO ] Implicit Places using invariants in 1804 ms returned []
[2025-06-03 18:05:57] [INFO ] Flow matrix only has 1997 transitions (discarded 397 similar events)
[2025-06-03 18:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:05:58] [INFO ] State equation strengthened by 839 read => feed constraints.
[2025-06-03 18:06:27] [INFO ] Implicit Places using invariants and state equation in 29666 ms returned [976]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31495 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 983/988 places, 2394/2404 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 983 transition count 2393
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 982 transition count 2393
Applied a total of 2 rules in 86 ms. Remains 982 /983 variables (removed 1) and now considering 2393/2394 (removed 1) transitions.
[2025-06-03 18:06:27] [INFO ] Flow matrix only has 1996 transitions (discarded 397 similar events)
// Phase 1: matrix 1996 rows 982 cols
[2025-06-03 18:06:27] [INFO ] Computed 50 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:06:28] [INFO ] Implicit Places using invariants in 1514 ms returned []
[2025-06-03 18:06:28] [INFO ] Flow matrix only has 1996 transitions (discarded 397 similar events)
[2025-06-03 18:06:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:06:29] [INFO ] State equation strengthened by 839 read => feed constraints.
[2025-06-03 18:06:53] [INFO ] Implicit Places using invariants and state equation in 24359 ms returned []
Implicit Place search using SMT with State Equation took 25884 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 982/988 places, 2393/2404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 59718 ms. Remains : 982/988 places, 2393/2404 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p3)), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3)))), (X (NOT (OR (AND p2 p3 (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p1) (NOT p3) p0)))), (X (NOT (AND (NOT p2) p1 p3 (NOT p0)))), (X (NOT (OR (AND p2 p3 p0) (AND (NOT p1) p3 p0)))), (X (NOT (AND (NOT p2) p1 p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p3 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (OR (AND p2 p3) (AND (NOT p1) p3)))), (X (NOT (AND (NOT p2) p1 p3))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p1) (NOT p3) p0))))), (X (X (NOT (AND (NOT p2) p1 p3 (NOT p0))))), (X (X (NOT (OR (AND p2 p3 p0) (AND (NOT p1) p3 p0))))), (X (X (NOT (AND (NOT p2) p1 p3 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p2 p3) (AND (NOT p1) p3))))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND p2 p3 (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (G (OR p1 p2 (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (F (NOT (AND (OR p1 (NOT p0)) (OR (NOT p2) (NOT p0))))), (F p0)]
Knowledge based reduction with 50 factoid took 279 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Stuttering acceptance computed with spot in 230 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Support contains 8 out of 1119 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 2542/2542 transitions.
Applied a total of 0 rules in 75 ms. Remains 1119 /1119 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2025-06-03 18:06:53] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1119 cols
[2025-06-03 18:06:53] [INFO ] Computed 52 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:06:55] [INFO ] Implicit Places using invariants in 2040 ms returned []
[2025-06-03 18:06:55] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2025-06-03 18:06:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:06:57] [INFO ] State equation strengthened by 853 read => feed constraints.
[2025-06-03 18:07:27] [INFO ] Performed 1113/1119 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 18:07:27] [INFO ] Implicit Places using invariants and state equation in 31579 ms returned []
Implicit Place search using SMT with State Equation took 33622 ms to find 0 implicit places.
Running 2525 sub problems to find dead transitions.
[2025-06-03 18:07:27] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2025-06-03 18:07:27] [INFO ] Invariant cache hit.
[2025-06-03 18:07:27] [INFO ] State equation strengthened by 853 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.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 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.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 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.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 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.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 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.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 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.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 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.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 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.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 0.0)
(s488 0.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 0.0)
(s514 0.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 1.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 1.0)
(s534 0.0)
(s535 1.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 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.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 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 0.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 1.0)
(s613 0.0)
(s614 1.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 1.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1117 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 31736ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 31744ms
Finished structural reductions in LTL mode , in 1 iterations and 65456 ms. Remains : 1119/1119 places, 2542/2542 transitions.
Computed a total of 304 stabilizing places and 926 stable transitions
Computed a total of 304 stabilizing places and 926 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (684 resets) in 559 ms. (71 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (148 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (148 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
[2025-06-03 18:08:00] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2025-06-03 18:08:00] [INFO ] Invariant cache hit.
[2025-06-03 18:08:00] [INFO ] State equation strengthened by 853 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1038/1042 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/1043 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1043 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/1084 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/1110 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/1119 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1119 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2270/3389 variables, 1119/1171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3389 variables, 853/2024 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3389 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3389 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3389/3389 variables, and 2024 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3137 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1119/1119 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1038/1042 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:04] [INFO ] Deduced a trap composed of 101 places in 1259 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:06] [INFO ] Deduced a trap composed of 113 places in 1178 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:07] [INFO ] Deduced a trap composed of 93 places in 1171 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:08] [INFO ] Deduced a trap composed of 187 places in 1514 ms of which 251 ms to minimize.
SMT process timed out in 8752ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1119/1119 places, 2542/2542 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1119 transition count 2541
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1118 transition count 2541
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1117 transition count 2540
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1117 transition count 2540
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1116 transition count 2532
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1116 transition count 2532
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 0 with 132 rules applied. Total rules applied 138 place count 1116 transition count 4276
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 0 with 132 rules applied. Total rules applied 270 place count 984 transition count 4276
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 271 place count 984 transition count 4276
Applied a total of 271 rules in 1019 ms. Remains 984 /1119 variables (removed 135) and now considering 4276/2542 (removed -1734) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1020 ms. Remains : 984/1119 places, 4276/2542 transitions.
RANDOM walk for 40000 steps (839 resets) in 1537 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (120 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (120 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (121 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (118 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 46244 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 4
Probabilistic random walk after 46244 steps, saw 19593 distinct states, run finished after 3013 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 18:08:13] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
// Phase 1: matrix 3878 rows 984 cols
[2025-06-03 18:08:13] [INFO ] Computed 52 invariants in 60 ms
[2025-06-03 18:08:13] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 887/891 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/892 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/892 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 57/949 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/949 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/975 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/975 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/984 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/984 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3878/4862 variables, 984/1036 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4862 variables, 2722/3758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4862 variables, 0/3758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4862 variables, 0/3758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4862/4862 variables, and 3758 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4863 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 984/984 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 887/891 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:20] [INFO ] Deduced a trap composed of 98 places in 1518 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:22] [INFO ] Deduced a trap composed of 82 places in 1423 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:23] [INFO ] Deduced a trap composed of 88 places in 1270 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:24] [INFO ] Deduced a trap composed of 81 places in 1331 ms of which 107 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:26] [INFO ] Deduced a trap composed of 98 places in 1371 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:27] [INFO ] Deduced a trap composed of 88 places in 1162 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:28] [INFO ] Deduced a trap composed of 130 places in 1286 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:30] [INFO ] Deduced a trap composed of 165 places in 1468 ms of which 203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:31] [INFO ] Deduced a trap composed of 82 places in 1417 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:33] [INFO ] Deduced a trap composed of 112 places in 1596 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:34] [INFO ] Deduced a trap composed of 153 places in 1444 ms of which 186 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/891 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:36] [INFO ] Deduced a trap composed of 81 places in 1314 ms of which 110 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:37] [INFO ] Deduced a trap composed of 152 places in 1446 ms of which 182 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:39] [INFO ] Deduced a trap composed of 81 places in 1489 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:40] [INFO ] Deduced a trap composed of 112 places in 1480 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:42] [INFO ] Deduced a trap composed of 130 places in 1433 ms of which 165 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/891 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/892 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/892 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 57/949 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:44] [INFO ] Deduced a trap composed of 5 places in 1268 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:45] [INFO ] Deduced a trap composed of 27 places in 1164 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:46] [INFO ] Deduced a trap composed of 27 places in 1229 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:47] [INFO ] Deduced a trap composed of 57 places in 1031 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:49] [INFO ] Deduced a trap composed of 46 places in 1370 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:50] [INFO ] Deduced a trap composed of 62 places in 1290 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:51] [INFO ] Deduced a trap composed of 62 places in 1174 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:52] [INFO ] Deduced a trap composed of 82 places in 1131 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:53] [INFO ] Deduced a trap composed of 85 places in 1283 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:55] [INFO ] Deduced a trap composed of 85 places in 1288 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:56] [INFO ] Deduced a trap composed of 75 places in 1430 ms of which 198 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:58] [INFO ] Deduced a trap composed of 92 places in 1621 ms of which 270 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:59] [INFO ] Deduced a trap composed of 184 places in 1220 ms of which 197 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:00] [INFO ] Deduced a trap composed of 195 places in 1266 ms of which 214 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:02] [INFO ] Deduced a trap composed of 192 places in 1092 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:03] [INFO ] Deduced a trap composed of 195 places in 1354 ms of which 206 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:04] [INFO ] Deduced a trap composed of 203 places in 1070 ms of which 163 ms to minimize.
SMT process timed out in 50712ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Applied a total of 0 rules in 145 ms. Remains 984 /984 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 984/984 places, 4276/4276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Applied a total of 0 rules in 144 ms. Remains 984 /984 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2025-06-03 18:09:04] [INFO ] Flow matrix only has 3878 transitions (discarded 398 similar events)
[2025-06-03 18:09:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:09:06] [INFO ] Implicit Places using invariants in 2128 ms returned [118, 816, 885]
[2025-06-03 18:09:06] [INFO ] Actually due to overlaps returned [816, 885]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2132 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 982/984 places, 4276/4276 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 981 transition count 4275
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 981 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 980 transition count 4274
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 980 transition count 4274
Applied a total of 4 rules in 246 ms. Remains 980 /982 variables (removed 2) and now considering 4274/4276 (removed 2) transitions.
[2025-06-03 18:09:07] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
// Phase 1: matrix 3876 rows 980 cols
[2025-06-03 18:09:07] [INFO ] Computed 50 invariants in 54 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:09:09] [INFO ] Implicit Places using invariants in 2396 ms returned [118]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2407 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/984 places, 4274/4276 transitions.
Applied a total of 0 rules in 239 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5169 ms. Remains : 979/984 places, 4274/4276 transitions.
RANDOM walk for 40000 steps (840 resets) in 1911 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (119 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (120 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (118 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (118 resets) in 213 ms. (186 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 47041 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 4
Probabilistic random walk after 47041 steps, saw 19905 distinct states, run finished after 3004 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 18:09:13] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
// Phase 1: matrix 3876 rows 979 cols
[2025-06-03 18:09:13] [INFO ] Computed 49 invariants in 83 ms
[2025-06-03 18:09:13] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 900/904 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/904 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/905 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 39/944 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/970 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/970 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 9/979 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3876/4855 variables, 979/1028 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4855 variables, 2722/3750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4855 variables, 0/3750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4855 variables, 0/3750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4855/4855 variables, and 3750 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4714 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 900/904 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:20] [INFO ] Deduced a trap composed of 96 places in 1412 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:21] [INFO ] Deduced a trap composed of 80 places in 1168 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:22] [INFO ] Deduced a trap composed of 110 places in 1643 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:24] [INFO ] Deduced a trap composed of 86 places in 1378 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:25] [INFO ] Deduced a trap composed of 79 places in 1436 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:27] [INFO ] Deduced a trap composed of 163 places in 1336 ms of which 125 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/904 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:28] [INFO ] Deduced a trap composed of 128 places in 1429 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:30] [INFO ] Deduced a trap composed of 80 places in 1380 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:31] [INFO ] Deduced a trap composed of 151 places in 1441 ms of which 174 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:33] [INFO ] Deduced a trap composed of 128 places in 1867 ms of which 236 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:35] [INFO ] Deduced a trap composed of 79 places in 1710 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:36] [INFO ] Deduced a trap composed of 86 places in 1426 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:38] [INFO ] Deduced a trap composed of 96 places in 1337 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:39] [INFO ] Deduced a trap composed of 79 places in 1139 ms of which 114 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/904 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:41] [INFO ] Deduced a trap composed of 150 places in 1678 ms of which 303 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:42] [INFO ] Deduced a trap composed of 110 places in 1540 ms of which 230 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/904 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/905 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/905 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 39/944 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:45] [INFO ] Deduced a trap composed of 5 places in 1461 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:46] [INFO ] Deduced a trap composed of 27 places in 1267 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:47] [INFO ] Deduced a trap composed of 62 places in 1495 ms of which 182 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:49] [INFO ] Deduced a trap composed of 75 places in 1347 ms of which 182 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:50] [INFO ] Deduced a trap composed of 85 places in 1267 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:51] [INFO ] Deduced a trap composed of 46 places in 1180 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:53] [INFO ] Deduced a trap composed of 92 places in 1449 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:54] [INFO ] Deduced a trap composed of 92 places in 1293 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:55] [INFO ] Deduced a trap composed of 97 places in 1147 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:57] [INFO ] Deduced a trap composed of 94 places in 1546 ms of which 235 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:09:58] [INFO ] Deduced a trap composed of 184 places in 1343 ms of which 202 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:00] [INFO ] Deduced a trap composed of 185 places in 1594 ms of which 318 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:01] [INFO ] Deduced a trap composed of 185 places in 1301 ms of which 276 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:03] [INFO ] Deduced a trap composed of 186 places in 1538 ms of which 287 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:04] [INFO ] Deduced a trap composed of 185 places in 1259 ms of which 203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:05] [INFO ] Deduced a trap composed of 185 places in 1087 ms of which 198 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:07] [INFO ] Deduced a trap composed of 185 places in 1579 ms of which 323 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:08] [INFO ] Deduced a trap composed of 185 places in 1435 ms of which 185 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:09] [INFO ] Deduced a trap composed of 185 places in 1216 ms of which 197 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:11] [INFO ] Deduced a trap composed of 193 places in 1073 ms of which 170 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/944 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:12] [INFO ] Deduced a trap composed of 52 places in 1236 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:13] [INFO ] Deduced a trap composed of 192 places in 1355 ms of which 204 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:15] [INFO ] Deduced a trap composed of 53 places in 1406 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:16] [INFO ] Deduced a trap composed of 185 places in 1329 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:18] [INFO ] Deduced a trap composed of 53 places in 1697 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:19] [INFO ] Deduced a trap composed of 185 places in 1665 ms of which 252 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:21] [INFO ] Deduced a trap composed of 53 places in 1458 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:22] [INFO ] Deduced a trap composed of 53 places in 1513 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:24] [INFO ] Deduced a trap composed of 53 places in 1368 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:25] [INFO ] Deduced a trap composed of 53 places in 1625 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:27] [INFO ] Deduced a trap composed of 185 places in 1020 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:28] [INFO ] Deduced a trap composed of 185 places in 1456 ms of which 293 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:30] [INFO ] Deduced a trap composed of 185 places in 1485 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:31] [INFO ] Deduced a trap composed of 185 places in 1430 ms of which 272 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:32] [INFO ] Deduced a trap composed of 100 places in 1106 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:10:33] [INFO ] Deduced a trap composed of 100 places in 1252 ms of which 154 ms to minimize.
SMT process timed out in 80246ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 164 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 174 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2025-06-03 18:10:34] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2025-06-03 18:10:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:10:37] [INFO ] Implicit Places using invariants in 2997 ms returned []
[2025-06-03 18:10:37] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2025-06-03 18:10:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:10:39] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-03 18:11:09] [INFO ] Performed 235/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 18:11:39] [INFO ] Performed 433/979 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 18:12:09] [INFO ] Performed 655/979 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 18:12:40] [INFO ] Performed 953/979 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2025-06-03 18:12:40] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2025-06-03 18:12:40] [INFO ] Implicit Places using invariants and state equation in 122826 ms returned []
Implicit Place search using SMT with State Equation took 125836 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:12:40] [INFO ] Redundant transitions in 443 ms returned []
Running 4212 sub problems to find dead transitions.
[2025-06-03 18:12:40] [INFO ] Flow matrix only has 3876 transitions (discarded 398 similar events)
[2025-06-03 18:12:40] [INFO ] Invariant cache hit.
[2025-06-03 18:12:40] [INFO ] State equation strengthened by 2722 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/977 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4212 unsolved
SMT process timed out in 36664ms, After SMT, problems are : Problem set: 0 solved, 4212 unsolved
Search for dead transitions found 0 dead transitions in 36680ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163168 ms. Remains : 979/979 places, 4274/4274 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Stuttering acceptance computed with spot in 297 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Stuttering acceptance computed with spot in 274 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Product exploration explored 100000 steps with 20000 reset in 1095 ms.
Product exploration explored 100000 steps with 20000 reset in 914 ms.
Applying partial POR strategy [false, false, true, false, false, false]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), p0, (OR (AND p0 (NOT p1)) (AND p0 p2)), false, (OR (AND p0 (NOT p1)) (AND p0 p2))]
Support contains 8 out of 1119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1119/1119 places, 2542/2542 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1119 transition count 2543
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1119 transition count 2543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 1118 transition count 2541
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1118 transition count 2541
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 1117 transition count 2533
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1117 transition count 2533
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 5 rules in 351 ms. Remains 1117 /1119 variables (removed 2) and now considering 2533/2542 (removed 9) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:13:21] [INFO ] Redundant transitions in 230 ms returned []
Running 2516 sub problems to find dead transitions.
[2025-06-03 18:13:21] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1117 cols
[2025-06-03 18:13:21] [INFO ] Computed 52 invariants in 34 ms
[2025-06-03 18:13:21] [INFO ] State equation strengthened by 846 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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/1115 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2516 unsolved
SMT process timed out in 31744ms, After SMT, problems are : Problem set: 0 solved, 2516 unsolved
Search for dead transitions found 0 dead transitions in 31752ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1117/1119 places, 2533/2542 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32350 ms. Remains : 1117/1119 places, 2533/2542 transitions.
Built C files in :
/tmp/ltsmin11471003333911699438
[2025-06-03 18:13:53] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11471003333911699438
Running compilation step : cd /tmp/ltsmin11471003333911699438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11471003333911699438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11471003333911699438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 8 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 2542/2542 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1118 transition count 2541
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1118 transition count 2541
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1117 transition count 2533
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1117 transition count 2533
Applied a total of 4 rules in 345 ms. Remains 1117 /1119 variables (removed 2) and now considering 2533/2542 (removed 9) transitions.
[2025-06-03 18:13:56] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1117 cols
[2025-06-03 18:13:56] [INFO ] Computed 52 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:13:58] [INFO ] Implicit Places using invariants in 2197 ms returned [1009]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2201 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1116/1119 places, 2533/2542 transitions.
Applied a total of 0 rules in 112 ms. Remains 1116 /1116 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2660 ms. Remains : 1116/1119 places, 2533/2542 transitions.
Built C files in :
/tmp/ltsmin15735429400113981476
[2025-06-03 18:13:58] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15735429400113981476
Running compilation step : cd /tmp/ltsmin15735429400113981476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15735429400113981476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15735429400113981476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:14:02] [INFO ] Flatten gal took : 59 ms
[2025-06-03 18:14:02] [INFO ] Flatten gal took : 61 ms
[2025-06-03 18:14:02] [INFO ] Time to serialize gal into /tmp/LTL305782777244818804.gal : 10 ms
[2025-06-03 18:14:02] [INFO ] Time to serialize properties into /tmp/LTL288988903308667321.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL305782777244818804.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7078242435666860940.hoa' '-atoms' '/tmp/LTL288988903308667321.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL288988903308667321.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7078242435666860940.hoa
Detected timeout of ITS tools.
[2025-06-03 18:14:17] [INFO ] Flatten gal took : 69 ms
[2025-06-03 18:14:17] [INFO ] Flatten gal took : 75 ms
[2025-06-03 18:14:17] [INFO ] Time to serialize gal into /tmp/LTL617029609371603050.gal : 13 ms
[2025-06-03 18:14:17] [INFO ] Time to serialize properties into /tmp/LTL3509634544198144182.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL617029609371603050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3509634544198144182.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((ThereIsAMasterInTheLeafSet<1)||(Node0WantsToManageTheCrashOfNode15<1))||((Node0HasDetectedCrashOfNode15<1)||(NoNodeMa...1525
Formula 0 simplified : G(F!"(((ThereIsAMasterInTheLeafSet<1)||(Node0WantsToManageTheCrashOfNode15<1))||((Node0HasDetectedCrashOfNode15<1)||(NoNodeManageThe...1287
Detected timeout of ITS tools.
[2025-06-03 18:14:32] [INFO ] Flatten gal took : 67 ms
[2025-06-03 18:14:32] [INFO ] Applying decomposition
[2025-06-03 18:14:32] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12255909546164239286.txt' '-o' '/tmp/graph12255909546164239286.bin' '-w' '/tmp/graph12255909546164239286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12255909546164239286.bin' '-l' '-1' '-v' '-w' '/tmp/graph12255909546164239286.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:14:32] [INFO ] Decomposing Gal with order
[2025-06-03 18:14:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:14:33] [INFO ] Removed a total of 2281 redundant transitions.
[2025-06-03 18:14:33] [INFO ] Flatten gal took : 345 ms
[2025-06-03 18:14:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1596 labels/synchronizations in 137 ms.
[2025-06-03 18:14:33] [INFO ] Time to serialize gal into /tmp/LTL2545303298316738213.gal : 28 ms
[2025-06-03 18:14:33] [INFO ] Time to serialize properties into /tmp/LTL13684061379499159029.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2545303298316738213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13684061379499159029.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G("(((u0.ThereIsAMasterInTheLeafSet<1)||(u0.Node0WantsToManageTheCrashOfNode15<1))||((i9.i2.u17.Node0HasDetectedCrashOfNode...1793
Formula 0 simplified : G(F!"(((u0.ThereIsAMasterInTheLeafSet<1)||(u0.Node0WantsToManageTheCrashOfNode15<1))||((i9.i2.u17.Node0HasDetectedCrashOfNode15<1)||...1515
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 finished in 635790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Stuttering acceptance computed with spot in 150 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 1273 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1273/1273 places, 2867/2867 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1273 transition count 2838
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1244 transition count 2838
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 58 place count 1244 transition count 2815
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 104 place count 1221 transition count 2815
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 117 place count 1208 transition count 2767
Iterating global reduction 2 with 13 rules applied. Total rules applied 130 place count 1208 transition count 2767
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 130 place count 1208 transition count 2765
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 1206 transition count 2765
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 141 place count 1199 transition count 2709
Iterating global reduction 2 with 7 rules applied. Total rules applied 148 place count 1199 transition count 2709
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 204 place count 1171 transition count 2681
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 1166 transition count 2676
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 1166 transition count 2676
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 219 place count 1161 transition count 2636
Iterating global reduction 2 with 5 rules applied. Total rules applied 224 place count 1161 transition count 2636
Applied a total of 224 rules in 710 ms. Remains 1161 /1273 variables (removed 112) and now considering 2636/2867 (removed 231) transitions.
[2025-06-03 18:14:49] [INFO ] Flow matrix only has 2364 transitions (discarded 272 similar events)
// Phase 1: matrix 2364 rows 1161 cols
[2025-06-03 18:14:49] [INFO ] Computed 63 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:14:51] [INFO ] Implicit Places using invariants in 2322 ms returned [9, 10, 95, 136, 486, 530, 561, 660, 709, 913, 959, 965, 1038, 1039]
[2025-06-03 18:14:51] [INFO ] Actually due to overlaps returned [959, 9, 10, 95, 486, 530, 561, 660, 709, 913, 965, 1038, 1039]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 2337 ms to find 13 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1148/1273 places, 2636/2867 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1141 transition count 2629
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1141 transition count 2629
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1134 transition count 2622
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1134 transition count 2622
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1129 transition count 2582
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1129 transition count 2582
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1124 transition count 2577
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 1119 transition count 2572
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 1119 transition count 2572
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 1114 transition count 2532
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 1114 transition count 2532
Applied a total of 68 rules in 754 ms. Remains 1114 /1148 variables (removed 34) and now considering 2532/2636 (removed 104) transitions.
[2025-06-03 18:14:52] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1114 cols
[2025-06-03 18:14:52] [INFO ] Computed 50 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:14:54] [INFO ] Implicit Places using invariants in 2387 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2400 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1113/1273 places, 2532/2867 transitions.
Applied a total of 0 rules in 84 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 6296 ms. Remains : 1113/1273 places, 2532/2867 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Product exploration explored 100000 steps with 1712 reset in 646 ms.
Product exploration explored 100000 steps with 1712 reset in 663 ms.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 335 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (682 resets) in 479 ms. (83 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (148 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
[2025-06-03 18:14:56] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2025-06-03 18:14:57] [INFO ] Computed 49 invariants in 25 ms
[2025-06-03 18:14:57] [INFO ] State equation strengthened by 846 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:14:58] [INFO ] Deduced a trap composed of 124 places in 1146 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:14:59] [INFO ] Deduced a trap composed of 138 places in 1066 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:00] [INFO ] Deduced a trap composed of 88 places in 879 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:01] [INFO ] Deduced a trap composed of 101 places in 940 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:02] [INFO ] Deduced a trap composed of 119 places in 1185 ms of which 50 ms to minimize.
SMT process timed out in 5805ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1112 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1112 transition count 2524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1109 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 978 transition count 4273
Applied a total of 270 rules in 814 ms. Remains 978 /1113 variables (removed 135) and now considering 4273/2532 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 815 ms. Remains : 978/1113 places, 4273/2532 transitions.
RANDOM walk for 40000 steps (839 resets) in 2102 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (121 resets) in 378 ms. (105 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 54070 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 54070 steps, saw 22842 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 18:15:07] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2025-06-03 18:15:07] [INFO ] Computed 49 invariants in 42 ms
[2025-06-03 18:15:07] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:09] [INFO ] Deduced a trap composed of 80 places in 1403 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:10] [INFO ] Deduced a trap composed of 96 places in 1129 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:11] [INFO ] Deduced a trap composed of 96 places in 1346 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:13] [INFO ] Deduced a trap composed of 87 places in 1270 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:14] [INFO ] Deduced a trap composed of 103 places in 1398 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:15] [INFO ] Deduced a trap composed of 100 places in 1330 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:17] [INFO ] Deduced a trap composed of 79 places in 1309 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/962 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/978 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4853 variables, 978/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4853 variables, 2722/3756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4853 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3756 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12574 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:21] [INFO ] Deduced a trap composed of 80 places in 1264 ms of which 34 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/936 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:23] [INFO ] Deduced a trap composed of 5 places in 1513 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:24] [INFO ] Deduced a trap composed of 46 places in 1641 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:26] [INFO ] Deduced a trap composed of 52 places in 1417 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:27] [INFO ] Deduced a trap composed of 57 places in 1321 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:28] [INFO ] Deduced a trap composed of 57 places in 1164 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:30] [INFO ] Deduced a trap composed of 52 places in 1471 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:31] [INFO ] Deduced a trap composed of 57 places in 1191 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:33] [INFO ] Deduced a trap composed of 58 places in 1698 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:34] [INFO ] Deduced a trap composed of 58 places in 1613 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:36] [INFO ] Deduced a trap composed of 58 places in 1710 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:38] [INFO ] Deduced a trap composed of 59 places in 1517 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:39] [INFO ] Deduced a trap composed of 62 places in 1467 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:41] [INFO ] Deduced a trap composed of 52 places in 1414 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:42] [INFO ] Deduced a trap composed of 52 places in 1799 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:44] [INFO ] Deduced a trap composed of 53 places in 1450 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:45] [INFO ] Deduced a trap composed of 53 places in 1541 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:47] [INFO ] Deduced a trap composed of 53 places in 1553 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:49] [INFO ] Deduced a trap composed of 53 places in 1501 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:50] [INFO ] Deduced a trap composed of 53 places in 1440 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:51] [INFO ] Deduced a trap composed of 53 places in 1282 ms of which 100 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:53] [INFO ] Deduced a trap composed of 53 places in 1260 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:54] [INFO ] Deduced a trap composed of 53 places in 1491 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:56] [INFO ] Deduced a trap composed of 53 places in 1335 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:57] [INFO ] Deduced a trap composed of 53 places in 1258 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:15:58] [INFO ] Deduced a trap composed of 53 places in 1553 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:16:00] [INFO ] Deduced a trap composed of 53 places in 1471 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:16:01] [INFO ] Deduced a trap composed of 53 places in 1444 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:16:03] [INFO ] Deduced a trap composed of 53 places in 1426 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:16:04] [INFO ] Deduced a trap composed of 57 places in 1628 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:16:06] [INFO ] Deduced a trap composed of 57 places in 1589 ms of which 102 ms to minimize.
SMT process timed out in 59224ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 144 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 143 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2025-06-03 18:16:06] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 18:16:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:16:09] [INFO ] Implicit Places using invariants in 2886 ms returned []
[2025-06-03 18:16:09] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 18:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:16:11] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-03 18:16:41] [INFO ] Performed 287/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 18:17:12] [INFO ] Performed 496/978 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 18:17:42] [INFO ] Performed 714/978 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 18:18:11] [INFO ] Implicit Places using invariants and state equation in 122053 ms returned []
Implicit Place search using SMT with State Equation took 124943 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:18:12] [INFO ] Redundant transitions in 383 ms returned []
Running 4211 sub problems to find dead transitions.
[2025-06-03 18:18:12] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 18:18:12] [INFO ] Invariant cache hit.
[2025-06-03 18:18:12] [INFO ] State equation strengthened by 2722 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 37454ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 37465ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162960 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 17 factoid took 859 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 1113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Applied a total of 0 rules in 174 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
[2025-06-03 18:18:50] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2025-06-03 18:18:50] [INFO ] Computed 49 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:18:53] [INFO ] Implicit Places using invariants in 2192 ms returned []
[2025-06-03 18:18:53] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2025-06-03 18:18:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:18:54] [INFO ] State equation strengthened by 846 read => feed constraints.
[2025-06-03 18:19:24] [INFO ] Performed 1094/1113 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 18:19:25] [INFO ] Implicit Places using invariants and state equation in 32108 ms returned []
Implicit Place search using SMT with State Equation took 34314 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:19:25] [INFO ] Redundant transitions in 133 ms returned []
Running 2515 sub problems to find dead transitions.
[2025-06-03 18:19:25] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2025-06-03 18:19:25] [INFO ] Invariant cache hit.
[2025-06-03 18:19:25] [INFO ] State equation strengthened by 846 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2515 unsolved
SMT process timed out in 31691ms, After SMT, problems are : Problem set: 0 solved, 2515 unsolved
Search for dead transitions found 0 dead transitions in 31698ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66341 ms. Remains : 1113/1113 places, 2532/2532 transitions.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (684 resets) in 435 ms. (91 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (148 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2025-06-03 18:19:57] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2025-06-03 18:19:57] [INFO ] Invariant cache hit.
[2025-06-03 18:19:57] [INFO ] State equation strengthened by 846 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:19:59] [INFO ] Deduced a trap composed of 124 places in 1156 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:00] [INFO ] Deduced a trap composed of 138 places in 1087 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:01] [INFO ] Deduced a trap composed of 88 places in 1039 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:02] [INFO ] Deduced a trap composed of 101 places in 1034 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:03] [INFO ] Deduced a trap composed of 119 places in 862 ms of which 31 ms to minimize.
SMT process timed out in 5557ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1112 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1112 transition count 2524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1109 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 978 transition count 4273
Applied a total of 270 rules in 778 ms. Remains 978 /1113 variables (removed 135) and now considering 4273/2532 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 779 ms. Remains : 978/1113 places, 4273/2532 transitions.
RANDOM walk for 40000 steps (840 resets) in 1387 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (120 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 54928 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 54928 steps, saw 23203 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 18:20:07] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2025-06-03 18:20:07] [INFO ] Computed 49 invariants in 25 ms
[2025-06-03 18:20:07] [INFO ] State equation strengthened by 2722 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:08] [INFO ] Deduced a trap composed of 80 places in 1031 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:09] [INFO ] Deduced a trap composed of 96 places in 1047 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:11] [INFO ] Deduced a trap composed of 96 places in 1404 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:12] [INFO ] Deduced a trap composed of 87 places in 1377 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:14] [INFO ] Deduced a trap composed of 103 places in 1307 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:15] [INFO ] Deduced a trap composed of 100 places in 1209 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:16] [INFO ] Deduced a trap composed of 79 places in 1122 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/962 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/978 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4853 variables, 978/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4853 variables, 2722/3756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4853 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3756 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11302 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:20] [INFO ] Deduced a trap composed of 80 places in 1320 ms of which 30 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/936 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:22] [INFO ] Deduced a trap composed of 5 places in 1382 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:23] [INFO ] Deduced a trap composed of 46 places in 1627 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:25] [INFO ] Deduced a trap composed of 52 places in 1512 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:26] [INFO ] Deduced a trap composed of 57 places in 1619 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:28] [INFO ] Deduced a trap composed of 57 places in 1476 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:29] [INFO ] Deduced a trap composed of 52 places in 1614 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:31] [INFO ] Deduced a trap composed of 57 places in 1505 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:32] [INFO ] Deduced a trap composed of 58 places in 1425 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:34] [INFO ] Deduced a trap composed of 58 places in 1462 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:35] [INFO ] Deduced a trap composed of 58 places in 1299 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:37] [INFO ] Deduced a trap composed of 59 places in 1560 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:38] [INFO ] Deduced a trap composed of 62 places in 1321 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:40] [INFO ] Deduced a trap composed of 52 places in 1332 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:41] [INFO ] Deduced a trap composed of 52 places in 1507 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:42] [INFO ] Deduced a trap composed of 53 places in 1277 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:44] [INFO ] Deduced a trap composed of 53 places in 1561 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:45] [INFO ] Deduced a trap composed of 53 places in 1335 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:47] [INFO ] Deduced a trap composed of 53 places in 1314 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:48] [INFO ] Deduced a trap composed of 53 places in 1672 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:50] [INFO ] Deduced a trap composed of 53 places in 1552 ms of which 105 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:52] [INFO ] Deduced a trap composed of 53 places in 1572 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:53] [INFO ] Deduced a trap composed of 53 places in 1290 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:54] [INFO ] Deduced a trap composed of 53 places in 1397 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:56] [INFO ] Deduced a trap composed of 53 places in 1427 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:57] [INFO ] Deduced a trap composed of 53 places in 1503 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:20:59] [INFO ] Deduced a trap composed of 53 places in 1839 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:21:01] [INFO ] Deduced a trap composed of 53 places in 1722 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:21:03] [INFO ] Deduced a trap composed of 53 places in 1728 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:21:04] [INFO ] Deduced a trap composed of 57 places in 1620 ms of which 158 ms to minimize.
SMT process timed out in 57206ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 239 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 244 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2025-06-03 18:21:05] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 18:21:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:21:08] [INFO ] Implicit Places using invariants in 2918 ms returned []
[2025-06-03 18:21:08] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 18:21:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:21:09] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2025-06-03 18:21:40] [INFO ] Performed 292/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 18:22:10] [INFO ] Performed 504/978 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 18:22:40] [INFO ] Performed 719/978 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 18:23:08] [INFO ] Implicit Places using invariants and state equation in 120724 ms returned []
Implicit Place search using SMT with State Equation took 123645 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:23:09] [INFO ] Redundant transitions in 376 ms returned []
Running 4211 sub problems to find dead transitions.
[2025-06-03 18:23:09] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2025-06-03 18:23:09] [INFO ] Invariant cache hit.
[2025-06-03 18:23:09] [INFO ] State equation strengthened by 2722 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 36517ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 36527ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160816 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 10 factoid took 411 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1712 reset in 736 ms.
Product exploration explored 100000 steps with 1714 reset in 654 ms.
Built C files in :
/tmp/ltsmin5898680431023575873
[2025-06-03 18:23:47] [INFO ] Too many transitions (2532) to apply POR reductions. Disabling POR matrices.
[2025-06-03 18:23:47] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5898680431023575873
Running compilation step : cd /tmp/ltsmin5898680431023575873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5898680431023575873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5898680431023575873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1112 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1111 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1111 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Applied a total of 6 rules in 329 ms. Remains 1110 /1113 variables (removed 3) and now considering 2522/2532 (removed 10) transitions.
[2025-06-03 18:23:51] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2025-06-03 18:23:51] [INFO ] Computed 49 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:23:54] [INFO ] Implicit Places using invariants in 2752 ms returned []
[2025-06-03 18:23:54] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2025-06-03 18:23:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:23:55] [INFO ] State equation strengthened by 839 read => feed constraints.
[2025-06-03 18:24:22] [INFO ] Implicit Places using invariants and state equation in 28077 ms returned [1102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30835 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1109/1113 places, 2522/2532 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1109 transition count 2521
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1108 transition count 2521
Applied a total of 2 rules in 114 ms. Remains 1108 /1109 variables (removed 1) and now considering 2521/2522 (removed 1) transitions.
[2025-06-03 18:24:22] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
// Phase 1: matrix 2249 rows 1108 cols
[2025-06-03 18:24:22] [INFO ] Computed 48 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:24:24] [INFO ] Implicit Places using invariants in 1895 ms returned []
[2025-06-03 18:24:24] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
[2025-06-03 18:24:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:24:25] [INFO ] State equation strengthened by 839 read => feed constraints.
[2025-06-03 18:24:55] [INFO ] Implicit Places using invariants and state equation in 31569 ms returned []
Implicit Place search using SMT with State Equation took 33481 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1113 places, 2521/2532 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64761 ms. Remains : 1108/1113 places, 2521/2532 transitions.
Built C files in :
/tmp/ltsmin17171186618952421347
[2025-06-03 18:24:55] [INFO ] Too many transitions (2521) to apply POR reductions. Disabling POR matrices.
[2025-06-03 18:24:55] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17171186618952421347
Running compilation step : cd /tmp/ltsmin17171186618952421347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17171186618952421347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17171186618952421347;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:24:58] [INFO ] Flatten gal took : 58 ms
[2025-06-03 18:24:58] [INFO ] Flatten gal took : 59 ms
[2025-06-03 18:24:59] [INFO ] Time to serialize gal into /tmp/LTL12588591417148159134.gal : 11 ms
[2025-06-03 18:24:59] [INFO ] Time to serialize properties into /tmp/LTL5697935928173353048.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12588591417148159134.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16799539210646518282.hoa' '-atoms' '/tmp/LTL5697935928173353048.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5697935928173353048.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16799539210646518282.hoa
Detected timeout of ITS tools.
[2025-06-03 18:25:14] [INFO ] Flatten gal took : 58 ms
[2025-06-03 18:25:14] [INFO ] Flatten gal took : 60 ms
[2025-06-03 18:25:14] [INFO ] Time to serialize gal into /tmp/LTL3526460497898468048.gal : 10 ms
[2025-06-03 18:25:14] [INFO ] Time to serialize properties into /tmp/LTL5848592723141266945.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3526460497898468048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5848592723141266945.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((Node15ManageTheCrashOfNode2<1)||(Lx...583
Formula 0 simplified : G(F!"((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtThe...567
Detected timeout of ITS tools.
[2025-06-03 18:25:29] [INFO ] Flatten gal took : 57 ms
[2025-06-03 18:25:29] [INFO ] Applying decomposition
[2025-06-03 18:25:29] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph118080145196767596.txt' '-o' '/tmp/graph118080145196767596.bin' '-w' '/tmp/graph118080145196767596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph118080145196767596.bin' '-l' '-1' '-v' '-w' '/tmp/graph118080145196767596.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:25:29] [INFO ] Decomposing Gal with order
[2025-06-03 18:25:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:25:29] [INFO ] Removed a total of 2279 redundant transitions.
[2025-06-03 18:25:29] [INFO ] Flatten gal took : 275 ms
[2025-06-03 18:25:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1362 labels/synchronizations in 76 ms.
[2025-06-03 18:25:30] [INFO ] Time to serialize gal into /tmp/LTL10902489307913786287.gal : 22 ms
[2025-06-03 18:25:30] [INFO ] Time to serialize properties into /tmp/LTL11816195320439148812.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10902489307913786287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11816195320439148812.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((i5.i0.i0.u19.Node15ManageTheCrashOfNode2<1)||(i5.i0.i0.u158.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((i5.i0.i0...747
Formula 0 simplified : G(F!"((i5.i0.i0.u19.Node15ManageTheCrashOfNode2<1)||(i5.i0.i0.u158.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((i5.i0.i0.u19.Nod...731
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 656622 ms.
[2025-06-03 18:25:45] [INFO ] Flatten gal took : 74 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1391631235834184238
[2025-06-03 18:25:45] [INFO ] Too many transitions (2867) to apply POR reductions. Disabling POR matrices.
[2025-06-03 18:25:45] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1391631235834184238
Running compilation step : cd /tmp/ltsmin1391631235834184238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 18:25:45] [INFO ] Applying decomposition
[2025-06-03 18:25:45] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14979998741768389443.txt' '-o' '/tmp/graph14979998741768389443.bin' '-w' '/tmp/graph14979998741768389443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14979998741768389443.bin' '-l' '-1' '-v' '-w' '/tmp/graph14979998741768389443.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:25:45] [INFO ] Decomposing Gal with order
[2025-06-03 18:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:25:45] [INFO ] Removed a total of 2357 redundant transitions.
[2025-06-03 18:25:45] [INFO ] Flatten gal took : 220 ms
[2025-06-03 18:25:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1319 labels/synchronizations in 82 ms.
[2025-06-03 18:25:45] [INFO ] Time to serialize gal into /tmp/LTLFireability13702071028805156219.gal : 25 ms
[2025-06-03 18:25:45] [INFO ] Time to serialize properties into /tmp/LTLFireability16453717702762177124.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13702071028805156219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16453717702762177124.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((F((G(F(((X(!("(((i0.u0.ThereIsAMasterInTheLeafSet>=1)&&(i0.u0.Node0WantsToManageTheCrashOfNode15>=1))&&((i2.u27.Node0HasDetectedCra...1811
Formula 0 simplified : G(F"(((i0.u0.ThereIsAMasterInTheLeafSet>=1)&&(i0.u0.Node0WantsToManageTheCrashOfNode15>=1))&&((i2.u27.Node0HasDetectedCrashOfNode15>...1525
Compilation finished in 12024 ms.
Running link step : cd /tmp/ltsmin1391631235834184238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 120 ms.
Running LTSmin : cd /tmp/ltsmin1391631235834184238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(((X(!(LTLAPp0==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))||[](!(LTLAPp0==true)))))||(!(LTLAPp3==true)&&X(X(X(<>(((X(!(LTLAPp0==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))||[](!(LTLAPp0==true))))))))))' '--buchi-type=spotba'
LTSmin run took 1833 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1391631235834184238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](!(LTLAPp4==true))||(!(LTLAPp5==true)&&X(([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&[](<>((LTLAPp6==true)))))))))' '--buchi-type=spotba'
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524300332"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;