About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C07
| 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 | ??FT??FFFF?FFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524300324.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-S16C07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524300324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K 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 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 5.7M 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-S16C07-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748957805882
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-S16C07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 13:36:48] [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 13:36:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 13:36:49] [INFO ] Load time of PNML (sax parser for PT used): 856 ms
[2025-06-03 13:36:49] [INFO ] Transformed 6222 places.
[2025-06-03 13:36:49] [INFO ] Transformed 8685 transitions.
[2025-06-03 13:36:49] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 1169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 6222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 6188 transition count 8685
Discarding 1880 places :
Symmetric choice reduction at 1 with 1880 rule applications. Total rules 1914 place count 4308 transition count 6805
Iterating global reduction 1 with 1880 rules applied. Total rules applied 3794 place count 4308 transition count 6805
Discarding 1647 places :
Symmetric choice reduction at 1 with 1647 rule applications. Total rules 5441 place count 2661 transition count 5158
Iterating global reduction 1 with 1647 rules applied. Total rules applied 7088 place count 2661 transition count 5158
Discarding 211 places :
Symmetric choice reduction at 1 with 211 rule applications. Total rules 7299 place count 2450 transition count 3681
Iterating global reduction 1 with 211 rules applied. Total rules applied 7510 place count 2450 transition count 3681
Applied a total of 7510 rules in 2047 ms. Remains 2450 /6222 variables (removed 3772) and now considering 3681/8685 (removed 5004) transitions.
[2025-06-03 13:36:52] [INFO ] Flow matrix only has 3409 transitions (discarded 272 similar events)
// Phase 1: matrix 3409 rows 2450 cols
[2025-06-03 13:36:52] [INFO ] Computed 577 invariants in 245 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:36:59] [INFO ] Implicit Places using invariants in 7013 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 26, 31, 38, 47, 58, 71, 86, 102, 118, 122, 124, 126, 128, 130, 132, 145, 156, 165, 172, 177, 182, 213, 220, 223, 224, 225, 226, 227, 228, 230, 234, 241, 248, 257, 268, 281, 295, 309, 310, 311, 312, 313, 314, 315, 316, 327, 336, 343, 348, 351, 353, 391, 394, 395, 396, 397, 398, 399, 401, 403, 406, 411, 418, 430, 441, 453, 466, 467, 468, 469, 470, 471, 472, 481, 491, 496, 499, 501, 503, 534, 541, 544, 545, 546, 547, 548, 549, 550, 551, 553, 555, 558, 563, 570, 579, 589, 599, 600, 601, 604, 605, 606, 613, 618, 621, 626, 631, 633, 664, 671, 674, 675, 676, 677, 678, 679, 680, 681, 683, 685, 687, 690, 695, 702, 710, 718, 719, 720, 721, 722, 723, 724, 725, 730, 733, 735, 737, 739, 741, 772, 779, 782, 783, 784, 785, 786, 787, 788, 789, 791, 793, 795, 797, 800, 805, 812, 820, 821, 822, 823, 824, 825, 830, 832, 834, 836, 838, 840, 874, 881, 884, 885, 886, 887, 889, 890, 891, 895, 897, 899, 901, 903, 906, 910, 916, 917, 918, 919, 920, 921, 925, 930, 932, 934, 936, 938, 969, 976, 979, 980, 981, 982, 983, 984, 985, 986, 988, 990, 992, 994, 996, 998, 1000, 1003, 1004, 1005, 1006, 1008, 1009, 1010, 1012, 1014, 1016, 1018, 1020, 1025, 1056, 1058, 1062, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1074, 1076, 1078, 1080, 1082, 1084, 1086, 1089, 1090, 1091, 1094, 1095, 1096, 1098, 1100, 1102, 1104, 1110, 1112, 1143, 1150, 1153, 1154, 1155, 1156, 1158, 1159, 1160, 1162, 1164, 1166, 1170, 1172, 1174, 1176, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1188, 1190, 1192, 1194, 1196, 1199, 1230, 1237, 1240, 1241, 1242, 1243, 1244, 1245, 1247, 1249, 1251, 1253, 1255, 1259, 1261, 1264, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1279, 1281, 1283, 1285, 1287, 1289, 1320, 1327, 1330, 1332, 1333, 1334, 1335, 1336, 1337, 1339, 1341, 1343, 1345, 1347, 1353, 1358, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1377, 1382, 1384, 1386, 1388, 1419, 1426, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1438, 1440, 1442, 1444, 1447, 1452, 1459, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1482, 1487, 1490, 1492, 1494, 1496, 1534, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1546, 1548, 1550, 1553, 1558, 1565, 1574, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1592, 1601, 1608, 1613, 1616, 1618, 1620, 1651, 1658, 1661, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1671, 1673, 1676, 1681, 1688, 1697, 1709, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1740, 1749, 1756, 1761, 1764, 1766, 1797, 1804, 1807, 1808, 1809, 1810, 1811, 1813, 1814, 1816, 1819, 1824, 1831, 1840, 1854, 1867, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1902, 1913, 1922, 1929, 1934, 1937, 1968, 1970, 1974, 1977, 1978, 1979, 1981, 1982, 1983, 1988, 1994, 2001, 2010, 2023, 2036, 2051, 2068, 2069, 2070, 2071, 2072, 2073, 2074, 2075, 2090, 2103, 2114, 2124, 2132, 2137, 2169]
[2025-06-03 13:36:59] [INFO ] Actually due to overlaps returned [213, 534, 664, 772, 874, 969, 1056, 1143, 1230, 1320, 1419, 1651, 1797, 1968, 2169, 4, 8, 12, 14, 16, 18, 20, 22, 24, 118, 122, 124, 126, 128, 130, 156, 223, 224, 225, 226, 227, 228, 309, 310, 311, 312, 313, 314, 315, 336, 394, 395, 396, 397, 398, 399, 401, 466, 467, 468, 469, 470, 471, 491, 544, 545, 546, 547, 548, 549, 550, 551, 599, 600, 601, 604, 605, 618, 674, 675, 676, 677, 678, 679, 680, 681, 718, 719, 720, 721, 722, 723, 724, 733, 782, 783, 784, 785, 786, 787, 788, 789, 820, 821, 822, 823, 824, 832, 884, 885, 886, 887, 889, 890, 891, 916, 917, 918, 919, 920, 930, 979, 980, 981, 982, 983, 984, 985, 986, 1003, 1004, 1005, 1006, 1008, 1009, 1014, 1058, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1089, 1090, 1091, 1094, 1095, 1100, 1153, 1154, 1155, 1156, 1158, 1159, 1160, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1190, 1240, 1241, 1242, 1243, 1244, 1245, 1247, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1281, 1330, 1332, 1333, 1334, 1335, 1336, 1337, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1613, 1661, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1756, 1807, 1808, 1809, 1810, 1811, 1813, 1814, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1922, 1970, 1977, 1978, 1979, 1981, 1982, 1983, 2068, 2069, 2070, 2071, 2072, 2073, 2074, 2114]
Discarding 267 places :
Implicit Place search using SMT only with invariants took 7071 ms to find 267 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2183/6222 places, 3681/8685 transitions.
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 205 place count 1978 transition count 3476
Iterating global reduction 0 with 205 rules applied. Total rules applied 410 place count 1978 transition count 3476
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 615 place count 1773 transition count 3271
Iterating global reduction 0 with 205 rules applied. Total rules applied 820 place count 1773 transition count 3271
Discarding 203 places :
Symmetric choice reduction at 0 with 203 rule applications. Total rules 1023 place count 1570 transition count 3068
Iterating global reduction 0 with 203 rules applied. Total rules applied 1226 place count 1570 transition count 3068
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 1241 place count 1555 transition count 2963
Iterating global reduction 0 with 15 rules applied. Total rules applied 1256 place count 1555 transition count 2963
Applied a total of 1256 rules in 456 ms. Remains 1555 /2183 variables (removed 628) and now considering 2963/3681 (removed 718) transitions.
[2025-06-03 13:36:59] [INFO ] Flow matrix only has 2691 transitions (discarded 272 similar events)
// Phase 1: matrix 2691 rows 1555 cols
[2025-06-03 13:36:59] [INFO ] Computed 310 invariants in 103 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:37:04] [INFO ] Implicit Places using invariants in 5076 ms returned [17, 22, 29, 38, 49, 62, 77, 93, 117, 130, 149, 156, 161, 166, 203, 207, 211, 218, 225, 234, 245, 258, 272, 286, 297, 312, 317, 320, 322, 336, 341, 344, 349, 356, 368, 379, 391, 404, 413, 427, 430, 432, 434, 447, 450, 452, 455, 460, 467, 476, 486, 498, 505, 512, 517, 522, 524, 537, 540, 542, 544, 547, 552, 559, 567, 574, 579, 583, 585, 587, 589, 598, 602, 604, 606, 608, 611, 616, 623, 631, 636, 639, 641, 643, 645, 662, 669, 671, 673, 675, 677, 680, 684, 690, 694, 700, 702, 704, 706, 721, 724, 726, 728, 730, 732, 734, 736, 740, 742, 745, 747, 749, 754, 763, 767, 769, 771, 773, 775, 777, 779, 784, 786, 789, 791, 797, 799, 813, 818, 820, 822, 826, 828, 830, 832, 834, 836, 839, 841, 843, 846, 857, 862, 864, 866, 868, 872, 874, 877, 881, 884, 887, 889, 891, 893, 904, 909, 911, 913, 915, 917, 923, 928, 934, 939, 944, 946, 948, 950, 961, 964, 966, 968, 970, 973, 978, 985, 993, 1000, 1005, 1008, 1010, 1012, 1014, 1024, 1027, 1029, 1031, 1034, 1039, 1046, 1055, 1065, 1074, 1081, 1088, 1090, 1092, 1101, 1105, 1107, 1110, 1115, 1122, 1131, 1143, 1155, 1166, 1175, 1186, 1189, 1191, 1200, 1205, 1208, 1213, 1220, 1229, 1243, 1256, 1270, 1283, 1294, 1309, 1314, 1317, 1326, 1334, 1340, 1347, 1356, 1369, 1382, 1397, 1413, 1428, 1441, 1461, 1469, 1474]
Discarding 240 places :
Implicit Place search using SMT only with invariants took 5085 ms to find 240 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1315/6222 places, 2963/8685 transitions.
Applied a total of 0 rules in 70 ms. Remains 1315 /1315 variables (removed 0) and now considering 2963/2963 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14752 ms. Remains : 1315/6222 places, 2963/8685 transitions.
Support contains 80 out of 1315 places after structural reductions.
[2025-06-03 13:37:05] [INFO ] Flatten gal took : 352 ms
[2025-06-03 13:37:05] [INFO ] Flatten gal took : 299 ms
[2025-06-03 13:37:06] [INFO ] Input system was already deterministic with 2963 transitions.
Support contains 76 out of 1315 places (down from 80) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 40 to 38
RANDOM walk for 40000 steps (549 resets) in 2843 ms. (14 steps per ms) remains 18/38 properties
BEST_FIRST walk for 4004 steps (12 resets) in 76 ms. (52 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 55 ms. (71 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 53 ms. (74 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 44 ms. (88 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 51 ms. (77 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 45 ms. (87 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 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 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
[2025-06-03 13:37:07] [INFO ] Flow matrix only has 2691 transitions (discarded 272 similar events)
// Phase 1: matrix 2691 rows 1315 cols
[2025-06-03 13:37:07] [INFO ] Computed 70 invariants in 47 ms
[2025-06-03 13:37:07] [INFO ] State equation strengthened by 1094 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/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 1156/1196 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1196 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/1198 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1198 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 5 (OVERLAPS) 92/1290 variables, 30/45 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1290 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 16/1306 variables, 16/61 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1306 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 9/1315 variables, 9/70 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1315 variables, 0/70 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 2691/4006 variables, 1315/1385 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4006 variables, 1094/2479 constraints. Problems are: Problem set: 3 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4006/4006 variables, and 2479 constraints, problems are : Problem set: 3 solved, 14 unsolved in 5028 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 1315/1315 constraints, ReadFeed: 1094/1094 constraints, PredecessorRefiner: 17/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 1161/1188 variables, 12/12 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1188 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/1189 variables, 1/13 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1189 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 95/1284 variables, 26/39 constraints. Problems are: Problem set: 3 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:16] [INFO ] Deduced a trap composed of 50 places in 1632 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:18] [INFO ] Deduced a trap composed of 124 places in 1948 ms of which 341 ms to minimize.
SMT process timed out in 10993ms, After SMT, problems are : Problem set: 3 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 27 out of 1315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1315/1315 places, 2963/2963 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1315 transition count 2936
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1288 transition count 2936
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 54 place count 1288 transition count 2912
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 102 place count 1264 transition count 2912
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 118 place count 1248 transition count 2848
Iterating global reduction 2 with 16 rules applied. Total rules applied 134 place count 1248 transition count 2848
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 134 place count 1248 transition count 2846
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 1246 transition count 2846
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 146 place count 1238 transition count 2790
Iterating global reduction 2 with 8 rules applied. Total rules applied 154 place count 1238 transition count 2790
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 7 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 208 place count 1211 transition count 2763
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 1203 transition count 2755
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 1203 transition count 2755
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 232 place count 1195 transition count 2699
Iterating global reduction 2 with 8 rules applied. Total rules applied 240 place count 1195 transition count 2699
Free-agglomeration rule (complex) applied 128 times.
Iterating global reduction 2 with 128 rules applied. Total rules applied 368 place count 1195 transition count 4035
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 496 place count 1067 transition count 4035
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 508 place count 1067 transition count 4035
Applied a total of 508 rules in 1658 ms. Remains 1067 /1315 variables (removed 248) and now considering 4035/2963 (removed -1072) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1659 ms. Remains : 1067/1315 places, 4035/2963 transitions.
RANDOM walk for 40000 steps (920 resets) in 2033 ms. (19 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (147 resets) in 330 ms. (120 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (147 resets) in 333 ms. (119 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (132 resets) in 289 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (133 resets) in 268 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (145 resets) in 236 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (145 resets) in 238 ms. (167 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (160 resets) in 305 ms. (130 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (132 resets) in 254 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (160 resets) in 258 ms. (154 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (134 resets) in 221 ms. (180 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (133 resets) in 271 ms. (147 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (132 resets) in 218 ms. (182 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (146 resets) in 227 ms. (175 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 40861 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :0 out of 13
Probabilistic random walk after 40861 steps, saw 17429 distinct states, run finished after 3009 ms. (steps per millisecond=13 ) properties seen :0
[2025-06-03 13:37:24] [INFO ] Flow matrix only has 3657 transitions (discarded 378 similar events)
// Phase 1: matrix 3657 rows 1067 cols
[2025-06-03 13:37:24] [INFO ] Computed 70 invariants in 59 ms
[2025-06-03 13:37:24] [INFO ] State equation strengthened by 2414 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 960/986 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/986 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/987 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 49/1036 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:27] [INFO ] Deduced a trap composed of 20 places in 1897 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:29] [INFO ] Deduced a trap composed of 134 places in 1874 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:31] [INFO ] Deduced a trap composed of 135 places in 1731 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:33] [INFO ] Deduced a trap composed of 136 places in 1602 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:34] [INFO ] Deduced a trap composed of 135 places in 1409 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:35] [INFO ] Deduced a trap composed of 135 places in 1337 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:37] [INFO ] Deduced a trap composed of 135 places in 1358 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:38] [INFO ] Deduced a trap composed of 138 places in 1468 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:40] [INFO ] Deduced a trap composed of 138 places in 1535 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:41] [INFO ] Deduced a trap composed of 140 places in 1362 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:43] [INFO ] Deduced a trap composed of 135 places in 1553 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:44] [INFO ] Deduced a trap composed of 135 places in 1170 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:45] [INFO ] Deduced a trap composed of 139 places in 1334 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:47] [INFO ] Deduced a trap composed of 142 places in 1335 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:48] [INFO ] Deduced a trap composed of 134 places in 1281 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:50] [INFO ] Deduced a trap composed of 126 places in 1526 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:51] [INFO ] Deduced a trap composed of 148 places in 1408 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:52] [INFO ] Deduced a trap composed of 134 places in 1177 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:54] [INFO ] Deduced a trap composed of 172 places in 1507 ms of which 199 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:55] [INFO ] Deduced a trap composed of 134 places in 1376 ms of which 114 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1036 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:57] [INFO ] Deduced a trap composed of 42 places in 1356 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:37:58] [INFO ] Deduced a trap composed of 42 places in 1219 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:00] [INFO ] Deduced a trap composed of 75 places in 1879 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:01] [INFO ] Deduced a trap composed of 130 places in 1324 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:03] [INFO ] Deduced a trap composed of 107 places in 1275 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:04] [INFO ] Deduced a trap composed of 110 places in 1122 ms of which 96 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1036 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:05] [INFO ] Deduced a trap composed of 78 places in 1334 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:07] [INFO ] Deduced a trap composed of 71 places in 1463 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:08] [INFO ] Deduced a trap composed of 76 places in 1376 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:10] [INFO ] Deduced a trap composed of 76 places in 1576 ms of which 80 ms to minimize.
SMT process timed out in 45599ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 1067 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1067/1067 places, 4035/4035 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1067 transition count 4034
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1066 transition count 4034
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1066 transition count 4034
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1065 transition count 4033
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1065 transition count 4033
Applied a total of 5 rules in 573 ms. Remains 1065 /1067 variables (removed 2) and now considering 4033/4035 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 573 ms. Remains : 1065/1067 places, 4033/4035 transitions.
RANDOM walk for 40000 steps (920 resets) in 2022 ms. (19 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (146 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (145 resets) in 208 ms. (191 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (132 resets) in 208 ms. (191 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (134 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (142 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (144 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (160 resets) in 266 ms. (149 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (133 resets) in 208 ms. (191 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (160 resets) in 217 ms. (183 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (134 resets) in 204 ms. (195 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (135 resets) in 266 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (132 resets) in 253 ms. (157 steps per ms) remains 11/12 properties
[2025-06-03 13:38:12] [INFO ] Flow matrix only has 3655 transitions (discarded 378 similar events)
// Phase 1: matrix 3655 rows 1065 cols
[2025-06-03 13:38:12] [INFO ] Computed 70 invariants in 54 ms
[2025-06-03 13:38:12] [INFO ] State equation strengthened by 2414 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 961/984 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/984 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/985 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 49/1034 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 18/1052 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1052 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 13/1065 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1065 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 3655/4720 variables, 1065/1135 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4720 variables, 2414/3549 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4720 variables, 0/3549 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/4720 variables, 0/3549 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4720/4720 variables, and 3549 constraints, problems are : Problem set: 0 solved, 11 unsolved in 27217 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 1065/1065 constraints, ReadFeed: 2414/2414 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 961/984 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:41] [INFO ] Deduced a trap composed of 126 places in 1539 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:43] [INFO ] Deduced a trap composed of 120 places in 1703 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:45] [INFO ] Deduced a trap composed of 127 places in 1881 ms of which 179 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:46] [INFO ] Deduced a trap composed of 118 places in 1640 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:48] [INFO ] Deduced a trap composed of 136 places in 1815 ms of which 212 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:50] [INFO ] Deduced a trap composed of 144 places in 1722 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:51] [INFO ] Deduced a trap composed of 145 places in 1490 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:53] [INFO ] Deduced a trap composed of 134 places in 1298 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:54] [INFO ] Deduced a trap composed of 136 places in 1625 ms of which 215 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:56] [INFO ] Deduced a trap composed of 118 places in 1897 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:58] [INFO ] Deduced a trap composed of 106 places in 1923 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:38:59] [INFO ] Deduced a trap composed of 106 places in 1187 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:01] [INFO ] Deduced a trap composed of 120 places in 1193 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:02] [INFO ] Deduced a trap composed of 127 places in 1211 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:03] [INFO ] Deduced a trap composed of 106 places in 1025 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:04] [INFO ] Deduced a trap composed of 119 places in 1347 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:06] [INFO ] Deduced a trap composed of 106 places in 1132 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:07] [INFO ] Deduced a trap composed of 167 places in 1246 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:08] [INFO ] Deduced a trap composed of 177 places in 1426 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:10] [INFO ] Deduced a trap composed of 550 places in 1493 ms of which 354 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/984 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:11] [INFO ] Deduced a trap composed of 128 places in 1454 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:13] [INFO ] Deduced a trap composed of 128 places in 1295 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:14] [INFO ] Deduced a trap composed of 600 places in 1623 ms of which 452 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:16] [INFO ] Deduced a trap composed of 213 places in 1532 ms of which 281 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:17] [INFO ] Deduced a trap composed of 213 places in 1503 ms of which 278 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:19] [INFO ] Deduced a trap composed of 120 places in 1422 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:20] [INFO ] Deduced a trap composed of 122 places in 1441 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:22] [INFO ] Deduced a trap composed of 120 places in 1454 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:23] [INFO ] Deduced a trap composed of 122 places in 1488 ms of which 179 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:25] [INFO ] Deduced a trap composed of 168 places in 1534 ms of which 232 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:26] [INFO ] Deduced a trap composed of 120 places in 1492 ms of which 176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:28] [INFO ] Deduced a trap composed of 128 places in 1419 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:29] [INFO ] Deduced a trap composed of 127 places in 1349 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:31] [INFO ] Deduced a trap composed of 127 places in 1399 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:32] [INFO ] Deduced a trap composed of 120 places in 1346 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:34] [INFO ] Deduced a trap composed of 143 places in 1485 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:35] [INFO ] Deduced a trap composed of 150 places in 1357 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:37] [INFO ] Deduced a trap composed of 151 places in 1446 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:38] [INFO ] Deduced a trap composed of 545 places in 1358 ms of which 343 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:39] [INFO ] Deduced a trap composed of 127 places in 1205 ms of which 129 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/984 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:41] [INFO ] Deduced a trap composed of 98 places in 1376 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:42] [INFO ] Deduced a trap composed of 106 places in 1208 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:43] [INFO ] Deduced a trap composed of 130 places in 1411 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:45] [INFO ] Deduced a trap composed of 138 places in 1664 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:47] [INFO ] Deduced a trap composed of 143 places in 1651 ms of which 213 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:48] [INFO ] Deduced a trap composed of 151 places in 1352 ms of which 217 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:50] [INFO ] Deduced a trap composed of 98 places in 1423 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:51] [INFO ] Deduced a trap composed of 179 places in 1522 ms of which 268 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:53] [INFO ] Deduced a trap composed of 106 places in 1620 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:39:54] [INFO ] Deduced a trap composed of 187 places in 1549 ms of which 254 ms to minimize.
SMT process timed out in 102623ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 23 out of 1065 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1065/1065 places, 4033/4033 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1065 transition count 4032
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1064 transition count 4032
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1064 transition count 4031
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1063 transition count 4031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1062 transition count 4030
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1062 transition count 4030
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1062 transition count 4030
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1061 transition count 4029
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1061 transition count 4029
Applied a total of 10 rules in 678 ms. Remains 1061 /1065 variables (removed 4) and now considering 4029/4033 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 679 ms. Remains : 1061/1065 places, 4029/4033 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 483 stabilizing places and 1330 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' '!(F((p0&&G(p1))))'
Support contains 4 out of 1315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1315/1315 places, 2963/2963 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 1315 transition count 2934
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1286 transition count 2934
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 58 place count 1286 transition count 2908
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 110 place count 1260 transition count 2908
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 128 place count 1242 transition count 2836
Iterating global reduction 2 with 18 rules applied. Total rules applied 146 place count 1242 transition count 2836
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 146 place count 1242 transition count 2834
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 1240 transition count 2834
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 158 place count 1232 transition count 2778
Iterating global reduction 2 with 8 rules applied. Total rules applied 166 place count 1232 transition count 2778
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 226 place count 1202 transition count 2748
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 236 place count 1192 transition count 2738
Iterating global reduction 2 with 10 rules applied. Total rules applied 246 place count 1192 transition count 2738
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 256 place count 1182 transition count 2668
Iterating global reduction 2 with 10 rules applied. Total rules applied 266 place count 1182 transition count 2668
Applied a total of 266 rules in 1098 ms. Remains 1182 /1315 variables (removed 133) and now considering 2668/2963 (removed 295) transitions.
[2025-06-03 13:39:57] [INFO ] Flow matrix only has 2396 transitions (discarded 272 similar events)
// Phase 1: matrix 2396 rows 1182 cols
[2025-06-03 13:39:57] [INFO ] Computed 70 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:39:59] [INFO ] Implicit Places using invariants in 2741 ms returned [94, 160, 264, 272, 326, 399, 400, 493, 494, 514, 528, 529, 556, 579, 580, 626, 655, 678, 732, 884, 991, 992]
[2025-06-03 13:39:59] [INFO ] Actually due to overlaps returned [264, 732, 94, 160, 272, 326, 399, 400, 493, 494, 514, 528, 529, 556, 579, 580, 626, 655, 884, 991]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 2747 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1162/1315 places, 2668/2963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1151 transition count 2657
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1151 transition count 2657
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1140 transition count 2646
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1140 transition count 2646
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1133 transition count 2597
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1133 transition count 2597
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 1126 transition count 2590
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 1119 transition count 2583
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 1119 transition count 2583
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 1112 transition count 2534
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 1112 transition count 2534
Applied a total of 100 rules in 883 ms. Remains 1112 /1162 variables (removed 50) and now considering 2534/2668 (removed 134) transitions.
[2025-06-03 13:40:00] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1112 cols
[2025-06-03 13:40:00] [INFO ] Computed 50 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:40:03] [INFO ] Implicit Places using invariants in 2539 ms returned [634, 941]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2542 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1110/1315 places, 2534/2963 transitions.
Applied a total of 0 rules in 114 ms. Remains 1110 /1110 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7385 ms. Remains : 1110/1315 places, 2534/2963 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00
Product exploration explored 100000 steps with 1954 reset in 1137 ms.
Product exploration explored 100000 steps with 1957 reset in 914 ms.
Computed a total of 295 stabilizing places and 918 stable transitions
Computed a total of 295 stabilizing places and 918 stable transitions
Detected a total of 295/1110 stabilizing places and 918/2534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 286 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 98 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (782 resets) in 508 ms. (78 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (164 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
[2025-06-03 13:40:06] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1110 cols
[2025-06-03 13:40:06] [INFO ] Computed 48 invariants in 40 ms
[2025-06-03 13:40:06] [INFO ] State equation strengthened by 848 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) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 976/1051 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1051 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/1096 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1096 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/1110 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1110 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2262/3372 variables, 1110/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3372 variables, 848/2006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3372 variables, 0/2006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3372 variables, 0/2006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3372/3372 variables, and 2006 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1110/1110 constraints, ReadFeed: 848/848 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 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) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 976/1051 variables, 3/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 13:40:09] [INFO ] Deduced a trap composed of 58 places in 1100 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:11] [INFO ] Deduced a trap composed of 59 places in 1056 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:11] [INFO ] Deduced a trap composed of 59 places in 861 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:12] [INFO ] Deduced a trap composed of 59 places in 870 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:40:13] [INFO ] Deduced a trap composed of 59 places in 1085 ms of which 95 ms to minimize.
SMT process timed out in 7416ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1110/1110 places, 2534/2534 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1109 transition count 2533
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1109 transition count 2533
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1108 transition count 2526
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1108 transition count 2526
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 137 place count 1108 transition count 4001
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 270 place count 975 transition count 4001
Applied a total of 270 rules in 691 ms. Remains 975 /1110 variables (removed 135) and now considering 4001/2534 (removed -1467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 692 ms. Remains : 975/1110 places, 4001/2534 transitions.
RANDOM walk for 35398 steps (852 resets) in 1145 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 539 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 97 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 1110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1110/1110 places, 2534/2534 transitions.
Applied a total of 0 rules in 109 ms. Remains 1110 /1110 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
[2025-06-03 13:40:15] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2025-06-03 13:40:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:40:18] [INFO ] Implicit Places using invariants in 2722 ms returned []
[2025-06-03 13:40:18] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2025-06-03 13:40:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:40:20] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 13:40:47] [INFO ] Implicit Places using invariants and state equation in 28602 ms returned [1101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31333 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1109/1110 places, 2534/2534 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 2533
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 2533
Applied a total of 2 rules in 127 ms. Remains 1108 /1109 variables (removed 1) and now considering 2533/2534 (removed 1) transitions.
[2025-06-03 13:40:47] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1108 cols
[2025-06-03 13:40:47] [INFO ] Computed 47 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:40:49] [INFO ] Implicit Places using invariants in 2017 ms returned []
[2025-06-03 13:40:49] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 13:40:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:40:50] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 13:41:17] [INFO ] Implicit Places using invariants and state equation in 28335 ms returned []
Implicit Place search using SMT with State Equation took 30356 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1110 places, 2533/2534 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61928 ms. Remains : 1108/1110 places, 2533/2534 transitions.
Computed a total of 293 stabilizing places and 917 stable transitions
Computed a total of 293 stabilizing places and 917 stable transitions
Detected a total of 293/1108 stabilizing places and 917/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 225 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 81 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 32347 steps (630 resets) in 300 ms. (107 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (OR (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 11 factoid took 435 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 :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1956 reset in 639 ms.
Product exploration explored 100000 steps with 1955 reset in 672 ms.
Built C files in :
/tmp/ltsmin11815525355926839018
[2025-06-03 13:41:20] [INFO ] Too many transitions (2533) to apply POR reductions. Disabling POR matrices.
[2025-06-03 13:41:20] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11815525355926839018
Running compilation step : cd /tmp/ltsmin11815525355926839018;'/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/ltsmin11815525355926839018;'/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/ltsmin11815525355926839018;'/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 1108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1108/1108 places, 2533/2533 transitions.
Applied a total of 0 rules in 112 ms. Remains 1108 /1108 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
[2025-06-03 13:41:23] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 13:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:41:25] [INFO ] Implicit Places using invariants in 1989 ms returned []
[2025-06-03 13:41:25] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 13:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:41:26] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 13:41:53] [INFO ] Implicit Places using invariants and state equation in 28578 ms returned []
Implicit Place search using SMT with State Equation took 30581 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:41:54] [INFO ] Redundant transitions in 173 ms returned []
Running 2516 sub problems to find dead transitions.
[2025-06-03 13:41:54] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 13:41:54] [INFO ] Invariant cache hit.
[2025-06-03 13:41:54] [INFO ] State equation strengthened by 848 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/1106 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2516 unsolved
SMT process timed out in 32312ms, After SMT, problems are : Problem set: 0 solved, 2516 unsolved
Search for dead transitions found 0 dead transitions in 32354ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63254 ms. Remains : 1108/1108 places, 2533/2533 transitions.
Built C files in :
/tmp/ltsmin815275101894289673
[2025-06-03 13:42:26] [INFO ] Too many transitions (2533) to apply POR reductions. Disabling POR matrices.
[2025-06-03 13:42:26] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin815275101894289673
Running compilation step : cd /tmp/ltsmin815275101894289673;'/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/ltsmin815275101894289673;'/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/ltsmin815275101894289673;'/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 13:42:29] [INFO ] Flatten gal took : 107 ms
[2025-06-03 13:42:30] [INFO ] Flatten gal took : 96 ms
[2025-06-03 13:42:30] [INFO ] Time to serialize gal into /tmp/LTL2664859872244426349.gal : 41 ms
[2025-06-03 13:42:30] [INFO ] Time to serialize properties into /tmp/LTL17645058957058031495.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/LTL2664859872244426349.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8971638274199760892.hoa' '-atoms' '/tmp/LTL17645058957058031495.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/LTL17645058957058031495.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8971638274199760892.hoa
Detected timeout of ITS tools.
[2025-06-03 13:42:45] [INFO ] Flatten gal took : 82 ms
[2025-06-03 13:42:45] [INFO ] Flatten gal took : 86 ms
[2025-06-03 13:42:45] [INFO ] Time to serialize gal into /tmp/LTL16979180662053898571.gal : 24 ms
[2025-06-03 13:42:45] [INFO ] Time to serialize properties into /tmp/LTL8758551378982742756.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/LTL16979180662053898571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8758551378982742756.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("((Node9HasAskedItsLeafSetToLx4ToReplaceNode4<1)||(LeafSetOfLx4IsSentToNode9<1))"))&&("((RequestOfNode5IsSentToLx3<1)||(Lx3IsA...187
Formula 0 simplified : G(!"((RequestOfNode5IsSentToLx3<1)||(Lx3IsActiveAndNotInTheLeafSet<1))" | F!"((Node9HasAskedItsLeafSetToLx4ToReplaceNode4<1)||(LeafS...181
Detected timeout of ITS tools.
[2025-06-03 13:43:00] [INFO ] Flatten gal took : 70 ms
[2025-06-03 13:43:00] [INFO ] Applying decomposition
[2025-06-03 13:43:00] [INFO ] Flatten gal took : 124 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/graph9426750514302001445.txt' '-o' '/tmp/graph9426750514302001445.bin' '-w' '/tmp/graph9426750514302001445.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9426750514302001445.bin' '-l' '-1' '-v' '-w' '/tmp/graph9426750514302001445.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:43:01] [INFO ] Decomposing Gal with order
[2025-06-03 13:43:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:43:01] [INFO ] Removed a total of 2279 redundant transitions.
[2025-06-03 13:43:02] [INFO ] Flatten gal took : 749 ms
[2025-06-03 13:43:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1506 labels/synchronizations in 190 ms.
[2025-06-03 13:43:02] [INFO ] Time to serialize gal into /tmp/LTL13088559547537535673.gal : 42 ms
[2025-06-03 13:43:02] [INFO ] Time to serialize properties into /tmp/LTL3573379760824016029.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/LTL13088559547537535673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3573379760824016029.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("((i14.i2.u156.Node9HasAskedItsLeafSetToLx4ToReplaceNode4<1)||(i14.i2.u156.LeafSetOfLx4IsSentToNode9<1))"))&&("((i14.i1.u154.R...235
Formula 0 simplified : G(!"((i14.i1.u154.RequestOfNode5IsSentToLx3<1)||(i14.i1.u154.Lx3IsActiveAndNotInTheLeafSet<1))" | F!"((i14.i2.u156.Node9HasAskedItsL...229
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-00 finished in 201431 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 X((X(X(p2))||G(!p1))))))'
Support contains 5 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 2963/2963 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1287 transition count 2887
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1287 transition count 2887
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 75 place count 1268 transition count 2808
Iterating global reduction 0 with 19 rules applied. Total rules applied 94 place count 1268 transition count 2808
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 1259 transition count 2745
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 1259 transition count 2745
Applied a total of 112 rules in 326 ms. Remains 1259 /1315 variables (removed 56) and now considering 2745/2963 (removed 218) transitions.
[2025-06-03 13:43:17] [INFO ] Flow matrix only has 2473 transitions (discarded 272 similar events)
// Phase 1: matrix 2473 rows 1259 cols
[2025-06-03 13:43:17] [INFO ] Computed 70 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:43:20] [INFO ] Implicit Places using invariants in 3077 ms returned [102, 189, 296, 305, 359, 435, 436, 532, 533, 555, 569, 570, 601, 627, 651, 678, 709, 732, 788, 943, 1052, 1053]
[2025-06-03 13:43:20] [INFO ] Actually due to overlaps returned [296, 788, 102, 189, 305, 359, 435, 436, 532, 533, 555, 569, 570, 601, 627, 651, 678, 709, 943, 1052]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 3082 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1239/1315 places, 2745/2963 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1221 transition count 2727
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1221 transition count 2727
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1203 transition count 2709
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1203 transition count 2709
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1185 transition count 2691
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1185 transition count 2691
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 122 place count 1171 transition count 2593
Iterating global reduction 0 with 14 rules applied. Total rules applied 136 place count 1171 transition count 2593
Applied a total of 136 rules in 400 ms. Remains 1171 /1239 variables (removed 68) and now considering 2593/2745 (removed 152) transitions.
[2025-06-03 13:43:21] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1171 cols
[2025-06-03 13:43:21] [INFO ] Computed 50 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:43:23] [INFO ] Implicit Places using invariants in 1860 ms returned [673, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1863 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1169/1315 places, 2593/2963 transitions.
Applied a total of 0 rules in 70 ms. Remains 1169 /1169 variables (removed 0) and now considering 2593/2593 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5742 ms. Remains : 1169/1315 places, 2593/2963 transitions.
Stuttering acceptance computed with spot in 837 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), false, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p2) p1), (NOT p2), false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), p1, false]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01
Product exploration explored 100000 steps with 1378 reset in 755 ms.
Product exploration explored 100000 steps with 1375 reset in 642 ms.
Computed a total of 337 stabilizing places and 960 stable transitions
Computed a total of 337 stabilizing places and 960 stable transitions
Detected a total of 337/1169 stabilizing places and 960/2593 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 (OR p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 411 ms. Reduced automaton from 22 states, 46 edges and 3 AP (stutter sensitive) to 22 states, 46 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 806 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), false, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p2) p1), (NOT p2), false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), p1, false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (548 resets) in 394 ms. (101 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (152 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (152 resets) in 449 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (152 resets) in 221 ms. (180 steps per ms) remains 2/4 properties
[2025-06-03 13:43:27] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2025-06-03 13:43:27] [INFO ] Computed 48 invariants in 29 ms
[2025-06-03 13:43:27] [INFO ] State equation strengthened by 848 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) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1078 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 53/1131 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/1159 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1159 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/1169 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1169 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2321/3490 variables, 1169/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3490 variables, 848/2065 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3490 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3490 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3490/3490 variables, and 2065 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1788 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 1169/1169 constraints, ReadFeed: 848/848 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) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1078 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/1131 variables, 7/10 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 13:43:30] [INFO ] Deduced a trap composed of 68 places in 1159 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:31] [INFO ] Deduced a trap composed of 70 places in 1154 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:32] [INFO ] Deduced a trap composed of 70 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 13:43:34] [INFO ] Deduced a trap composed of 70 places in 1178 ms of which 145 ms to minimize.
SMT process timed out in 6961ms, 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 1169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1169/1169 places, 2593/2593 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 1169 transition count 2565
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1141 transition count 2565
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 56 place count 1141 transition count 2551
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 1127 transition count 2551
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 120 place count 1109 transition count 2533
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 1108 transition count 2532
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 1108 transition count 2532
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 1107 transition count 2525
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 1107 transition count 2525
Free-agglomeration rule (complex) applied 117 times.
Iterating global reduction 2 with 117 rules applied. Total rules applied 241 place count 1107 transition count 3974
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 2 with 117 rules applied. Total rules applied 358 place count 990 transition count 3974
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 990 transition count 3974
Applied a total of 359 rules in 741 ms. Remains 990 /1169 variables (removed 179) and now considering 3974/2593 (removed -1381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 990/1169 places, 3974/2593 transitions.
RANDOM walk for 40000 steps (945 resets) in 1254 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (130 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (130 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 49350 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 49350 steps, saw 20909 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 13:43:38] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
// Phase 1: matrix 3590 rows 990 cols
[2025-06-03 13:43:38] [INFO ] Computed 48 invariants in 30 ms
[2025-06-03 13:43:38] [INFO ] State equation strengthened by 2408 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) 912/916 variables, 3/3 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 13:43:39] [INFO ] Deduced a trap composed of 129 places in 1179 ms of which 116 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/952 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/952 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/980 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/990 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/990 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3590/4580 variables, 990/1039 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4580 variables, 2408/3447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4580 variables, 0/3447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4580 variables, 0/3447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4580/4580 variables, and 3447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3706 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 990/990 constraints, ReadFeed: 2408/2408 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 912/916 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 1/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 13:43:43] [INFO ] Deduced a trap composed of 81 places in 1243 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:44] [INFO ] Deduced a trap composed of 111 places in 1328 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:46] [INFO ] Deduced a trap composed of 151 places in 1316 ms of which 190 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/916 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/952 variables, 7/14 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 13:43:47] [INFO ] Deduced a trap composed of 52 places in 1351 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:49] [INFO ] Deduced a trap composed of 54 places in 1368 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:50] [INFO ] Deduced a trap composed of 54 places in 1262 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:51] [INFO ] Deduced a trap composed of 54 places in 1346 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:53] [INFO ] Deduced a trap composed of 55 places in 1262 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:54] [INFO ] Deduced a trap composed of 55 places in 1295 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:55] [INFO ] Deduced a trap composed of 55 places in 1307 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:57] [INFO ] Deduced a trap composed of 55 places in 1259 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:58] [INFO ] Deduced a trap composed of 55 places in 1318 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:43:59] [INFO ] Deduced a trap composed of 55 places in 1280 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:01] [INFO ] Deduced a trap composed of 55 places in 1344 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:02] [INFO ] Deduced a trap composed of 55 places in 1305 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:03] [INFO ] Deduced a trap composed of 55 places in 1271 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:04] [INFO ] Deduced a trap composed of 54 places in 1285 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:06] [INFO ] Deduced a trap composed of 55 places in 1291 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:07] [INFO ] Deduced a trap composed of 96 places in 1006 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:08] [INFO ] Deduced a trap composed of 54 places in 1245 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:09] [INFO ] Deduced a trap composed of 55 places in 1241 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:11] [INFO ] Deduced a trap composed of 55 places in 1237 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:12] [INFO ] Deduced a trap composed of 100 places in 1045 ms of which 107 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 20/34 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 13:44:13] [INFO ] Deduced a trap composed of 55 places in 1166 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:14] [INFO ] Deduced a trap composed of 54 places in 1272 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:15] [INFO ] Deduced a trap composed of 54 places in 1236 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:17] [INFO ] Deduced a trap composed of 52 places in 1289 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:18] [INFO ] Deduced a trap composed of 52 places in 1255 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:19] [INFO ] Deduced a trap composed of 53 places in 1243 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:21] [INFO ] Deduced a trap composed of 53 places in 1248 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:22] [INFO ] Deduced a trap composed of 53 places in 1187 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:23] [INFO ] Deduced a trap composed of 53 places in 1324 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:24] [INFO ] Deduced a trap composed of 53 places in 1344 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:26] [INFO ] Deduced a trap composed of 53 places in 1205 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:27] [INFO ] Deduced a trap composed of 53 places in 1264 ms of which 99 ms to minimize.
SMT process timed out in 49086ms, 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 990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 3974/3974 transitions.
Applied a total of 0 rules in 166 ms. Remains 990 /990 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 990/990 places, 3974/3974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 3974/3974 transitions.
Applied a total of 0 rules in 158 ms. Remains 990 /990 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
[2025-06-03 13:44:27] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
[2025-06-03 13:44:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:44:30] [INFO ] Implicit Places using invariants in 2241 ms returned [484]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2262 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 989/990 places, 3974/3974 transitions.
Applied a total of 0 rules in 157 ms. Remains 989 /989 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2578 ms. Remains : 989/990 places, 3974/3974 transitions.
RANDOM walk for 40000 steps (944 resets) in 1266 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (128 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 49721 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 49721 steps, saw 21063 distinct states, run finished after 3006 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 13:44:33] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
// Phase 1: matrix 3590 rows 989 cols
[2025-06-03 13:44:33] [INFO ] Computed 47 invariants in 33 ms
[2025-06-03 13:44:33] [INFO ] State equation strengthened by 2408 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) 912/916 variables, 3/3 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 13:44:35] [INFO ] Deduced a trap composed of 81 places in 1268 ms of which 115 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 35/951 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/979 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/989 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/989 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3590/4579 variables, 989/1037 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4579 variables, 2408/3445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4579 variables, 0/3445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4579 variables, 0/3445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4579/4579 variables, and 3445 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3988 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 989/989 constraints, ReadFeed: 2408/2408 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 912/916 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 1/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 13:44:39] [INFO ] Deduced a trap composed of 79 places in 1251 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:40] [INFO ] Deduced a trap composed of 151 places in 1238 ms of which 187 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/916 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/951 variables, 6/12 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 13:44:41] [INFO ] Deduced a trap composed of 90 places in 1104 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:42] [INFO ] Deduced a trap composed of 103 places in 1060 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:44] [INFO ] Deduced a trap composed of 115 places in 1149 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:45] [INFO ] Deduced a trap composed of 103 places in 1177 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:46] [INFO ] Deduced a trap composed of 103 places in 1050 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:47] [INFO ] Deduced a trap composed of 103 places in 1113 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:48] [INFO ] Deduced a trap composed of 103 places in 1073 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:49] [INFO ] Deduced a trap composed of 103 places in 1093 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:50] [INFO ] Deduced a trap composed of 103 places in 1038 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:51] [INFO ] Deduced a trap composed of 103 places in 1161 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:53] [INFO ] Deduced a trap composed of 109 places in 1107 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:54] [INFO ] Deduced a trap composed of 103 places in 1066 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:55] [INFO ] Deduced a trap composed of 121 places in 1091 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:56] [INFO ] Deduced a trap composed of 103 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 13:44:57] [INFO ] Deduced a trap composed of 92 places in 1112 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:58] [INFO ] Deduced a trap composed of 92 places in 1113 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:44:59] [INFO ] Deduced a trap composed of 95 places in 1091 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:00] [INFO ] Deduced a trap composed of 91 places in 975 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:01] [INFO ] Deduced a trap composed of 91 places in 1100 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:02] [INFO ] Deduced a trap composed of 91 places in 1077 ms of which 120 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 20/32 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 13:45:04] [INFO ] Deduced a trap composed of 91 places in 1098 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:05] [INFO ] Deduced a trap composed of 91 places in 1116 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:06] [INFO ] Deduced a trap composed of 91 places in 1086 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:07] [INFO ] Deduced a trap composed of 91 places in 1108 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:08] [INFO ] Deduced a trap composed of 91 places in 1086 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:09] [INFO ] Deduced a trap composed of 91 places in 1158 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:10] [INFO ] Deduced a trap composed of 91 places in 1112 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:12] [INFO ] Deduced a trap composed of 91 places in 1086 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:13] [INFO ] Deduced a trap composed of 91 places in 1081 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:14] [INFO ] Deduced a trap composed of 58 places in 1302 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:15] [INFO ] Deduced a trap composed of 57 places in 1281 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:17] [INFO ] Deduced a trap composed of 58 places in 1302 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:18] [INFO ] Deduced a trap composed of 104 places in 1112 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:19] [INFO ] Deduced a trap composed of 58 places in 1356 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:21] [INFO ] Deduced a trap composed of 54 places in 1348 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:22] [INFO ] Deduced a trap composed of 104 places in 1138 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:23] [INFO ] Deduced a trap composed of 58 places in 1333 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:24] [INFO ] Deduced a trap composed of 54 places in 1294 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:25] [INFO ] Deduced a trap composed of 104 places in 1078 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:27] [INFO ] Deduced a trap composed of 124 places in 1094 ms of which 105 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 20/52 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 13:45:28] [INFO ] Deduced a trap composed of 58 places in 1316 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:29] [INFO ] Deduced a trap composed of 58 places in 1345 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:31] [INFO ] Deduced a trap composed of 59 places in 1236 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:32] [INFO ] Deduced a trap composed of 58 places in 1237 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:33] [INFO ] Deduced a trap composed of 58 places in 1347 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:34] [INFO ] Deduced a trap composed of 58 places in 1267 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:36] [INFO ] Deduced a trap composed of 59 places in 1296 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:37] [INFO ] Deduced a trap composed of 58 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 13:45:38] [INFO ] Deduced a trap composed of 58 places in 1308 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:40] [INFO ] Deduced a trap composed of 58 places in 1297 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:41] [INFO ] Deduced a trap composed of 55 places in 1317 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:42] [INFO ] Deduced a trap composed of 56 places in 1286 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:44] [INFO ] Deduced a trap composed of 53 places in 1290 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:45] [INFO ] Deduced a trap composed of 53 places in 1310 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:46] [INFO ] Deduced a trap composed of 56 places in 1215 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:48] [INFO ] Deduced a trap composed of 56 places in 1271 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:49] [INFO ] Deduced a trap composed of 56 places in 1273 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:50] [INFO ] Deduced a trap composed of 56 places in 1255 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:52] [INFO ] Deduced a trap composed of 55 places in 1316 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:45:53] [INFO ] Deduced a trap composed of 56 places in 1298 ms of which 82 ms to minimize.
SMT process timed out in 79725ms, 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 989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 3974/3974 transitions.
Applied a total of 0 rules in 139 ms. Remains 989 /989 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 989/989 places, 3974/3974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 3974/3974 transitions.
Applied a total of 0 rules in 137 ms. Remains 989 /989 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
[2025-06-03 13:45:53] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
[2025-06-03 13:45:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:45:55] [INFO ] Implicit Places using invariants in 2180 ms returned []
[2025-06-03 13:45:55] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
[2025-06-03 13:45:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:45:57] [INFO ] State equation strengthened by 2408 read => feed constraints.
[2025-06-03 13:46:27] [INFO ] Performed 389/989 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:46:57] [INFO ] Performed 605/989 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 13:47:27] [INFO ] Performed 934/989 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 13:47:41] [INFO ] Implicit Places using invariants and state equation in 105878 ms returned []
Implicit Place search using SMT with State Equation took 108068 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:47:42] [INFO ] Redundant transitions in 655 ms returned []
Running 3912 sub problems to find dead transitions.
[2025-06-03 13:47:42] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
[2025-06-03 13:47:42] [INFO ] Invariant cache hit.
[2025-06-03 13:47:42] [INFO ] State equation strengthened by 2408 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/987 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3912 unsolved
SMT process timed out in 36649ms, After SMT, problems are : Problem set: 0 solved, 3912 unsolved
Search for dead transitions found 0 dead transitions in 36668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145588 ms. Remains : 989/989 places, 3974/3974 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1 p2)))]
Knowledge based reduction with 13 factoid took 1303 ms. Reduced automaton from 22 states, 46 edges and 3 AP (stutter sensitive) to 22 states, 46 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 791 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), false, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p2) p1), (NOT p2), false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), p1, false]
Stuttering acceptance computed with spot in 781 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), false, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p2) p1), (NOT p2), false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), p1, false]
Support contains 5 out of 1169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1169/1169 places, 2593/2593 transitions.
Applied a total of 0 rules in 66 ms. Remains 1169 /1169 variables (removed 0) and now considering 2593/2593 (removed 0) transitions.
[2025-06-03 13:48:22] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2025-06-03 13:48:22] [INFO ] Computed 48 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:48:24] [INFO ] Implicit Places using invariants in 1905 ms returned []
[2025-06-03 13:48:24] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
[2025-06-03 13:48:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:48:25] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 13:48:55] [INFO ] Performed 855/1169 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:49:02] [INFO ] Implicit Places using invariants and state equation in 38589 ms returned []
Implicit Place search using SMT with State Equation took 40500 ms to find 0 implicit places.
Running 2576 sub problems to find dead transitions.
[2025-06-03 13:49:02] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
[2025-06-03 13:49:02] [INFO ] Invariant cache hit.
[2025-06-03 13:49:02] [INFO ] State equation strengthened by 848 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1167 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2576 unsolved
SMT process timed out in 31667ms, After SMT, problems are : Problem set: 0 solved, 2576 unsolved
Search for dead transitions found 0 dead transitions in 31680ms
Finished structural reductions in LTL mode , in 1 iterations and 72254 ms. Remains : 1169/1169 places, 2593/2593 transitions.
Computed a total of 337 stabilizing places and 960 stable transitions
Computed a total of 337 stabilizing places and 960 stable transitions
Detected a total of 337/1169 stabilizing places and 960/2593 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 412 ms. Reduced automaton from 22 states, 46 edges and 3 AP (stutter sensitive) to 22 states, 46 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 809 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), false, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p2) p1), (NOT p2), false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), p1, false]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (551 resets) in 402 ms. (99 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (152 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
[2025-06-03 13:49:35] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
[2025-06-03 13:49:35] [INFO ] Invariant cache hit.
[2025-06-03 13:49:35] [INFO ] State equation strengthened by 848 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) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1078 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/1131 variables, 7/10 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 13:49:37] [INFO ] Deduced a trap composed of 66 places in 1135 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:38] [INFO ] Deduced a trap composed of 66 places in 1152 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:39] [INFO ] Deduced a trap composed of 67 places in 1158 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:40] [INFO ] Deduced a trap composed of 67 places in 1116 ms of which 129 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1131/3490 variables, and 14 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 3/31 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/1169 constraints, ReadFeed: 0/848 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 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) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1078 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/1131 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1131 variables, 4/14 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 13:49:42] [INFO ] Deduced a trap composed of 68 places in 1190 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:43] [INFO ] Deduced a trap composed of 68 places in 1191 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:44] [INFO ] Deduced a trap composed of 68 places in 1150 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:45] [INFO ] Deduced a trap composed of 68 places in 1115 ms of which 134 ms to minimize.
SMT process timed out in 10033ms, 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 1169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1169/1169 places, 2593/2593 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 1169 transition count 2565
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1141 transition count 2565
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 56 place count 1141 transition count 2551
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 1127 transition count 2551
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 120 place count 1109 transition count 2533
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 1108 transition count 2532
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 1108 transition count 2532
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 1107 transition count 2525
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 1107 transition count 2525
Free-agglomeration rule (complex) applied 117 times.
Iterating global reduction 2 with 117 rules applied. Total rules applied 241 place count 1107 transition count 3974
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 2 with 117 rules applied. Total rules applied 358 place count 990 transition count 3974
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 990 transition count 3974
Applied a total of 359 rules in 685 ms. Remains 990 /1169 variables (removed 179) and now considering 3974/2593 (removed -1381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 990/1169 places, 3974/2593 transitions.
RANDOM walk for 40000 steps (946 resets) in 1177 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (128 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (128 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 49517 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 49517 steps, saw 20979 distinct states, run finished after 3002 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 13:49:49] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
// Phase 1: matrix 3590 rows 990 cols
[2025-06-03 13:49:50] [INFO ] Computed 48 invariants in 27 ms
[2025-06-03 13:49:50] [INFO ] State equation strengthened by 2408 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) 912/916 variables, 3/3 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 13:49:51] [INFO ] Deduced a trap composed of 129 places in 1249 ms of which 126 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/952 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/952 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/980 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/990 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/990 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3590/4580 variables, 990/1039 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4580 variables, 2408/3447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4580 variables, 0/3447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4580 variables, 0/3447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4580/4580 variables, and 3447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3839 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 990/990 constraints, ReadFeed: 2408/2408 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 912/916 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 1/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 13:49:55] [INFO ] Deduced a trap composed of 81 places in 1218 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:56] [INFO ] Deduced a trap composed of 111 places in 1189 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:49:57] [INFO ] Deduced a trap composed of 151 places in 1224 ms of which 181 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/916 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/952 variables, 7/14 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 13:49:59] [INFO ] Deduced a trap composed of 52 places in 1312 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:00] [INFO ] Deduced a trap composed of 54 places in 1255 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:01] [INFO ] Deduced a trap composed of 54 places in 1184 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:02] [INFO ] Deduced a trap composed of 54 places in 1228 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:04] [INFO ] Deduced a trap composed of 55 places in 1256 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:05] [INFO ] Deduced a trap composed of 55 places in 1333 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:06] [INFO ] Deduced a trap composed of 55 places in 1309 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:08] [INFO ] Deduced a trap composed of 55 places in 1263 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:09] [INFO ] Deduced a trap composed of 55 places in 1315 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:10] [INFO ] Deduced a trap composed of 55 places in 1272 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:12] [INFO ] Deduced a trap composed of 55 places in 1266 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:13] [INFO ] Deduced a trap composed of 55 places in 1301 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:14] [INFO ] Deduced a trap composed of 55 places in 1217 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:15] [INFO ] Deduced a trap composed of 54 places in 1156 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:17] [INFO ] Deduced a trap composed of 55 places in 1284 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:18] [INFO ] Deduced a trap composed of 96 places in 1123 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:19] [INFO ] Deduced a trap composed of 54 places in 1172 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:20] [INFO ] Deduced a trap composed of 55 places in 1157 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:21] [INFO ] Deduced a trap composed of 55 places in 1108 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:22] [INFO ] Deduced a trap composed of 100 places in 951 ms of which 103 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 20/34 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 13:50:23] [INFO ] Deduced a trap composed of 55 places in 1202 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:25] [INFO ] Deduced a trap composed of 54 places in 1278 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:26] [INFO ] Deduced a trap composed of 54 places in 1233 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:27] [INFO ] Deduced a trap composed of 52 places in 1339 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:29] [INFO ] Deduced a trap composed of 52 places in 1319 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:30] [INFO ] Deduced a trap composed of 53 places in 1256 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:31] [INFO ] Deduced a trap composed of 53 places in 1331 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:33] [INFO ] Deduced a trap composed of 53 places in 1298 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:34] [INFO ] Deduced a trap composed of 53 places in 1319 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:35] [INFO ] Deduced a trap composed of 53 places in 1266 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:37] [INFO ] Deduced a trap composed of 53 places in 1252 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:38] [INFO ] Deduced a trap composed of 53 places in 1233 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:39] [INFO ] Deduced a trap composed of 53 places in 1229 ms of which 98 ms to minimize.
SMT process timed out in 49635ms, 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 990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 3974/3974 transitions.
Applied a total of 0 rules in 138 ms. Remains 990 /990 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 990/990 places, 3974/3974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 3974/3974 transitions.
Applied a total of 0 rules in 138 ms. Remains 990 /990 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
[2025-06-03 13:50:39] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
[2025-06-03 13:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:50:42] [INFO ] Implicit Places using invariants in 2265 ms returned [484]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2268 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 989/990 places, 3974/3974 transitions.
Applied a total of 0 rules in 137 ms. Remains 989 /989 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2543 ms. Remains : 989/990 places, 3974/3974 transitions.
RANDOM walk for 40000 steps (945 resets) in 1049 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (127 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (130 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 50846 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 50846 steps, saw 21528 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 13:50:45] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
// Phase 1: matrix 3590 rows 989 cols
[2025-06-03 13:50:45] [INFO ] Computed 47 invariants in 28 ms
[2025-06-03 13:50:45] [INFO ] State equation strengthened by 2408 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) 912/916 variables, 3/3 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 13:50:47] [INFO ] Deduced a trap composed of 81 places in 1227 ms of which 115 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 35/951 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/979 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/989 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/989 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3590/4579 variables, 989/1037 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4579 variables, 2408/3445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4579 variables, 0/3445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4579 variables, 0/3445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4579/4579 variables, and 3445 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3875 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 989/989 constraints, ReadFeed: 2408/2408 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 912/916 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/916 variables, 1/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 13:50:50] [INFO ] Deduced a trap composed of 79 places in 1187 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:52] [INFO ] Deduced a trap composed of 151 places in 1259 ms of which 185 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/916 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/916 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/951 variables, 6/12 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 13:50:53] [INFO ] Deduced a trap composed of 90 places in 1068 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:54] [INFO ] Deduced a trap composed of 103 places in 1031 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:55] [INFO ] Deduced a trap composed of 115 places in 1056 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:56] [INFO ] Deduced a trap composed of 103 places in 1147 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:57] [INFO ] Deduced a trap composed of 103 places in 1023 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:58] [INFO ] Deduced a trap composed of 103 places in 1077 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:50:59] [INFO ] Deduced a trap composed of 103 places in 1031 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:01] [INFO ] Deduced a trap composed of 103 places in 1101 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:02] [INFO ] Deduced a trap composed of 103 places in 1067 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:03] [INFO ] Deduced a trap composed of 103 places in 1116 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:04] [INFO ] Deduced a trap composed of 109 places in 1025 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:05] [INFO ] Deduced a trap composed of 103 places in 1076 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:06] [INFO ] Deduced a trap composed of 121 places in 950 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:07] [INFO ] Deduced a trap composed of 103 places in 979 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:08] [INFO ] Deduced a trap composed of 92 places in 983 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:09] [INFO ] Deduced a trap composed of 92 places in 1061 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:10] [INFO ] Deduced a trap composed of 95 places in 1041 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:11] [INFO ] Deduced a trap composed of 91 places in 1071 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:12] [INFO ] Deduced a trap composed of 91 places in 1064 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:13] [INFO ] Deduced a trap composed of 91 places in 953 ms of which 119 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 20/32 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 13:51:14] [INFO ] Deduced a trap composed of 91 places in 1042 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:15] [INFO ] Deduced a trap composed of 91 places in 1078 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:17] [INFO ] Deduced a trap composed of 91 places in 1061 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:18] [INFO ] Deduced a trap composed of 91 places in 1106 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:19] [INFO ] Deduced a trap composed of 91 places in 1110 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:20] [INFO ] Deduced a trap composed of 91 places in 1072 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:21] [INFO ] Deduced a trap composed of 91 places in 1072 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:22] [INFO ] Deduced a trap composed of 91 places in 1065 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:23] [INFO ] Deduced a trap composed of 91 places in 1063 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:25] [INFO ] Deduced a trap composed of 58 places in 1260 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:26] [INFO ] Deduced a trap composed of 57 places in 1299 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:27] [INFO ] Deduced a trap composed of 58 places in 1228 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:28] [INFO ] Deduced a trap composed of 104 places in 1092 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:30] [INFO ] Deduced a trap composed of 58 places in 1277 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:31] [INFO ] Deduced a trap composed of 54 places in 1324 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:32] [INFO ] Deduced a trap composed of 104 places in 1115 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:33] [INFO ] Deduced a trap composed of 58 places in 1290 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:35] [INFO ] Deduced a trap composed of 54 places in 1314 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:36] [INFO ] Deduced a trap composed of 104 places in 1119 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:37] [INFO ] Deduced a trap composed of 124 places in 1011 ms of which 106 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 20/52 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 13:51:38] [INFO ] Deduced a trap composed of 58 places in 1299 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:40] [INFO ] Deduced a trap composed of 58 places in 1357 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:41] [INFO ] Deduced a trap composed of 59 places in 1301 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:42] [INFO ] Deduced a trap composed of 58 places in 1303 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:43] [INFO ] Deduced a trap composed of 58 places in 1252 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:45] [INFO ] Deduced a trap composed of 58 places in 1263 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:46] [INFO ] Deduced a trap composed of 59 places in 1253 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:47] [INFO ] Deduced a trap composed of 58 places in 1285 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:49] [INFO ] Deduced a trap composed of 58 places in 1322 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:50] [INFO ] Deduced a trap composed of 58 places in 1305 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:51] [INFO ] Deduced a trap composed of 55 places in 1274 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:53] [INFO ] Deduced a trap composed of 56 places in 1293 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:54] [INFO ] Deduced a trap composed of 53 places in 1234 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:55] [INFO ] Deduced a trap composed of 53 places in 1318 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:57] [INFO ] Deduced a trap composed of 56 places in 1276 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:58] [INFO ] Deduced a trap composed of 56 places in 1268 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:51:59] [INFO ] Deduced a trap composed of 56 places in 1270 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:52:00] [INFO ] Deduced a trap composed of 56 places in 1225 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:52:02] [INFO ] Deduced a trap composed of 55 places in 1295 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 13:52:03] [INFO ] Deduced a trap composed of 56 places in 1277 ms of which 80 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/951 variables, 20/72 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 13:52:04] [INFO ] Deduced a trap composed of 56 places in 1282 ms of which 45 ms to minimize.
SMT process timed out in 79197ms, 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 989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 3974/3974 transitions.
Applied a total of 0 rules in 145 ms. Remains 989 /989 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 989/989 places, 3974/3974 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 3974/3974 transitions.
Applied a total of 0 rules in 139 ms. Remains 989 /989 variables (removed 0) and now considering 3974/3974 (removed 0) transitions.
[2025-06-03 13:52:05] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
[2025-06-03 13:52:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:52:07] [INFO ] Implicit Places using invariants in 2249 ms returned []
[2025-06-03 13:52:07] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
[2025-06-03 13:52:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:52:08] [INFO ] State equation strengthened by 2408 read => feed constraints.
[2025-06-03 13:52:39] [INFO ] Performed 388/989 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:53:09] [INFO ] Performed 602/989 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 13:53:39] [INFO ] Performed 917/989 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 13:53:53] [INFO ] Implicit Places using invariants and state equation in 106396 ms returned []
Implicit Place search using SMT with State Equation took 108652 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:53:54] [INFO ] Redundant transitions in 200 ms returned []
Running 3912 sub problems to find dead transitions.
[2025-06-03 13:53:54] [INFO ] Flow matrix only has 3590 transitions (discarded 384 similar events)
[2025-06-03 13:53:54] [INFO ] Invariant cache hit.
[2025-06-03 13:53:54] [INFO ] State equation strengthened by 2408 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.
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/987 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3912 unsolved
SMT process timed out in 36240ms, After SMT, problems are : Problem set: 0 solved, 3912 unsolved
Search for dead transitions found 0 dead transitions in 36253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145267 ms. Remains : 989/989 places, 3974/3974 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1 p2)))]
Knowledge based reduction with 13 factoid took 1316 ms. Reduced automaton from 22 states, 46 edges and 3 AP (stutter sensitive) to 22 states, 46 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 793 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), false, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p2) p1), (NOT p2), false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), p1, false]
Stuttering acceptance computed with spot in 779 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), false, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p2) p1), (NOT p2), false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), p1, false]
Stuttering acceptance computed with spot in 786 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), false, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p2) p1), (NOT p2), false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), p1, false]
Product exploration explored 100000 steps with 1377 reset in 548 ms.
Product exploration explored 100000 steps with 1379 reset in 600 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, false, false, false, false, true, true, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 779 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), false, (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, (AND (NOT p2) p1), (NOT p2), false, (AND p1 (NOT p2)), false, (AND p1 (NOT p2)), p1, false]
Support contains 5 out of 1169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1169/1169 places, 2593/2593 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1169 transition count 2593
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 27 place count 1169 transition count 2594
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 41 place count 1169 transition count 2594
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 1156 transition count 2581
Deduced a syphon composed of 28 places in 2 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 1156 transition count 2581
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 85 place count 1156 transition count 2581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 1154 transition count 2579
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 1154 transition count 2579
Deduced a syphon composed of 44 places in 1 ms
Applied a total of 89 rules in 677 ms. Remains 1154 /1169 variables (removed 15) and now considering 2579/2593 (removed 14) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:54:37] [INFO ] Redundant transitions in 145 ms returned []
Running 2562 sub problems to find dead transitions.
[2025-06-03 13:54:37] [INFO ] Flow matrix only has 2307 transitions (discarded 272 similar events)
// Phase 1: matrix 2307 rows 1154 cols
[2025-06-03 13:54:37] [INFO ] Computed 48 invariants in 27 ms
[2025-06-03 13:54:37] [INFO ] State equation strengthened by 848 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1152 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2562 unsolved
SMT process timed out in 31788ms, After SMT, problems are : Problem set: 0 solved, 2562 unsolved
Search for dead transitions found 0 dead transitions in 31795ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1154/1169 places, 2579/2593 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32633 ms. Remains : 1154/1169 places, 2579/2593 transitions.
Built C files in :
/tmp/ltsmin12805152255857192202
[2025-06-03 13:55:08] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12805152255857192202
Running compilation step : cd /tmp/ltsmin12805152255857192202;'/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/ltsmin12805152255857192202;'/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/ltsmin12805152255857192202;'/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 5 out of 1169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1169/1169 places, 2593/2593 transitions.
Applied a total of 0 rules in 59 ms. Remains 1169 /1169 variables (removed 0) and now considering 2593/2593 (removed 0) transitions.
[2025-06-03 13:55:12] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1169 cols
[2025-06-03 13:55:12] [INFO ] Computed 48 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:14] [INFO ] Implicit Places using invariants in 2475 ms returned []
[2025-06-03 13:55:14] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
[2025-06-03 13:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:55:15] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 13:55:46] [INFO ] Performed 876/1169 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:55:52] [INFO ] Implicit Places using invariants and state equation in 37525 ms returned []
Implicit Place search using SMT with State Equation took 40018 ms to find 0 implicit places.
Running 2576 sub problems to find dead transitions.
[2025-06-03 13:55:52] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
[2025-06-03 13:55:52] [INFO ] Invariant cache hit.
[2025-06-03 13:55:52] [INFO ] State equation strengthened by 848 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1167 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2576 unsolved
SMT process timed out in 31513ms, After SMT, problems are : Problem set: 0 solved, 2576 unsolved
Search for dead transitions found 0 dead transitions in 31523ms
Finished structural reductions in LTL mode , in 1 iterations and 71607 ms. Remains : 1169/1169 places, 2593/2593 transitions.
Built C files in :
/tmp/ltsmin7714444769643176611
[2025-06-03 13:56:23] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7714444769643176611
Running compilation step : cd /tmp/ltsmin7714444769643176611;'/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/ltsmin7714444769643176611;'/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/ltsmin7714444769643176611;'/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 13:56:26] [INFO ] Flatten gal took : 86 ms
[2025-06-03 13:56:26] [INFO ] Flatten gal took : 99 ms
[2025-06-03 13:56:26] [INFO ] Time to serialize gal into /tmp/LTL15381727813293503704.gal : 18 ms
[2025-06-03 13:56:26] [INFO ] Time to serialize properties into /tmp/LTL4335141471186466130.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/LTL15381727813293503704.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17186444192131280922.hoa' '-atoms' '/tmp/LTL4335141471186466130.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/LTL4335141471186466130.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17186444192131280922.hoa
Detected timeout of ITS tools.
[2025-06-03 13:56:42] [INFO ] Flatten gal took : 81 ms
[2025-06-03 13:56:42] [INFO ] Flatten gal took : 82 ms
[2025-06-03 13:56:42] [INFO ] Time to serialize gal into /tmp/LTL17869478914307698358.gal : 12 ms
[2025-06-03 13:56:42] [INFO ] Time to serialize properties into /tmp/LTL1032191134043523858.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/LTL17869478914307698358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1032191134043523858.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 : !((G((("(Node8HasTheLeafSetOfRx3ToReplaceNode14>=1)")U("((Node8HasDetectedCrashOfNode9>=1)&&(Node9IsTheNodeMaster>=1))"))U(X((X(X("((N...310
Formula 0 simplified : F((!"(Node8HasTheLeafSetOfRx3ToReplaceNode14>=1)" R !"((Node8HasDetectedCrashOfNode9>=1)&&(Node9IsTheNodeMaster>=1))") R X(XX!"((Nod...296
Detected timeout of ITS tools.
[2025-06-03 13:56:57] [INFO ] Flatten gal took : 85 ms
[2025-06-03 13:56:57] [INFO ] Applying decomposition
[2025-06-03 13:56:57] [INFO ] Flatten gal took : 90 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/graph1778345107162247596.txt' '-o' '/tmp/graph1778345107162247596.bin' '-w' '/tmp/graph1778345107162247596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1778345107162247596.bin' '-l' '-1' '-v' '-w' '/tmp/graph1778345107162247596.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:56:57] [INFO ] Decomposing Gal with order
[2025-06-03 13:56:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:56:57] [INFO ] Removed a total of 1897 redundant transitions.
[2025-06-03 13:56:57] [INFO ] Flatten gal took : 217 ms
[2025-06-03 13:56:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1093 labels/synchronizations in 111 ms.
[2025-06-03 13:56:58] [INFO ] Time to serialize gal into /tmp/LTL3752148674227141565.gal : 27 ms
[2025-06-03 13:56:58] [INFO ] Time to serialize properties into /tmp/LTL4361639724802804384.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/LTL3752148674227141565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4361639724802804384.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 : !((G((("(i10.i0.i3.u189.Node8HasTheLeafSetOfRx3ToReplaceNode14>=1)")U("((i9.u91.Node8HasDetectedCrashOfNode9>=1)&&(i9.u0.Node9IsTheNod...379
Formula 0 simplified : F((!"(i10.i0.i3.u189.Node8HasTheLeafSetOfRx3ToReplaceNode14>=1)" R !"((i9.u91.Node8HasDetectedCrashOfNode9>=1)&&(i9.u0.Node9IsTheNod...365
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-01 finished in 835736 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 1315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1315/1315 places, 2963/2963 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 1315 transition count 2934
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1286 transition count 2934
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 58 place count 1286 transition count 2907
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 112 place count 1259 transition count 2907
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 132 place count 1239 transition count 2833
Iterating global reduction 2 with 20 rules applied. Total rules applied 152 place count 1239 transition count 2833
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 152 place count 1239 transition count 2830
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 1236 transition count 2830
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 168 place count 1226 transition count 2760
Iterating global reduction 2 with 10 rules applied. Total rules applied 178 place count 1226 transition count 2760
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 236 place count 1197 transition count 2731
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 246 place count 1187 transition count 2721
Iterating global reduction 2 with 10 rules applied. Total rules applied 256 place count 1187 transition count 2721
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 266 place count 1177 transition count 2651
Iterating global reduction 2 with 10 rules applied. Total rules applied 276 place count 1177 transition count 2651
Applied a total of 276 rules in 562 ms. Remains 1177 /1315 variables (removed 138) and now considering 2651/2963 (removed 312) transitions.
[2025-06-03 13:57:13] [INFO ] Flow matrix only has 2379 transitions (discarded 272 similar events)
// Phase 1: matrix 2379 rows 1177 cols
[2025-06-03 13:57:13] [INFO ] Computed 70 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:16] [INFO ] Implicit Places using invariants in 2442 ms returned [93, 159, 263, 271, 325, 398, 399, 491, 492, 511, 525, 526, 553, 576, 577, 595, 620, 649, 672, 726, 878, 985, 986]
[2025-06-03 13:57:16] [INFO ] Actually due to overlaps returned [263, 726, 93, 159, 271, 325, 398, 399, 491, 492, 511, 525, 526, 553, 576, 577, 595, 620, 649, 878, 985]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 2455 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1156/1315 places, 2651/2963 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1143 transition count 2638
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1143 transition count 2638
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1130 transition count 2625
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1130 transition count 2625
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 1121 transition count 2562
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 1121 transition count 2562
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 1115 transition count 2556
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 1109 transition count 2550
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 1109 transition count 2550
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 1103 transition count 2508
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 1103 transition count 2508
Applied a total of 106 rules in 603 ms. Remains 1103 /1156 variables (removed 53) and now considering 2508/2651 (removed 143) transitions.
[2025-06-03 13:57:16] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1103 cols
[2025-06-03 13:57:16] [INFO ] Computed 49 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:18] [INFO ] Implicit Places using invariants in 1731 ms returned [625, 932]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1744 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1101/1315 places, 2508/2963 transitions.
Applied a total of 0 rules in 114 ms. Remains 1101 /1101 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5478 ms. Remains : 1101/1315 places, 2508/2963 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-02 finished in 5537 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 U !p1))))'
Support contains 4 out of 1315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1315/1315 places, 2963/2963 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 1315 transition count 2934
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1286 transition count 2934
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 58 place count 1286 transition count 2908
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 110 place count 1260 transition count 2908
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 128 place count 1242 transition count 2842
Iterating global reduction 2 with 18 rules applied. Total rules applied 146 place count 1242 transition count 2842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 146 place count 1242 transition count 2840
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 150 place count 1240 transition count 2840
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 159 place count 1231 transition count 2777
Iterating global reduction 2 with 9 rules applied. Total rules applied 168 place count 1231 transition count 2777
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 228 place count 1201 transition count 2747
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 238 place count 1191 transition count 2737
Iterating global reduction 2 with 10 rules applied. Total rules applied 248 place count 1191 transition count 2737
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 258 place count 1181 transition count 2667
Iterating global reduction 2 with 10 rules applied. Total rules applied 268 place count 1181 transition count 2667
Applied a total of 268 rules in 573 ms. Remains 1181 /1315 variables (removed 134) and now considering 2667/2963 (removed 296) transitions.
[2025-06-03 13:57:19] [INFO ] Flow matrix only has 2395 transitions (discarded 272 similar events)
// Phase 1: matrix 2395 rows 1181 cols
[2025-06-03 13:57:19] [INFO ] Computed 70 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:21] [INFO ] Implicit Places using invariants in 2441 ms returned [163, 267, 275, 329, 402, 403, 495, 496, 515, 529, 530, 557, 580, 581, 599, 624, 653, 676, 730, 882, 989, 990]
[2025-06-03 13:57:21] [INFO ] Actually due to overlaps returned [267, 730, 163, 275, 329, 402, 403, 495, 496, 515, 529, 530, 557, 580, 581, 599, 624, 653, 882, 989]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 2453 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1161/1315 places, 2667/2963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1150 transition count 2656
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1150 transition count 2656
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1139 transition count 2645
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1139 transition count 2645
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1132 transition count 2596
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1132 transition count 2596
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 72 place count 1125 transition count 2589
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 79 place count 1118 transition count 2582
Iterating global reduction 0 with 7 rules applied. Total rules applied 86 place count 1118 transition count 2582
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 1111 transition count 2533
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 1111 transition count 2533
Applied a total of 100 rules in 642 ms. Remains 1111 /1161 variables (removed 50) and now considering 2533/2667 (removed 134) transitions.
[2025-06-03 13:57:22] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1111 cols
[2025-06-03 13:57:22] [INFO ] Computed 50 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:24] [INFO ] Implicit Places using invariants in 2041 ms returned [632, 939]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2051 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1109/1315 places, 2533/2963 transitions.
Applied a total of 0 rules in 114 ms. Remains 1109 /1109 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5837 ms. Remains : 1109/1315 places, 2533/2963 transitions.
Stuttering acceptance computed with spot in 75 ms :[p1, p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04
Product exploration explored 100000 steps with 1959 reset in 752 ms.
Product exploration explored 100000 steps with 1961 reset in 782 ms.
Computed a total of 294 stabilizing places and 917 stable transitions
Computed a total of 294 stabilizing places and 917 stable transitions
Detected a total of 294/1109 stabilizing places and 917/2533 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 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 based reduction with 13 factoid took 279 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p1, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (780 resets) in 466 ms. (85 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (164 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
[2025-06-03 13:57:26] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
// Phase 1: matrix 2261 rows 1109 cols
[2025-06-03 13:57:26] [INFO ] Computed 48 invariants in 27 ms
[2025-06-03 13:57:26] [INFO ] State equation strengthened by 848 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, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 1001/3370 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/31 constraints, Generalized P Invariants (flows): 0/17 constraints, State Equation: 0/1109 constraints, ReadFeed: 0/848 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 15 factoid took 547 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[p1, p1]
Stuttering acceptance computed with spot in 68 ms :[p1, p1]
Support contains 2 out of 1109 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 : 1109/1109 places, 2533/2533 transitions.
Applied a total of 0 rules in 114 ms. Remains 1109 /1109 variables (removed 0) and now considering 2533/2533 (removed 0) transitions.
[2025-06-03 13:57:27] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 13:57:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:29] [INFO ] Implicit Places using invariants in 2050 ms returned []
[2025-06-03 13:57:29] [INFO ] Flow matrix only has 2261 transitions (discarded 272 similar events)
[2025-06-03 13:57:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:31] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 13:57:57] [INFO ] Implicit Places using invariants and state equation in 27610 ms returned [1083]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 29670 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1108/1109 places, 2533/2533 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 1108 transition count 2532
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 1107 transition count 2532
Applied a total of 2 rules in 121 ms. Remains 1107 /1108 variables (removed 1) and now considering 2532/2533 (removed 1) transitions.
[2025-06-03 13:57:57] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1107 cols
[2025-06-03 13:57:57] [INFO ] Computed 47 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:57:59] [INFO ] Implicit Places using invariants in 2030 ms returned []
[2025-06-03 13:57:59] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2025-06-03 13:57:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:58:00] [INFO ] State equation strengthened by 848 read => feed constraints.
[2025-06-03 13:58:31] [INFO ] Performed 1082/1107 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 13:58:31] [INFO ] Implicit Places using invariants and state equation in 32144 ms returned []
Implicit Place search using SMT with State Equation took 34178 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1109 places, 2532/2533 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64083 ms. Remains : 1107/1109 places, 2532/2533 transitions.
Computed a total of 292 stabilizing places and 916 stable transitions
Computed a total of 292 stabilizing places and 916 stable transitions
Detected a total of 292/1107 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[p1, p1]
RANDOM walk for 21022 steps (410 resets) in 174 ms. (120 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p1, p1]
Stuttering acceptance computed with spot in 64 ms :[p1, p1]
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Product exploration explored 100000 steps with 1959 reset in 661 ms.
Product exploration explored 100000 steps with 1962 reset in 699 ms.
Built C files in :
/tmp/ltsmin5456934109173929519
[2025-06-03 13:58:33] [INFO ] Too many transitions (2532) to apply POR reductions. Disabling POR matrices.
[2025-06-03 13:58:33] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5456934109173929519
Running compilation step : cd /tmp/ltsmin5456934109173929519;'/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/ltsmin5456934109173929519;'/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/ltsmin5456934109173929519;'/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 2 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2532/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 1107 transition count 2531
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 1106 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1105 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1105 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1104 transition count 2523
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1104 transition count 2523
Applied a total of 6 rules in 310 ms. Remains 1104 /1107 variables (removed 3) and now considering 2523/2532 (removed 9) transitions.
[2025-06-03 13:58:37] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
// Phase 1: matrix 2251 rows 1104 cols
[2025-06-03 13:58:37] [INFO ] Computed 47 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:58:39] [INFO ] Implicit Places using invariants in 2009 ms returned [93]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2012 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1103/1107 places, 2523/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 1102 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1101 transition count 2521
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1101 transition count 2521
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1100 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1100 transition count 2514
Applied a total of 6 rules in 344 ms. Remains 1100 /1103 variables (removed 3) and now considering 2514/2523 (removed 9) transitions.
[2025-06-03 13:58:39] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
// Phase 1: matrix 2242 rows 1100 cols
[2025-06-03 13:58:39] [INFO ] Computed 46 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:58:41] [INFO ] Implicit Places using invariants in 1952 ms returned []
[2025-06-03 13:58:41] [INFO ] Flow matrix only has 2242 transitions (discarded 272 similar events)
[2025-06-03 13:58:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:58:42] [INFO ] State equation strengthened by 836 read => feed constraints.
[2025-06-03 13:59:09] [INFO ] Implicit Places using invariants and state equation in 27757 ms returned []
Implicit Place search using SMT with State Equation took 29720 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1100/1107 places, 2514/2532 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32388 ms. Remains : 1100/1107 places, 2514/2532 transitions.
Built C files in :
/tmp/ltsmin10767364747269160947
[2025-06-03 13:59:09] [INFO ] Too many transitions (2514) to apply POR reductions. Disabling POR matrices.
[2025-06-03 13:59:09] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10767364747269160947
Running compilation step : cd /tmp/ltsmin10767364747269160947;'/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/ltsmin10767364747269160947;'/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/ltsmin10767364747269160947;'/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 13:59:12] [INFO ] Flatten gal took : 63 ms
[2025-06-03 13:59:12] [INFO ] Flatten gal took : 65 ms
[2025-06-03 13:59:12] [INFO ] Time to serialize gal into /tmp/LTL1489932978756037077.gal : 11 ms
[2025-06-03 13:59:12] [INFO ] Time to serialize properties into /tmp/LTL10451182948178119127.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/LTL1489932978756037077.gal' '-t' 'CGAL' '-hoa' '/tmp/aut279463486170542433.hoa' '-atoms' '/tmp/LTL10451182948178119127.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...317
Loading property file /tmp/LTL10451182948178119127.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut279463486170542433.hoa
Detected timeout of ITS tools.
[2025-06-03 13:59:27] [INFO ] Flatten gal took : 65 ms
[2025-06-03 13:59:27] [INFO ] Flatten gal took : 66 ms
[2025-06-03 13:59:27] [INFO ] Time to serialize gal into /tmp/LTL5886952006252600999.gal : 11 ms
[2025-06-03 13:59:27] [INFO ] Time to serialize properties into /tmp/LTL16094781594452123960.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/LTL5886952006252600999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16094781594452123960.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((!("((Node0HasAskedItsLeafSetToRx1ToReplaceNode15>=1)&&(LeafSetOfRx1IsSentToNode0>=1))"))U(!("((Node16ManageTheCrashOfNode13>=1...207
Formula 0 simplified : GF("((Node0HasAskedItsLeafSetToRx1ToReplaceNode15>=1)&&(LeafSetOfRx1IsSentToNode0>=1))" R "((Node16ManageTheCrashOfNode13>=1)&&(Rx0I...194
Detected timeout of ITS tools.
[2025-06-03 13:59:42] [INFO ] Flatten gal took : 59 ms
[2025-06-03 13:59:42] [INFO ] Applying decomposition
[2025-06-03 13:59:42] [INFO ] Flatten gal took : 61 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/graph16167411883250167758.txt' '-o' '/tmp/graph16167411883250167758.bin' '-w' '/tmp/graph16167411883250167758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16167411883250167758.bin' '-l' '-1' '-v' '-w' '/tmp/graph16167411883250167758.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:59:43] [INFO ] Decomposing Gal with order
[2025-06-03 13:59:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:59:43] [INFO ] Removed a total of 3495 redundant transitions.
[2025-06-03 13:59:43] [INFO ] Flatten gal took : 209 ms
[2025-06-03 13:59:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1252 labels/synchronizations in 120 ms.
[2025-06-03 13:59:43] [INFO ] Time to serialize gal into /tmp/LTL250262062257471585.gal : 28 ms
[2025-06-03 13:59:43] [INFO ] Time to serialize properties into /tmp/LTL7982638643817719796.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/LTL250262062257471585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7982638643817719796.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...253
Read 1 LTL properties
Checking formula 0 : !((F(G((!("((i5.i0.u12.Node0HasAskedItsLeafSetToRx1ToReplaceNode15>=1)&&(i5.i0.u175.LeafSetOfRx1IsSentToNode0>=1))"))U(!("((i5.i0.u40....249
Formula 0 simplified : GF("((i5.i0.u12.Node0HasAskedItsLeafSetToRx1ToReplaceNode15>=1)&&(i5.i0.u175.LeafSetOfRx1IsSentToNode0>=1))" R "((i5.i0.u40.Node16Ma...236
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-04 finished in 159978 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)))'
Support contains 1 out of 1315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1315/1315 places, 2963/2963 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 1315 transition count 2935
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1287 transition count 2935
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 56 place count 1287 transition count 2908
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 110 place count 1260 transition count 2908
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 130 place count 1240 transition count 2834
Iterating global reduction 2 with 20 rules applied. Total rules applied 150 place count 1240 transition count 2834
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 150 place count 1240 transition count 2831
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 1237 transition count 2831
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 166 place count 1227 transition count 2761
Iterating global reduction 2 with 10 rules applied. Total rules applied 176 place count 1227 transition count 2761
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 234 place count 1198 transition count 2732
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 243 place count 1189 transition count 2723
Iterating global reduction 2 with 9 rules applied. Total rules applied 252 place count 1189 transition count 2723
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 261 place count 1180 transition count 2660
Iterating global reduction 2 with 9 rules applied. Total rules applied 270 place count 1180 transition count 2660
Applied a total of 270 rules in 658 ms. Remains 1180 /1315 variables (removed 135) and now considering 2660/2963 (removed 303) transitions.
[2025-06-03 13:59:59] [INFO ] Flow matrix only has 2388 transitions (discarded 272 similar events)
// Phase 1: matrix 2388 rows 1180 cols
[2025-06-03 13:59:59] [INFO ] Computed 70 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:01] [INFO ] Implicit Places using invariants in 2620 ms returned [93, 159, 263, 271, 325, 398, 399, 491, 492, 511, 525, 526, 553, 576, 577, 595, 620, 675, 729, 881, 988, 989]
[2025-06-03 14:00:01] [INFO ] Actually due to overlaps returned [263, 729, 93, 159, 271, 325, 398, 399, 491, 492, 511, 525, 526, 553, 576, 577, 595, 620, 881, 988]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 2624 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1160/1315 places, 2660/2963 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1147 transition count 2647
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1147 transition count 2647
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1134 transition count 2634
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1134 transition count 2634
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 1125 transition count 2571
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 1125 transition count 2571
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 1120 transition count 2566
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 1115 transition count 2561
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 1115 transition count 2561
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 1110 transition count 2526
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 1110 transition count 2526
Applied a total of 100 rules in 727 ms. Remains 1110 /1160 variables (removed 50) and now considering 2526/2660 (removed 134) transitions.
[2025-06-03 14:00:02] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1110 cols
[2025-06-03 14:00:02] [INFO ] Computed 50 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:04] [INFO ] Implicit Places using invariants in 2028 ms returned [630, 938]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2030 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1315 places, 2526/2963 transitions.
Applied a total of 0 rules in 113 ms. Remains 1108 /1108 variables (removed 0) and now considering 2526/2526 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6152 ms. Remains : 1108/1315 places, 2526/2963 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-05
Product exploration explored 100000 steps with 1958 reset in 682 ms.
Product exploration explored 100000 steps with 1957 reset in 671 ms.
Computed a total of 293 stabilizing places and 910 stable transitions
Computed a total of 293 stabilizing places and 910 stable transitions
Detected a total of 293/1108 stabilizing places and 910/2526 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24533 steps (477 resets) in 209 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1108/1108 places, 2526/2526 transitions.
Applied a total of 0 rules in 128 ms. Remains 1108 /1108 variables (removed 0) and now considering 2526/2526 (removed 0) transitions.
[2025-06-03 14:00:06] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1108 cols
[2025-06-03 14:00:06] [INFO ] Computed 48 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:08] [INFO ] Implicit Places using invariants in 2006 ms returned []
[2025-06-03 14:00:08] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
[2025-06-03 14:00:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:09] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 14:00:36] [INFO ] Implicit Places using invariants and state equation in 27882 ms returned [1099]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 29907 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1107/1108 places, 2526/2526 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 1107 transition count 2525
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 1106 transition count 2525
Applied a total of 2 rules in 122 ms. Remains 1106 /1107 variables (removed 1) and now considering 2525/2526 (removed 1) transitions.
[2025-06-03 14:00:36] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1106 cols
[2025-06-03 14:00:36] [INFO ] Computed 47 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:38] [INFO ] Implicit Places using invariants in 1767 ms returned []
[2025-06-03 14:00:38] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2025-06-03 14:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:00:39] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 14:01:08] [INFO ] Implicit Places using invariants and state equation in 29605 ms returned []
Implicit Place search using SMT with State Equation took 31391 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1106/1108 places, 2525/2526 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61553 ms. Remains : 1106/1108 places, 2525/2526 transitions.
Computed a total of 291 stabilizing places and 909 stable transitions
Computed a total of 291 stabilizing places and 909 stable transitions
Detected a total of 291/1106 stabilizing places and 909/2525 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 14980 steps (291 resets) in 128 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1958 reset in 624 ms.
Product exploration explored 100000 steps with 1959 reset in 693 ms.
Built C files in :
/tmp/ltsmin17316474623044676788
[2025-06-03 14:01:10] [INFO ] Too many transitions (2525) to apply POR reductions. Disabling POR matrices.
[2025-06-03 14:01:10] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17316474623044676788
Running compilation step : cd /tmp/ltsmin17316474623044676788;'/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/ltsmin17316474623044676788;'/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/ltsmin17316474623044676788;'/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 1 out of 1106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1106/1106 places, 2525/2525 transitions.
Applied a total of 0 rules in 126 ms. Remains 1106 /1106 variables (removed 0) and now considering 2525/2525 (removed 0) transitions.
[2025-06-03 14:01:13] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2025-06-03 14:01:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:01:15] [INFO ] Implicit Places using invariants in 2027 ms returned []
[2025-06-03 14:01:15] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2025-06-03 14:01:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:01:16] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 14:01:45] [INFO ] Implicit Places using invariants and state equation in 30078 ms returned []
Implicit Place search using SMT with State Equation took 32110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:01:45] [INFO ] Redundant transitions in 125 ms returned []
Running 2508 sub problems to find dead transitions.
[2025-06-03 14:01:45] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2025-06-03 14:01:45] [INFO ] Invariant cache hit.
[2025-06-03 14:01:45] [INFO ] State equation strengthened by 842 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1104 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2508 unsolved
SMT process timed out in 31800ms, After SMT, problems are : Problem set: 0 solved, 2508 unsolved
Search for dead transitions found 0 dead transitions in 31807ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64180 ms. Remains : 1106/1106 places, 2525/2525 transitions.
Built C files in :
/tmp/ltsmin7754193728460427185
[2025-06-03 14:02:17] [INFO ] Too many transitions (2525) to apply POR reductions. Disabling POR matrices.
[2025-06-03 14:02:17] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7754193728460427185
Running compilation step : cd /tmp/ltsmin7754193728460427185;'/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/ltsmin7754193728460427185;'/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/ltsmin7754193728460427185;'/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 14:02:20] [INFO ] Flatten gal took : 63 ms
[2025-06-03 14:02:20] [INFO ] Flatten gal took : 66 ms
[2025-06-03 14:02:20] [INFO ] Time to serialize gal into /tmp/LTL4720872558996266981.gal : 14 ms
[2025-06-03 14:02:20] [INFO ] Time to serialize properties into /tmp/LTL13528892163815825818.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/LTL4720872558996266981.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14566307896663847401.hoa' '-atoms' '/tmp/LTL13528892163815825818.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/LTL13528892163815825818.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14566307896663847401.hoa
Detected timeout of ITS tools.
[2025-06-03 14:02:35] [INFO ] Flatten gal took : 57 ms
[2025-06-03 14:02:35] [INFO ] Flatten gal took : 58 ms
[2025-06-03 14:02:35] [INFO ] Time to serialize gal into /tmp/LTL17343217529948609159.gal : 11 ms
[2025-06-03 14:02:35] [INFO ] Time to serialize properties into /tmp/LTL2464625565575698808.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/LTL17343217529948609159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2464625565575698808.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 : !((G(F("(Node11HasTheLeafSetOfLx1ToReplaceNode6<1)"))))
Formula 0 simplified : FG!"(Node11HasTheLeafSetOfLx1ToReplaceNode6<1)"
Detected timeout of ITS tools.
[2025-06-03 14:02:51] [INFO ] Flatten gal took : 62 ms
[2025-06-03 14:02:51] [INFO ] Applying decomposition
[2025-06-03 14:02:51] [INFO ] Flatten gal took : 65 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/graph13739042979733568316.txt' '-o' '/tmp/graph13739042979733568316.bin' '-w' '/tmp/graph13739042979733568316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13739042979733568316.bin' '-l' '-1' '-v' '-w' '/tmp/graph13739042979733568316.weights' '-q' '0' '-e' '0.001'
[2025-06-03 14:02:51] [INFO ] Decomposing Gal with order
[2025-06-03 14:02:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 14:02:51] [INFO ] Removed a total of 2270 redundant transitions.
[2025-06-03 14:02:51] [INFO ] Flatten gal took : 301 ms
[2025-06-03 14:02:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1604 labels/synchronizations in 86 ms.
[2025-06-03 14:02:51] [INFO ] Time to serialize gal into /tmp/LTL17402959261750139280.gal : 18 ms
[2025-06-03 14:02:51] [INFO ] Time to serialize properties into /tmp/LTL13195303453803861400.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/LTL17402959261750139280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13195303453803861400.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 : !((G(F("(i16.i3.u168.Node11HasTheLeafSetOfLx1ToReplaceNode6<1)"))))
Formula 0 simplified : FG!"(i16.i3.u168.Node11HasTheLeafSetOfLx1ToReplaceNode6<1)"
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-05 finished in 188242 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((F((p0&&G((p1||X(X(p2)))))) U G(p3))))'
Support contains 6 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 2963/2963 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1288 transition count 2888
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1288 transition count 2888
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 72 place count 1270 transition count 2810
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 1270 transition count 2810
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 1262 transition count 2754
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 1262 transition count 2754
Applied a total of 106 rules in 290 ms. Remains 1262 /1315 variables (removed 53) and now considering 2754/2963 (removed 209) transitions.
[2025-06-03 14:03:07] [INFO ] Flow matrix only has 2482 transitions (discarded 272 similar events)
// Phase 1: matrix 2482 rows 1262 cols
[2025-06-03 14:03:07] [INFO ] Computed 70 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:03:09] [INFO ] Implicit Places using invariants in 2562 ms returned [102, 189, 295, 304, 358, 435, 535, 536, 558, 573, 607, 632, 633, 654, 681, 712, 735, 791, 946, 1055, 1056]
[2025-06-03 14:03:09] [INFO ] Actually due to overlaps returned [295, 791, 102, 189, 304, 358, 435, 535, 536, 558, 573, 607, 632, 633, 654, 681, 712, 946, 1055]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 2574 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1243/1315 places, 2754/2963 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1226 transition count 2737
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1226 transition count 2737
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1209 transition count 2720
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1209 transition count 2720
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 1192 transition count 2703
Iterating global reduction 0 with 17 rules applied. Total rules applied 102 place count 1192 transition count 2703
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 115 place count 1179 transition count 2612
Iterating global reduction 0 with 13 rules applied. Total rules applied 128 place count 1179 transition count 2612
Applied a total of 128 rules in 361 ms. Remains 1179 /1243 variables (removed 64) and now considering 2612/2754 (removed 142) transitions.
[2025-06-03 14:03:10] [INFO ] Flow matrix only has 2340 transitions (discarded 272 similar events)
// Phase 1: matrix 2340 rows 1179 cols
[2025-06-03 14:03:10] [INFO ] Computed 51 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:03:12] [INFO ] Implicit Places using invariants in 2195 ms returned [680, 992]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2208 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1177/1315 places, 2612/2963 transitions.
Applied a total of 0 rules in 71 ms. Remains 1177 /1177 variables (removed 0) and now considering 2612/2612 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5504 ms. Remains : 1177/1315 places, 2612/2963 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p3), (NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-07 finished in 5886 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(((p0 U ((p2 U p3)&&p1))&&X(X(p2))&&F(p4))))'
Support contains 8 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 2963/2963 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1289 transition count 2901
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1289 transition count 2901
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 71 place count 1270 transition count 2828
Iterating global reduction 0 with 19 rules applied. Total rules applied 90 place count 1270 transition count 2828
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 100 place count 1260 transition count 2758
Iterating global reduction 0 with 10 rules applied. Total rules applied 110 place count 1260 transition count 2758
Applied a total of 110 rules in 292 ms. Remains 1260 /1315 variables (removed 55) and now considering 2758/2963 (removed 205) transitions.
[2025-06-03 14:03:13] [INFO ] Flow matrix only has 2486 transitions (discarded 272 similar events)
// Phase 1: matrix 2486 rows 1260 cols
[2025-06-03 14:03:13] [INFO ] Computed 70 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:03:15] [INFO ] Implicit Places using invariants in 2699 ms returned [102, 189, 295, 304, 358, 434, 435, 531, 556, 570, 571, 602, 627, 628, 649, 677, 708, 731, 787, 943, 1052, 1053]
[2025-06-03 14:03:15] [INFO ] Actually due to overlaps returned [295, 787, 102, 189, 304, 358, 434, 435, 531, 556, 570, 571, 602, 627, 628, 649, 677, 708, 943, 1052]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 2721 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1240/1315 places, 2758/2963 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1222 transition count 2740
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1222 transition count 2740
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1204 transition count 2722
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1204 transition count 2722
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1186 transition count 2704
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1186 transition count 2704
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 122 place count 1172 transition count 2606
Iterating global reduction 0 with 14 rules applied. Total rules applied 136 place count 1172 transition count 2606
Applied a total of 136 rules in 356 ms. Remains 1172 /1240 variables (removed 68) and now considering 2606/2758 (removed 152) transitions.
[2025-06-03 14:03:16] [INFO ] Flow matrix only has 2334 transitions (discarded 272 similar events)
// Phase 1: matrix 2334 rows 1172 cols
[2025-06-03 14:03:16] [INFO ] Computed 50 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:03:18] [INFO ] Implicit Places using invariants in 1903 ms returned [672, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1905 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1170/1315 places, 2606/2963 transitions.
Applied a total of 0 rules in 68 ms. Remains 1170 /1170 variables (removed 0) and now considering 2606/2606 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5342 ms. Remains : 1170/1315 places, 2606/2963 transitions.
Stuttering acceptance computed with spot in 408 ms :[(OR (NOT p2) (NOT p1) (NOT p3) (NOT p4)), (OR (NOT p2) (NOT p1) (NOT p3) (NOT p4)), true, (NOT p3), (OR (NOT p1) (NOT p3)), (NOT p2), (NOT p4), (NOT p3), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-08 finished in 5783 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(G((p0||X(p1)||G(p2)))))'
Support contains 5 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 2963/2963 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1288 transition count 2882
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1288 transition count 2882
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 71 place count 1271 transition count 2817
Iterating global reduction 0 with 17 rules applied. Total rules applied 88 place count 1271 transition count 2817
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 97 place count 1262 transition count 2754
Iterating global reduction 0 with 9 rules applied. Total rules applied 106 place count 1262 transition count 2754
Applied a total of 106 rules in 287 ms. Remains 1262 /1315 variables (removed 53) and now considering 2754/2963 (removed 209) transitions.
[2025-06-03 14:03:18] [INFO ] Flow matrix only has 2482 transitions (discarded 272 similar events)
// Phase 1: matrix 2482 rows 1262 cols
[2025-06-03 14:03:18] [INFO ] Computed 70 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:03:21] [INFO ] Implicit Places using invariants in 2962 ms returned [102, 297, 306, 360, 436, 536, 537, 559, 573, 607, 632, 633, 654, 681, 712, 735, 791, 946, 1055, 1056]
[2025-06-03 14:03:21] [INFO ] Actually due to overlaps returned [297, 791, 102, 306, 360, 436, 536, 537, 559, 573, 607, 632, 633, 654, 681, 712, 946, 1055]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 2975 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1244/1315 places, 2754/2963 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1228 transition count 2738
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1228 transition count 2738
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1212 transition count 2722
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1212 transition count 2722
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1196 transition count 2706
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1196 transition count 2706
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 108 place count 1184 transition count 2622
Iterating global reduction 0 with 12 rules applied. Total rules applied 120 place count 1184 transition count 2622
Applied a total of 120 rules in 397 ms. Remains 1184 /1244 variables (removed 60) and now considering 2622/2754 (removed 132) transitions.
[2025-06-03 14:03:22] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
// Phase 1: matrix 2350 rows 1184 cols
[2025-06-03 14:03:22] [INFO ] Computed 52 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:03:24] [INFO ] Implicit Places using invariants in 2112 ms returned [684, 996]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2126 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1315 places, 2622/2963 transitions.
Applied a total of 0 rules in 78 ms. Remains 1182 /1182 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5863 ms. Remains : 1182/1315 places, 2622/2963 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10
Product exploration explored 100000 steps with 1379 reset in 731 ms.
Product exploration explored 100000 steps with 1377 reset in 694 ms.
Computed a total of 350 stabilizing places and 989 stable transitions
Computed a total of 350 stabilizing places and 989 stable transitions
Detected a total of 350/1182 stabilizing places and 989/2622 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1232 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (549 resets) in 386 ms. (103 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40002 steps (152 resets) in 120 ms. (330 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (152 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (152 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (152 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
[2025-06-03 14:03:27] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
// Phase 1: matrix 2350 rows 1182 cols
[2025-06-03 14:03:27] [INFO ] Computed 50 invariants in 28 ms
[2025-06-03 14:03:27] [INFO ] State equation strengthened by 866 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, 3 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 123/127 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 979/1106 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1168 variables, 29/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1168 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/1182 variables, 14/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1182 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2350/3532 variables, 1182/1232 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3532 variables, 866/2098 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3532 variables, 0/2098 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3532 variables, 0/2098 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3532/3532 variables, and 2098 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2086 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1182/1182 constraints, ReadFeed: 866/866 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 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: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 979/1106 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:31] [INFO ] Deduced a trap composed of 70 places in 1056 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:32] [INFO ] Deduced a trap composed of 74 places in 928 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:33] [INFO ] Deduced a trap composed of 74 places in 915 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:34] [INFO ] Deduced a trap composed of 74 places in 1040 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:35] [INFO ] Deduced a trap composed of 74 places in 1007 ms of which 126 ms to minimize.
SMT process timed out in 7447ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 2622/2622 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1182 transition count 2596
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1156 transition count 2596
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 1156 transition count 2582
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 1142 transition count 2582
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 122 place count 1121 transition count 2561
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 1120 transition count 2560
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 1120 transition count 2560
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 1119 transition count 2553
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 1119 transition count 2553
Free-agglomeration rule (complex) applied 136 times.
Iterating global reduction 2 with 136 rules applied. Total rules applied 262 place count 1119 transition count 4007
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 398 place count 983 transition count 4007
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 399 place count 983 transition count 4007
Applied a total of 399 rules in 685 ms. Remains 983 /1182 variables (removed 199) and now considering 4007/2622 (removed -1385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 685 ms. Remains : 983/1182 places, 4007/2622 transitions.
RANDOM walk for 40000 steps (961 resets) in 1170 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (130 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 51381 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 51381 steps, saw 21652 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 14:03:39] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
// Phase 1: matrix 3609 rows 983 cols
[2025-06-03 14:03:39] [INFO ] Computed 50 invariants in 28 ms
[2025-06-03 14:03:39] [INFO ] State equation strengthened by 2450 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) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 852/924 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:41] [INFO ] Deduced a trap composed of 52 places in 1202 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:42] [INFO ] Deduced a trap composed of 53 places in 1200 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:43] [INFO ] Deduced a trap composed of 55 places in 1192 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:44] [INFO ] Deduced a trap composed of 53 places in 1211 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:45] [INFO ] Deduced a trap composed of 53 places in 1190 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:47] [INFO ] Deduced a trap composed of 53 places in 1209 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:48] [INFO ] Deduced a trap composed of 53 places in 1201 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:49] [INFO ] Deduced a trap composed of 53 places in 1138 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:50] [INFO ] Deduced a trap composed of 53 places in 1193 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:52] [INFO ] Deduced a trap composed of 53 places in 1201 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:53] [INFO ] Deduced a trap composed of 54 places in 1110 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:54] [INFO ] Deduced a trap composed of 94 places in 969 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:55] [INFO ] Deduced a trap composed of 96 places in 928 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:56] [INFO ] Deduced a trap composed of 96 places in 923 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:57] [INFO ] Deduced a trap composed of 96 places in 911 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:58] [INFO ] Deduced a trap composed of 52 places in 1169 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:03:59] [INFO ] Deduced a trap composed of 52 places in 1176 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:00] [INFO ] Deduced a trap composed of 52 places in 1176 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:01] [INFO ] Deduced a trap composed of 52 places in 1111 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:02] [INFO ] Deduced a trap composed of 52 places in 1121 ms of which 53 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/924 variables, 20/27 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 14:04:04] [INFO ] Deduced a trap composed of 52 places in 1106 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:05] [INFO ] Deduced a trap composed of 52 places in 1188 ms of which 88 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/924 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/924 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 45/969 variables, 29/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/969 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/983 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/983 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3609/4592 variables, 983/1055 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4592 variables, 2450/3505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4592 variables, 0/3505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4592 variables, 0/3505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4592/4592 variables, and 3505 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29234 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 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) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 852/924 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/924 variables, 22/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 14:04:10] [INFO ] Deduced a trap composed of 52 places in 1093 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:11] [INFO ] Deduced a trap composed of 52 places in 1083 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:12] [INFO ] Deduced a trap composed of 52 places in 1171 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:13] [INFO ] Deduced a trap composed of 52 places in 1207 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:14] [INFO ] Deduced a trap composed of 52 places in 1160 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:16] [INFO ] Deduced a trap composed of 52 places in 1203 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:17] [INFO ] Deduced a trap composed of 52 places in 1223 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:18] [INFO ] Deduced a trap composed of 52 places in 1130 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:19] [INFO ] Deduced a trap composed of 52 places in 1180 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:20] [INFO ] Deduced a trap composed of 52 places in 1197 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:22] [INFO ] Deduced a trap composed of 53 places in 1203 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:23] [INFO ] Deduced a trap composed of 53 places in 1187 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:24] [INFO ] Deduced a trap composed of 53 places in 1199 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:25] [INFO ] Deduced a trap composed of 53 places in 1264 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:27] [INFO ] Deduced a trap composed of 53 places in 1206 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:28] [INFO ] Deduced a trap composed of 53 places in 1185 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:29] [INFO ] Deduced a trap composed of 53 places in 1206 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:30] [INFO ] Deduced a trap composed of 53 places in 1220 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:31] [INFO ] Deduced a trap composed of 53 places in 1075 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:33] [INFO ] Deduced a trap composed of 53 places in 1125 ms of which 53 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/924 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 14:04:34] [INFO ] Deduced a trap composed of 53 places in 1065 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:35] [INFO ] Deduced a trap composed of 53 places in 1102 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:36] [INFO ] Deduced a trap composed of 53 places in 1125 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:37] [INFO ] Deduced a trap composed of 54 places in 1108 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:38] [INFO ] Deduced a trap composed of 54 places in 1073 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:39] [INFO ] Deduced a trap composed of 54 places in 1093 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:40] [INFO ] Deduced a trap composed of 54 places in 1167 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:42] [INFO ] Deduced a trap composed of 54 places in 1169 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:43] [INFO ] Deduced a trap composed of 54 places in 1187 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:44] [INFO ] Deduced a trap composed of 54 places in 1145 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:45] [INFO ] Deduced a trap composed of 54 places in 1085 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:46] [INFO ] Deduced a trap composed of 54 places in 1010 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:47] [INFO ] Deduced a trap composed of 54 places in 1100 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:48] [INFO ] Deduced a trap composed of 56 places in 1130 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:49] [INFO ] Deduced a trap composed of 96 places in 875 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:51] [INFO ] Deduced a trap composed of 57 places in 1112 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:52] [INFO ] Deduced a trap composed of 55 places in 1086 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:53] [INFO ] Deduced a trap composed of 55 places in 1115 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:04:54] [INFO ] Deduced a trap composed of 55 places in 1059 ms of which 53 ms to minimize.
SMT process timed out in 74770ms, 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 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4007/4007 transitions.
Applied a total of 0 rules in 150 ms. Remains 983 /983 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 983/983 places, 4007/4007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4007/4007 transitions.
Applied a total of 0 rules in 138 ms. Remains 983 /983 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
[2025-06-03 14:04:54] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2025-06-03 14:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:04:56] [INFO ] Implicit Places using invariants in 2080 ms returned [342]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2107 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 982/983 places, 4007/4007 transitions.
Applied a total of 0 rules in 139 ms. Remains 982 /982 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2384 ms. Remains : 982/983 places, 4007/4007 transitions.
RANDOM walk for 40000 steps (961 resets) in 1353 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (127 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 51820 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 51820 steps, saw 21827 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 14:05:00] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
// Phase 1: matrix 3609 rows 982 cols
[2025-06-03 14:05:00] [INFO ] Computed 49 invariants in 26 ms
[2025-06-03 14:05:00] [INFO ] State equation strengthened by 2450 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) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 851/923 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/968 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/968 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/982 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3609/4591 variables, 982/1031 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4591 variables, 2450/3481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4591 variables, 0/3481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/4591 variables, 0/3481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4591/4591 variables, and 3481 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: 982/982 constraints, ReadFeed: 2450/2450 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) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 851/923 variables, 4/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 14:05:04] [INFO ] Deduced a trap composed of 52 places in 1154 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:05] [INFO ] Deduced a trap composed of 53 places in 1174 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:07] [INFO ] Deduced a trap composed of 53 places in 1181 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:08] [INFO ] Deduced a trap composed of 52 places in 1026 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:09] [INFO ] Deduced a trap composed of 52 places in 1113 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:10] [INFO ] Deduced a trap composed of 52 places in 1145 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:11] [INFO ] Deduced a trap composed of 52 places in 1129 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:12] [INFO ] Deduced a trap composed of 53 places in 1158 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:13] [INFO ] Deduced a trap composed of 53 places in 1125 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:15] [INFO ] Deduced a trap composed of 53 places in 1166 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:16] [INFO ] Deduced a trap composed of 53 places in 1104 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:17] [INFO ] Deduced a trap composed of 53 places in 1150 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:18] [INFO ] Deduced a trap composed of 53 places in 1153 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:19] [INFO ] Deduced a trap composed of 53 places in 1226 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:20] [INFO ] Deduced a trap composed of 53 places in 1107 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:21] [INFO ] Deduced a trap composed of 100 places in 826 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:22] [INFO ] Deduced a trap composed of 53 places in 1138 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:24] [INFO ] Deduced a trap composed of 53 places in 1142 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:25] [INFO ] Deduced a trap composed of 55 places in 1121 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:26] [INFO ] Deduced a trap composed of 53 places in 1133 ms of which 89 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 20/26 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 14:05:27] [INFO ] Deduced a trap composed of 53 places in 1024 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:28] [INFO ] Deduced a trap composed of 53 places in 1118 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:29] [INFO ] Deduced a trap composed of 53 places in 1007 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:30] [INFO ] Deduced a trap composed of 103 places in 848 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:31] [INFO ] Deduced a trap composed of 53 places in 1138 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:33] [INFO ] Deduced a trap composed of 53 places in 1152 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:34] [INFO ] Deduced a trap composed of 53 places in 1142 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:35] [INFO ] Deduced a trap composed of 53 places in 1122 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:36] [INFO ] Deduced a trap composed of 53 places in 1151 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:37] [INFO ] Deduced a trap composed of 53 places in 1167 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:38] [INFO ] Deduced a trap composed of 53 places in 1102 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:39] [INFO ] Deduced a trap composed of 53 places in 1132 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:41] [INFO ] Deduced a trap composed of 53 places in 1191 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:42] [INFO ] Deduced a trap composed of 53 places in 1192 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:43] [INFO ] Deduced a trap composed of 53 places in 1215 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:44] [INFO ] Deduced a trap composed of 53 places in 1199 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:46] [INFO ] Deduced a trap composed of 53 places in 1205 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:47] [INFO ] Deduced a trap composed of 53 places in 1151 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:48] [INFO ] Deduced a trap composed of 53 places in 1032 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:49] [INFO ] Deduced a trap composed of 53 places in 1094 ms of which 83 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/923 variables, 20/46 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 14:05:50] [INFO ] Deduced a trap composed of 53 places in 1044 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:51] [INFO ] Deduced a trap composed of 53 places in 1186 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:52] [INFO ] Deduced a trap composed of 53 places in 1146 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:54] [INFO ] Deduced a trap composed of 53 places in 1106 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:55] [INFO ] Deduced a trap composed of 53 places in 1168 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:56] [INFO ] Deduced a trap composed of 53 places in 1196 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:57] [INFO ] Deduced a trap composed of 53 places in 1180 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:05:58] [INFO ] Deduced a trap composed of 53 places in 1165 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:00] [INFO ] Deduced a trap composed of 53 places in 1193 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:01] [INFO ] Deduced a trap composed of 54 places in 1105 ms of which 61 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 45/968 variables, 29/85 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 14:06:02] [INFO ] Deduced a trap composed of 5 places in 1223 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:03] [INFO ] Deduced a trap composed of 53 places in 1230 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:05] [INFO ] Deduced a trap composed of 53 places in 1313 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:06] [INFO ] Deduced a trap composed of 53 places in 1231 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:07] [INFO ] Deduced a trap composed of 53 places in 1272 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:08] [INFO ] Deduced a trap composed of 53 places in 1268 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:10] [INFO ] Deduced a trap composed of 53 places in 1241 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:11] [INFO ] Deduced a trap composed of 53 places in 1278 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:12] [INFO ] Deduced a trap composed of 53 places in 1291 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:14] [INFO ] Deduced a trap composed of 53 places in 1295 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:15] [INFO ] Deduced a trap composed of 53 places in 1285 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:16] [INFO ] Deduced a trap composed of 53 places in 1278 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:18] [INFO ] Deduced a trap composed of 27 places in 1224 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:06:19] [INFO ] Deduced a trap composed of 53 places in 1337 ms of which 153 ms to minimize.
SMT process timed out in 78929ms, 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 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4007/4007 transitions.
Applied a total of 0 rules in 141 ms. Remains 982 /982 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 982/982 places, 4007/4007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4007/4007 transitions.
Applied a total of 0 rules in 144 ms. Remains 982 /982 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
[2025-06-03 14:06:19] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2025-06-03 14:06:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:06:21] [INFO ] Implicit Places using invariants in 2296 ms returned []
[2025-06-03 14:06:22] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2025-06-03 14:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:06:23] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-03 14:06:53] [INFO ] Performed 245/982 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 14:07:24] [INFO ] Performed 427/982 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 14:07:54] [INFO ] Performed 634/982 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-03 14:08:26] [INFO ] Performed 953/982 implicitness test of which 0 returned IMPLICIT in 122 seconds.
[2025-06-03 14:08:26] [INFO ] Timeout of Implicit test with SMT after 122 seconds.
[2025-06-03 14:08:26] [INFO ] Implicit Places using invariants and state equation in 124272 ms returned []
Implicit Place search using SMT with State Equation took 126571 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:08:26] [INFO ] Redundant transitions in 299 ms returned []
Running 3945 sub problems to find dead transitions.
[2025-06-03 14:08:26] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2025-06-03 14:08:26] [INFO ] Invariant cache hit.
[2025-06-03 14:08:26] [INFO ] State equation strengthened by 2450 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/980 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3945 unsolved
SMT process timed out in 36926ms, After SMT, problems are : Problem set: 0 solved, 3945 unsolved
Search for dead transitions found 0 dead transitions in 36943ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163982 ms. Remains : 982/982 places, 4007/4007 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F p0)]
Knowledge based reduction with 19 factoid took 4213 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2622/2622 transitions.
Applied a total of 0 rules in 68 ms. Remains 1182 /1182 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2025-06-03 14:09:08] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
// Phase 1: matrix 2350 rows 1182 cols
[2025-06-03 14:09:08] [INFO ] Computed 50 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:09:11] [INFO ] Implicit Places using invariants in 2782 ms returned []
[2025-06-03 14:09:11] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
[2025-06-03 14:09:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:09:12] [INFO ] State equation strengthened by 866 read => feed constraints.
[2025-06-03 14:09:42] [INFO ] Performed 897/1182 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 14:09:49] [INFO ] Implicit Places using invariants and state equation in 38397 ms returned []
Implicit Place search using SMT with State Equation took 41185 ms to find 0 implicit places.
Running 2605 sub problems to find dead transitions.
[2025-06-03 14:09:49] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
[2025-06-03 14:09:49] [INFO ] Invariant cache hit.
[2025-06-03 14:09:49] [INFO ] State equation strengthened by 866 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 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.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 1.0)
(s36 0.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 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.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 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.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 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.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 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1180 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2605 unsolved
SMT process timed out in 31810ms, After SMT, problems are : Problem set: 0 solved, 2605 unsolved
Search for dead transitions found 0 dead transitions in 31819ms
Finished structural reductions in LTL mode , in 1 iterations and 73082 ms. Remains : 1182/1182 places, 2622/2622 transitions.
Computed a total of 350 stabilizing places and 989 stable transitions
Computed a total of 350 stabilizing places and 989 stable transitions
Detected a total of 350/1182 stabilizing places and 989/2622 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1398 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (550 resets) in 614 ms. (65 steps per ms) remains 1/8 properties
BEST_FIRST walk for 37856 steps (143 resets) in 141 ms. (266 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 3059 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1376 reset in 880 ms.
Product exploration explored 100000 steps with 1375 reset in 633 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 2622/2622 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1182 transition count 2622
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 25 place count 1182 transition count 2623
Deduced a syphon composed of 39 places in 3 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 39 place count 1182 transition count 2623
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 50 place count 1171 transition count 2612
Deduced a syphon composed of 28 places in 2 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 61 place count 1171 transition count 2612
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 3 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 82 place count 1171 transition count 2612
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 1167 transition count 2608
Deduced a syphon composed of 45 places in 2 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 1167 transition count 2608
Deduced a syphon composed of 45 places in 2 ms
Applied a total of 90 rules in 618 ms. Remains 1167 /1182 variables (removed 15) and now considering 2608/2622 (removed 14) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:10:29] [INFO ] Redundant transitions in 235 ms returned []
Running 2591 sub problems to find dead transitions.
[2025-06-03 14:10:29] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1167 cols
[2025-06-03 14:10:30] [INFO ] Computed 50 invariants in 46 ms
[2025-06-03 14:10:30] [INFO ] State equation strengthened by 866 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 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.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 1.0)
(s36 0.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 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.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 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.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 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.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 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.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 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.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 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.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 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.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 0.0)
(s463 1.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 1.0)
(s474 0.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 1.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 0.0)
(s594 0.0)
(s595 1.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 0.0)
(s617 0.0)
(s618 1.0)
(s619 1.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)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 1.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 1.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 1.0)
(s783 0.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 0.0)
(s799 1.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 1.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 1.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 1.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 1.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 1.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 1.0)
(s867 0.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 0.0)
(s874 0.0)
(s875 1.0)
(s876 0.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 0.0)
(s881 1.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 1.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 1.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 1.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 1.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 1.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 1.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 1.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 1.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 1.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 1.0)
(s975 0.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 0.0)
(s980 1.0)
(s981 0.0)
(s982 1.0)
(s983 1.0)
(s984 0.0)
(s985 1.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 1.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1165 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2591 unsolved
SMT process timed out in 31897ms, After SMT, problems are : Problem set: 0 solved, 2591 unsolved
Search for dead transitions found 0 dead transitions in 31909ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1167/1182 places, 2608/2622 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32780 ms. Remains : 1167/1182 places, 2608/2622 transitions.
Built C files in :
/tmp/ltsmin6625885303422970383
[2025-06-03 14:11:01] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6625885303422970383
Running compilation step : cd /tmp/ltsmin6625885303422970383;'/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/ltsmin6625885303422970383;'/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/ltsmin6625885303422970383;'/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 5 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2622/2622 transitions.
Applied a total of 0 rules in 66 ms. Remains 1182 /1182 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2025-06-03 14:11:05] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
// Phase 1: matrix 2350 rows 1182 cols
[2025-06-03 14:11:05] [INFO ] Computed 50 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:11:07] [INFO ] Implicit Places using invariants in 2390 ms returned []
[2025-06-03 14:11:07] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
[2025-06-03 14:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:11:08] [INFO ] State equation strengthened by 866 read => feed constraints.
[2025-06-03 14:11:38] [INFO ] Performed 957/1182 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 14:11:43] [INFO ] Implicit Places using invariants and state equation in 36105 ms returned []
Implicit Place search using SMT with State Equation took 38498 ms to find 0 implicit places.
Running 2605 sub problems to find dead transitions.
[2025-06-03 14:11:43] [INFO ] Flow matrix only has 2350 transitions (discarded 272 similar events)
[2025-06-03 14:11:43] [INFO ] Invariant cache hit.
[2025-06-03 14:11:43] [INFO ] State equation strengthened by 866 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/1180 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2605 unsolved
SMT process timed out in 32001ms, After SMT, problems are : Problem set: 0 solved, 2605 unsolved
Search for dead transitions found 0 dead transitions in 32012ms
Finished structural reductions in LTL mode , in 1 iterations and 70587 ms. Remains : 1182/1182 places, 2622/2622 transitions.
Built C files in :
/tmp/ltsmin56954475606928543
[2025-06-03 14:12:15] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin56954475606928543
Running compilation step : cd /tmp/ltsmin56954475606928543;'/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/ltsmin56954475606928543;'/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/ltsmin56954475606928543;'/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 14:12:18] [INFO ] Flatten gal took : 71 ms
[2025-06-03 14:12:18] [INFO ] Flatten gal took : 68 ms
[2025-06-03 14:12:18] [INFO ] Time to serialize gal into /tmp/LTL9376940046222383978.gal : 12 ms
[2025-06-03 14:12:18] [INFO ] Time to serialize properties into /tmp/LTL14753177591288334652.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/LTL9376940046222383978.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10558434454990716792.hoa' '-atoms' '/tmp/LTL14753177591288334652.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/LTL14753177591288334652.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10558434454990716792.hoa
Detected timeout of ITS tools.
[2025-06-03 14:12:34] [INFO ] Flatten gal took : 63 ms
[2025-06-03 14:12:34] [INFO ] Flatten gal took : 64 ms
[2025-06-03 14:12:34] [INFO ] Time to serialize gal into /tmp/LTL1934865109347793461.gal : 11 ms
[2025-06-03 14:12:34] [INFO ] Time to serialize properties into /tmp/LTL11214661080668558897.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/LTL1934865109347793461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11214661080668558897.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 : !((X(G((("(Node3HasTheLeafSetOfRx4ToReplaceNode13>=1)")||(X("((Node1HasAskedItsLeafSetToLx6ToReplaceNode3<1)||(LeafSetOfLx6IsSentToNod...257
Formula 0 simplified : XF(!"(Node3HasTheLeafSetOfRx4ToReplaceNode13>=1)" & X!"((Node1HasAskedItsLeafSetToLx6ToReplaceNode3<1)||(LeafSetOfLx6IsSentToNode1<1...245
Detected timeout of ITS tools.
[2025-06-03 14:12:49] [INFO ] Flatten gal took : 64 ms
[2025-06-03 14:12:49] [INFO ] Applying decomposition
[2025-06-03 14:12:49] [INFO ] Flatten gal took : 64 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/graph9350135691129023983.txt' '-o' '/tmp/graph9350135691129023983.bin' '-w' '/tmp/graph9350135691129023983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9350135691129023983.bin' '-l' '-1' '-v' '-w' '/tmp/graph9350135691129023983.weights' '-q' '0' '-e' '0.001'
[2025-06-03 14:12:49] [INFO ] Decomposing Gal with order
[2025-06-03 14:12:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 14:12:49] [INFO ] Removed a total of 2941 redundant transitions.
[2025-06-03 14:12:49] [INFO ] Flatten gal took : 237 ms
[2025-06-03 14:12:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1654 labels/synchronizations in 139 ms.
[2025-06-03 14:12:50] [INFO ] Time to serialize gal into /tmp/LTL17685470232087316680.gal : 28 ms
[2025-06-03 14:12:50] [INFO ] Time to serialize properties into /tmp/LTL15400415055120605744.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/LTL17685470232087316680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15400415055120605744.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 : !((X(G((("(i17.i1.u82.Node3HasTheLeafSetOfRx4ToReplaceNode13>=1)")||(X("((i1.i2.u8.Node1HasAskedItsLeafSetToLx6ToReplaceNode3<1)||(i1....311
Formula 0 simplified : XF(!"(i17.i1.u82.Node3HasTheLeafSetOfRx4ToReplaceNode13>=1)" & X!"((i1.i2.u8.Node1HasAskedItsLeafSetToLx6ToReplaceNode3<1)||(i1.i2.u...299
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10 finished in 586451 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(!p0) U ((!p1&&X(!p0))||X(G(!p0)))) U ((F(p2) U p3)&&X(X(F(p1))))))'
Support contains 8 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 2963/2963 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1287 transition count 2887
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1287 transition count 2887
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 75 place count 1268 transition count 2808
Iterating global reduction 0 with 19 rules applied. Total rules applied 94 place count 1268 transition count 2808
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 1259 transition count 2745
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 1259 transition count 2745
Applied a total of 112 rules in 281 ms. Remains 1259 /1315 variables (removed 56) and now considering 2745/2963 (removed 218) transitions.
[2025-06-03 14:13:05] [INFO ] Flow matrix only has 2473 transitions (discarded 272 similar events)
// Phase 1: matrix 2473 rows 1259 cols
[2025-06-03 14:13:05] [INFO ] Computed 70 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:08] [INFO ] Implicit Places using invariants in 3050 ms returned [102, 189, 295, 304, 437, 438, 534, 535, 557, 571, 572, 603, 628, 629, 650, 677, 708, 731, 787, 942, 1051, 1052]
[2025-06-03 14:13:08] [INFO ] Actually due to overlaps returned [295, 787, 102, 189, 304, 437, 438, 534, 535, 557, 571, 572, 603, 628, 629, 650, 677, 708, 942, 1051]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 3054 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1239/1315 places, 2745/2963 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1221 transition count 2727
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1221 transition count 2727
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1203 transition count 2709
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1203 transition count 2709
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1185 transition count 2691
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1185 transition count 2691
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 122 place count 1171 transition count 2593
Iterating global reduction 0 with 14 rules applied. Total rules applied 136 place count 1171 transition count 2593
Applied a total of 136 rules in 348 ms. Remains 1171 /1239 variables (removed 68) and now considering 2593/2745 (removed 152) transitions.
[2025-06-03 14:13:08] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1171 cols
[2025-06-03 14:13:08] [INFO ] Computed 50 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:10] [INFO ] Implicit Places using invariants in 2068 ms returned [672, 984]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2084 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1169/1315 places, 2593/2963 transitions.
Applied a total of 0 rules in 67 ms. Remains 1169 /1169 variables (removed 0) and now considering 2593/2593 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5837 ms. Remains : 1169/1315 places, 2593/2963 transitions.
Stuttering acceptance computed with spot in 535 ms :[(OR (NOT p3) (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) p3 (NOT p1)), (NOT p3), (NOT p1), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-11 finished in 6442 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)||G(p1)))'
Support contains 5 out of 1315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1315/1315 places, 2963/2963 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 1315 transition count 2934
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1286 transition count 2934
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 58 place count 1286 transition count 2907
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 112 place count 1259 transition count 2907
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 132 place count 1239 transition count 2833
Iterating global reduction 2 with 20 rules applied. Total rules applied 152 place count 1239 transition count 2833
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 152 place count 1239 transition count 2830
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 158 place count 1236 transition count 2830
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 168 place count 1226 transition count 2760
Iterating global reduction 2 with 10 rules applied. Total rules applied 178 place count 1226 transition count 2760
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 234 place count 1198 transition count 2732
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 244 place count 1188 transition count 2722
Iterating global reduction 2 with 10 rules applied. Total rules applied 254 place count 1188 transition count 2722
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 264 place count 1178 transition count 2652
Iterating global reduction 2 with 10 rules applied. Total rules applied 274 place count 1178 transition count 2652
Applied a total of 274 rules in 543 ms. Remains 1178 /1315 variables (removed 137) and now considering 2652/2963 (removed 311) transitions.
[2025-06-03 14:13:12] [INFO ] Flow matrix only has 2380 transitions (discarded 272 similar events)
// Phase 1: matrix 2380 rows 1178 cols
[2025-06-03 14:13:12] [INFO ] Computed 70 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:14] [INFO ] Implicit Places using invariants in 2488 ms returned [93, 159, 263, 271, 325, 398, 399, 491, 492, 511, 525, 526, 553, 576, 577, 595, 620, 649, 672, 726, 879, 986, 987]
[2025-06-03 14:13:14] [INFO ] Actually due to overlaps returned [263, 726, 93, 159, 271, 325, 398, 399, 491, 492, 511, 525, 526, 553, 576, 577, 595, 620, 649, 879, 986]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 2490 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1157/1315 places, 2652/2963 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1144 transition count 2639
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1144 transition count 2639
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1131 transition count 2626
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1131 transition count 2626
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 1122 transition count 2563
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 1122 transition count 2563
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 1116 transition count 2557
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 1110 transition count 2551
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 1110 transition count 2551
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 1104 transition count 2509
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 1104 transition count 2509
Applied a total of 106 rules in 562 ms. Remains 1104 /1157 variables (removed 53) and now considering 2509/2652 (removed 143) transitions.
[2025-06-03 14:13:15] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1104 cols
[2025-06-03 14:13:15] [INFO ] Computed 49 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:17] [INFO ] Implicit Places using invariants in 2151 ms returned [625, 933]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2152 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1102/1315 places, 2509/2963 transitions.
Applied a total of 0 rules in 108 ms. Remains 1102 /1102 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5857 ms. Remains : 1102/1315 places, 2509/2963 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-12 finished in 5945 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(p0)&&G((p1||X(G(p2))))))'
Support contains 7 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1315/1315 places, 2963/2963 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1287 transition count 2887
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1287 transition count 2887
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 75 place count 1268 transition count 2808
Iterating global reduction 0 with 19 rules applied. Total rules applied 94 place count 1268 transition count 2808
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 1259 transition count 2745
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 1259 transition count 2745
Applied a total of 112 rules in 280 ms. Remains 1259 /1315 variables (removed 56) and now considering 2745/2963 (removed 218) transitions.
[2025-06-03 14:13:17] [INFO ] Flow matrix only has 2473 transitions (discarded 272 similar events)
// Phase 1: matrix 2473 rows 1259 cols
[2025-06-03 14:13:17] [INFO ] Computed 70 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:20] [INFO ] Implicit Places using invariants in 3159 ms returned [102, 189, 304, 358, 434, 435, 531, 532, 554, 568, 569, 628, 629, 650, 677, 708, 731, 787, 943, 1052]
[2025-06-03 14:13:20] [INFO ] Actually due to overlaps returned [787, 102, 189, 304, 358, 434, 435, 531, 532, 554, 568, 569, 628, 629, 650, 677, 708, 943, 1052]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 3162 ms to find 19 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1240/1315 places, 2745/2963 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1222 transition count 2727
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1222 transition count 2727
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1204 transition count 2709
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1204 transition count 2709
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1186 transition count 2691
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1186 transition count 2691
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 122 place count 1172 transition count 2593
Iterating global reduction 0 with 14 rules applied. Total rules applied 136 place count 1172 transition count 2593
Applied a total of 136 rules in 463 ms. Remains 1172 /1240 variables (removed 68) and now considering 2593/2745 (removed 152) transitions.
[2025-06-03 14:13:21] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1172 cols
[2025-06-03 14:13:21] [INFO ] Computed 51 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:23] [INFO ] Implicit Places using invariants in 2401 ms returned [673]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2423 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1171/1315 places, 2593/2963 transitions.
Applied a total of 0 rules in 66 ms. Remains 1171 /1171 variables (removed 0) and now considering 2593/2593 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6395 ms. Remains : 1171/1315 places, 2593/2963 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-14 finished in 6568 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)||G((F(p1)&&F(G(p0))))))'
Support contains 6 out of 1315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1315/1315 places, 2963/2963 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 1315 transition count 2934
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1286 transition count 2934
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 1286 transition count 2910
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 1262 transition count 2910
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 123 place count 1245 transition count 2839
Iterating global reduction 2 with 17 rules applied. Total rules applied 140 place count 1245 transition count 2839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 140 place count 1245 transition count 2838
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 1244 transition count 2838
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 149 place count 1237 transition count 2789
Iterating global reduction 2 with 7 rules applied. Total rules applied 156 place count 1237 transition count 2789
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 7 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 218 place count 1206 transition count 2758
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 228 place count 1196 transition count 2748
Iterating global reduction 2 with 10 rules applied. Total rules applied 238 place count 1196 transition count 2748
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 248 place count 1186 transition count 2678
Iterating global reduction 2 with 10 rules applied. Total rules applied 258 place count 1186 transition count 2678
Applied a total of 258 rules in 731 ms. Remains 1186 /1315 variables (removed 129) and now considering 2678/2963 (removed 285) transitions.
[2025-06-03 14:13:24] [INFO ] Flow matrix only has 2406 transitions (discarded 272 similar events)
// Phase 1: matrix 2406 rows 1186 cols
[2025-06-03 14:13:24] [INFO ] Computed 70 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:27] [INFO ] Implicit Places using invariants in 2766 ms returned [95, 161, 265, 273, 327, 400, 401, 493, 494, 529, 530, 558, 581, 582, 600, 657, 680, 734, 886, 994]
[2025-06-03 14:13:27] [INFO ] Actually due to overlaps returned [265, 734, 95, 161, 273, 327, 400, 401, 493, 494, 529, 530, 558, 581, 582, 600, 657, 886]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 2779 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1168/1315 places, 2678/2963 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1159 transition count 2669
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1159 transition count 2669
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1150 transition count 2660
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1150 transition count 2660
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1145 transition count 2625
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1145 transition count 2625
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 60 place count 1138 transition count 2618
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 1131 transition count 2611
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 1131 transition count 2611
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 1124 transition count 2562
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 1124 transition count 2562
Applied a total of 88 rules in 769 ms. Remains 1124 /1168 variables (removed 44) and now considering 2562/2678 (removed 116) transitions.
[2025-06-03 14:13:28] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1124 cols
[2025-06-03 14:13:28] [INFO ] Computed 52 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:30] [INFO ] Implicit Places using invariants in 2158 ms returned [639, 948]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2164 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1122/1315 places, 2562/2963 transitions.
Applied a total of 0 rules in 167 ms. Remains 1122 /1122 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6625 ms. Remains : 1122/1315 places, 2562/2963 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-15 finished in 6779 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&&G(p1))))'
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 X((X(X(p2))||G(!p1))))))'
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 U !p1))))'
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)))'
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(G((p0||X(p1)||G(p2)))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2)]
Support contains 5 out of 1315 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1315/1315 places, 2963/2963 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 1315 transition count 2935
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1287 transition count 2935
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 56 place count 1287 transition count 2910
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 106 place count 1262 transition count 2910
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 124 place count 1244 transition count 2838
Iterating global reduction 2 with 18 rules applied. Total rules applied 142 place count 1244 transition count 2838
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 142 place count 1244 transition count 2836
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 146 place count 1242 transition count 2836
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 1234 transition count 2780
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 1234 transition count 2780
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 222 place count 1204 transition count 2750
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 231 place count 1195 transition count 2741
Iterating global reduction 2 with 9 rules applied. Total rules applied 240 place count 1195 transition count 2741
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 249 place count 1186 transition count 2678
Iterating global reduction 2 with 9 rules applied. Total rules applied 258 place count 1186 transition count 2678
Applied a total of 258 rules in 835 ms. Remains 1186 /1315 variables (removed 129) and now considering 2678/2963 (removed 285) transitions.
[2025-06-03 14:13:32] [INFO ] Flow matrix only has 2406 transitions (discarded 272 similar events)
// Phase 1: matrix 2406 rows 1186 cols
[2025-06-03 14:13:32] [INFO ] Computed 70 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:35] [INFO ] Implicit Places using invariants in 2537 ms returned [93, 267, 275, 329, 402, 498, 499, 518, 532, 563, 586, 587, 605, 630, 659, 682, 736, 888, 995, 996]
[2025-06-03 14:13:35] [INFO ] Actually due to overlaps returned [267, 736, 93, 275, 329, 402, 498, 499, 518, 532, 563, 586, 587, 605, 630, 659, 888, 995]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 2539 ms to find 18 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1168/1315 places, 2678/2963 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1159 transition count 2669
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1159 transition count 2669
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1150 transition count 2660
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1150 transition count 2660
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 1146 transition count 2632
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 1146 transition count 2632
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 58 place count 1139 transition count 2625
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 1132 transition count 2618
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 1132 transition count 2618
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 1124 transition count 2562
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 1124 transition count 2562
Applied a total of 88 rules in 652 ms. Remains 1124 /1168 variables (removed 44) and now considering 2562/2678 (removed 116) transitions.
[2025-06-03 14:13:35] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1124 cols
[2025-06-03 14:13:35] [INFO ] Computed 52 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:13:37] [INFO ] Implicit Places using invariants in 1998 ms returned [644, 951]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2015 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1122/1315 places, 2562/2963 transitions.
Applied a total of 0 rules in 83 ms. Remains 1122 /1122 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 6126 ms. Remains : 1122/1315 places, 2562/2963 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10
Product exploration explored 100000 steps with 1951 reset in 865 ms.
Product exploration explored 100000 steps with 1955 reset in 733 ms.
Computed a total of 307 stabilizing places and 946 stable transitions
Computed a total of 307 stabilizing places and 946 stable transitions
Detected a total of 307/1122 stabilizing places and 946/2562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1262 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (778 resets) in 775 ms. (51 steps per ms) remains 3/10 properties
BEST_FIRST walk for 40002 steps (164 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (164 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (164 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
[2025-06-03 14:13:41] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1122 cols
[2025-06-03 14:13:41] [INFO ] Computed 50 invariants in 34 ms
[2025-06-03 14:13:41] [INFO ] State equation strengthened by 866 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, 3 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 80/84 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 979/1063 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1063 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/1108 variables, 29/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1108 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/1122 variables, 14/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1122 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2290/3412 variables, 1122/1172 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3412 variables, 866/2038 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3412 variables, 0/2038 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3412 variables, 0/2038 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3412/3412 variables, and 2038 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2291 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1122/1122 constraints, ReadFeed: 866/866 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 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: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/84 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 979/1063 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:13:45] [INFO ] Deduced a trap composed of 61 places in 1394 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:13:46] [INFO ] Deduced a trap composed of 65 places in 827 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:13:47] [INFO ] Deduced a trap composed of 65 places in 1263 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:13:48] [INFO ] Deduced a trap composed of 65 places in 1034 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:13:49] [INFO ] Deduced a trap composed of 65 places in 875 ms of which 107 ms to minimize.
SMT process timed out in 8126ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1122/1122 places, 2562/2562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1122 transition count 2561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1121 transition count 2561
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1120 transition count 2560
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1120 transition count 2560
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1119 transition count 2553
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1119 transition count 2553
Free-agglomeration rule (complex) applied 136 times.
Iterating global reduction 2 with 136 rules applied. Total rules applied 142 place count 1119 transition count 4007
Reduce places removed 136 places and 0 transitions.
Iterating post reduction 2 with 136 rules applied. Total rules applied 278 place count 983 transition count 4007
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 279 place count 983 transition count 4007
Applied a total of 279 rules in 695 ms. Remains 983 /1122 variables (removed 139) and now considering 4007/2562 (removed -1445) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 695 ms. Remains : 983/1122 places, 4007/2562 transitions.
RANDOM walk for 40000 steps (961 resets) in 1490 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (127 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 52361 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 52361 steps, saw 22059 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 14:13:54] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
// Phase 1: matrix 3609 rows 983 cols
[2025-06-03 14:13:54] [INFO ] Computed 50 invariants in 132 ms
[2025-06-03 14:13:54] [INFO ] State equation strengthened by 2450 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) 885/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/941 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/941 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/969 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/969 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/983 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/983 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3609/4592 variables, 983/1033 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4592 variables, 2450/3483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4592 variables, 0/3483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4592 variables, 0/3483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4592/4592 variables, and 3483 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3582 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2450/2450 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) 885/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/941 variables, 5/8 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 14:14:00] [INFO ] Deduced a trap composed of 5 places in 1684 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:01] [INFO ] Deduced a trap composed of 51 places in 1654 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:03] [INFO ] Deduced a trap composed of 51 places in 1464 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:04] [INFO ] Deduced a trap composed of 51 places in 1147 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:05] [INFO ] Deduced a trap composed of 51 places in 1347 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:06] [INFO ] Deduced a trap composed of 51 places in 1154 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:08] [INFO ] Deduced a trap composed of 51 places in 1406 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:09] [INFO ] Deduced a trap composed of 51 places in 1591 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:11] [INFO ] Deduced a trap composed of 51 places in 1218 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:12] [INFO ] Deduced a trap composed of 51 places in 1464 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:14] [INFO ] Deduced a trap composed of 51 places in 1336 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:15] [INFO ] Deduced a trap composed of 51 places in 1759 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:17] [INFO ] Deduced a trap composed of 27 places in 1682 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:19] [INFO ] Deduced a trap composed of 51 places in 1461 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:20] [INFO ] Deduced a trap composed of 51 places in 1463 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:22] [INFO ] Deduced a trap composed of 51 places in 1519 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:23] [INFO ] Deduced a trap composed of 51 places in 1381 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:24] [INFO ] Deduced a trap composed of 51 places in 1252 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:26] [INFO ] Deduced a trap composed of 51 places in 1755 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:28] [INFO ] Deduced a trap composed of 51 places in 1648 ms of which 146 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/941 variables, 20/28 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 14:14:29] [INFO ] Deduced a trap composed of 51 places in 1473 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:31] [INFO ] Deduced a trap composed of 51 places in 1666 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:33] [INFO ] Deduced a trap composed of 46 places in 1635 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:34] [INFO ] Deduced a trap composed of 51 places in 1468 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:36] [INFO ] Deduced a trap composed of 51 places in 1622 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:37] [INFO ] Deduced a trap composed of 51 places in 1550 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:39] [INFO ] Deduced a trap composed of 51 places in 1515 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:40] [INFO ] Deduced a trap composed of 51 places in 1359 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:42] [INFO ] Deduced a trap composed of 51 places in 1494 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:43] [INFO ] Deduced a trap composed of 51 places in 1520 ms of which 138 ms to minimize.
SMT process timed out in 49803ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4007/4007 transitions.
Applied a total of 0 rules in 196 ms. Remains 983 /983 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 983/983 places, 4007/4007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4007/4007 transitions.
Applied a total of 0 rules in 223 ms. Remains 983 /983 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
[2025-06-03 14:14:44] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2025-06-03 14:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:14:47] [INFO ] Implicit Places using invariants in 2948 ms returned [341]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2953 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 982/983 places, 4007/4007 transitions.
Applied a total of 0 rules in 153 ms. Remains 982 /982 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3330 ms. Remains : 982/983 places, 4007/4007 transitions.
RANDOM walk for 40000 steps (961 resets) in 1519 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (130 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (128 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 53064 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 53064 steps, saw 22351 distinct states, run finished after 3004 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 14:14:50] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
// Phase 1: matrix 3609 rows 982 cols
[2025-06-03 14:14:51] [INFO ] Computed 49 invariants in 30 ms
[2025-06-03 14:14:51] [INFO ] State equation strengthened by 2450 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) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 851/923 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/968 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/968 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/982 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3609/4591 variables, 982/1031 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4591 variables, 2450/3481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4591 variables, 0/3481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/4591 variables, 0/3481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4591/4591 variables, and 3481 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5142 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 982/982 constraints, ReadFeed: 2450/2450 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) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 851/923 variables, 4/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 14:14:57] [INFO ] Deduced a trap composed of 52 places in 1119 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:58] [INFO ] Deduced a trap composed of 52 places in 1155 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:14:59] [INFO ] Deduced a trap composed of 52 places in 1214 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:01] [INFO ] Deduced a trap composed of 52 places in 1465 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:02] [INFO ] Deduced a trap composed of 52 places in 1452 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:04] [INFO ] Deduced a trap composed of 52 places in 1328 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:05] [INFO ] Deduced a trap composed of 52 places in 1336 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:06] [INFO ] Deduced a trap composed of 52 places in 1333 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:08] [INFO ] Deduced a trap composed of 52 places in 1424 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:09] [INFO ] Deduced a trap composed of 52 places in 1418 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:11] [INFO ] Deduced a trap composed of 52 places in 1140 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:12] [INFO ] Deduced a trap composed of 52 places in 1383 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:13] [INFO ] Deduced a trap composed of 52 places in 1353 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:15] [INFO ] Deduced a trap composed of 52 places in 1368 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:16] [INFO ] Deduced a trap composed of 52 places in 1220 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:17] [INFO ] Deduced a trap composed of 52 places in 1214 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:19] [INFO ] Deduced a trap composed of 52 places in 1286 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:20] [INFO ] Deduced a trap composed of 52 places in 1267 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:21] [INFO ] Deduced a trap composed of 52 places in 1192 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:22] [INFO ] Deduced a trap composed of 52 places in 1042 ms of which 81 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/923 variables, 20/26 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 14:15:24] [INFO ] Deduced a trap composed of 53 places in 1396 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:25] [INFO ] Deduced a trap composed of 53 places in 1397 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:26] [INFO ] Deduced a trap composed of 53 places in 1325 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:27] [INFO ] Deduced a trap composed of 54 places in 1176 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:29] [INFO ] Deduced a trap composed of 94 places in 1062 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:30] [INFO ] Deduced a trap composed of 53 places in 1324 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:31] [INFO ] Deduced a trap composed of 53 places in 1359 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:33] [INFO ] Deduced a trap composed of 53 places in 1352 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:34] [INFO ] Deduced a trap composed of 53 places in 1341 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:35] [INFO ] Deduced a trap composed of 55 places in 1198 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:37] [INFO ] Deduced a trap composed of 53 places in 1361 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:38] [INFO ] Deduced a trap composed of 53 places in 1325 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:39] [INFO ] Deduced a trap composed of 53 places in 1377 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:40] [INFO ] Deduced a trap composed of 96 places in 968 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:42] [INFO ] Deduced a trap composed of 113 places in 1072 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:43] [INFO ] Deduced a trap composed of 117 places in 1029 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:44] [INFO ] Deduced a trap composed of 107 places in 1085 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:45] [INFO ] Deduced a trap composed of 110 places in 1108 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:46] [INFO ] Deduced a trap composed of 126 places in 983 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:47] [INFO ] Deduced a trap composed of 131 places in 1032 ms of which 102 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/923 variables, 20/46 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 14:15:48] [INFO ] Deduced a trap composed of 82 places in 1202 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:50] [INFO ] Deduced a trap composed of 55 places in 1295 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:51] [INFO ] Deduced a trap composed of 55 places in 1345 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:52] [INFO ] Deduced a trap composed of 95 places in 877 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:53] [INFO ] Deduced a trap composed of 55 places in 1179 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:54] [INFO ] Deduced a trap composed of 95 places in 871 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:55] [INFO ] Deduced a trap composed of 95 places in 909 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:56] [INFO ] Deduced a trap composed of 54 places in 1431 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:58] [INFO ] Deduced a trap composed of 54 places in 1263 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:15:59] [INFO ] Deduced a trap composed of 54 places in 1347 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:00] [INFO ] Deduced a trap composed of 54 places in 1208 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:02] [INFO ] Deduced a trap composed of 54 places in 1167 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:03] [INFO ] Deduced a trap composed of 55 places in 1254 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:04] [INFO ] Deduced a trap composed of 83 places in 1101 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:05] [INFO ] Deduced a trap composed of 97 places in 1043 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:06] [INFO ] Deduced a trap composed of 97 places in 911 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:07] [INFO ] Deduced a trap composed of 111 places in 1135 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:08] [INFO ] Deduced a trap composed of 104 places in 1200 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:10] [INFO ] Deduced a trap composed of 118 places in 1193 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:16:11] [INFO ] Deduced a trap composed of 118 places in 1095 ms of which 96 ms to minimize.
SMT process timed out in 80248ms, 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 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4007/4007 transitions.
Applied a total of 0 rules in 267 ms. Remains 982 /982 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 982/982 places, 4007/4007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4007/4007 transitions.
Applied a total of 0 rules in 232 ms. Remains 982 /982 variables (removed 0) and now considering 4007/4007 (removed 0) transitions.
[2025-06-03 14:16:11] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2025-06-03 14:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:16:14] [INFO ] Implicit Places using invariants in 3141 ms returned []
[2025-06-03 14:16:14] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2025-06-03 14:16:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:16:16] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-03 14:16:47] [INFO ] Performed 356/982 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 14:17:17] [INFO ] Performed 548/982 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 14:17:49] [INFO ] Performed 948/982 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2025-06-03 14:17:55] [INFO ] Implicit Places using invariants and state equation in 101085 ms returned []
Implicit Place search using SMT with State Equation took 104233 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:17:56] [INFO ] Redundant transitions in 324 ms returned []
Running 3945 sub problems to find dead transitions.
[2025-06-03 14:17:56] [INFO ] Flow matrix only has 3609 transitions (discarded 398 similar events)
[2025-06-03 14:17:56] [INFO ] Invariant cache hit.
[2025-06-03 14:17:56] [INFO ] State equation strengthened by 2450 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/980 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3945 unsolved
SMT process timed out in 36183ms, After SMT, problems are : Problem set: 0 solved, 3945 unsolved
Search for dead transitions found 0 dead transitions in 36194ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141014 ms. Remains : 982/982 places, 4007/4007 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F p0)]
Knowledge based reduction with 19 factoid took 3808 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 1122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1122/1122 places, 2562/2562 transitions.
Applied a total of 0 rules in 111 ms. Remains 1122 /1122 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
[2025-06-03 14:18:36] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1122 cols
[2025-06-03 14:18:36] [INFO ] Computed 50 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:18:39] [INFO ] Implicit Places using invariants in 2151 ms returned []
[2025-06-03 14:18:39] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2025-06-03 14:18:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:18:40] [INFO ] State equation strengthened by 866 read => feed constraints.
[2025-06-03 14:19:08] [INFO ] Implicit Places using invariants and state equation in 29857 ms returned []
Implicit Place search using SMT with State Equation took 32015 ms to find 0 implicit places.
Running 2545 sub problems to find dead transitions.
[2025-06-03 14:19:08] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2025-06-03 14:19:08] [INFO ] Invariant cache hit.
[2025-06-03 14:19:08] [INFO ] State equation strengthened by 866 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1120 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2545 unsolved
SMT process timed out in 31986ms, After SMT, problems are : Problem set: 0 solved, 2545 unsolved
Search for dead transitions found 0 dead transitions in 31999ms
Finished structural reductions in LTL mode , in 1 iterations and 64141 ms. Remains : 1122/1122 places, 2562/2562 transitions.
Computed a total of 307 stabilizing places and 946 stable transitions
Computed a total of 307 stabilizing places and 946 stable transitions
Detected a total of 307/1122 stabilizing places and 946/2562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1162 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (779 resets) in 521 ms. (76 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (164 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
[2025-06-03 14:19:42] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2025-06-03 14:19:42] [INFO ] Invariant cache hit.
[2025-06-03 14:19:42] [INFO ] State equation strengthened by 866 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) 81/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 980/1063 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:19:44] [INFO ] Deduced a trap composed of 61 places in 1475 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:19:45] [INFO ] Deduced a trap composed of 62 places in 1308 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:19:47] [INFO ] Deduced a trap composed of 62 places in 1425 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:19:48] [INFO ] Deduced a trap composed of 62 places in 1249 ms of which 119 ms to minimize.
SMT process timed out in 5974ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1122/1122 places, 2562/2562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1122 transition count 2561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1121 transition count 2561
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1121 transition count 2560
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1120 transition count 2560
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1118 transition count 2558
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1118 transition count 2558
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1116 transition count 2544
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1116 transition count 2544
Free-agglomeration rule (complex) applied 135 times.
Iterating global reduction 2 with 135 rules applied. Total rules applied 147 place count 1116 transition count 4005
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 2 with 135 rules applied. Total rules applied 282 place count 981 transition count 4005
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 284 place count 981 transition count 4005
Applied a total of 284 rules in 927 ms. Remains 981 /1122 variables (removed 141) and now considering 4005/2562 (removed -1443) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 927 ms. Remains : 981/1122 places, 4005/2562 transitions.
RANDOM walk for 40000 steps (964 resets) in 1336 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (129 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 53088 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 1
Probabilistic random walk after 53088 steps, saw 22360 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 14:19:53] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
// Phase 1: matrix 3607 rows 981 cols
[2025-06-03 14:19:53] [INFO ] Computed 50 invariants in 33 ms
[2025-06-03 14:19:53] [INFO ] State equation strengthened by 2450 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) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/887 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/939 variables, 5/8 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 14:19:55] [INFO ] Deduced a trap composed of 5 places in 1619 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:19:56] [INFO ] Deduced a trap composed of 53 places in 1436 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:19:58] [INFO ] Deduced a trap composed of 54 places in 1442 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:19:59] [INFO ] Deduced a trap composed of 54 places in 1458 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:01] [INFO ] Deduced a trap composed of 53 places in 1534 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:02] [INFO ] Deduced a trap composed of 53 places in 1496 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:04] [INFO ] Deduced a trap composed of 53 places in 1520 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:05] [INFO ] Deduced a trap composed of 53 places in 1394 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:06] [INFO ] Deduced a trap composed of 53 places in 1270 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:08] [INFO ] Deduced a trap composed of 53 places in 1390 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:09] [INFO ] Deduced a trap composed of 53 places in 1416 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:11] [INFO ] Deduced a trap composed of 53 places in 1502 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:12] [INFO ] Deduced a trap composed of 53 places in 1388 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:14] [INFO ] Deduced a trap composed of 53 places in 1295 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:15] [INFO ] Deduced a trap composed of 54 places in 1346 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:16] [INFO ] Deduced a trap composed of 54 places in 1468 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:18] [INFO ] Deduced a trap composed of 54 places in 1467 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:19] [INFO ] Deduced a trap composed of 55 places in 1416 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:21] [INFO ] Deduced a trap composed of 89 places in 1551 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:22] [INFO ] Deduced a trap composed of 95 places in 1183 ms of which 76 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 20/28 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 14:20:24] [INFO ] Deduced a trap composed of 54 places in 1612 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:25] [INFO ] Deduced a trap composed of 54 places in 1608 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:27] [INFO ] Deduced a trap composed of 54 places in 1433 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:28] [INFO ] Deduced a trap composed of 54 places in 1232 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:29] [INFO ] Deduced a trap composed of 54 places in 1331 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:31] [INFO ] Deduced a trap composed of 54 places in 1730 ms of which 99 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/939 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/967 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/981 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3607/4588 variables, 981/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4588 variables, 2450/3507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4588 variables, 0/3507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4588 variables, 0/3507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4588/4588 variables, and 3507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 41184 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 981/981 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 26/26 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) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/887 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/939 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 26/34 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 14:20:36] [INFO ] Deduced a trap composed of 53 places in 1551 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:37] [INFO ] Deduced a trap composed of 53 places in 1623 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:39] [INFO ] Deduced a trap composed of 53 places in 1718 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:41] [INFO ] Deduced a trap composed of 27 places in 1408 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:42] [INFO ] Deduced a trap composed of 53 places in 1715 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:44] [INFO ] Deduced a trap composed of 27 places in 1646 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:46] [INFO ] Deduced a trap composed of 53 places in 1433 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:47] [INFO ] Deduced a trap composed of 53 places in 1545 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:48] [INFO ] Deduced a trap composed of 46 places in 1303 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:50] [INFO ] Deduced a trap composed of 53 places in 1244 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:51] [INFO ] Deduced a trap composed of 53 places in 1742 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:53] [INFO ] Deduced a trap composed of 53 places in 1646 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:55] [INFO ] Deduced a trap composed of 53 places in 1438 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:56] [INFO ] Deduced a trap composed of 53 places in 1384 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:57] [INFO ] Deduced a trap composed of 53 places in 1386 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:20:59] [INFO ] Deduced a trap composed of 53 places in 1359 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:00] [INFO ] Deduced a trap composed of 53 places in 1193 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:01] [INFO ] Deduced a trap composed of 53 places in 1353 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:03] [INFO ] Deduced a trap composed of 53 places in 1337 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:04] [INFO ] Deduced a trap composed of 53 places in 1191 ms of which 97 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/939 variables, 20/54 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 14:21:05] [INFO ] Deduced a trap composed of 53 places in 1296 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:06] [INFO ] Deduced a trap composed of 53 places in 1130 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:08] [INFO ] Deduced a trap composed of 53 places in 1516 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:09] [INFO ] Deduced a trap composed of 53 places in 1408 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:11] [INFO ] Deduced a trap composed of 53 places in 1356 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:12] [INFO ] Deduced a trap composed of 53 places in 1186 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:13] [INFO ] Deduced a trap composed of 53 places in 1181 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:14] [INFO ] Deduced a trap composed of 53 places in 1303 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:16] [INFO ] Deduced a trap composed of 53 places in 1263 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:17] [INFO ] Deduced a trap composed of 53 places in 1166 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:18] [INFO ] Deduced a trap composed of 53 places in 1218 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 14:21:20] [INFO ] Deduced a trap composed of 53 places in 1301 ms of which 152 ms to minimize.
SMT process timed out in 86937ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 981 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4005/4005 transitions.
Applied a total of 0 rules in 134 ms. Remains 981 /981 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 981/981 places, 4005/4005 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4005/4005 transitions.
Applied a total of 0 rules in 133 ms. Remains 981 /981 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
[2025-06-03 14:21:20] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
[2025-06-03 14:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:21:22] [INFO ] Implicit Places using invariants in 2562 ms returned [341, 440]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2565 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/981 places, 4005/4005 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 978 transition count 4004
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 4004
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 977 transition count 4003
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 977 transition count 4003
Applied a total of 4 rules in 219 ms. Remains 977 /979 variables (removed 2) and now considering 4003/4005 (removed 2) transitions.
[2025-06-03 14:21:23] [INFO ] Flow matrix only has 3605 transitions (discarded 398 similar events)
// Phase 1: matrix 3605 rows 977 cols
[2025-06-03 14:21:23] [INFO ] Computed 48 invariants in 64 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:21:25] [INFO ] Implicit Places using invariants in 2442 ms returned []
[2025-06-03 14:21:25] [INFO ] Flow matrix only has 3605 transitions (discarded 398 similar events)
[2025-06-03 14:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:21:27] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-03 14:21:57] [INFO ] Performed 303/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 14:22:27] [INFO ] Performed 526/977 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 14:22:58] [INFO ] Performed 936/977 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2025-06-03 14:23:08] [INFO ] Implicit Places using invariants and state equation in 102743 ms returned []
Implicit Place search using SMT with State Equation took 105192 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 977/981 places, 4003/4005 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 108110 ms. Remains : 977/981 places, 4003/4005 transitions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 16 factoid took 3261 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1952 reset in 943 ms.
Product exploration explored 100000 steps with 1951 reset in 703 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 1122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1122/1122 places, 2562/2562 transitions.
Applied a total of 0 rules in 179 ms. Remains 1122 /1122 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 14:23:14] [INFO ] Redundant transitions in 213 ms returned []
Running 2545 sub problems to find dead transitions.
[2025-06-03 14:23:14] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1122 cols
[2025-06-03 14:23:14] [INFO ] Computed 50 invariants in 40 ms
[2025-06-03 14:23:15] [INFO ] State equation strengthened by 866 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 0.0)
(s136 1.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 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.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 0.0)
(s192 1.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 0.0)
(s204 1.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 0.0)
(s217 1.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 0.0)
(s229 1.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 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.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 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1120 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2545 unsolved
SMT process timed out in 32102ms, After SMT, problems are : Problem set: 0 solved, 2545 unsolved
Search for dead transitions found 0 dead transitions in 32112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32546 ms. Remains : 1122/1122 places, 2562/2562 transitions.
Built C files in :
/tmp/ltsmin4801733304099042571
[2025-06-03 14:23:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4801733304099042571
Running compilation step : cd /tmp/ltsmin4801733304099042571;'/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/ltsmin4801733304099042571;'/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/ltsmin4801733304099042571;'/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 5 out of 1122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1122/1122 places, 2562/2562 transitions.
Applied a total of 0 rules in 111 ms. Remains 1122 /1122 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
[2025-06-03 14:23:50] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2025-06-03 14:23:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:23:52] [INFO ] Implicit Places using invariants in 2168 ms returned []
[2025-06-03 14:23:52] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2025-06-03 14:23:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 14:23:53] [INFO ] State equation strengthened by 866 read => feed constraints.
[2025-06-03 14:24:23] [INFO ] Performed 1107/1122 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 14:24:24] [INFO ] Implicit Places using invariants and state equation in 32206 ms returned []
Implicit Place search using SMT with State Equation took 34376 ms to find 0 implicit places.
Running 2545 sub problems to find dead transitions.
[2025-06-03 14:24:24] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
[2025-06-03 14:24:24] [INFO ] Invariant cache hit.
[2025-06-03 14:24:24] [INFO ] State equation strengthened by 866 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1120 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2545 unsolved
SMT process timed out in 31768ms, After SMT, problems are : Problem set: 0 solved, 2545 unsolved
Search for dead transitions found 0 dead transitions in 31775ms
Finished structural reductions in LTL mode , in 1 iterations and 66266 ms. Remains : 1122/1122 places, 2562/2562 transitions.
Built C files in :
/tmp/ltsmin3782709420258702106
[2025-06-03 14:24:56] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3782709420258702106
Running compilation step : cd /tmp/ltsmin3782709420258702106;'/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/ltsmin3782709420258702106;'/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/ltsmin3782709420258702106;'/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 14:24:59] [INFO ] Flatten gal took : 58 ms
[2025-06-03 14:24:59] [INFO ] Flatten gal took : 59 ms
[2025-06-03 14:24:59] [INFO ] Time to serialize gal into /tmp/LTL18426324277510313275.gal : 12 ms
[2025-06-03 14:24:59] [INFO ] Time to serialize properties into /tmp/LTL13275169525031897376.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/LTL18426324277510313275.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6364039250934700567.hoa' '-atoms' '/tmp/LTL13275169525031897376.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/LTL13275169525031897376.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6364039250934700567.hoa
Detected timeout of ITS tools.
[2025-06-03 14:25:14] [INFO ] Flatten gal took : 55 ms
[2025-06-03 14:25:14] [INFO ] Flatten gal took : 58 ms
[2025-06-03 14:25:14] [INFO ] Time to serialize gal into /tmp/LTL16380123888196901708.gal : 12 ms
[2025-06-03 14:25:14] [INFO ] Time to serialize properties into /tmp/LTL1541267070513167971.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/LTL16380123888196901708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1541267070513167971.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 : !((X(G((("(Node3HasTheLeafSetOfRx4ToReplaceNode13>=1)")||(X("((Node1HasAskedItsLeafSetToLx6ToReplaceNode3<1)||(LeafSetOfLx6IsSentToNod...257
Formula 0 simplified : XF(!"(Node3HasTheLeafSetOfRx4ToReplaceNode13>=1)" & X!"((Node1HasAskedItsLeafSetToLx6ToReplaceNode3<1)||(LeafSetOfLx6IsSentToNode1<1...245
Detected timeout of ITS tools.
[2025-06-03 14:25:29] [INFO ] Flatten gal took : 59 ms
[2025-06-03 14:25:29] [INFO ] Applying decomposition
[2025-06-03 14:25:30] [INFO ] Flatten gal took : 60 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/graph6863131713161865900.txt' '-o' '/tmp/graph6863131713161865900.bin' '-w' '/tmp/graph6863131713161865900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6863131713161865900.bin' '-l' '-1' '-v' '-w' '/tmp/graph6863131713161865900.weights' '-q' '0' '-e' '0.001'
[2025-06-03 14:25:30] [INFO ] Decomposing Gal with order
[2025-06-03 14:25:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 14:25:30] [INFO ] Removed a total of 2317 redundant transitions.
[2025-06-03 14:25:30] [INFO ] Flatten gal took : 384 ms
[2025-06-03 14:25:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1004 labels/synchronizations in 93 ms.
[2025-06-03 14:25:30] [INFO ] Time to serialize gal into /tmp/LTL16058320132018883093.gal : 22 ms
[2025-06-03 14:25:30] [INFO ] Time to serialize properties into /tmp/LTL7004455984460905327.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/LTL16058320132018883093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7004455984460905327.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 : !((X(G((("(i4.i1.i1.u63.Node3HasTheLeafSetOfRx4ToReplaceNode13>=1)")||(X("((i4.i0.i1.u39.Node1HasAskedItsLeafSetToLx6ToReplaceNode3<1)...322
Formula 0 simplified : XF(!"(i4.i1.i1.u63.Node3HasTheLeafSetOfRx4ToReplaceNode13>=1)" & X!"((i4.i0.i1.u39.Node1HasAskedItsLeafSetToLx6ToReplaceNode3<1)||(i...310
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C07-LTLFireability-10 finished in 734448 ms.
[2025-06-03 14:25:46] [INFO ] Flatten gal took : 126 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13502253562464386165
[2025-06-03 14:25:46] [INFO ] Too many transitions (2963) to apply POR reductions. Disabling POR matrices.
[2025-06-03 14:25:46] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13502253562464386165
Running compilation step : cd /tmp/ltsmin13502253562464386165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' '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 14:25:46] [INFO ] Applying decomposition
[2025-06-03 14:25:46] [INFO ] Flatten gal took : 131 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/graph8138452446765830474.txt' '-o' '/tmp/graph8138452446765830474.bin' '-w' '/tmp/graph8138452446765830474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8138452446765830474.bin' '-l' '-1' '-v' '-w' '/tmp/graph8138452446765830474.weights' '-q' '0' '-e' '0.001'
[2025-06-03 14:25:46] [INFO ] Decomposing Gal with order
[2025-06-03 14:25:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 14:25:46] [INFO ] Removed a total of 2474 redundant transitions.
[2025-06-03 14:25:46] [INFO ] Flatten gal took : 206 ms
[2025-06-03 14:25:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1627 labels/synchronizations in 84 ms.
[2025-06-03 14:25:47] [INFO ] Time to serialize gal into /tmp/LTLFireability15761431298870099624.gal : 23 ms
[2025-06-03 14:25:47] [INFO ] Time to serialize properties into /tmp/LTLFireability11538891310149760386.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/LTLFireability15761431298870099624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11538891310149760386.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 5 LTL properties
Checking formula 0 : !((F(("((i1.i6.u190.RequestOfNode5IsSentToLx3<1)||(i1.i4.u189.Lx3IsActiveAndNotInTheLeafSet<1))")&&(G("((i1.i2.u213.Node9HasAskedItsLe...231
Formula 0 simplified : G(!"((i1.i6.u190.RequestOfNode5IsSentToLx3<1)||(i1.i4.u189.Lx3IsActiveAndNotInTheLeafSet<1))" | F!"((i1.i2.u213.Node9HasAskedItsLeaf...225
Compilation finished in 13191 ms.
Running link step : cd /tmp/ltsmin13502253562464386165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin13502253562464386165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin13502253562464386165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13502253562464386165;'/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' '[]((((LTLAPp2==true) U (LTLAPp3==true)) U X((X(X((LTLAPp4==true)))||[](!(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin13502253562464386165;'/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' '[]((((LTLAPp2==true) U (LTLAPp3==true)) U X((X(X((LTLAPp4==true)))||[](!(LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13502253562464386165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((!(LTLAPp5==true) U !(LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin13502253562464386165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((!(LTLAPp5==true) U !(LTLAPp6==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13502253562464386165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp7==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin13502253562464386165;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13502253562464386165;'/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([](((LTLAPp8==true)||X((LTLAPp9==true))||[]((LTLAPp10==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-S16C07"
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-S16C07, 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-174876524300324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C07.tgz
mv MultiCrashLeafsetExtension-PT-S16C07 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 ;