About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C04
| 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 | TFFTFF?FFFTFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524300300.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-S16C04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524300300
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.1M 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-S16C04-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748923250776
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-S16C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 04:00:53] [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 04:00:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 04:00:54] [INFO ] Load time of PNML (sax parser for PT used): 767 ms
[2025-06-03 04:00:54] [INFO ] Transformed 4260 places.
[2025-06-03 04:00:54] [INFO ] Transformed 6027 transitions.
[2025-06-03 04:00:54] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 1036 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 4260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 4232 transition count 6027
Discarding 1077 places :
Symmetric choice reduction at 1 with 1077 rule applications. Total rules 1105 place count 3155 transition count 4950
Iterating global reduction 1 with 1077 rules applied. Total rules applied 2182 place count 3155 transition count 4950
Discarding 941 places :
Symmetric choice reduction at 1 with 941 rule applications. Total rules 3123 place count 2214 transition count 4009
Iterating global reduction 1 with 941 rules applied. Total rules applied 4064 place count 2214 transition count 4009
Discarding 220 places :
Symmetric choice reduction at 1 with 220 rule applications. Total rules 4284 place count 1994 transition count 3129
Iterating global reduction 1 with 220 rules applied. Total rules applied 4504 place count 1994 transition count 3129
Applied a total of 4504 rules in 2205 ms. Remains 1994 /4260 variables (removed 2266) and now considering 3129/6027 (removed 2898) transitions.
[2025-06-03 04:00:57] [INFO ] Flow matrix only has 2857 transitions (discarded 272 similar events)
// Phase 1: matrix 2857 rows 1994 cols
[2025-06-03 04:00:57] [INFO ] Computed 469 invariants in 188 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:01:03] [INFO ] Implicit Places using invariants in 6145 ms returned [4, 8, 12, 14, 18, 20, 25, 32, 41, 52, 65, 82, 98, 116, 118, 120, 122, 135, 148, 157, 164, 169, 172, 191, 198, 201, 202, 203, 204, 205, 208, 213, 220, 229, 240, 253, 267, 281, 282, 283, 284, 285, 296, 305, 312, 317, 320, 322, 341, 348, 351, 352, 353, 354, 355, 357, 360, 365, 372, 381, 392, 405, 417, 418, 419, 420, 421, 430, 437, 442, 445, 447, 449, 468, 475, 478, 479, 480, 481, 482, 484, 486, 489, 494, 501, 510, 520, 530, 531, 532, 533, 534, 541, 546, 549, 551, 553, 555, 574, 581, 584, 585, 586, 587, 588, 590, 592, 594, 597, 602, 609, 617, 625, 626, 628, 629, 634, 639, 641, 643, 645, 647, 666, 673, 676, 677, 679, 680, 682, 684, 688, 691, 694, 699, 705, 711, 712, 713, 714, 715, 718, 720, 722, 724, 726, 728, 747, 754, 757, 758, 759, 761, 764, 768, 770, 772, 774, 777, 781, 785, 786, 787, 788, 789, 791, 793, 795, 797, 799, 801, 820, 827, 830, 831, 832, 833, 834, 836, 838, 840, 842, 844, 846, 848, 851, 852, 853, 854, 855, 858, 860, 862, 864, 866, 868, 887, 889, 893, 896, 897, 898, 899, 900, 902, 904, 906, 908, 910, 912, 914, 917, 918, 921, 922, 926, 928, 930, 932, 934, 936, 962, 965, 966, 968, 969, 971, 973, 977, 979, 981, 983, 985, 988, 991, 992, 994, 996, 998, 1000, 1004, 1006, 1028, 1035, 1038, 1039, 1040, 1041, 1042, 1044, 1046, 1048, 1050, 1052, 1054, 1057, 1062, 1063, 1064, 1065, 1066, 1069, 1071, 1073, 1075, 1077, 1080, 1099, 1106, 1109, 1110, 1111, 1112, 1113, 1115, 1117, 1120, 1122, 1124, 1127, 1132, 1139, 1140, 1141, 1142, 1143, 1148, 1151, 1153, 1155, 1157, 1159, 1178, 1185, 1188, 1189, 1190, 1191, 1192, 1194, 1196, 1198, 1200, 1203, 1208, 1215, 1224, 1225, 1226, 1227, 1228, 1235, 1240, 1243, 1247, 1249, 1268, 1275, 1278, 1279, 1280, 1281, 1282, 1284, 1286, 1288, 1291, 1296, 1303, 1312, 1323, 1325, 1326, 1327, 1336, 1343, 1348, 1354, 1356, 1358, 1377, 1384, 1387, 1388, 1389, 1390, 1391, 1393, 1395, 1398, 1403, 1410, 1419, 1430, 1443, 1444, 1445, 1446, 1447, 1458, 1467, 1474, 1479, 1482, 1484, 1510, 1513, 1514, 1515, 1516, 1517, 1519, 1522, 1527, 1534, 1543, 1554, 1583, 1584, 1585, 1587, 1602, 1613, 1622, 1629, 1634, 1637, 1656, 1658, 1662, 1665, 1666, 1667, 1668, 1669, 1672, 1677, 1684, 1693, 1704, 1717, 1732, 1749, 1750, 1751, 1752, 1753, 1768, 1781, 1792, 1801, 1808, 1813, 1833]
[2025-06-03 04:01:03] [INFO ] Actually due to overlaps returned [191, 341, 468, 574, 666, 747, 820, 887, 1028, 1099, 1178, 1268, 1377, 1656, 1833, 4, 12, 14, 18, 82, 116, 118, 120, 164, 201, 202, 203, 204, 253, 281, 282, 283, 284, 317, 351, 352, 353, 354, 392, 417, 418, 419, 420, 445, 478, 479, 480, 481, 510, 530, 531, 532, 533, 551, 584, 585, 586, 587, 609, 625, 626, 628, 643, 676, 677, 679, 699, 711, 712, 713, 714, 724, 757, 758, 759, 777, 785, 786, 787, 788, 797, 830, 831, 832, 833, 846, 851, 852, 853, 854, 864, 889, 896, 897, 898, 899, 917, 918, 921, 932, 965, 966, 968, 985, 988, 991, 1000, 1038, 1039, 1040, 1041, 1057, 1062, 1063, 1064, 1065, 1075, 1109, 1110, 1111, 1112, 1132, 1139, 1140, 1141, 1142, 1155, 1188, 1189, 1190, 1191, 1215, 1224, 1225, 1226, 1227, 1278, 1279, 1280, 1281, 1312, 1323, 1325, 1326, 1354, 1387, 1388, 1389, 1390, 1430, 1443, 1444, 1445, 1446, 1513, 1514, 1515, 1516, 1583, 1584, 1585, 1634, 1658, 1665, 1666, 1667, 1668, 1732, 1749, 1750, 1751, 1752, 1808]
Discarding 173 places :
Implicit Place search using SMT only with invariants took 6250 ms to find 173 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1821/4260 places, 3129/6027 transitions.
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 117 place count 1704 transition count 3012
Iterating global reduction 0 with 117 rules applied. Total rules applied 234 place count 1704 transition count 3012
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 351 place count 1587 transition count 2895
Iterating global reduction 0 with 117 rules applied. Total rules applied 468 place count 1587 transition count 2895
Discarding 116 places :
Symmetric choice reduction at 0 with 116 rule applications. Total rules 584 place count 1471 transition count 2779
Iterating global reduction 0 with 116 rules applied. Total rules applied 700 place count 1471 transition count 2779
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 721 place count 1450 transition count 2695
Iterating global reduction 0 with 21 rules applied. Total rules applied 742 place count 1450 transition count 2695
Applied a total of 742 rules in 511 ms. Remains 1450 /1821 variables (removed 371) and now considering 2695/3129 (removed 434) transitions.
[2025-06-03 04:01:03] [INFO ] Flow matrix only has 2423 transitions (discarded 272 similar events)
// Phase 1: matrix 2423 rows 1450 cols
[2025-06-03 04:01:03] [INFO ] Computed 296 invariants in 122 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:01:07] [INFO ] Implicit Places using invariants in 3701 ms returned [7, 16, 21, 28, 37, 48, 61, 93, 114, 127, 140, 149, 160, 163, 188, 191, 194, 199, 206, 215, 226, 252, 266, 277, 286, 293, 300, 302, 315, 317, 319, 322, 327, 334, 343, 366, 377, 386, 393, 398, 402, 404, 413, 415, 417, 419, 422, 427, 434, 452, 461, 468, 473, 476, 479, 481, 490, 492, 494, 496, 498, 501, 506, 520, 529, 534, 539, 541, 544, 546, 557, 561, 563, 565, 569, 572, 575, 585, 590, 593, 595, 597, 600, 602, 613, 617, 620, 624, 626, 628, 630, 636, 639, 641, 643, 645, 648, 650, 661, 663, 665, 667, 669, 671, 673, 676, 678, 681, 683, 685, 688, 690, 697, 699, 701, 703, 705, 707, 709, 711, 713, 718, 722, 724, 726, 729, 731, 743, 747, 749, 751, 755, 757, 759, 761, 767, 769, 771, 773, 778, 780, 798, 800, 802, 804, 806, 808, 810, 812, 818, 821, 823, 825, 828, 831, 840, 842, 844, 846, 849, 851, 853, 856, 866, 871, 874, 876, 879, 881, 890, 892, 894, 896, 898, 900, 903, 908, 922, 929, 934, 937, 941, 943, 952, 955, 957, 959, 961, 964, 969, 976, 996, 1005, 1012, 1017, 1024, 1026, 1038, 1040, 1042, 1044, 1047, 1052, 1059, 1068, 1090, 1101, 1110, 1117, 1122, 1125, 1127, 1137, 1139, 1141, 1144, 1149, 1156, 1165, 1176, 1206, 1221, 1232, 1241, 1248, 1255, 1264, 1266, 1269, 1274, 1281, 1290, 1301, 1314, 1344, 1359, 1372, 1383, 1392, 1403]
Discarding 240 places :
Implicit Place search using SMT only with invariants took 3707 ms to find 240 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1210/4260 places, 2695/6027 transitions.
Applied a total of 0 rules in 60 ms. Remains 1210 /1210 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12761 ms. Remains : 1210/4260 places, 2695/6027 transitions.
Support contains 69 out of 1210 places after structural reductions.
[2025-06-03 04:01:08] [INFO ] Flatten gal took : 502 ms
[2025-06-03 04:01:08] [INFO ] Flatten gal took : 168 ms
[2025-06-03 04:01:09] [INFO ] Input system was already deterministic with 2695 transitions.
Reduction of identical properties reduced properties to check from 40 to 37
RANDOM walk for 40000 steps (953 resets) in 3302 ms. (12 steps per ms) remains 22/37 properties
BEST_FIRST walk for 4004 steps (24 resets) in 63 ms. (62 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (24 resets) in 77 ms. (51 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (24 resets) in 84 ms. (47 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (24 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (24 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (24 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (24 resets) in 68 ms. (58 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (24 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 26 ms. (148 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
[2025-06-03 04:01:10] [INFO ] Flow matrix only has 2423 transitions (discarded 272 similar events)
// Phase 1: matrix 2423 rows 1210 cols
[2025-06-03 04:01:10] [INFO ] Computed 56 invariants in 51 ms
[2025-06-03 04:01:10] [INFO ] State equation strengthened by 911 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp38 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 2 (OVERLAPS) 1109/1147 variables, 13/16 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:13] [INFO ] Deduced a trap composed of 192 places in 2172 ms of which 544 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:14] [INFO ] Deduced a trap composed of 197 places in 1263 ms of which 300 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:15] [INFO ] Deduced a trap composed of 144 places in 1180 ms of which 239 ms to minimize.
SMT process timed out in 5529ms, After SMT, problems are : Problem set: 2 solved, 18 unsolved
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 33 out of 1210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1210 transition count 2682
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1197 transition count 2682
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 26 place count 1197 transition count 2667
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 56 place count 1182 transition count 2667
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 67 place count 1171 transition count 2644
Iterating global reduction 2 with 11 rules applied. Total rules applied 78 place count 1171 transition count 2644
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 78 place count 1171 transition count 2642
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 1169 transition count 2642
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 1162 transition count 2614
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 1162 transition count 2614
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 140 place count 1140 transition count 2592
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 1137 transition count 2589
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 1137 transition count 2589
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 1134 transition count 2577
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 1134 transition count 2577
Free-agglomeration rule (complex) applied 139 times.
Iterating global reduction 2 with 139 rules applied. Total rules applied 291 place count 1134 transition count 2945
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 2 with 139 rules applied. Total rules applied 430 place count 995 transition count 2945
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 435 place count 995 transition count 2945
Applied a total of 435 rules in 1330 ms. Remains 995 /1210 variables (removed 215) and now considering 2945/2695 (removed -250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1332 ms. Remains : 995/1210 places, 2945/2695 transitions.
RANDOM walk for 40000 steps (1572 resets) in 1263 ms. (31 steps per ms) remains 14/18 properties
BEST_FIRST walk for 40004 steps (233 resets) in 209 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (233 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (252 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (251 resets) in 183 ms. (217 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (276 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (229 resets) in 173 ms. (229 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (254 resets) in 135 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (251 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (231 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (229 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (249 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (231 resets) in 162 ms. (245 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (252 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (232 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
[2025-06-03 04:01:18] [INFO ] Flow matrix only has 2548 transitions (discarded 397 similar events)
// Phase 1: matrix 2548 rows 995 cols
[2025-06-03 04:01:18] [INFO ] Computed 56 invariants in 33 ms
[2025-06-03 04:01:18] [INFO ] State equation strengthened by 1376 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, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 641/667 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:19] [INFO ] Deduced a trap composed of 268 places in 528 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/667 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/667 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/668 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/668 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 305/973 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:22] [INFO ] Deduced a trap composed of 5 places in 1251 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:23] [INFO ] Deduced a trap composed of 62 places in 1301 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:25] [INFO ] Deduced a trap composed of 62 places in 1342 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:26] [INFO ] Deduced a trap composed of 62 places in 1589 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:28] [INFO ] Deduced a trap composed of 71 places in 1521 ms of which 186 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:30] [INFO ] Deduced a trap composed of 63 places in 1477 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:31] [INFO ] Deduced a trap composed of 63 places in 1412 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:33] [INFO ] Deduced a trap composed of 67 places in 1515 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:34] [INFO ] Deduced a trap composed of 63 places in 1230 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:35] [INFO ] Deduced a trap composed of 63 places in 1163 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:35] [INFO ] Deduced a trap composed of 98 places in 223 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:36] [INFO ] Deduced a trap composed of 145 places in 1179 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:38] [INFO ] Deduced a trap composed of 159 places in 1455 ms of which 246 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:39] [INFO ] Deduced a trap composed of 145 places in 1058 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:40] [INFO ] Deduced a trap composed of 161 places in 1008 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:41] [INFO ] Deduced a trap composed of 117 places in 1152 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:42] [INFO ] Deduced a trap composed of 132 places in 1142 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:44] [INFO ] Deduced a trap composed of 134 places in 1199 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:44] [INFO ] Deduced a trap composed of 86 places in 372 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:44] [INFO ] Deduced a trap composed of 83 places in 362 ms of which 24 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:46] [INFO ] Deduced a trap composed of 51 places in 1327 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:47] [INFO ] Deduced a trap composed of 62 places in 1069 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:48] [INFO ] Deduced a trap composed of 61 places in 1263 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:50] [INFO ] Deduced a trap composed of 121 places in 1288 ms of which 259 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:51] [INFO ] Deduced a trap composed of 63 places in 1365 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:52] [INFO ] Deduced a trap composed of 62 places in 1372 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:54] [INFO ] Deduced a trap composed of 63 places in 1336 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:55] [INFO ] Deduced a trap composed of 131 places in 1160 ms of which 222 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:56] [INFO ] Deduced a trap composed of 62 places in 1076 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:57] [INFO ] Deduced a trap composed of 60 places in 1130 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:58] [INFO ] Deduced a trap composed of 59 places in 1073 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:00] [INFO ] Deduced a trap composed of 59 places in 1308 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:01] [INFO ] Deduced a trap composed of 131 places in 1277 ms of which 196 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:02] [INFO ] Deduced a trap composed of 60 places in 1138 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:03] [INFO ] Deduced a trap composed of 61 places in 1103 ms of which 109 ms to minimize.
SMT process timed out in 45473ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 995 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 2945/2945 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 995 transition count 2944
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 994 transition count 2944
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 992 transition count 2939
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 992 transition count 2939
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 992 transition count 2941
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 991 transition count 2941
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 991 transition count 2941
Applied a total of 9 rules in 466 ms. Remains 991 /995 variables (removed 4) and now considering 2941/2945 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 991/995 places, 2941/2945 transitions.
RANDOM walk for 40000 steps (1572 resets) in 1262 ms. (31 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (232 resets) in 221 ms. (180 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (233 resets) in 241 ms. (165 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (250 resets) in 243 ms. (163 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (254 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (276 resets) in 259 ms. (153 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (231 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (250 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (253 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (230 resets) in 156 ms. (254 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (233 resets) in 212 ms. (187 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (250 resets) in 168 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (230 resets) in 151 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (256 resets) in 173 ms. (229 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (233 resets) in 182 ms. (218 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 40633 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :0 out of 14
Probabilistic random walk after 40633 steps, saw 17160 distinct states, run finished after 3010 ms. (steps per millisecond=13 ) properties seen :0
[2025-06-03 04:02:08] [INFO ] Flow matrix only has 2544 transitions (discarded 397 similar events)
// Phase 1: matrix 2544 rows 991 cols
[2025-06-03 04:02:08] [INFO ] Computed 56 invariants in 45 ms
[2025-06-03 04:02:08] [INFO ] State equation strengthened by 1376 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 909/935 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:10] [INFO ] Deduced a trap composed of 120 places in 1222 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:11] [INFO ] Deduced a trap composed of 139 places in 1436 ms of which 226 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:12] [INFO ] Deduced a trap composed of 139 places in 1311 ms of which 181 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:14] [INFO ] Deduced a trap composed of 149 places in 1523 ms of which 247 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:15] [INFO ] Deduced a trap composed of 89 places in 1371 ms of which 219 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:17] [INFO ] Deduced a trap composed of 160 places in 1490 ms of which 339 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:18] [INFO ] Deduced a trap composed of 89 places in 1347 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:20] [INFO ] Deduced a trap composed of 107 places in 1337 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:21] [INFO ] Deduced a trap composed of 149 places in 1337 ms of which 215 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:22] [INFO ] Deduced a trap composed of 450 places in 1289 ms of which 506 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:24] [INFO ] Deduced a trap composed of 89 places in 1285 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:25] [INFO ] Deduced a trap composed of 106 places in 1305 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:26] [INFO ] Deduced a trap composed of 96 places in 1209 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:28] [INFO ] Deduced a trap composed of 453 places in 1378 ms of which 402 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:29] [INFO ] Deduced a trap composed of 597 places in 1347 ms of which 459 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:30] [INFO ] Deduced a trap composed of 377 places in 1195 ms of which 239 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:32] [INFO ] Deduced a trap composed of 119 places in 1235 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:33] [INFO ] Deduced a trap composed of 99 places in 1349 ms of which 230 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:34] [INFO ] Deduced a trap composed of 100 places in 1073 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:35] [INFO ] Deduced a trap composed of 101 places in 1191 ms of which 159 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/935 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:37] [INFO ] Deduced a trap composed of 90 places in 1329 ms of which 209 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:38] [INFO ] Deduced a trap composed of 377 places in 1111 ms of which 241 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:39] [INFO ] Deduced a trap composed of 318 places in 1188 ms of which 317 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:41] [INFO ] Deduced a trap composed of 108 places in 1187 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:42] [INFO ] Deduced a trap composed of 88 places in 1173 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:43] [INFO ] Deduced a trap composed of 95 places in 1409 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:45] [INFO ] Deduced a trap composed of 390 places in 1408 ms of which 320 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:46] [INFO ] Deduced a trap composed of 307 places in 1376 ms of which 374 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:47] [INFO ] Deduced a trap composed of 88 places in 1033 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:49] [INFO ] Deduced a trap composed of 110 places in 1300 ms of which 289 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:50] [INFO ] Deduced a trap composed of 108 places in 1240 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:51] [INFO ] Deduced a trap composed of 101 places in 1174 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:52] [INFO ] Deduced a trap composed of 105 places in 1212 ms of which 168 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/935 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:54] [INFO ] Deduced a trap composed of 570 places in 1133 ms of which 324 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:55] [INFO ] Deduced a trap composed of 394 places in 1314 ms of which 268 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:57] [INFO ] Deduced a trap composed of 87 places in 1307 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:58] [INFO ] Deduced a trap composed of 87 places in 1197 ms of which 130 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/935 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:00] [INFO ] Deduced a trap composed of 121 places in 1363 ms of which 205 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:01] [INFO ] Deduced a trap composed of 90 places in 1279 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:02] [INFO ] Deduced a trap composed of 139 places in 1314 ms of which 289 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:03] [INFO ] Deduced a trap composed of 185 places in 1290 ms of which 239 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:05] [INFO ] Deduced a trap composed of 161 places in 1522 ms of which 303 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:07] [INFO ] Deduced a trap composed of 185 places in 1616 ms of which 366 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:08] [INFO ] Deduced a trap composed of 90 places in 1235 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:09] [INFO ] Deduced a trap composed of 90 places in 1058 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:10] [INFO ] Deduced a trap composed of 108 places in 1101 ms of which 172 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:11] [INFO ] Deduced a trap composed of 97 places in 1014 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:12] [INFO ] Deduced a trap composed of 140 places in 1253 ms of which 216 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:13] [INFO ] Deduced a trap composed of 107 places in 1012 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:15] [INFO ] Deduced a trap composed of 502 places in 1645 ms of which 689 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:16] [INFO ] Deduced a trap composed of 682 places in 1207 ms of which 323 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:19] [INFO ] Deduced a trap composed of 99 places in 1508 ms of which 230 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:21] [INFO ] Deduced a trap composed of 191 places in 1246 ms of which 283 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:22] [INFO ] Deduced a trap composed of 100 places in 1312 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:24] [INFO ] Deduced a trap composed of 117 places in 1321 ms of which 173 ms to minimize.
SMT process timed out in 75796ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 991/991 places, 2941/2941 transitions.
Applied a total of 0 rules in 107 ms. Remains 991 /991 variables (removed 0) and now considering 2941/2941 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 991/991 places, 2941/2941 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 991/991 places, 2941/2941 transitions.
Applied a total of 0 rules in 163 ms. Remains 991 /991 variables (removed 0) and now considering 2941/2941 (removed 0) transitions.
[2025-06-03 04:03:24] [INFO ] Flow matrix only has 2544 transitions (discarded 397 similar events)
[2025-06-03 04:03:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:03:27] [INFO ] Implicit Places using invariants in 2603 ms returned [7, 84, 380, 399, 430, 484, 494, 501, 510, 511, 610, 648, 741, 785]
[2025-06-03 04:03:27] [INFO ] Actually due to overlaps returned [494, 741, 7, 84, 380, 399, 430, 484, 501, 510, 511, 648]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2612 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/991 places, 2941/2941 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 971 transition count 2933
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 971 transition count 2933
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 963 transition count 2925
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 963 transition count 2925
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 963 transition count 2924
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 34 place count 962 transition count 2924
Applied a total of 34 rules in 306 ms. Remains 962 /979 variables (removed 17) and now considering 2924/2941 (removed 17) transitions.
[2025-06-03 04:03:27] [INFO ] Flow matrix only has 2527 transitions (discarded 397 similar events)
// Phase 1: matrix 2527 rows 962 cols
[2025-06-03 04:03:27] [INFO ] Computed 44 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:03:29] [INFO ] Implicit Places using invariants in 2400 ms returned [592, 764]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2405 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 960/991 places, 2924/2941 transitions.
Applied a total of 0 rules in 150 ms. Remains 960 /960 variables (removed 0) and now considering 2924/2924 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5639 ms. Remains : 960/991 places, 2924/2941 transitions.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 378 stabilizing places and 1062 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' '!(X(G((X((F(G(p1))||(X(p3)&&p2)))||p0))))'
Support contains 7 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1191 transition count 2655
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1191 transition count 2655
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 50 place count 1179 transition count 2616
Iterating global reduction 0 with 12 rules applied. Total rules applied 62 place count 1179 transition count 2616
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1176 transition count 2604
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1176 transition count 2604
Applied a total of 68 rules in 318 ms. Remains 1176 /1210 variables (removed 34) and now considering 2604/2695 (removed 91) transitions.
[2025-06-03 04:03:30] [INFO ] Flow matrix only has 2332 transitions (discarded 272 similar events)
// Phase 1: matrix 2332 rows 1176 cols
[2025-06-03 04:03:30] [INFO ] Computed 56 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:03:33] [INFO ] Implicit Places using invariants in 2850 ms returned [12, 99, 459, 482, 521, 581, 592, 601, 611, 612, 777, 938, 953]
[2025-06-03 04:03:33] [INFO ] Actually due to overlaps returned [592, 12, 99, 459, 482, 521, 581, 601, 611, 612, 777, 953]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2854 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1164/1210 places, 2604/2695 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1153 transition count 2593
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1153 transition count 2593
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1142 transition count 2582
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1142 transition count 2582
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1131 transition count 2571
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1131 transition count 2571
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1121 transition count 2531
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1121 transition count 2531
Applied a total of 86 rules in 567 ms. Remains 1121 /1164 variables (removed 43) and now considering 2531/2604 (removed 73) transitions.
[2025-06-03 04:03:34] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1121 cols
[2025-06-03 04:03:34] [INFO ] Computed 44 invariants in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:03:36] [INFO ] Implicit Places using invariants in 2623 ms returned [898]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2626 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1120/1210 places, 2531/2695 transitions.
Applied a total of 0 rules in 116 ms. Remains 1120 /1120 variables (removed 0) and now considering 2531/2531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6483 ms. Remains : 1120/1210 places, 2531/2695 transitions.
Stuttering acceptance computed with spot in 429 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-00
Product exploration explored 100000 steps with 2393 reset in 929 ms.
Product exploration explored 100000 steps with 2394 reset in 621 ms.
Computed a total of 288 stabilizing places and 898 stable transitions
Computed a total of 288 stabilizing places and 898 stable transitions
Detected a total of 288/1120 stabilizing places and 898/2531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X p0), (X (X p0)), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (955 resets) in 660 ms. (60 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (244 resets) in 315 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (244 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
[2025-06-03 04:03:39] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1120 cols
[2025-06-03 04:03:39] [INFO ] Computed 43 invariants in 35 ms
[2025-06-03 04:03:39] [INFO ] State equation strengthened by 824 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1040/1043 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1043 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/1061 variables, 1/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 04:03:41] [INFO ] Deduced a trap composed of 92 places in 1309 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:42] [INFO ] Deduced a trap composed of 175 places in 1276 ms of which 222 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:44] [INFO ] Deduced a trap composed of 201 places in 1436 ms of which 312 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:45] [INFO ] Deduced a trap composed of 104 places in 1171 ms of which 138 ms to minimize.
SMT process timed out in 5698ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1120/1120 places, 2531/2531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1120 transition count 2515
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1104 transition count 2515
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 1104 transition count 2507
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 1096 transition count 2507
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 82 place count 1079 transition count 2490
Free-agglomeration rule (complex) applied 130 times.
Iterating global reduction 2 with 130 rules applied. Total rules applied 212 place count 1079 transition count 3170
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 2 with 130 rules applied. Total rules applied 342 place count 949 transition count 3170
Applied a total of 342 rules in 409 ms. Remains 949 /1120 variables (removed 171) and now considering 3170/2531 (removed -639) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 949/1120 places, 3170/2531 transitions.
RANDOM walk for 40000 steps (1703 resets) in 1214 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (159 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 53490 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 53490 steps, saw 22292 distinct states, run finished after 3003 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 04:03:49] [INFO ] Flow matrix only has 2773 transitions (discarded 397 similar events)
// Phase 1: matrix 2773 rows 949 cols
[2025-06-03 04:03:49] [INFO ] Computed 43 invariants in 50 ms
[2025-06-03 04:03:49] [INFO ] State equation strengthened by 1634 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/872 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/890 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/890 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 25/915 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/915 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/941 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/941 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/949 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2773/3722 variables, 949/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3722 variables, 1634/2626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3722 variables, 0/2626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3722 variables, 0/2626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3722/3722 variables, and 2626 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3203 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 949/949 constraints, ReadFeed: 1634/1634 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 869/872 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/890 variables, 1/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 04:03:54] [INFO ] Deduced a trap composed of 64 places in 1110 ms of which 86 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/890 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/915 variables, 2/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 04:03:55] [INFO ] Deduced a trap composed of 5 places in 1183 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:56] [INFO ] Deduced a trap composed of 27 places in 1176 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:57] [INFO ] Deduced a trap composed of 63 places in 1085 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:59] [INFO ] Deduced a trap composed of 76 places in 1342 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:00] [INFO ] Deduced a trap composed of 83 places in 1301 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:01] [INFO ] Deduced a trap composed of 76 places in 1102 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:03] [INFO ] Deduced a trap composed of 63 places in 1354 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:04] [INFO ] Deduced a trap composed of 98 places in 1287 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:05] [INFO ] Deduced a trap composed of 27 places in 1048 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:06] [INFO ] Deduced a trap composed of 57 places in 1092 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:07] [INFO ] Deduced a trap composed of 63 places in 1256 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:08] [INFO ] Deduced a trap composed of 105 places in 1010 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:10] [INFO ] Deduced a trap composed of 86 places in 1292 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:11] [INFO ] Deduced a trap composed of 93 places in 1115 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:12] [INFO ] Deduced a trap composed of 95 places in 1167 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:13] [INFO ] Deduced a trap composed of 93 places in 1034 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:14] [INFO ] Deduced a trap composed of 98 places in 993 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:15] [INFO ] Deduced a trap composed of 95 places in 1044 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:16] [INFO ] Deduced a trap composed of 95 places in 1043 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:17] [INFO ] Deduced a trap composed of 102 places in 1073 ms of which 154 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/915 variables, 20/30 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 04:04:18] [INFO ] Deduced a trap composed of 102 places in 1045 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:20] [INFO ] Deduced a trap composed of 104 places in 1046 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:21] [INFO ] Deduced a trap composed of 86 places in 990 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:22] [INFO ] Deduced a trap composed of 96 places in 1043 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:23] [INFO ] Deduced a trap composed of 93 places in 982 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:24] [INFO ] Deduced a trap composed of 107 places in 998 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:25] [INFO ] Deduced a trap composed of 95 places in 1025 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:26] [INFO ] Deduced a trap composed of 109 places in 1070 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:27] [INFO ] Deduced a trap composed of 109 places in 1024 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:28] [INFO ] Deduced a trap composed of 109 places in 1404 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:29] [INFO ] Deduced a trap composed of 93 places in 1167 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:31] [INFO ] Deduced a trap composed of 98 places in 1201 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:32] [INFO ] Deduced a trap composed of 107 places in 1200 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:33] [INFO ] Deduced a trap composed of 120 places in 1354 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:34] [INFO ] Deduced a trap composed of 95 places in 1067 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:36] [INFO ] Deduced a trap composed of 109 places in 1454 ms of which 227 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:37] [INFO ] Deduced a trap composed of 102 places in 1610 ms of which 256 ms to minimize.
SMT process timed out in 48391ms, 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 3 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3170/3170 transitions.
Applied a total of 0 rules in 161 ms. Remains 949 /949 variables (removed 0) and now considering 3170/3170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 949/949 places, 3170/3170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3170/3170 transitions.
Applied a total of 0 rules in 166 ms. Remains 949 /949 variables (removed 0) and now considering 3170/3170 (removed 0) transitions.
[2025-06-03 04:04:38] [INFO ] Flow matrix only has 2773 transitions (discarded 397 similar events)
[2025-06-03 04:04:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:04:40] [INFO ] Implicit Places using invariants in 2606 ms returned [586, 715]
[2025-06-03 04:04:40] [INFO ] Actually due to overlaps returned [715]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2612 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 948/949 places, 3170/3170 transitions.
Applied a total of 0 rules in 158 ms. Remains 948 /948 variables (removed 0) and now considering 3170/3170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2936 ms. Remains : 948/949 places, 3170/3170 transitions.
RANDOM walk for 40000 steps (1705 resets) in 927 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (160 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (159 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 55973 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 55973 steps, saw 23319 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 04:04:44] [INFO ] Flow matrix only has 2773 transitions (discarded 397 similar events)
// Phase 1: matrix 2773 rows 948 cols
[2025-06-03 04:04:44] [INFO ] Computed 42 invariants in 41 ms
[2025-06-03 04:04:44] [INFO ] State equation strengthened by 1634 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/870 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/5 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 04:04:46] [INFO ] Deduced a trap composed of 135 places in 1196 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:47] [INFO ] Deduced a trap composed of 82 places in 1128 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:48] [INFO ] Deduced a trap composed of 113 places in 1232 ms of which 142 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/914 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/940 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/948 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/948 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2773/3721 variables, 948/993 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3721 variables, 1634/2627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3721 variables, 0/2627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3721 variables, 0/2627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3721/3721 variables, and 2627 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6906 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 948/948 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/870 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 26/914 variables, 3/11 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 04:04:52] [INFO ] Deduced a trap composed of 5 places in 1069 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:53] [INFO ] Deduced a trap composed of 27 places in 990 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:54] [INFO ] Deduced a trap composed of 63 places in 1056 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:55] [INFO ] Deduced a trap composed of 76 places in 1031 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:56] [INFO ] Deduced a trap composed of 86 places in 1047 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:58] [INFO ] Deduced a trap composed of 93 places in 1054 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:59] [INFO ] Deduced a trap composed of 93 places in 1175 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:00] [INFO ] Deduced a trap composed of 98 places in 999 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:01] [INFO ] Deduced a trap composed of 95 places in 1110 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:02] [INFO ] Deduced a trap composed of 95 places in 1159 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:03] [INFO ] Deduced a trap composed of 86 places in 1132 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:04] [INFO ] Deduced a trap composed of 96 places in 1171 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:06] [INFO ] Deduced a trap composed of 93 places in 1136 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:07] [INFO ] Deduced a trap composed of 107 places in 1126 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:08] [INFO ] Deduced a trap composed of 143 places in 1166 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:09] [INFO ] Deduced a trap composed of 148 places in 1245 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:10] [INFO ] Deduced a trap composed of 151 places in 1160 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:11] [INFO ] Deduced a trap composed of 156 places in 1006 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:13] [INFO ] Deduced a trap composed of 144 places in 1202 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:14] [INFO ] Deduced a trap composed of 144 places in 1086 ms of which 145 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 20/31 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 04:05:15] [INFO ] Deduced a trap composed of 144 places in 1090 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:16] [INFO ] Deduced a trap composed of 144 places in 1111 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:17] [INFO ] Deduced a trap composed of 144 places in 1104 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:18] [INFO ] Deduced a trap composed of 76 places in 1195 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:19] [INFO ] Deduced a trap composed of 63 places in 1056 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:21] [INFO ] Deduced a trap composed of 98 places in 1192 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:22] [INFO ] Deduced a trap composed of 27 places in 1178 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:23] [INFO ] Deduced a trap composed of 57 places in 1017 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:24] [INFO ] Deduced a trap composed of 63 places in 1302 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:25] [INFO ] Deduced a trap composed of 105 places in 1185 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:26] [INFO ] Deduced a trap composed of 156 places in 952 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:27] [INFO ] Deduced a trap composed of 156 places in 954 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:29] [INFO ] Deduced a trap composed of 156 places in 1129 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:30] [INFO ] Deduced a trap composed of 156 places in 1119 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:31] [INFO ] Deduced a trap composed of 156 places in 1100 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:32] [INFO ] Deduced a trap composed of 156 places in 1298 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:33] [INFO ] Deduced a trap composed of 145 places in 1328 ms of which 206 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:35] [INFO ] Deduced a trap composed of 211 places in 1220 ms of which 185 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:36] [INFO ] Deduced a trap composed of 162 places in 1215 ms of which 206 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:37] [INFO ] Deduced a trap composed of 164 places in 1413 ms of which 234 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 20/51 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 04:05:39] [INFO ] Deduced a trap composed of 83 places in 1287 ms of which 128 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/914 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/914 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 26/940 variables, 26/78 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 04:05:40] [INFO ] Deduced a trap composed of 159 places in 1234 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:41] [INFO ] Deduced a trap composed of 60 places in 1291 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:43] [INFO ] Deduced a trap composed of 44 places in 1278 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:44] [INFO ] Deduced a trap composed of 58 places in 1422 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:46] [INFO ] Deduced a trap composed of 59 places in 1345 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:47] [INFO ] Deduced a trap composed of 51 places in 1348 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:48] [INFO ] Deduced a trap composed of 52 places in 1458 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:50] [INFO ] Deduced a trap composed of 53 places in 1396 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:51] [INFO ] Deduced a trap composed of 50 places in 1214 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:52] [INFO ] Deduced a trap composed of 50 places in 1320 ms of which 95 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/940 variables, 10/88 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 04:05:54] [INFO ] Deduced a trap composed of 55 places in 1269 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:55] [INFO ] Deduced a trap composed of 60 places in 1379 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:05:57] [INFO ] Deduced a trap composed of 51 places in 1437 ms of which 145 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/940 variables, 3/91 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 04:05:58] [INFO ] Deduced a trap composed of 132 places in 1287 ms of which 227 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:06:00] [INFO ] Deduced a trap composed of 51 places in 1400 ms of which 134 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/940 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/940 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/948 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/948 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2773/3721 variables, 948/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 19 (INCLUDED_ONLY) 0/3721 variables, 1634/2683 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3721 variables, 1/2684 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3721 variables, 0/2684 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3721/3721 variables, and 2684 constraints, problems are : Problem set: 1 solved, 1 unsolved in 75027 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 948/948 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 82005ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 3170/3170 transitions.
Applied a total of 0 rules in 144 ms. Remains 948 /948 variables (removed 0) and now considering 3170/3170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 948/948 places, 3170/3170 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 p3), (X p0), (X (X p0)), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (G p0)]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-00 finished in 156151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||G(p1))))'
Support contains 3 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1193 transition count 2657
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1193 transition count 2657
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1183 transition count 2623
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1183 transition count 2623
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1181 transition count 2615
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1181 transition count 2615
Applied a total of 58 rules in 437 ms. Remains 1181 /1210 variables (removed 29) and now considering 2615/2695 (removed 80) transitions.
[2025-06-03 04:06:07] [INFO ] Flow matrix only has 2343 transitions (discarded 272 similar events)
// Phase 1: matrix 2343 rows 1181 cols
[2025-06-03 04:06:07] [INFO ] Computed 56 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:09] [INFO ] Implicit Places using invariants in 2804 ms returned [12, 99, 459, 482, 521, 581, 592, 613, 614, 734, 892, 943, 958]
[2025-06-03 04:06:09] [INFO ] Actually due to overlaps returned [592, 892, 12, 99, 459, 482, 521, 581, 613, 614, 958]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2807 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1170/1210 places, 2615/2695 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1161 transition count 2606
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1161 transition count 2606
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1152 transition count 2597
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1152 transition count 2597
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1143 transition count 2588
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1143 transition count 2588
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 1135 transition count 2556
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 1135 transition count 2556
Applied a total of 70 rules in 354 ms. Remains 1135 /1170 variables (removed 35) and now considering 2556/2615 (removed 59) transitions.
[2025-06-03 04:06:10] [INFO ] Flow matrix only has 2284 transitions (discarded 272 similar events)
// Phase 1: matrix 2284 rows 1135 cols
[2025-06-03 04:06:10] [INFO ] Computed 45 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:12] [INFO ] Implicit Places using invariants in 2671 ms returned [702, 910]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2673 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1133/1210 places, 2556/2695 transitions.
Applied a total of 0 rules in 64 ms. Remains 1133 /1133 variables (removed 0) and now considering 2556/2556 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6337 ms. Remains : 1133/1210 places, 2556/2695 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-01 finished in 6627 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((X(X(X(p0)))||F(p1)))))'
Support contains 5 out of 1210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1210 transition count 2682
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1197 transition count 2682
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 26 place count 1197 transition count 2666
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 1181 transition count 2666
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 73 place count 1166 transition count 2630
Iterating global reduction 2 with 15 rules applied. Total rules applied 88 place count 1166 transition count 2630
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 88 place count 1166 transition count 2627
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 94 place count 1163 transition count 2627
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 102 place count 1155 transition count 2595
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 1155 transition count 2595
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 152 place count 1134 transition count 2574
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 1131 transition count 2571
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 1131 transition count 2571
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 1128 transition count 2559
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 1128 transition count 2559
Applied a total of 164 rules in 837 ms. Remains 1128 /1210 variables (removed 82) and now considering 2559/2695 (removed 136) transitions.
[2025-06-03 04:06:14] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
// Phase 1: matrix 2287 rows 1128 cols
[2025-06-03 04:06:14] [INFO ] Computed 56 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:16] [INFO ] Implicit Places using invariants in 2680 ms returned [9, 94, 437, 458, 495, 552, 562, 570, 580, 581, 695, 739, 847, 897]
[2025-06-03 04:06:16] [INFO ] Actually due to overlaps returned [562, 847, 9, 94, 437, 458, 495, 552, 570, 580, 581, 739]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2684 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1116/1210 places, 2559/2695 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1108 transition count 2551
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1108 transition count 2551
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1100 transition count 2543
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1100 transition count 2543
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 1094 transition count 2519
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 1094 transition count 2519
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1092 transition count 2517
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1090 transition count 2515
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1090 transition count 2515
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1087 transition count 2503
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1087 transition count 2503
Applied a total of 58 rules in 714 ms. Remains 1087 /1116 variables (removed 29) and now considering 2503/2559 (removed 56) transitions.
[2025-06-03 04:06:17] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1087 cols
[2025-06-03 04:06:17] [INFO ] Computed 44 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:19] [INFO ] Implicit Places using invariants in 2226 ms returned [668, 866]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2228 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1085/1210 places, 2503/2695 transitions.
Applied a total of 0 rules in 168 ms. Remains 1085 /1085 variables (removed 0) and now considering 2503/2503 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6632 ms. Remains : 1085/1210 places, 2503/2695 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-02 finished in 6749 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((G(p0)||X(p1))))'
Support contains 4 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1193 transition count 2660
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1193 transition count 2660
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 1182 transition count 2625
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 1182 transition count 2625
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1179 transition count 2613
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1179 transition count 2613
Applied a total of 62 rules in 378 ms. Remains 1179 /1210 variables (removed 31) and now considering 2613/2695 (removed 82) transitions.
[2025-06-03 04:06:20] [INFO ] Flow matrix only has 2341 transitions (discarded 272 similar events)
// Phase 1: matrix 2341 rows 1179 cols
[2025-06-03 04:06:20] [INFO ] Computed 56 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:23] [INFO ] Implicit Places using invariants in 3025 ms returned [12, 99, 459, 523, 583, 594, 603, 613, 614, 735, 780, 890, 941, 956]
[2025-06-03 04:06:23] [INFO ] Actually due to overlaps returned [594, 890, 12, 99, 459, 523, 583, 603, 613, 614, 780, 956]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 3028 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1167/1210 places, 2613/2695 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1157 transition count 2603
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1157 transition count 2603
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1147 transition count 2593
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1147 transition count 2593
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1137 transition count 2583
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1137 transition count 2583
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 1128 transition count 2547
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 1128 transition count 2547
Applied a total of 78 rules in 340 ms. Remains 1128 /1167 variables (removed 39) and now considering 2547/2613 (removed 66) transitions.
[2025-06-03 04:06:23] [INFO ] Flow matrix only has 2275 transitions (discarded 272 similar events)
// Phase 1: matrix 2275 rows 1128 cols
[2025-06-03 04:06:23] [INFO ] Computed 44 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:26] [INFO ] Implicit Places using invariants in 2889 ms returned [703, 904]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2892 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1126/1210 places, 2547/2695 transitions.
Applied a total of 0 rules in 86 ms. Remains 1126 /1126 variables (removed 0) and now considering 2547/2547 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6725 ms. Remains : 1126/1210 places, 2547/2695 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03
Product exploration explored 100000 steps with 2389 reset in 775 ms.
Product exploration explored 100000 steps with 2394 reset in 959 ms.
Computed a total of 294 stabilizing places and 914 stable transitions
Computed a total of 294 stabilizing places and 914 stable transitions
Detected a total of 294/1126 stabilizing places and 914/2547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 650 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (957 resets) in 479 ms. (83 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (244 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2025-06-03 04:06:29] [INFO ] Flow matrix only has 2275 transitions (discarded 272 similar events)
// Phase 1: matrix 2275 rows 1126 cols
[2025-06-03 04:06:29] [INFO ] Computed 42 invariants in 45 ms
[2025-06-03 04:06:29] [INFO ] State equation strengthened by 833 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 apf4 is UNSAT
After SMT solving in domain Real declared 87/3401 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 2/31 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/1126 constraints, ReadFeed: 0/833 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 16 factoid took 870 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1126/1126 places, 2547/2547 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1126 transition count 2532
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1111 transition count 2532
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 30 place count 1111 transition count 2524
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 46 place count 1103 transition count 2524
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 82 place count 1085 transition count 2506
Applied a total of 82 rules in 359 ms. Remains 1085 /1126 variables (removed 41) and now considering 2506/2547 (removed 41) transitions.
[2025-06-03 04:06:31] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
// Phase 1: matrix 2234 rows 1085 cols
[2025-06-03 04:06:31] [INFO ] Computed 42 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:34] [INFO ] Implicit Places using invariants in 2838 ms returned []
[2025-06-03 04:06:34] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:06:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:35] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 04:07:05] [INFO ] Performed 1031/1085 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:07:06] [INFO ] Implicit Places using invariants and state equation in 32500 ms returned []
Implicit Place search using SMT with State Equation took 35344 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:07:06] [INFO ] Redundant transitions in 170 ms returned []
Running 2489 sub problems to find dead transitions.
[2025-06-03 04:07:06] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:07:06] [INFO ] Invariant cache hit.
[2025-06-03 04:07:06] [INFO ] State equation strengthened by 833 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/1083 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2489 unsolved
SMT process timed out in 32261ms, After SMT, problems are : Problem set: 0 solved, 2489 unsolved
Search for dead transitions found 0 dead transitions in 32284ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/1126 places, 2506/2547 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68177 ms. Remains : 1085/1126 places, 2506/2547 transitions.
Computed a total of 270 stabilizing places and 890 stable transitions
Computed a total of 270 stabilizing places and 890 stable transitions
Detected a total of 270/1085 stabilizing places and 890/2506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p1 p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 402 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1351 resets) in 446 ms. (89 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
[2025-06-03 04:07:39] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:07:39] [INFO ] Invariant cache hit.
[2025-06-03 04:07:39] [INFO ] State equation strengthened by 833 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 apf5 is UNSAT
After SMT solving in domain Real declared 989/3319 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/31 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/1085 constraints, ReadFeed: 0/833 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p1 p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 16 factoid took 716 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3386 reset in 713 ms.
Product exploration explored 100000 steps with 3386 reset in 725 ms.
Built C files in :
/tmp/ltsmin1632053903925251873
[2025-06-03 04:07:42] [INFO ] Too many transitions (2506) to apply POR reductions. Disabling POR matrices.
[2025-06-03 04:07:42] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1632053903925251873
Running compilation step : cd /tmp/ltsmin1632053903925251873;'/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/ltsmin1632053903925251873;'/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/ltsmin1632053903925251873;'/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 1085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1085/1085 places, 2506/2506 transitions.
Applied a total of 0 rules in 110 ms. Remains 1085 /1085 variables (removed 0) and now considering 2506/2506 (removed 0) transitions.
[2025-06-03 04:07:46] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:07:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:07:47] [INFO ] Implicit Places using invariants in 1807 ms returned []
[2025-06-03 04:07:47] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:07:48] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 04:08:19] [INFO ] Performed 1044/1085 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:08:20] [INFO ] Implicit Places using invariants and state equation in 32152 ms returned []
Implicit Place search using SMT with State Equation took 33961 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:08:20] [INFO ] Redundant transitions in 212 ms returned []
Running 2489 sub problems to find dead transitions.
[2025-06-03 04:08:20] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:08:20] [INFO ] Invariant cache hit.
[2025-06-03 04:08:20] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s1075 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
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 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.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 0.0)
(s50 1.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 0.0)
(s64 1.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 0.0)
(s79 1.0)
(s80 1.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 0.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 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.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 0.0)
(s193 0.0)
(s194 1.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 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.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 0.0)
(s218 0.0)
(s219 1.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 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 1.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 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 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 1.0)
(s390 0.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 0.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 0.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 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 0.0)
(s602 0.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 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.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 0.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 1.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 1.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 0.0)
(s751 1.0)
(s752 1.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 1.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 1.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 1.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 1.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 1.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 1.0)
(s819 0.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 0.0)
(s826 0.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 0.0)
(s832 1.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 1.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 1.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 1.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 1.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.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 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 1.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 1.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 1.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 1.0)
(s926 0.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 0.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 0.0)
(s935 1.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 1.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 1.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 1.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 1.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 1.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 1.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 1.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 1.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 1.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 1.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 1.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 1.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 1.0)
(s1059 0.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2489 unsolved
SMT process timed out in 31831ms, After SMT, problems are : Problem set: 0 solved, 2489 unsolved
Search for dead transitions found 0 dead transitions in 31846ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66148 ms. Remains : 1085/1085 places, 2506/2506 transitions.
Built C files in :
/tmp/ltsmin18334949827145109206
[2025-06-03 04:08:52] [INFO ] Too many transitions (2506) to apply POR reductions. Disabling POR matrices.
[2025-06-03 04:08:52] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18334949827145109206
Running compilation step : cd /tmp/ltsmin18334949827145109206;'/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/ltsmin18334949827145109206;'/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/ltsmin18334949827145109206;'/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 04:08:55] [INFO ] Flatten gal took : 105 ms
[2025-06-03 04:08:55] [INFO ] Flatten gal took : 95 ms
[2025-06-03 04:08:55] [INFO ] Time to serialize gal into /tmp/LTL12297503019938207521.gal : 38 ms
[2025-06-03 04:08:55] [INFO ] Time to serialize properties into /tmp/LTL12752637150786693685.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/LTL12297503019938207521.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16613632492409844202.hoa' '-atoms' '/tmp/LTL12752637150786693685.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...320
Loading property file /tmp/LTL12752637150786693685.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16613632492409844202.hoa
Detected timeout of ITS tools.
[2025-06-03 04:09:10] [INFO ] Flatten gal took : 87 ms
[2025-06-03 04:09:10] [INFO ] Flatten gal took : 135 ms
[2025-06-03 04:09:11] [INFO ] Time to serialize gal into /tmp/LTL13670008238079104597.gal : 39 ms
[2025-06-03 04:09:11] [INFO ] Time to serialize properties into /tmp/LTL14810914984952255419.ltl : 3 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/LTL13670008238079104597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14810914984952255419.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...277
Read 1 LTL properties
Checking formula 0 : !((G((G("((Node10ManageTheCrashOfNode15<1)||(Rx1IsAtTheRightExtremityOfTheLeafSet<1))"))||(X("((Node5HasAskedItsLeafSetToLx2ToReplaceN...200
Formula 0 simplified : F(F!"((Node10ManageTheCrashOfNode15<1)||(Rx1IsAtTheRightExtremityOfTheLeafSet<1))" & X!"((Node5HasAskedItsLeafSetToLx2ToReplaceNode3...192
Detected timeout of ITS tools.
[2025-06-03 04:09:26] [INFO ] Flatten gal took : 76 ms
[2025-06-03 04:09:26] [INFO ] Applying decomposition
[2025-06-03 04:09:26] [INFO ] Flatten gal took : 78 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/graph4782105476519507076.txt' '-o' '/tmp/graph4782105476519507076.bin' '-w' '/tmp/graph4782105476519507076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4782105476519507076.bin' '-l' '-1' '-v' '-w' '/tmp/graph4782105476519507076.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:09:26] [INFO ] Decomposing Gal with order
[2025-06-03 04:09:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:09:27] [INFO ] Removed a total of 2247 redundant transitions.
[2025-06-03 04:09:27] [INFO ] Flatten gal took : 910 ms
[2025-06-03 04:09:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1534 labels/synchronizations in 190 ms.
[2025-06-03 04:09:28] [INFO ] Time to serialize gal into /tmp/LTL17724748876390726965.gal : 34 ms
[2025-06-03 04:09:28] [INFO ] Time to serialize properties into /tmp/LTL10499695247753249185.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/LTL17724748876390726965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10499695247753249185.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((G("((i17.u82.Node10ManageTheCrashOfNode15<1)||(i17.u157.Rx1IsAtTheRightExtremityOfTheLeafSet<1))"))||(X("((i17.u152.Node5HasAske...235
Formula 0 simplified : F(F!"((i17.u82.Node10ManageTheCrashOfNode15<1)||(i17.u157.Rx1IsAtTheRightExtremityOfTheLeafSet<1))" & X!"((i17.u152.Node5HasAskedIts...227
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03 finished in 203164 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) U p1))||(X(X(X(p2)))&&F(p1))))'
Support contains 6 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1194 transition count 2661
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1194 transition count 2661
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 1184 transition count 2630
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1184 transition count 2630
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1181 transition count 2618
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1181 transition count 2618
Applied a total of 58 rules in 277 ms. Remains 1181 /1210 variables (removed 29) and now considering 2618/2695 (removed 77) transitions.
[2025-06-03 04:09:43] [INFO ] Flow matrix only has 2346 transitions (discarded 272 similar events)
// Phase 1: matrix 2346 rows 1181 cols
[2025-06-03 04:09:43] [INFO ] Computed 56 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:09:46] [INFO ] Implicit Places using invariants in 2769 ms returned [12, 462, 485, 524, 584, 595, 604, 614, 737, 782, 892, 943, 958]
[2025-06-03 04:09:46] [INFO ] Actually due to overlaps returned [595, 892, 12, 462, 485, 524, 584, 604, 614, 782, 958]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2772 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1170/1210 places, 2618/2695 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1161 transition count 2609
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1161 transition count 2609
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1152 transition count 2600
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1152 transition count 2600
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1143 transition count 2591
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1143 transition count 2591
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 1135 transition count 2559
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 1135 transition count 2559
Applied a total of 70 rules in 596 ms. Remains 1135 /1170 variables (removed 35) and now considering 2559/2618 (removed 59) transitions.
[2025-06-03 04:09:46] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
// Phase 1: matrix 2287 rows 1135 cols
[2025-06-03 04:09:46] [INFO ] Computed 45 invariants in 48 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:09:49] [INFO ] Implicit Places using invariants in 2398 ms returned [709, 910]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2417 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1133/1210 places, 2559/2695 transitions.
Applied a total of 0 rules in 106 ms. Remains 1133 /1133 variables (removed 0) and now considering 2559/2559 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6169 ms. Remains : 1133/1210 places, 2559/2695 transitions.
Stuttering acceptance computed with spot in 466 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04
Stuttering criterion allowed to conclude after 43 steps with 1 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-04 finished in 6665 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((!p1||X(X(!p2)))) U !p3)&&p0)))'
Support contains 6 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1192 transition count 2659
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1192 transition count 2659
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 1180 transition count 2620
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 1180 transition count 2620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1177 transition count 2608
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1177 transition count 2608
Applied a total of 66 rules in 443 ms. Remains 1177 /1210 variables (removed 33) and now considering 2608/2695 (removed 87) transitions.
[2025-06-03 04:09:50] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1177 cols
[2025-06-03 04:09:50] [INFO ] Computed 56 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:09:53] [INFO ] Implicit Places using invariants in 3000 ms returned [12, 99, 459, 482, 521, 581, 592, 601, 611, 612, 732, 777, 887, 939, 954]
[2025-06-03 04:09:53] [INFO ] Actually due to overlaps returned [592, 887, 12, 99, 459, 482, 521, 581, 601, 611, 612, 777, 954]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 3008 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1164/1210 places, 2608/2695 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1153 transition count 2597
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1153 transition count 2597
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1142 transition count 2586
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1142 transition count 2586
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1131 transition count 2575
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1131 transition count 2575
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1121 transition count 2535
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1121 transition count 2535
Applied a total of 86 rules in 404 ms. Remains 1121 /1164 variables (removed 43) and now considering 2535/2608 (removed 73) transitions.
[2025-06-03 04:09:53] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1121 cols
[2025-06-03 04:09:53] [INFO ] Computed 43 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:09:55] [INFO ] Implicit Places using invariants in 2158 ms returned [696, 898]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2169 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1119/1210 places, 2535/2695 transitions.
Applied a total of 0 rules in 101 ms. Remains 1119 /1119 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6125 ms. Remains : 1119/1210 places, 2535/2695 transitions.
Stuttering acceptance computed with spot in 288 ms :[p3, (OR (NOT p0) p3), (AND p1 p2), true, (OR (NOT p0) p3), (OR p3 (AND p1 p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-05 finished in 6453 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 2 out of 1210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1210 transition count 2682
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1197 transition count 2682
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 26 place count 1197 transition count 2665
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 60 place count 1180 transition count 2665
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 76 place count 1164 transition count 2628
Iterating global reduction 2 with 16 rules applied. Total rules applied 92 place count 1164 transition count 2628
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 92 place count 1164 transition count 2624
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 1160 transition count 2624
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 109 place count 1151 transition count 2588
Iterating global reduction 2 with 9 rules applied. Total rules applied 118 place count 1151 transition count 2588
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 160 place count 1130 transition count 2567
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 1127 transition count 2564
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 1127 transition count 2564
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 169 place count 1124 transition count 2552
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 1124 transition count 2552
Applied a total of 172 rules in 735 ms. Remains 1124 /1210 variables (removed 86) and now considering 2552/2695 (removed 143) transitions.
[2025-06-03 04:09:57] [INFO ] Flow matrix only has 2280 transitions (discarded 272 similar events)
// Phase 1: matrix 2280 rows 1124 cols
[2025-06-03 04:09:57] [INFO ] Computed 56 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:09:59] [INFO ] Implicit Places using invariants in 2283 ms returned [9, 94, 436, 457, 494, 551, 561, 569, 579, 580, 694, 738, 846, 896, 911]
[2025-06-03 04:09:59] [INFO ] Actually due to overlaps returned [561, 846, 9, 94, 436, 457, 494, 551, 569, 579, 580, 738, 911]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 2291 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1111/1210 places, 2552/2695 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1102 transition count 2543
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1102 transition count 2543
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1093 transition count 2534
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1093 transition count 2534
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 1086 transition count 2506
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 1086 transition count 2506
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1084 transition count 2504
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1082 transition count 2502
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1082 transition count 2502
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1079 transition count 2490
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1079 transition count 2490
Applied a total of 64 rules in 652 ms. Remains 1079 /1111 variables (removed 32) and now considering 2490/2552 (removed 62) transitions.
[2025-06-03 04:09:59] [INFO ] Flow matrix only has 2218 transitions (discarded 272 similar events)
// Phase 1: matrix 2218 rows 1079 cols
[2025-06-03 04:09:59] [INFO ] Computed 43 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:10:02] [INFO ] Implicit Places using invariants in 2641 ms returned [667, 865]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2644 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1077/1210 places, 2490/2695 transitions.
Applied a total of 0 rules in 126 ms. Remains 1077 /1077 variables (removed 0) and now considering 2490/2490 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6448 ms. Remains : 1077/1210 places, 2490/2695 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06
Product exploration explored 100000 steps with 3388 reset in 649 ms.
Product exploration explored 100000 steps with 3383 reset in 689 ms.
Computed a total of 262 stabilizing places and 874 stable transitions
Computed a total of 262 stabilizing places and 874 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 99 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1353 resets) in 459 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (264 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 70009 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 70009 steps, saw 29375 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2025-06-03 04:10:07] [INFO ] Flow matrix only has 2218 transitions (discarded 272 similar events)
// Phase 1: matrix 2218 rows 1077 cols
[2025-06-03 04:10:07] [INFO ] Computed 41 invariants in 41 ms
[2025-06-03 04:10:07] [INFO ] State equation strengthened by 824 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) 997/999 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1018 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:09] [INFO ] Deduced a trap composed of 129 places in 1378 ms of which 214 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:10] [INFO ] Deduced a trap composed of 126 places in 1176 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:11] [INFO ] Deduced a trap composed of 80 places in 1110 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:12] [INFO ] Deduced a trap composed of 92 places in 878 ms of which 127 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/3295 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 5/31 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1077 constraints, ReadFeed: 0/824 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 997/999 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1018 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1018 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:14] [INFO ] Deduced a trap composed of 68 places in 1307 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:15] [INFO ] Deduced a trap composed of 109 places in 1140 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:16] [INFO ] Deduced a trap composed of 120 places in 1349 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:18] [INFO ] Deduced a trap composed of 72 places in 1256 ms of which 174 ms to minimize.
SMT process timed out in 10474ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1077 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1077/1077 places, 2490/2490 transitions.
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 131 place count 1077 transition count 3169
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 262 place count 946 transition count 3169
Applied a total of 262 rules in 309 ms. Remains 946 /1077 variables (removed 131) and now considering 3169/2490 (removed -679) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 946/1077 places, 3169/2490 transitions.
RANDOM walk for 40000 steps (1704 resets) in 902 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (187 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 56773 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 1
Probabilistic random walk after 56773 steps, saw 23646 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 04:10:21] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
// Phase 1: matrix 2771 rows 946 cols
[2025-06-03 04:10:21] [INFO ] Computed 41 invariants in 30 ms
[2025-06-03 04:10:21] [INFO ] State equation strengthened by 1634 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) 866/868 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/887 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:23] [INFO ] Deduced a trap composed of 63 places in 1289 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:24] [INFO ] Deduced a trap composed of 70 places in 1049 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:25] [INFO ] Deduced a trap composed of 95 places in 1113 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:26] [INFO ] Deduced a trap composed of 70 places in 1068 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:27] [INFO ] Deduced a trap composed of 116 places in 1095 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:28] [INFO ] Deduced a trap composed of 107 places in 987 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:29] [INFO ] Deduced a trap composed of 63 places in 1008 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:31] [INFO ] Deduced a trap composed of 112 places in 1243 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:32] [INFO ] Deduced a trap composed of 94 places in 1152 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:33] [INFO ] Deduced a trap composed of 64 places in 1168 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:34] [INFO ] Deduced a trap composed of 80 places in 1181 ms of which 105 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 25/912 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/912 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/938 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/938 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/946 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/946 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2771/3717 variables, 946/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3717 variables, 1634/2632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3717 variables, 0/2632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3717 variables, 0/2632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3717/3717 variables, and 2632 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14714 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 946/946 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 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) 866/868 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/887 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 11/16 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 04:10:37] [INFO ] Deduced a trap composed of 64 places in 1176 ms of which 91 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/887 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/912 variables, 2/19 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 04:10:39] [INFO ] Deduced a trap composed of 27 places in 1229 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:40] [INFO ] Deduced a trap composed of 5 places in 1225 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:41] [INFO ] Deduced a trap composed of 46 places in 1086 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:42] [INFO ] Deduced a trap composed of 49 places in 1250 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:44] [INFO ] Deduced a trap composed of 50 places in 1256 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:45] [INFO ] Deduced a trap composed of 50 places in 1503 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:46] [INFO ] Deduced a trap composed of 50 places in 1244 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:47] [INFO ] Deduced a trap composed of 50 places in 1066 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:49] [INFO ] Deduced a trap composed of 49 places in 1229 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:50] [INFO ] Deduced a trap composed of 62 places in 1260 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:51] [INFO ] Deduced a trap composed of 50 places in 1262 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:53] [INFO ] Deduced a trap composed of 50 places in 1337 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:54] [INFO ] Deduced a trap composed of 49 places in 1517 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:55] [INFO ] Deduced a trap composed of 52 places in 1206 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:57] [INFO ] Deduced a trap composed of 46 places in 1380 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:58] [INFO ] Deduced a trap composed of 51 places in 1442 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:00] [INFO ] Deduced a trap composed of 49 places in 1443 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:01] [INFO ] Deduced a trap composed of 52 places in 1402 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:02] [INFO ] Deduced a trap composed of 27 places in 1252 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:04] [INFO ] Deduced a trap composed of 52 places in 1378 ms of which 142 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/912 variables, 20/39 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 04:11:05] [INFO ] Deduced a trap composed of 46 places in 1276 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:06] [INFO ] Deduced a trap composed of 56 places in 1245 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:07] [INFO ] Deduced a trap composed of 53 places in 1108 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:09] [INFO ] Deduced a trap composed of 50 places in 1272 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:10] [INFO ] Deduced a trap composed of 57 places in 1093 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:11] [INFO ] Deduced a trap composed of 50 places in 1246 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:12] [INFO ] Deduced a trap composed of 52 places in 1262 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:14] [INFO ] Deduced a trap composed of 50 places in 1185 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:15] [INFO ] Deduced a trap composed of 50 places in 1193 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:16] [INFO ] Deduced a trap composed of 50 places in 1239 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:17] [INFO ] Deduced a trap composed of 50 places in 1223 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:18] [INFO ] Deduced a trap composed of 50 places in 1087 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:20] [INFO ] Deduced a trap composed of 50 places in 1251 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:11:21] [INFO ] Deduced a trap composed of 50 places in 1241 ms of which 86 ms to minimize.
SMT process timed out in 59817ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 3169/3169 transitions.
Applied a total of 0 rules in 93 ms. Remains 946 /946 variables (removed 0) and now considering 3169/3169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 946/946 places, 3169/3169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 3169/3169 transitions.
Applied a total of 0 rules in 115 ms. Remains 946 /946 variables (removed 0) and now considering 3169/3169 (removed 0) transitions.
[2025-06-03 04:11:21] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2025-06-03 04:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:11:24] [INFO ] Implicit Places using invariants in 2519 ms returned []
[2025-06-03 04:11:24] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2025-06-03 04:11:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:11:25] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2025-06-03 04:11:56] [INFO ] Performed 426/946 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:12:26] [INFO ] Performed 798/946 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 04:12:35] [INFO ] Implicit Places using invariants and state equation in 71040 ms returned []
Implicit Place search using SMT with State Equation took 73563 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:12:35] [INFO ] Redundant transitions in 291 ms returned []
Running 3107 sub problems to find dead transitions.
[2025-06-03 04:12:35] [INFO ] Flow matrix only has 2771 transitions (discarded 398 similar events)
[2025-06-03 04:12:35] [INFO ] Invariant cache hit.
[2025-06-03 04:12:35] [INFO ] State equation strengthened by 1634 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/944 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3107 unsolved
SMT process timed out in 34015ms, After SMT, problems are : Problem set: 0 solved, 3107 unsolved
Search for dead transitions found 0 dead transitions in 34028ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108014 ms. Remains : 946/946 places, 3169/3169 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 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 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1077 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1077/1077 places, 2490/2490 transitions.
Applied a total of 0 rules in 169 ms. Remains 1077 /1077 variables (removed 0) and now considering 2490/2490 (removed 0) transitions.
[2025-06-03 04:13:10] [INFO ] Flow matrix only has 2218 transitions (discarded 272 similar events)
// Phase 1: matrix 2218 rows 1077 cols
[2025-06-03 04:13:10] [INFO ] Computed 41 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:13:12] [INFO ] Implicit Places using invariants in 2548 ms returned []
[2025-06-03 04:13:12] [INFO ] Flow matrix only has 2218 transitions (discarded 272 similar events)
[2025-06-03 04:13:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:13:13] [INFO ] State equation strengthened by 824 read => feed constraints.
[2025-06-03 04:13:44] [INFO ] Performed 1067/1077 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2025-06-03 04:13:44] [INFO ] Implicit Places using invariants and state equation in 31802 ms returned [1062, 1072]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 34355 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1075/1077 places, 2490/2490 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1075 transition count 2488
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1073 transition count 2488
Applied a total of 4 rules in 187 ms. Remains 1073 /1075 variables (removed 2) and now considering 2488/2490 (removed 2) transitions.
[2025-06-03 04:13:44] [INFO ] Flow matrix only has 2216 transitions (discarded 272 similar events)
// Phase 1: matrix 2216 rows 1073 cols
[2025-06-03 04:13:44] [INFO ] Computed 39 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:13:47] [INFO ] Implicit Places using invariants in 2456 ms returned []
[2025-06-03 04:13:47] [INFO ] Flow matrix only has 2216 transitions (discarded 272 similar events)
[2025-06-03 04:13:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:13:48] [INFO ] State equation strengthened by 824 read => feed constraints.
[2025-06-03 04:14:17] [INFO ] Implicit Places using invariants and state equation in 30458 ms returned []
Implicit Place search using SMT with State Equation took 32927 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1073/1077 places, 2488/2490 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67639 ms. Remains : 1073/1077 places, 2488/2490 transitions.
Computed a total of 258 stabilizing places and 872 stable transitions
Computed a total of 258 stabilizing places and 872 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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)]
RANDOM walk for 40000 steps (1358 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (265 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 68839 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 68839 steps, saw 28888 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2025-06-03 04:14:20] [INFO ] Flow matrix only has 2216 transitions (discarded 272 similar events)
[2025-06-03 04:14:20] [INFO ] Invariant cache hit.
[2025-06-03 04:14:20] [INFO ] State equation strengthened by 824 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) 995/997 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/997 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1016 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:22] [INFO ] Deduced a trap composed of 78 places in 1010 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:23] [INFO ] Deduced a trap composed of 124 places in 1110 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:24] [INFO ] Deduced a trap composed of 125 places in 1183 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:25] [INFO ] Deduced a trap composed of 133 places in 1161 ms of which 171 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1016 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1016 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 25/1041 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5019ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1073 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1073/1073 places, 2488/2488 transitions.
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 131 place count 1073 transition count 3167
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 262 place count 942 transition count 3167
Applied a total of 262 rules in 370 ms. Remains 942 /1073 variables (removed 131) and now considering 3167/2488 (removed -679) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 942/1073 places, 3167/2488 transitions.
RANDOM walk for 40000 steps (1706 resets) in 852 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (187 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 67316 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 67316 steps, saw 27995 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2025-06-03 04:14:29] [INFO ] Flow matrix only has 2769 transitions (discarded 398 similar events)
// Phase 1: matrix 2769 rows 942 cols
[2025-06-03 04:14:29] [INFO ] Computed 39 invariants in 76 ms
[2025-06-03 04:14:29] [INFO ] State equation strengthened by 1634 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) 864/866 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/866 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/885 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/910 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/910 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/936 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/942 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/942 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2769/3711 variables, 942/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3711 variables, 1634/2615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3711 variables, 0/2615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3711 variables, 0/2615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3711/3711 variables, and 2615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2222 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 942/942 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 864/866 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/866 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/885 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:33] [INFO ] Deduced a trap composed of 110 places in 1324 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:34] [INFO ] Deduced a trap composed of 114 places in 1339 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:35] [INFO ] Deduced a trap composed of 101 places in 1163 ms of which 117 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/910 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:37] [INFO ] Deduced a trap composed of 5 places in 1032 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:38] [INFO ] Deduced a trap composed of 27 places in 1022 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:39] [INFO ] Deduced a trap composed of 46 places in 1084 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:40] [INFO ] Deduced a trap composed of 62 places in 1283 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:41] [INFO ] Deduced a trap composed of 75 places in 1076 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:42] [INFO ] Deduced a trap composed of 85 places in 1121 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:43] [INFO ] Deduced a trap composed of 111 places in 1147 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:45] [INFO ] Deduced a trap composed of 52 places in 1195 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:46] [INFO ] Deduced a trap composed of 52 places in 1050 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:47] [INFO ] Deduced a trap composed of 52 places in 1134 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:48] [INFO ] Deduced a trap composed of 52 places in 1531 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:50] [INFO ] Deduced a trap composed of 53 places in 1178 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:51] [INFO ] Deduced a trap composed of 51 places in 1034 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:52] [INFO ] Deduced a trap composed of 52 places in 1202 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:53] [INFO ] Deduced a trap composed of 52 places in 1005 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:54] [INFO ] Deduced a trap composed of 52 places in 1320 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:55] [INFO ] Deduced a trap composed of 52 places in 1194 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:57] [INFO ] Deduced a trap composed of 52 places in 1101 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:58] [INFO ] Deduced a trap composed of 51 places in 1181 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:59] [INFO ] Deduced a trap composed of 51 places in 1382 ms of which 84 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/910 variables, 20/30 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 04:15:00] [INFO ] Deduced a trap composed of 51 places in 1155 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:02] [INFO ] Deduced a trap composed of 44 places in 1212 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:03] [INFO ] Deduced a trap composed of 44 places in 1188 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:04] [INFO ] Deduced a trap composed of 44 places in 1154 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:05] [INFO ] Deduced a trap composed of 44 places in 1208 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:06] [INFO ] Deduced a trap composed of 44 places in 1187 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:08] [INFO ] Deduced a trap composed of 44 places in 1105 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:09] [INFO ] Deduced a trap composed of 52 places in 1218 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:10] [INFO ] Deduced a trap composed of 52 places in 1011 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:11] [INFO ] Deduced a trap composed of 52 places in 1038 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:12] [INFO ] Deduced a trap composed of 51 places in 1201 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:13] [INFO ] Deduced a trap composed of 52 places in 1031 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:14] [INFO ] Deduced a trap composed of 52 places in 1047 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:15] [INFO ] Deduced a trap composed of 51 places in 1162 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:17] [INFO ] Deduced a trap composed of 52 places in 1186 ms of which 50 ms to minimize.
SMT process timed out in 47725ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 942 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 942/942 places, 3167/3167 transitions.
Applied a total of 0 rules in 118 ms. Remains 942 /942 variables (removed 0) and now considering 3167/3167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 942/942 places, 3167/3167 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 942/942 places, 3167/3167 transitions.
Applied a total of 0 rules in 129 ms. Remains 942 /942 variables (removed 0) and now considering 3167/3167 (removed 0) transitions.
[2025-06-03 04:15:17] [INFO ] Flow matrix only has 2769 transitions (discarded 398 similar events)
[2025-06-03 04:15:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:15:20] [INFO ] Implicit Places using invariants in 2515 ms returned []
[2025-06-03 04:15:20] [INFO ] Flow matrix only has 2769 transitions (discarded 398 similar events)
[2025-06-03 04:15:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:15:21] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2025-06-03 04:15:51] [INFO ] Performed 436/942 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:16:21] [INFO ] Performed 716/942 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 04:16:33] [INFO ] Implicit Places using invariants and state equation in 73947 ms returned []
Implicit Place search using SMT with State Equation took 76473 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:16:34] [INFO ] Redundant transitions in 188 ms returned []
Running 3105 sub problems to find dead transitions.
[2025-06-03 04:16:34] [INFO ] Flow matrix only has 2769 transitions (discarded 398 similar events)
[2025-06-03 04:16:34] [INFO ] Invariant cache hit.
[2025-06-03 04:16:34] [INFO ] State equation strengthened by 1634 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.
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 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 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 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.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 1.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/940 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3105 unsolved
SMT process timed out in 34466ms, After SMT, problems are : Problem set: 0 solved, 3105 unsolved
Search for dead transitions found 0 dead transitions in 34478ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111285 ms. Remains : 942/942 places, 3167/3167 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3394 reset in 878 ms.
Product exploration explored 100000 steps with 3397 reset in 581 ms.
Built C files in :
/tmp/ltsmin9112977604495983223
[2025-06-03 04:17:10] [INFO ] Too many transitions (2488) to apply POR reductions. Disabling POR matrices.
[2025-06-03 04:17:10] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9112977604495983223
Running compilation step : cd /tmp/ltsmin9112977604495983223;'/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/ltsmin9112977604495983223;'/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/ltsmin9112977604495983223;'/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 1073 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1073/1073 places, 2488/2488 transitions.
Applied a total of 0 rules in 102 ms. Remains 1073 /1073 variables (removed 0) and now considering 2488/2488 (removed 0) transitions.
[2025-06-03 04:17:13] [INFO ] Flow matrix only has 2216 transitions (discarded 272 similar events)
// Phase 1: matrix 2216 rows 1073 cols
[2025-06-03 04:17:13] [INFO ] Computed 39 invariants in 49 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:17:16] [INFO ] Implicit Places using invariants in 2548 ms returned []
[2025-06-03 04:17:16] [INFO ] Flow matrix only has 2216 transitions (discarded 272 similar events)
[2025-06-03 04:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:17:17] [INFO ] State equation strengthened by 824 read => feed constraints.
[2025-06-03 04:17:43] [INFO ] Implicit Places using invariants and state equation in 26841 ms returned []
Implicit Place search using SMT with State Equation took 29395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:17:43] [INFO ] Redundant transitions in 184 ms returned []
Running 2471 sub problems to find dead transitions.
[2025-06-03 04:17:43] [INFO ] Flow matrix only has 2216 transitions (discarded 272 similar events)
[2025-06-03 04:17:43] [INFO ] Invariant cache hit.
[2025-06-03 04:17:43] [INFO ] State equation strengthened by 824 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1071 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2471 unsolved
SMT process timed out in 31895ms, After SMT, problems are : Problem set: 0 solved, 2471 unsolved
Search for dead transitions found 0 dead transitions in 31904ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61608 ms. Remains : 1073/1073 places, 2488/2488 transitions.
Built C files in :
/tmp/ltsmin1015605391230537870
[2025-06-03 04:18:15] [INFO ] Too many transitions (2488) to apply POR reductions. Disabling POR matrices.
[2025-06-03 04:18:15] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1015605391230537870
Running compilation step : cd /tmp/ltsmin1015605391230537870;'/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/ltsmin1015605391230537870;'/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/ltsmin1015605391230537870;'/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 04:18:18] [INFO ] Flatten gal took : 78 ms
[2025-06-03 04:18:18] [INFO ] Flatten gal took : 89 ms
[2025-06-03 04:18:18] [INFO ] Time to serialize gal into /tmp/LTL12744414236952310850.gal : 14 ms
[2025-06-03 04:18:18] [INFO ] Time to serialize properties into /tmp/LTL11698181294537541614.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/LTL12744414236952310850.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7275630965858350637.hoa' '-atoms' '/tmp/LTL11698181294537541614.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/LTL11698181294537541614.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7275630965858350637.hoa
Detected timeout of ITS tools.
[2025-06-03 04:18:33] [INFO ] Flatten gal took : 57 ms
[2025-06-03 04:18:33] [INFO ] Flatten gal took : 58 ms
[2025-06-03 04:18:33] [INFO ] Time to serialize gal into /tmp/LTL12625417964115035501.gal : 12 ms
[2025-06-03 04:18:33] [INFO ] Time to serialize properties into /tmp/LTL16708588603838643361.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/LTL12625417964115035501.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16708588603838643361.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node13NotifyThatHeIsActive<1)||(Node14ThinksNode13ShouldBeNodeMasterToReplaceNode12<1))"))))
Formula 0 simplified : FG!"((Node13NotifyThatHeIsActive<1)||(Node14ThinksNode13ShouldBeNodeMasterToReplaceNode12<1))"
Detected timeout of ITS tools.
[2025-06-03 04:18:48] [INFO ] Flatten gal took : 57 ms
[2025-06-03 04:18:48] [INFO ] Applying decomposition
[2025-06-03 04:18:48] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6670344639353548714.txt' '-o' '/tmp/graph6670344639353548714.bin' '-w' '/tmp/graph6670344639353548714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6670344639353548714.bin' '-l' '-1' '-v' '-w' '/tmp/graph6670344639353548714.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:18:49] [INFO ] Decomposing Gal with order
[2025-06-03 04:18:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:18:49] [INFO ] Removed a total of 3368 redundant transitions.
[2025-06-03 04:18:49] [INFO ] Flatten gal took : 223 ms
[2025-06-03 04:18:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1174 labels/synchronizations in 96 ms.
[2025-06-03 04:18:49] [INFO ] Time to serialize gal into /tmp/LTL9589409487149967085.gal : 27 ms
[2025-06-03 04:18:49] [INFO ] Time to serialize properties into /tmp/LTL6518160831266285265.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/LTL9589409487149967085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6518160831266285265.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(F("((i15.i1.u107.Node13NotifyThatHeIsActive<1)||(i15.i1.u128.Node14ThinksNode13ShouldBeNodeMasterToReplaceNode12<1))"))))
Formula 0 simplified : FG!"((i15.i1.u107.Node13NotifyThatHeIsActive<1)||(i15.i1.u128.Node14ThinksNode13ShouldBeNodeMasterToReplaceNode12<1))"
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-06 finished in 548467 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) U G((!p1||X((X((!p1&&G(!p2))) U (!p1&&X((!p1&&G(!p2))))))))))'
Support contains 9 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1192 transition count 2659
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1192 transition count 2659
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 1180 transition count 2620
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 1180 transition count 2620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1177 transition count 2608
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1177 transition count 2608
Applied a total of 66 rules in 389 ms. Remains 1177 /1210 variables (removed 33) and now considering 2608/2695 (removed 87) transitions.
[2025-06-03 04:19:05] [INFO ] Flow matrix only has 2336 transitions (discarded 272 similar events)
// Phase 1: matrix 2336 rows 1177 cols
[2025-06-03 04:19:05] [INFO ] Computed 56 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:19:08] [INFO ] Implicit Places using invariants in 2923 ms returned [12, 99, 459, 482, 522, 582, 602, 612, 613, 733, 778, 888, 954]
[2025-06-03 04:19:08] [INFO ] Actually due to overlaps returned [888, 12, 99, 459, 482, 522, 582, 602, 612, 613, 778, 954]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2927 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1165/1210 places, 2608/2695 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1154 transition count 2597
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1154 transition count 2597
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1143 transition count 2586
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1143 transition count 2586
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1132 transition count 2575
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1132 transition count 2575
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1122 transition count 2535
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1122 transition count 2535
Applied a total of 86 rules in 457 ms. Remains 1122 /1165 variables (removed 43) and now considering 2535/2608 (removed 73) transitions.
[2025-06-03 04:19:08] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1122 cols
[2025-06-03 04:19:08] [INFO ] Computed 44 invariants in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:19:11] [INFO ] Implicit Places using invariants in 2588 ms returned [698]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2591 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1121/1210 places, 2535/2695 transitions.
Applied a total of 0 rules in 91 ms. Remains 1121 /1121 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6457 ms. Remains : 1121/1210 places, 2535/2695 transitions.
Stuttering acceptance computed with spot in 564 ms :[p1, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), p1, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), p1, (NOT p0), (AND (NOT p0) p2), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07
Product exploration explored 100000 steps with 2393 reset in 762 ms.
Product exploration explored 100000 steps with 2391 reset in 974 ms.
Computed a total of 289 stabilizing places and 902 stable transitions
Computed a total of 289 stabilizing places and 902 stable transitions
Detected a total of 289/1121 stabilizing places and 902/2535 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 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (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 14 factoid took 638 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 488 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (NOT p0), (AND (NOT p0) p2), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (956 resets) in 496 ms. (80 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40004 steps (240 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (240 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
[2025-06-03 04:19:15] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1121 cols
[2025-06-03 04:19:15] [INFO ] Computed 43 invariants in 34 ms
[2025-06-03 04:19:15] [INFO ] State equation strengthened by 827 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf7 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 1028/3384 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 4/33 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/1121 constraints, ReadFeed: 0/827 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 382ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (OR p1 p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 (NOT p1) (NOT p2))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (OR p0 (NOT p1)) (OR p0 (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p1), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 16 factoid took 2243 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 542 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (NOT p0), (AND (NOT p0) p2), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 525 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (NOT p0), (AND (NOT p0) p2), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Support contains 9 out of 1121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1121/1121 places, 2535/2535 transitions.
Applied a total of 0 rules in 106 ms. Remains 1121 /1121 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
[2025-06-03 04:19:18] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2025-06-03 04:19:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:19:21] [INFO ] Implicit Places using invariants in 2162 ms returned []
[2025-06-03 04:19:21] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2025-06-03 04:19:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:19:22] [INFO ] State equation strengthened by 827 read => feed constraints.
[2025-06-03 04:19:49] [INFO ] Implicit Places using invariants and state equation in 28912 ms returned [1110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31088 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1120/1121 places, 2535/2535 transitions.
Applied a total of 0 rules in 106 ms. Remains 1120 /1120 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31302 ms. Remains : 1120/1121 places, 2535/2535 transitions.
Computed a total of 288 stabilizing places and 902 stable transitions
Computed a total of 288 stabilizing places and 902 stable transitions
Detected a total of 288/1120 stabilizing places and 902/2535 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 (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1479 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter sensitive) to 10 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 569 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (NOT p0), (AND (NOT p0) p2), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (957 resets) in 405 ms. (98 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (244 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 36646 steps (223 resets) in 138 ms. (263 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (OR p0 (NOT p1)) (OR p0 (NOT p2))))), (F p1), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 14 factoid took 3736 ms. Reduced automaton from 10 states, 26 edges and 3 AP (stutter sensitive) to 10 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (NOT p0), (AND (NOT p0) p2), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 509 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (NOT p0), (AND (NOT p0) p2), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 540 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (NOT p0), (AND (NOT p0) p2), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Product exploration explored 100000 steps with 2391 reset in 553 ms.
Product exploration explored 100000 steps with 2393 reset in 557 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 553 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), p1, (NOT p0), (AND (NOT p0) p2), (AND p1 p2), (AND (NOT p0) p2), (AND p1 p2)]
Support contains 9 out of 1120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1120/1120 places, 2535/2535 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1120 transition count 2535
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 1120 transition count 2535
Deduced a syphon composed of 24 places in 2 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1120 transition count 2535
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 1111 transition count 2526
Deduced a syphon composed of 15 places in 3 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 1111 transition count 2526
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 2 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 59 place count 1111 transition count 2526
Deduced a syphon composed of 32 places in 1 ms
Applied a total of 59 rules in 704 ms. Remains 1111 /1120 variables (removed 9) and now considering 2526/2535 (removed 9) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:20:01] [INFO ] Redundant transitions in 133 ms returned []
Running 2509 sub problems to find dead transitions.
[2025-06-03 04:20:01] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1111 cols
[2025-06-03 04:20:01] [INFO ] Computed 42 invariants in 44 ms
[2025-06-03 04:20:01] [INFO ] State equation strengthened by 827 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 1.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 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.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 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 1.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 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.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 0.0)
(s131 0.0)
(s132 1.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 1.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.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 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.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 1.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 0.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1109 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2509 unsolved
SMT process timed out in 31914ms, After SMT, problems are : Problem set: 0 solved, 2509 unsolved
Search for dead transitions found 0 dead transitions in 31920ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1111/1120 places, 2526/2535 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32768 ms. Remains : 1111/1120 places, 2526/2535 transitions.
Built C files in :
/tmp/ltsmin10345775516147392889
[2025-06-03 04:20:33] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10345775516147392889
Running compilation step : cd /tmp/ltsmin10345775516147392889;'/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/ltsmin10345775516147392889;'/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/ltsmin10345775516147392889;'/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 9 out of 1120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1120/1120 places, 2535/2535 transitions.
Applied a total of 0 rules in 90 ms. Remains 1120 /1120 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
[2025-06-03 04:20:36] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1120 cols
[2025-06-03 04:20:36] [INFO ] Computed 42 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:20:38] [INFO ] Implicit Places using invariants in 1867 ms returned []
[2025-06-03 04:20:38] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2025-06-03 04:20:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:20:39] [INFO ] State equation strengthened by 827 read => feed constraints.
[2025-06-03 04:21:09] [INFO ] Performed 764/1120 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:21:18] [INFO ] Implicit Places using invariants and state equation in 40673 ms returned []
Implicit Place search using SMT with State Equation took 42545 ms to find 0 implicit places.
Running 2518 sub problems to find dead transitions.
[2025-06-03 04:21:18] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2025-06-03 04:21:18] [INFO ] Invariant cache hit.
[2025-06-03 04:21:18] [INFO ] State equation strengthened by 827 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1118 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2518 unsolved
SMT process timed out in 31417ms, After SMT, problems are : Problem set: 0 solved, 2518 unsolved
Search for dead transitions found 0 dead transitions in 31424ms
Finished structural reductions in LTL mode , in 1 iterations and 74065 ms. Remains : 1120/1120 places, 2535/2535 transitions.
Built C files in :
/tmp/ltsmin6213045441423399394
[2025-06-03 04:21:50] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6213045441423399394
Running compilation step : cd /tmp/ltsmin6213045441423399394;'/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/ltsmin6213045441423399394;'/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/ltsmin6213045441423399394;'/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 04:21:53] [INFO ] Flatten gal took : 66 ms
[2025-06-03 04:21:53] [INFO ] Flatten gal took : 67 ms
[2025-06-03 04:21:53] [INFO ] Time to serialize gal into /tmp/LTL3400615771641692626.gal : 17 ms
[2025-06-03 04:21:53] [INFO ] Time to serialize properties into /tmp/LTL9590739142693875821.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/LTL3400615771641692626.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7532513354905255618.hoa' '-atoms' '/tmp/LTL9590739142693875821.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/LTL9590739142693875821.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7532513354905255618.hoa
Detected timeout of ITS tools.
[2025-06-03 04:22:08] [INFO ] Flatten gal took : 64 ms
[2025-06-03 04:22:08] [INFO ] Flatten gal took : 67 ms
[2025-06-03 04:22:08] [INFO ] Time to serialize gal into /tmp/LTL10256681387715327659.gal : 11 ms
[2025-06-03 04:22:08] [INFO ] Time to serialize properties into /tmp/LTL10960179934295067007.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/LTL10256681387715327659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10960179934295067007.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...277
Read 1 LTL properties
Checking formula 0 : !(((F("(((Lx0IsActiveAndNotInTheLeafSet>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))&&(ANodeFromTheLeafSetOfLx0IsACtiveInTheLeafSet>...840
Formula 0 simplified : G!"(((Lx0IsActiveAndNotInTheLeafSet>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))&&(ANodeFromTheLeafSetOfLx0IsACtiveInTheLeafSet>=1...561
Detected timeout of ITS tools.
[2025-06-03 04:22:23] [INFO ] Flatten gal took : 65 ms
[2025-06-03 04:22:23] [INFO ] Applying decomposition
[2025-06-03 04:22:23] [INFO ] Flatten gal took : 79 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/graph18140050329457944176.txt' '-o' '/tmp/graph18140050329457944176.bin' '-w' '/tmp/graph18140050329457944176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18140050329457944176.bin' '-l' '-1' '-v' '-w' '/tmp/graph18140050329457944176.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:22:24] [INFO ] Decomposing Gal with order
[2025-06-03 04:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:22:24] [INFO ] Removed a total of 1862 redundant transitions.
[2025-06-03 04:22:24] [INFO ] Flatten gal took : 189 ms
[2025-06-03 04:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1437 labels/synchronizations in 69 ms.
[2025-06-03 04:22:24] [INFO ] Time to serialize gal into /tmp/LTL15190376105807664768.gal : 23 ms
[2025-06-03 04:22:24] [INFO ] Time to serialize properties into /tmp/LTL10452056098483110544.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/LTL15190376105807664768.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10452056098483110544.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((F("(((i2.i6.u23.Lx0IsActiveAndNotInTheLeafSet>=1)&&(i2.i5.u22.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))&&(i2.i6.u165.ANodeFromTheLe...997
Formula 0 simplified : G!"(((i2.i6.u23.Lx0IsActiveAndNotInTheLeafSet>=1)&&(i2.i5.u22.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))&&(i2.i6.u165.ANodeFromTheLeaf...675
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07 finished in 214875 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)||F((F(p3)&&X(F(p4))&&p2)))))'
Support contains 6 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1194 transition count 2661
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1194 transition count 2661
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 1184 transition count 2624
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 1184 transition count 2624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1183 transition count 2620
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1183 transition count 2620
Applied a total of 54 rules in 241 ms. Remains 1183 /1210 variables (removed 27) and now considering 2620/2695 (removed 75) transitions.
[2025-06-03 04:22:39] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
// Phase 1: matrix 2348 rows 1183 cols
[2025-06-03 04:22:39] [INFO ] Computed 56 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:42] [INFO ] Implicit Places using invariants in 2747 ms returned [12, 99, 459, 482, 521, 596, 605, 616, 739, 784, 894, 945, 960]
[2025-06-03 04:22:42] [INFO ] Actually due to overlaps returned [596, 894, 12, 99, 459, 482, 521, 605, 616, 784, 960]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2751 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1172/1210 places, 2620/2695 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1163 transition count 2611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1163 transition count 2611
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1154 transition count 2602
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1154 transition count 2602
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 1145 transition count 2593
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 1145 transition count 2593
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 1137 transition count 2561
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 1137 transition count 2561
Applied a total of 70 rules in 493 ms. Remains 1137 /1172 variables (removed 35) and now considering 2561/2620 (removed 59) transitions.
[2025-06-03 04:22:43] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1137 cols
[2025-06-03 04:22:43] [INFO ] Computed 45 invariants in 69 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:45] [INFO ] Implicit Places using invariants in 2841 ms returned [711, 912]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2844 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1135/1210 places, 2561/2695 transitions.
Applied a total of 0 rules in 80 ms. Remains 1135 /1135 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6415 ms. Remains : 1135/1210 places, 2561/2695 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (OR (NOT p2) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (NOT p3), (NOT p4), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-09 finished in 6862 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 ((G(p1) U X(p2))&&F(!p3))))'
Support contains 8 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1193 transition count 2660
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1193 transition count 2660
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 1182 transition count 2625
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 1182 transition count 2625
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1179 transition count 2613
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1179 transition count 2613
Applied a total of 62 rules in 241 ms. Remains 1179 /1210 variables (removed 31) and now considering 2613/2695 (removed 82) transitions.
[2025-06-03 04:22:46] [INFO ] Flow matrix only has 2341 transitions (discarded 272 similar events)
// Phase 1: matrix 2341 rows 1179 cols
[2025-06-03 04:22:46] [INFO ] Computed 56 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:49] [INFO ] Implicit Places using invariants in 2770 ms returned [12, 99, 484, 523, 583, 594, 603, 613, 614, 735, 780, 890, 941, 956]
[2025-06-03 04:22:49] [INFO ] Actually due to overlaps returned [594, 890, 12, 99, 484, 523, 583, 603, 613, 614, 780, 956]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2776 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1167/1210 places, 2613/2695 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1157 transition count 2603
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1157 transition count 2603
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1147 transition count 2593
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1147 transition count 2593
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1137 transition count 2583
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1137 transition count 2583
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 1128 transition count 2547
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 1128 transition count 2547
Applied a total of 78 rules in 315 ms. Remains 1128 /1167 variables (removed 39) and now considering 2547/2613 (removed 66) transitions.
[2025-06-03 04:22:49] [INFO ] Flow matrix only has 2275 transitions (discarded 272 similar events)
// Phase 1: matrix 2275 rows 1128 cols
[2025-06-03 04:22:49] [INFO ] Computed 44 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:52] [INFO ] Implicit Places using invariants in 2583 ms returned [703, 904]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2585 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1126/1210 places, 2547/2695 transitions.
Applied a total of 0 rules in 55 ms. Remains 1126 /1126 variables (removed 0) and now considering 2547/2547 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5973 ms. Remains : 1126/1210 places, 2547/2695 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p2) p3), (NOT p2), p3, (NOT p2), true, (NOT p1), (AND p3 (NOT p1)), (AND p0 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-11 finished in 6299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0&&X(((!p0 U (!p2||G(!p0)))&&p1)))))))'
Support contains 6 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1192 transition count 2656
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1192 transition count 2656
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 1181 transition count 2621
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 1181 transition count 2621
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1178 transition count 2609
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1178 transition count 2609
Applied a total of 64 rules in 227 ms. Remains 1178 /1210 variables (removed 32) and now considering 2609/2695 (removed 86) transitions.
[2025-06-03 04:22:53] [INFO ] Flow matrix only has 2337 transitions (discarded 272 similar events)
// Phase 1: matrix 2337 rows 1178 cols
[2025-06-03 04:22:53] [INFO ] Computed 56 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:56] [INFO ] Implicit Places using invariants in 3034 ms returned [101, 461, 484, 523, 583, 594, 603, 613, 614, 734, 779, 889, 940, 955]
[2025-06-03 04:22:56] [INFO ] Actually due to overlaps returned [594, 889, 101, 461, 484, 523, 583, 603, 613, 614, 779, 955]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 3037 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1166/1210 places, 2609/2695 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1156 transition count 2599
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1156 transition count 2599
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1146 transition count 2589
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1146 transition count 2589
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 1136 transition count 2579
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 1136 transition count 2579
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 1127 transition count 2543
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 1127 transition count 2543
Applied a total of 78 rules in 295 ms. Remains 1127 /1166 variables (removed 39) and now considering 2543/2609 (removed 66) transitions.
[2025-06-03 04:22:56] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1127 cols
[2025-06-03 04:22:56] [INFO ] Computed 44 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:58] [INFO ] Implicit Places using invariants in 2617 ms returned [702, 903]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2622 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1125/1210 places, 2543/2695 transitions.
Applied a total of 0 rules in 57 ms. Remains 1125 /1125 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6238 ms. Remains : 1125/1210 places, 2543/2695 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 1489 ms.
Product exploration explored 100000 steps with 25000 reset in 1215 ms.
Computed a total of 293 stabilizing places and 910 stable transitions
Computed a total of 293 stabilizing places and 910 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
RANDOM walk for 40000 steps (955 resets) in 444 ms. (89 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (244 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (244 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (244 resets) in 551 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (244 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (244 resets) in 465 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (244 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
[2025-06-03 04:23:03] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1125 cols
[2025-06-03 04:23:03] [INFO ] Computed 42 invariants in 24 ms
[2025-06-03 04:23:03] [INFO ] State equation strengthened by 830 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 1042/1048 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1048 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 43/1091 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:04] [INFO ] Deduced a trap composed of 50 places in 1249 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:06] [INFO ] Deduced a trap composed of 67 places in 1174 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:07] [INFO ] Deduced a trap composed of 63 places in 1217 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:08] [INFO ] Deduced a trap composed of 66 places in 1171 ms of which 127 ms to minimize.
SMT process timed out in 5520ms, After SMT, problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1125/1125 places, 2543/2543 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1125 transition count 2528
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1110 transition count 2528
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 1110 transition count 2519
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 1101 transition count 2519
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1100 transition count 2518
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1100 transition count 2518
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 1100 transition count 2517
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 52 place count 1099 transition count 2517
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1098 transition count 2513
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1098 transition count 2513
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 86 place count 1082 transition count 2497
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 217 place count 1082 transition count 2768
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 348 place count 951 transition count 2768
Applied a total of 348 rules in 699 ms. Remains 951 /1125 variables (removed 174) and now considering 2768/2543 (removed -225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 700 ms. Remains : 951/1125 places, 2768/2543 transitions.
RANDOM walk for 40000 steps (1572 resets) in 861 ms. (46 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (158 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (159 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (194 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 64382 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 3
Probabilistic random walk after 64382 steps, saw 26885 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2025-06-03 04:23:12] [INFO ] Flow matrix only has 2370 transitions (discarded 398 similar events)
// Phase 1: matrix 2370 rows 951 cols
[2025-06-03 04:23:12] [INFO ] Computed 42 invariants in 33 ms
[2025-06-03 04:23:12] [INFO ] State equation strengthened by 1229 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 869/873 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/891 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/917 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/917 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 26/943 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/943 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 8/951 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/951 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2370/3321 variables, 951/993 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3321 variables, 1229/2222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3321 variables, 0/2222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3321 variables, 0/2222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3321/3321 variables, and 2222 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3338 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 951/951 constraints, ReadFeed: 1229/1229 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 869/873 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/891 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:17] [INFO ] Deduced a trap composed of 84 places in 1266 ms of which 210 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:18] [INFO ] Deduced a trap composed of 68 places in 1114 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:19] [INFO ] Deduced a trap composed of 67 places in 922 ms of which 103 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 26/917 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:21] [INFO ] Deduced a trap composed of 5 places in 1349 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:22] [INFO ] Deduced a trap composed of 27 places in 1222 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:23] [INFO ] Deduced a trap composed of 46 places in 1142 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:25] [INFO ] Deduced a trap composed of 51 places in 1353 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:26] [INFO ] Deduced a trap composed of 51 places in 1131 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:27] [INFO ] Deduced a trap composed of 50 places in 1089 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:28] [INFO ] Deduced a trap composed of 51 places in 933 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:29] [INFO ] Deduced a trap composed of 51 places in 1272 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:30] [INFO ] Deduced a trap composed of 51 places in 1130 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:31] [INFO ] Deduced a trap composed of 52 places in 995 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:32] [INFO ] Deduced a trap composed of 51 places in 1196 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:34] [INFO ] Deduced a trap composed of 50 places in 1036 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:35] [INFO ] Deduced a trap composed of 50 places in 1263 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:36] [INFO ] Deduced a trap composed of 50 places in 1157 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:37] [INFO ] Deduced a trap composed of 52 places in 1009 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:38] [INFO ] Deduced a trap composed of 51 places in 1146 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:39] [INFO ] Deduced a trap composed of 62 places in 1046 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:40] [INFO ] Deduced a trap composed of 27 places in 1133 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:41] [INFO ] Deduced a trap composed of 45 places in 1060 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:42] [INFO ] Deduced a trap composed of 45 places in 915 ms of which 81 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/917 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:43] [INFO ] Deduced a trap composed of 45 places in 1013 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:45] [INFO ] Deduced a trap composed of 45 places in 1150 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:46] [INFO ] Deduced a trap composed of 45 places in 995 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:47] [INFO ] Deduced a trap composed of 45 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 04:23:48] [INFO ] Deduced a trap composed of 51 places in 980 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:49] [INFO ] Deduced a trap composed of 54 places in 986 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:50] [INFO ] Deduced a trap composed of 51 places in 1349 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:51] [INFO ] Deduced a trap composed of 54 places in 1332 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:52] [INFO ] Deduced a trap composed of 52 places in 989 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:53] [INFO ] Deduced a trap composed of 55 places in 1092 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:55] [INFO ] Deduced a trap composed of 55 places in 996 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:56] [INFO ] Deduced a trap composed of 46 places in 1158 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:57] [INFO ] Deduced a trap composed of 53 places in 993 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:58] [INFO ] Deduced a trap composed of 53 places in 1173 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:59] [INFO ] Deduced a trap composed of 46 places in 1169 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:24:00] [INFO ] Deduced a trap composed of 54 places in 988 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:24:01] [INFO ] Deduced a trap composed of 51 places in 1090 ms of which 136 ms to minimize.
SMT process timed out in 49119ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 2768/2768 transitions.
Applied a total of 0 rules in 125 ms. Remains 951 /951 variables (removed 0) and now considering 2768/2768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 951/951 places, 2768/2768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 2768/2768 transitions.
Applied a total of 0 rules in 132 ms. Remains 951 /951 variables (removed 0) and now considering 2768/2768 (removed 0) transitions.
[2025-06-03 04:24:02] [INFO ] Flow matrix only has 2370 transitions (discarded 398 similar events)
[2025-06-03 04:24:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:24:04] [INFO ] Implicit Places using invariants in 2214 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2217 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 950/951 places, 2768/2768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 949 transition count 2767
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 949 transition count 2767
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 948 transition count 2766
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 948 transition count 2766
Applied a total of 4 rules in 240 ms. Remains 948 /950 variables (removed 2) and now considering 2766/2768 (removed 2) transitions.
[2025-06-03 04:24:04] [INFO ] Flow matrix only has 2368 transitions (discarded 398 similar events)
// Phase 1: matrix 2368 rows 948 cols
[2025-06-03 04:24:04] [INFO ] Computed 41 invariants in 65 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:24:07] [INFO ] Implicit Places using invariants in 2665 ms returned []
[2025-06-03 04:24:07] [INFO ] Flow matrix only has 2368 transitions (discarded 398 similar events)
[2025-06-03 04:24:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:24:08] [INFO ] State equation strengthened by 1229 read => feed constraints.
[2025-06-03 04:24:38] [INFO ] Performed 610/948 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:24:53] [INFO ] Implicit Places using invariants and state equation in 46005 ms returned [945]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 48678 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 947/951 places, 2766/2768 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 947 transition count 2765
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 946 transition count 2765
Applied a total of 2 rules in 87 ms. Remains 946 /947 variables (removed 1) and now considering 2765/2766 (removed 1) transitions.
[2025-06-03 04:24:53] [INFO ] Flow matrix only has 2367 transitions (discarded 398 similar events)
// Phase 1: matrix 2367 rows 946 cols
[2025-06-03 04:24:53] [INFO ] Computed 40 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:24:55] [INFO ] Implicit Places using invariants in 2237 ms returned []
[2025-06-03 04:24:55] [INFO ] Flow matrix only has 2367 transitions (discarded 398 similar events)
[2025-06-03 04:24:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:24:56] [INFO ] State equation strengthened by 1229 read => feed constraints.
[2025-06-03 04:25:26] [INFO ] Performed 555/946 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:25:46] [INFO ] Implicit Places using invariants and state equation in 50706 ms returned []
Implicit Place search using SMT with State Equation took 52945 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 946/951 places, 2765/2768 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 104312 ms. Remains : 946/951 places, 2765/2768 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT p0))), (G (OR (NOT p1) p0 (NOT p2))), (G (OR (NOT p0) (NOT p2))), (G (AND (OR p1 (NOT p0)) (OR (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1125 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1125/1125 places, 2543/2543 transitions.
Applied a total of 0 rules in 94 ms. Remains 1125 /1125 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2025-06-03 04:25:46] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1125 cols
[2025-06-03 04:25:46] [INFO ] Computed 42 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:25:49] [INFO ] Implicit Places using invariants in 2448 ms returned []
[2025-06-03 04:25:49] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2025-06-03 04:25:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:25:50] [INFO ] State equation strengthened by 830 read => feed constraints.
[2025-06-03 04:26:21] [INFO ] Performed 876/1125 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:26:24] [INFO ] Implicit Places using invariants and state equation in 35681 ms returned [1114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 38135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1124/1125 places, 2543/2543 transitions.
Applied a total of 0 rules in 63 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38294 ms. Remains : 1124/1125 places, 2543/2543 transitions.
Computed a total of 292 stabilizing places and 910 stable transitions
Computed a total of 292 stabilizing places and 910 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (956 resets) in 368 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (245 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 63236 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 63236 steps, saw 26975 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2025-06-03 04:26:28] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1124 cols
[2025-06-03 04:26:28] [INFO ] Computed 41 invariants in 37 ms
[2025-06-03 04:26:28] [INFO ] State equation strengthened by 830 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
At refinement iteration 1 (OVERLAPS) 1044/1048 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1048 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 43/1091 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/1117 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1117 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/1124 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1124 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2271/3395 variables, 1124/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3395 variables, 830/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3395 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3395 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3395/3395 variables, and 1995 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2052 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1124/1124 constraints, ReadFeed: 830/830 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1044/1048 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1048 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/1091 variables, 3/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 04:26:32] [INFO ] Deduced a trap composed of 50 places in 1271 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:33] [INFO ] Deduced a trap composed of 66 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 04:26:34] [INFO ] Deduced a trap composed of 67 places in 1245 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:35] [INFO ] Deduced a trap composed of 67 places in 1323 ms of which 125 ms to minimize.
SMT process timed out in 7330ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1124 transition count 2527
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1108 transition count 2527
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 1108 transition count 2519
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 1100 transition count 2519
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 1082 transition count 2501
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 2 with 133 rules applied. Total rules applied 217 place count 1082 transition count 3172
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 2 with 133 rules applied. Total rules applied 350 place count 949 transition count 3172
Applied a total of 350 rules in 450 ms. Remains 949 /1124 variables (removed 175) and now considering 3172/2543 (removed -629) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 949/1124 places, 3172/2543 transitions.
RANDOM walk for 40000 steps (1708 resets) in 879 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (157 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11887 steps, run visited all 1 properties in 524 ms. (steps per millisecond=22 )
Probabilistic random walk after 11887 steps, saw 5085 distinct states, run finished after 531 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 1436 ms.
Product exploration explored 100000 steps with 25000 reset in 1014 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1124 transition count 2543
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 1124 transition count 2543
Deduced a syphon composed of 24 places in 3 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 1124 transition count 2543
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 1116 transition count 2535
Deduced a syphon composed of 16 places in 2 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 1116 transition count 2535
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 2 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 58 place count 1116 transition count 2535
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 1115 transition count 2534
Deduced a syphon composed of 33 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 1115 transition count 2534
Deduced a syphon composed of 33 places in 2 ms
Applied a total of 60 rules in 503 ms. Remains 1115 /1124 variables (removed 9) and now considering 2534/2543 (removed 9) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:26:41] [INFO ] Redundant transitions in 226 ms returned []
Running 2517 sub problems to find dead transitions.
[2025-06-03 04:26:41] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1115 cols
[2025-06-03 04:26:41] [INFO ] Computed 41 invariants in 38 ms
[2025-06-03 04:26:41] [INFO ] State equation strengthened by 830 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 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 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.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 0.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 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.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 1.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 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 1.0)
(s234 0.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 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1113 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2517 unsolved
SMT process timed out in 32290ms, After SMT, problems are : Problem set: 0 solved, 2517 unsolved
Search for dead transitions found 0 dead transitions in 32299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1115/1124 places, 2534/2543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33047 ms. Remains : 1115/1124 places, 2534/2543 transitions.
Built C files in :
/tmp/ltsmin172322908393094881
[2025-06-03 04:27:13] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin172322908393094881
Running compilation step : cd /tmp/ltsmin172322908393094881;'/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/ltsmin172322908393094881;'/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/ltsmin172322908393094881;'/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 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 2543/2543 transitions.
Applied a total of 0 rules in 54 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
[2025-06-03 04:27:16] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1124 cols
[2025-06-03 04:27:16] [INFO ] Computed 41 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:27:19] [INFO ] Implicit Places using invariants in 2512 ms returned []
[2025-06-03 04:27:19] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2025-06-03 04:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:27:20] [INFO ] State equation strengthened by 830 read => feed constraints.
[2025-06-03 04:27:50] [INFO ] Performed 864/1124 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:27:55] [INFO ] Implicit Places using invariants and state equation in 36591 ms returned []
Implicit Place search using SMT with State Equation took 39106 ms to find 0 implicit places.
Running 2526 sub problems to find dead transitions.
[2025-06-03 04:27:55] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2025-06-03 04:27:55] [INFO ] Invariant cache hit.
[2025-06-03 04:27:55] [INFO ] State equation strengthened by 830 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 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 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.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 0.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 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 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 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.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 1.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.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 0.0)
(s313 1.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 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.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 1.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 0.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 1.0)
(s461 0.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 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 0.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 1.0)
(s530 0.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 1.0)
(s602 0.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 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 1.0)
(s629 0.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 0.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 0.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 0.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 1.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 1.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 1.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 1.0)
(s774 0.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 0.0)
(s780 1.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 1.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 1.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 1.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 1.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 1.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 1.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 1.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 1.0)
(s848 0.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 0.0)
(s855 0.0)
(s856 1.0)
(s857 0.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 0.0)
(s862 1.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 1.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 1.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 1.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 1.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1122 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2526 unsolved
SMT process timed out in 31993ms, After SMT, problems are : Problem set: 0 solved, 2526 unsolved
Search for dead transitions found 0 dead transitions in 31998ms
Finished structural reductions in LTL mode , in 1 iterations and 71165 ms. Remains : 1124/1124 places, 2543/2543 transitions.
Built C files in :
/tmp/ltsmin16703644346848047848
[2025-06-03 04:28:27] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16703644346848047848
Running compilation step : cd /tmp/ltsmin16703644346848047848;'/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/ltsmin16703644346848047848;'/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/ltsmin16703644346848047848;'/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 04:28:30] [INFO ] Flatten gal took : 69 ms
[2025-06-03 04:28:31] [INFO ] Flatten gal took : 72 ms
[2025-06-03 04:28:31] [INFO ] Time to serialize gal into /tmp/LTL4737100478712468488.gal : 11 ms
[2025-06-03 04:28:31] [INFO ] Time to serialize properties into /tmp/LTL14267774899340507640.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/LTL4737100478712468488.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10522374873331535704.hoa' '-atoms' '/tmp/LTL14267774899340507640.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/LTL14267774899340507640.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10522374873331535704.hoa
Detected timeout of ITS tools.
[2025-06-03 04:28:46] [INFO ] Flatten gal took : 63 ms
[2025-06-03 04:28:46] [INFO ] Flatten gal took : 65 ms
[2025-06-03 04:28:46] [INFO ] Time to serialize gal into /tmp/LTL436799941322454533.gal : 10 ms
[2025-06-03 04:28:46] [INFO ] Time to serialize properties into /tmp/LTL13974903559476282558.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/LTL436799941322454533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13974903559476282558.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12<1)||(NodesCanDetectThatNode13HasCrashed<1))&&((Node0HasAskedItsLea...550
Formula 0 simplified : XXG(!"((Node1HasDetectedCrashOfNode16<1)||(Node16IsTheNodeMaster<1))" | X(!"(((Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12<1)...455
Detected timeout of ITS tools.
[2025-06-03 04:29:01] [INFO ] Flatten gal took : 101 ms
[2025-06-03 04:29:01] [INFO ] Applying decomposition
[2025-06-03 04:29:01] [INFO ] Flatten gal took : 95 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/graph3045919535212863423.txt' '-o' '/tmp/graph3045919535212863423.bin' '-w' '/tmp/graph3045919535212863423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3045919535212863423.bin' '-l' '-1' '-v' '-w' '/tmp/graph3045919535212863423.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:29:01] [INFO ] Decomposing Gal with order
[2025-06-03 04:29:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:29:01] [INFO ] Removed a total of 1862 redundant transitions.
[2025-06-03 04:29:02] [INFO ] Flatten gal took : 228 ms
[2025-06-03 04:29:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1247 labels/synchronizations in 85 ms.
[2025-06-03 04:29:02] [INFO ] Time to serialize gal into /tmp/LTL762068915064367554.gal : 31 ms
[2025-06-03 04:29:02] [INFO ] Time to serialize properties into /tmp/LTL7171173852376538395.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/LTL762068915064367554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7171173852376538395.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 : !((X(X(F((X(("(((i12.u38.Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12<1)||(i12.u41.NodesCanDetectThatNode13HasCrashed<1))&&((i2....645
Formula 0 simplified : XXG(!"((i0.u0.Node1HasDetectedCrashOfNode16<1)||(i0.u0.Node16IsTheNodeMaster<1))" | X(!"(((i12.u38.Node1ThinksNode13ShouldBeNodeMast...538
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13 finished in 384507 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(((G(F(p1)) U !p1)&&p0))))'
Support contains 4 out of 1210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1210 transition count 2682
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1197 transition count 2682
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 26 place count 1197 transition count 2666
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 1181 transition count 2666
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 73 place count 1166 transition count 2630
Iterating global reduction 2 with 15 rules applied. Total rules applied 88 place count 1166 transition count 2630
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 88 place count 1166 transition count 2627
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 94 place count 1163 transition count 2627
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 102 place count 1155 transition count 2595
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 1155 transition count 2595
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 154 place count 1133 transition count 2573
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 1130 transition count 2570
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 1130 transition count 2570
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 1127 transition count 2558
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 1127 transition count 2558
Applied a total of 166 rules in 663 ms. Remains 1127 /1210 variables (removed 83) and now considering 2558/2695 (removed 137) transitions.
[2025-06-03 04:29:17] [INFO ] Flow matrix only has 2286 transitions (discarded 272 similar events)
// Phase 1: matrix 2286 rows 1127 cols
[2025-06-03 04:29:17] [INFO ] Computed 56 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:20] [INFO ] Implicit Places using invariants in 2911 ms returned [9, 95, 437, 458, 555, 565, 573, 583, 584, 698, 742, 850, 900, 915]
[2025-06-03 04:29:20] [INFO ] Actually due to overlaps returned [565, 850, 9, 95, 437, 458, 555, 573, 583, 584, 742, 915]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2913 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1115/1210 places, 2558/2695 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1107 transition count 2550
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1107 transition count 2550
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1099 transition count 2542
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1099 transition count 2542
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 1093 transition count 2518
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 1093 transition count 2518
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 1091 transition count 2516
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 1089 transition count 2514
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 1089 transition count 2514
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1086 transition count 2502
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1086 transition count 2502
Applied a total of 58 rules in 522 ms. Remains 1086 /1115 variables (removed 29) and now considering 2502/2558 (removed 56) transitions.
[2025-06-03 04:29:21] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1086 cols
[2025-06-03 04:29:21] [INFO ] Computed 44 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:23] [INFO ] Implicit Places using invariants in 1857 ms returned [674, 872]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1859 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1084/1210 places, 2502/2695 transitions.
Applied a total of 0 rules in 112 ms. Remains 1084 /1084 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6070 ms. Remains : 1084/1210 places, 2502/2695 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-14 finished in 6300 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 2 out of 1210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1210 transition count 2682
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1197 transition count 2682
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 26 place count 1197 transition count 2665
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 60 place count 1180 transition count 2665
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 76 place count 1164 transition count 2628
Iterating global reduction 2 with 16 rules applied. Total rules applied 92 place count 1164 transition count 2628
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 92 place count 1164 transition count 2624
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 1160 transition count 2624
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 109 place count 1151 transition count 2588
Iterating global reduction 2 with 9 rules applied. Total rules applied 118 place count 1151 transition count 2588
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 160 place count 1130 transition count 2567
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 1127 transition count 2564
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 1127 transition count 2564
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 169 place count 1124 transition count 2552
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 1124 transition count 2552
Applied a total of 172 rules in 740 ms. Remains 1124 /1210 variables (removed 86) and now considering 2552/2695 (removed 143) transitions.
[2025-06-03 04:29:24] [INFO ] Flow matrix only has 2280 transitions (discarded 272 similar events)
// Phase 1: matrix 2280 rows 1124 cols
[2025-06-03 04:29:24] [INFO ] Computed 56 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:27] [INFO ] Implicit Places using invariants in 2740 ms returned [9, 94, 436, 457, 494, 551, 561, 569, 579, 580, 694, 738, 846, 896, 911]
[2025-06-03 04:29:27] [INFO ] Actually due to overlaps returned [561, 846, 9, 94, 436, 457, 494, 551, 569, 579, 580, 738, 911]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 2743 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1111/1210 places, 2552/2695 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1102 transition count 2543
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1102 transition count 2543
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1093 transition count 2534
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1093 transition count 2534
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 1086 transition count 2506
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 1086 transition count 2506
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1084 transition count 2504
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 1082 transition count 2502
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 1082 transition count 2502
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1079 transition count 2490
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1079 transition count 2490
Applied a total of 64 rules in 742 ms. Remains 1079 /1111 variables (removed 32) and now considering 2490/2552 (removed 62) transitions.
[2025-06-03 04:29:27] [INFO ] Flow matrix only has 2218 transitions (discarded 272 similar events)
// Phase 1: matrix 2218 rows 1079 cols
[2025-06-03 04:29:27] [INFO ] Computed 43 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:29] [INFO ] Implicit Places using invariants in 2047 ms returned [667, 865]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2049 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1077/1210 places, 2490/2695 transitions.
Applied a total of 0 rules in 96 ms. Remains 1077 /1077 variables (removed 0) and now considering 2490/2490 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6371 ms. Remains : 1077/1210 places, 2490/2695 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-15 finished in 6462 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((G(p0)||X(p1))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1210 transition count 2682
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1197 transition count 2682
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 26 place count 1197 transition count 2666
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 1181 transition count 2666
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 72 place count 1167 transition count 2634
Iterating global reduction 2 with 14 rules applied. Total rules applied 86 place count 1167 transition count 2634
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 86 place count 1167 transition count 2631
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 92 place count 1164 transition count 2631
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 1156 transition count 2599
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 1156 transition count 2599
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 152 place count 1134 transition count 2577
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 1131 transition count 2574
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 1131 transition count 2574
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 1128 transition count 2562
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 1128 transition count 2562
Applied a total of 164 rules in 622 ms. Remains 1128 /1210 variables (removed 82) and now considering 2562/2695 (removed 133) transitions.
[2025-06-03 04:29:30] [INFO ] Flow matrix only has 2290 transitions (discarded 272 similar events)
// Phase 1: matrix 2290 rows 1128 cols
[2025-06-03 04:29:30] [INFO ] Computed 56 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:33] [INFO ] Implicit Places using invariants in 2846 ms returned [9, 95, 437, 498, 555, 565, 573, 583, 584, 699, 743, 851, 901, 916]
[2025-06-03 04:29:33] [INFO ] Actually due to overlaps returned [565, 851, 9, 95, 437, 498, 555, 573, 583, 584, 743, 916]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2849 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1116/1210 places, 2562/2695 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1109 transition count 2555
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1109 transition count 2555
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1102 transition count 2548
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1102 transition count 2548
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1097 transition count 2528
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1097 transition count 2528
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 1094 transition count 2525
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1091 transition count 2522
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1091 transition count 2522
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1087 transition count 2506
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1087 transition count 2506
Applied a total of 58 rules in 573 ms. Remains 1087 /1116 variables (removed 29) and now considering 2506/2562 (removed 56) transitions.
[2025-06-03 04:29:34] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
// Phase 1: matrix 2234 rows 1087 cols
[2025-06-03 04:29:34] [INFO ] Computed 44 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:36] [INFO ] Implicit Places using invariants in 2449 ms returned [675, 873]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2453 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1085/1210 places, 2506/2695 transitions.
Applied a total of 0 rules in 74 ms. Remains 1085 /1085 variables (removed 0) and now considering 2506/2506 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 6573 ms. Remains : 1085/1210 places, 2506/2695 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03
Product exploration explored 100000 steps with 3386 reset in 625 ms.
Product exploration explored 100000 steps with 3382 reset in 994 ms.
Computed a total of 270 stabilizing places and 890 stable transitions
Computed a total of 270 stabilizing places and 890 stable transitions
Detected a total of 270/1085 stabilizing places and 890/2506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 657 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (1353 resets) in 643 ms. (62 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (264 resets) in 217 ms. (183 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (264 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
[2025-06-03 04:29:39] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
// Phase 1: matrix 2234 rows 1085 cols
[2025-06-03 04:29:39] [INFO ] Computed 42 invariants in 49 ms
[2025-06-03 04:29:39] [INFO ] State equation strengthened by 833 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 apf4 is UNSAT
After SMT solving in domain Real declared 63/3319 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 2/31 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/1085 constraints, ReadFeed: 0/833 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 16 factoid took 857 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1085/1085 places, 2506/2506 transitions.
Applied a total of 0 rules in 168 ms. Remains 1085 /1085 variables (removed 0) and now considering 2506/2506 (removed 0) transitions.
[2025-06-03 04:29:41] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:29:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:43] [INFO ] Implicit Places using invariants in 2330 ms returned []
[2025-06-03 04:29:43] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:29:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:44] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 04:30:11] [INFO ] Implicit Places using invariants and state equation in 28217 ms returned []
Implicit Place search using SMT with State Equation took 30555 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:30:11] [INFO ] Redundant transitions in 143 ms returned []
Running 2489 sub problems to find dead transitions.
[2025-06-03 04:30:11] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:30:11] [INFO ] Invariant cache hit.
[2025-06-03 04:30:11] [INFO ] State equation strengthened by 833 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1083 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2489 unsolved
SMT process timed out in 32553ms, After SMT, problems are : Problem set: 0 solved, 2489 unsolved
Search for dead transitions found 0 dead transitions in 32563ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63448 ms. Remains : 1085/1085 places, 2506/2506 transitions.
Computed a total of 270 stabilizing places and 890 stable transitions
Computed a total of 270 stabilizing places and 890 stable transitions
Detected a total of 270/1085 stabilizing places and 890/2506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p1 p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 439 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1354 resets) in 523 ms. (76 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
[2025-06-03 04:30:45] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:30:45] [INFO ] Invariant cache hit.
[2025-06-03 04:30:45] [INFO ] State equation strengthened by 833 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 apf5 is UNSAT
After SMT solving in domain Real declared 63/3319 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/31 constraints, Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/1085 constraints, ReadFeed: 0/833 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p1 p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 16 factoid took 659 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3386 reset in 884 ms.
Product exploration explored 100000 steps with 3386 reset in 866 ms.
Built C files in :
/tmp/ltsmin15410657541441237893
[2025-06-03 04:30:48] [INFO ] Too many transitions (2506) to apply POR reductions. Disabling POR matrices.
[2025-06-03 04:30:48] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15410657541441237893
Running compilation step : cd /tmp/ltsmin15410657541441237893;'/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/ltsmin15410657541441237893;'/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/ltsmin15410657541441237893;'/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 1085 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1085/1085 places, 2506/2506 transitions.
Applied a total of 0 rules in 98 ms. Remains 1085 /1085 variables (removed 0) and now considering 2506/2506 (removed 0) transitions.
[2025-06-03 04:30:51] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:30:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:30:53] [INFO ] Implicit Places using invariants in 2475 ms returned []
[2025-06-03 04:30:53] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:30:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:30:55] [INFO ] State equation strengthened by 833 read => feed constraints.
[2025-06-03 04:31:22] [INFO ] Implicit Places using invariants and state equation in 29019 ms returned []
Implicit Place search using SMT with State Equation took 31496 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:31:23] [INFO ] Redundant transitions in 122 ms returned []
Running 2489 sub problems to find dead transitions.
[2025-06-03 04:31:23] [INFO ] Flow matrix only has 2234 transitions (discarded 272 similar events)
[2025-06-03 04:31:23] [INFO ] Invariant cache hit.
[2025-06-03 04:31:23] [INFO ] State equation strengthened by 833 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/1083 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2489 unsolved
SMT process timed out in 32421ms, After SMT, problems are : Problem set: 0 solved, 2489 unsolved
Search for dead transitions found 0 dead transitions in 32427ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64170 ms. Remains : 1085/1085 places, 2506/2506 transitions.
Built C files in :
/tmp/ltsmin8449576012623998930
[2025-06-03 04:31:55] [INFO ] Too many transitions (2506) to apply POR reductions. Disabling POR matrices.
[2025-06-03 04:31:55] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8449576012623998930
Running compilation step : cd /tmp/ltsmin8449576012623998930;'/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/ltsmin8449576012623998930;'/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/ltsmin8449576012623998930;'/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 04:31:58] [INFO ] Flatten gal took : 55 ms
[2025-06-03 04:31:58] [INFO ] Flatten gal took : 56 ms
[2025-06-03 04:31:58] [INFO ] Time to serialize gal into /tmp/LTL6846508103686169300.gal : 10 ms
[2025-06-03 04:31:58] [INFO ] Time to serialize properties into /tmp/LTL11740264074594776190.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/LTL6846508103686169300.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8323476270958980447.hoa' '-atoms' '/tmp/LTL11740264074594776190.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/LTL11740264074594776190.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8323476270958980447.hoa
Detected timeout of ITS tools.
[2025-06-03 04:32:13] [INFO ] Flatten gal took : 55 ms
[2025-06-03 04:32:13] [INFO ] Flatten gal took : 56 ms
[2025-06-03 04:32:13] [INFO ] Time to serialize gal into /tmp/LTL4862207806663180259.gal : 11 ms
[2025-06-03 04:32:13] [INFO ] Time to serialize properties into /tmp/LTL3572024559183014280.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/LTL4862207806663180259.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3572024559183014280.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((G("((Node10ManageTheCrashOfNode15<1)||(Rx1IsAtTheRightExtremityOfTheLeafSet<1))"))||(X("((Node5HasAskedItsLeafSetToLx2ToReplaceN...200
Formula 0 simplified : F(F!"((Node10ManageTheCrashOfNode15<1)||(Rx1IsAtTheRightExtremityOfTheLeafSet<1))" & X!"((Node5HasAskedItsLeafSetToLx2ToReplaceNode3...192
Detected timeout of ITS tools.
[2025-06-03 04:32:29] [INFO ] Flatten gal took : 93 ms
[2025-06-03 04:32:29] [INFO ] Applying decomposition
[2025-06-03 04:32:29] [INFO ] Flatten gal took : 93 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/graph7806726979689802509.txt' '-o' '/tmp/graph7806726979689802509.bin' '-w' '/tmp/graph7806726979689802509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7806726979689802509.bin' '-l' '-1' '-v' '-w' '/tmp/graph7806726979689802509.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:32:29] [INFO ] Decomposing Gal with order
[2025-06-03 04:32:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:32:29] [INFO ] Removed a total of 2252 redundant transitions.
[2025-06-03 04:32:30] [INFO ] Flatten gal took : 461 ms
[2025-06-03 04:32:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 1315 labels/synchronizations in 99 ms.
[2025-06-03 04:32:30] [INFO ] Time to serialize gal into /tmp/LTL8603775191705284763.gal : 28 ms
[2025-06-03 04:32:30] [INFO ] Time to serialize properties into /tmp/LTL11186910528150194431.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/LTL8603775191705284763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11186910528150194431.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 : !((G((G("((i15.i3.u83.Node10ManageTheCrashOfNode15<1)||(i15.i3.u19.Rx1IsAtTheRightExtremityOfTheLeafSet<1))"))||(X("((i15.i1.u72.Node5...244
Formula 0 simplified : F(F!"((i15.i3.u83.Node10ManageTheCrashOfNode15<1)||(i15.i3.u19.Rx1IsAtTheRightExtremityOfTheLeafSet<1))" & X!"((i15.i1.u72.Node5HasA...236
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03 finished in 195217 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)))'
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) U G((!p1||X((X((!p1&&G(!p2))) U (!p1&&X((!p1&&G(!p2))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0&&X(((!p0 U (!p2||G(!p0)))&&p1)))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
Support contains 6 out of 1210 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1210/1210 places, 2695/2695 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 1210 transition count 2682
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 1197 transition count 2682
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 26 place count 1197 transition count 2666
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 1181 transition count 2666
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 73 place count 1166 transition count 2630
Iterating global reduction 2 with 15 rules applied. Total rules applied 88 place count 1166 transition count 2630
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 88 place count 1166 transition count 2627
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 94 place count 1163 transition count 2627
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 102 place count 1155 transition count 2595
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 1155 transition count 2595
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 152 place count 1134 transition count 2574
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 1131 transition count 2571
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 1131 transition count 2571
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 1128 transition count 2559
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 1128 transition count 2559
Applied a total of 164 rules in 710 ms. Remains 1128 /1210 variables (removed 82) and now considering 2559/2695 (removed 136) transitions.
[2025-06-03 04:32:47] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
// Phase 1: matrix 2287 rows 1128 cols
[2025-06-03 04:32:47] [INFO ] Computed 56 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:32:49] [INFO ] Implicit Places using invariants in 2284 ms returned [97, 440, 461, 498, 555, 565, 573, 583, 584, 698, 742, 850, 900, 915]
[2025-06-03 04:32:49] [INFO ] Actually due to overlaps returned [565, 850, 97, 440, 461, 498, 555, 573, 583, 584, 742, 915]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 2286 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1116/1210 places, 2559/2695 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1109 transition count 2552
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1109 transition count 2552
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1102 transition count 2545
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1102 transition count 2545
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1097 transition count 2525
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1097 transition count 2525
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 1094 transition count 2522
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1091 transition count 2519
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1091 transition count 2519
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1087 transition count 2503
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1087 transition count 2503
Applied a total of 58 rules in 499 ms. Remains 1087 /1116 variables (removed 29) and now considering 2503/2559 (removed 56) transitions.
[2025-06-03 04:32:49] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1087 cols
[2025-06-03 04:32:49] [INFO ] Computed 44 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:32:52] [INFO ] Implicit Places using invariants in 2579 ms returned [674, 872]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2585 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1085/1210 places, 2503/2695 transitions.
Applied a total of 0 rules in 79 ms. Remains 1085 /1085 variables (removed 0) and now considering 2503/2503 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 6159 ms. Remains : 1085/1210 places, 2503/2695 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 1044 ms.
Product exploration explored 100000 steps with 25000 reset in 1035 ms.
Computed a total of 269 stabilizing places and 886 stable transitions
Computed a total of 269 stabilizing places and 886 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) (AND p0 p2)), (AND p0 p2)]
RANDOM walk for 40000 steps (1353 resets) in 613 ms. (65 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (264 resets) in 240 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (265 resets) in 287 ms. (138 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40002 steps (265 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 191 ms. (208 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (265 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (264 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
[2025-06-03 04:32:55] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1085 cols
[2025-06-03 04:32:55] [INFO ] Computed 42 invariants in 25 ms
[2025-06-03 04:32:55] [INFO ] State equation strengthened by 830 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 749/755 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/755 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 296/1051 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1051 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 26/1077 variables, 26/34 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/1085 variables, 8/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1085 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2231/3316 variables, 1085/1127 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3316 variables, 830/1957 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3316 variables, 0/1957 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3316 variables, 0/1957 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3316/3316 variables, and 1957 constraints, problems are : Problem set: 3 solved, 3 unsolved in 2897 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1085/1085 constraints, ReadFeed: 830/830 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 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: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 690/694 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/694 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 314/1008 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:59] [INFO ] Deduced a trap composed of 47 places in 834 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:00] [INFO ] Deduced a trap composed of 93 places in 550 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:01] [INFO ] Deduced a trap composed of 132 places in 801 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:01] [INFO ] Deduced a trap composed of 132 places in 562 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:02] [INFO ] Deduced a trap composed of 157 places in 541 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:03] [INFO ] Deduced a trap composed of 164 places in 592 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:03] [INFO ] Deduced a trap composed of 207 places in 613 ms of which 18 ms to minimize.
SMT process timed out in 7978ms, After SMT, problems are : Problem set: 3 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 2503/2503 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 1085 transition count 2502
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 1084 transition count 2502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1083 transition count 2501
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1083 transition count 2501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1082 transition count 2497
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1082 transition count 2497
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 137 place count 1082 transition count 2768
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 268 place count 951 transition count 2768
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 269 place count 951 transition count 2768
Applied a total of 269 rules in 769 ms. Remains 951 /1085 variables (removed 134) and now considering 2768/2503 (removed -265) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 951/1085 places, 2768/2503 transitions.
RANDOM walk for 40000 steps (1571 resets) in 861 ms. (46 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (158 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (158 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (190 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 47496 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 3
Probabilistic random walk after 47496 steps, saw 19880 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 04:33:07] [INFO ] Flow matrix only has 2370 transitions (discarded 398 similar events)
// Phase 1: matrix 2370 rows 951 cols
[2025-06-03 04:33:07] [INFO ] Computed 42 invariants in 19 ms
[2025-06-03 04:33:07] [INFO ] State equation strengthened by 1229 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 869/873 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/891 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:09] [INFO ] Deduced a trap composed of 164 places in 1140 ms of which 230 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:10] [INFO ] Deduced a trap composed of 164 places in 1121 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:11] [INFO ] Deduced a trap composed of 74 places in 1064 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:12] [INFO ] Deduced a trap composed of 116 places in 1045 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:13] [INFO ] Deduced a trap composed of 84 places in 958 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:14] [INFO ] Deduced a trap composed of 98 places in 1118 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:15] [INFO ] Deduced a trap composed of 67 places in 917 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:16] [INFO ] Deduced a trap composed of 67 places in 1066 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:17] [INFO ] Deduced a trap composed of 116 places in 1148 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:19] [INFO ] Deduced a trap composed of 84 places in 1074 ms of which 123 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/917 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/917 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 26/943 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/943 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8/951 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/951 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2370/3321 variables, 951/1003 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3321 variables, 1229/2232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3321 variables, 0/2232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/3321 variables, 0/2232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3321/3321 variables, and 2232 constraints, problems are : Problem set: 0 solved, 3 unsolved in 13902 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 951/951 constraints, ReadFeed: 1229/1229 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 869/873 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 18/891 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:23] [INFO ] Deduced a trap composed of 74 places in 1077 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:24] [INFO ] Deduced a trap composed of 68 places in 1034 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:25] [INFO ] Deduced a trap composed of 68 places in 1005 ms of which 106 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 26/917 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:26] [INFO ] Deduced a trap composed of 5 places in 1167 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:27] [INFO ] Deduced a trap composed of 27 places in 1071 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:28] [INFO ] Deduced a trap composed of 46 places in 991 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:29] [INFO ] Deduced a trap composed of 52 places in 1035 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:30] [INFO ] Deduced a trap composed of 54 places in 1105 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:32] [INFO ] Deduced a trap composed of 54 places in 1155 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:33] [INFO ] Deduced a trap composed of 54 places in 1132 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:34] [INFO ] Deduced a trap composed of 54 places in 1105 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:35] [INFO ] Deduced a trap composed of 53 places in 1131 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:36] [INFO ] Deduced a trap composed of 53 places in 1134 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:37] [INFO ] Deduced a trap composed of 53 places in 1077 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:38] [INFO ] Deduced a trap composed of 53 places in 1202 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:40] [INFO ] Deduced a trap composed of 53 places in 1095 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:41] [INFO ] Deduced a trap composed of 53 places in 1254 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:42] [INFO ] Deduced a trap composed of 53 places in 1036 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:43] [INFO ] Deduced a trap composed of 53 places in 1164 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:44] [INFO ] Deduced a trap composed of 55 places in 1100 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:45] [INFO ] Deduced a trap composed of 53 places in 1137 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:46] [INFO ] Deduced a trap composed of 53 places in 1098 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:48] [INFO ] Deduced a trap composed of 53 places in 1161 ms of which 85 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/917 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:49] [INFO ] Deduced a trap composed of 51 places in 1123 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:50] [INFO ] Deduced a trap composed of 62 places in 1191 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:51] [INFO ] Deduced a trap composed of 52 places in 997 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:52] [INFO ] Deduced a trap composed of 55 places in 1331 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:54] [INFO ] Deduced a trap composed of 46 places in 1146 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:55] [INFO ] Deduced a trap composed of 54 places in 1120 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:56] [INFO ] Deduced a trap composed of 52 places in 975 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:57] [INFO ] Deduced a trap composed of 55 places in 1137 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:58] [INFO ] Deduced a trap composed of 27 places in 1269 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:59] [INFO ] Deduced a trap composed of 54 places in 1136 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:34:01] [INFO ] Deduced a trap composed of 55 places in 1300 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:34:02] [INFO ] Deduced a trap composed of 46 places in 978 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:34:03] [INFO ] Deduced a trap composed of 51 places in 974 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:34:04] [INFO ] Deduced a trap composed of 58 places in 1139 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:34:05] [INFO ] Deduced a trap composed of 59 places in 1124 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:34:06] [INFO ] Deduced a trap composed of 54 places in 1108 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:34:07] [INFO ] Deduced a trap composed of 55 places in 1163 ms of which 90 ms to minimize.
SMT process timed out in 59876ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 2768/2768 transitions.
Applied a total of 0 rules in 90 ms. Remains 951 /951 variables (removed 0) and now considering 2768/2768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 951/951 places, 2768/2768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 2768/2768 transitions.
Applied a total of 0 rules in 90 ms. Remains 951 /951 variables (removed 0) and now considering 2768/2768 (removed 0) transitions.
[2025-06-03 04:34:07] [INFO ] Flow matrix only has 2370 transitions (discarded 398 similar events)
[2025-06-03 04:34:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:34:10] [INFO ] Implicit Places using invariants in 2409 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2411 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 950/951 places, 2768/2768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 949 transition count 2767
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 949 transition count 2767
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 948 transition count 2766
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 948 transition count 2766
Applied a total of 4 rules in 148 ms. Remains 948 /950 variables (removed 2) and now considering 2766/2768 (removed 2) transitions.
[2025-06-03 04:34:10] [INFO ] Flow matrix only has 2368 transitions (discarded 398 similar events)
// Phase 1: matrix 2368 rows 948 cols
[2025-06-03 04:34:10] [INFO ] Computed 41 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:34:12] [INFO ] Implicit Places using invariants in 2030 ms returned []
[2025-06-03 04:34:12] [INFO ] Flow matrix only has 2368 transitions (discarded 398 similar events)
[2025-06-03 04:34:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:34:13] [INFO ] State equation strengthened by 1229 read => feed constraints.
[2025-06-03 04:34:44] [INFO ] Performed 532/948 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:35:05] [INFO ] Implicit Places using invariants and state equation in 53042 ms returned [943]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 55076 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 947/951 places, 2766/2768 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 947 transition count 2765
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 946 transition count 2765
Applied a total of 2 rules in 107 ms. Remains 946 /947 variables (removed 1) and now considering 2765/2766 (removed 1) transitions.
[2025-06-03 04:35:05] [INFO ] Flow matrix only has 2367 transitions (discarded 398 similar events)
// Phase 1: matrix 2367 rows 946 cols
[2025-06-03 04:35:05] [INFO ] Computed 40 invariants in 61 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:35:08] [INFO ] Implicit Places using invariants in 2407 ms returned []
[2025-06-03 04:35:08] [INFO ] Flow matrix only has 2367 transitions (discarded 398 similar events)
[2025-06-03 04:35:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:35:09] [INFO ] State equation strengthened by 1229 read => feed constraints.
[2025-06-03 04:35:39] [INFO ] Performed 667/946 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:35:46] [INFO ] Implicit Places using invariants and state equation in 38350 ms returned []
Implicit Place search using SMT with State Equation took 40762 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 946/951 places, 2765/2768 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 98596 ms. Remains : 946/951 places, 2765/2768 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT p0))), (G (OR (NOT p1) p0 (NOT p2))), (G (OR (NOT p0) (NOT p2))), (G (AND (OR p1 (NOT p0)) (OR (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1085 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1085/1085 places, 2503/2503 transitions.
Applied a total of 0 rules in 97 ms. Remains 1085 /1085 variables (removed 0) and now considering 2503/2503 (removed 0) transitions.
[2025-06-03 04:35:46] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1085 cols
[2025-06-03 04:35:47] [INFO ] Computed 42 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:35:49] [INFO ] Implicit Places using invariants in 2546 ms returned []
[2025-06-03 04:35:49] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
[2025-06-03 04:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:35:50] [INFO ] State equation strengthened by 830 read => feed constraints.
[2025-06-03 04:36:21] [INFO ] Performed 928/1085 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 04:36:29] [INFO ] Implicit Places using invariants and state equation in 39942 ms returned [1080]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 42495 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1084/1085 places, 2503/2503 transitions.
Applied a total of 0 rules in 59 ms. Remains 1084 /1084 variables (removed 0) and now considering 2503/2503 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42651 ms. Remains : 1084/1085 places, 2503/2503 transitions.
Computed a total of 268 stabilizing places and 886 stable transitions
Computed a total of 268 stabilizing places and 886 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 23620 steps (796 resets) in 193 ms. (121 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 1625 ms.
Product exploration explored 100000 steps with 25000 reset in 1445 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1084/1084 places, 2503/2503 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 1084 transition count 2503
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1084 transition count 2503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1084 transition count 2503
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 265 ms. Remains 1084 /1084 variables (removed 0) and now considering 2503/2503 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:36:34] [INFO ] Redundant transitions in 201 ms returned []
Running 2486 sub problems to find dead transitions.
[2025-06-03 04:36:34] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1084 cols
[2025-06-03 04:36:34] [INFO ] Computed 41 invariants in 39 ms
[2025-06-03 04:36:34] [INFO ] State equation strengthened by 830 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/1082 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2486 unsolved
SMT process timed out in 32428ms, After SMT, problems are : Problem set: 0 solved, 2486 unsolved
Search for dead transitions found 0 dead transitions in 32437ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/1084 places, 2503/2503 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32926 ms. Remains : 1084/1084 places, 2503/2503 transitions.
Built C files in :
/tmp/ltsmin2979495621120638719
[2025-06-03 04:37:06] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2979495621120638719
Running compilation step : cd /tmp/ltsmin2979495621120638719;'/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/ltsmin2979495621120638719;'/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/ltsmin2979495621120638719;'/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 1084 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1084/1084 places, 2503/2503 transitions.
Applied a total of 0 rules in 93 ms. Remains 1084 /1084 variables (removed 0) and now considering 2503/2503 (removed 0) transitions.
[2025-06-03 04:37:09] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
// Phase 1: matrix 2231 rows 1084 cols
[2025-06-03 04:37:10] [INFO ] Computed 41 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:37:12] [INFO ] Implicit Places using invariants in 2517 ms returned []
[2025-06-03 04:37:12] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
[2025-06-03 04:37:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:37:13] [INFO ] State equation strengthened by 830 read => feed constraints.
[2025-06-03 04:37:38] [INFO ] Implicit Places using invariants and state equation in 25964 ms returned []
Implicit Place search using SMT with State Equation took 28486 ms to find 0 implicit places.
Running 2486 sub problems to find dead transitions.
[2025-06-03 04:37:38] [INFO ] Flow matrix only has 2231 transitions (discarded 272 similar events)
[2025-06-03 04:37:38] [INFO ] Invariant cache hit.
[2025-06-03 04:37:38] [INFO ] State equation strengthened by 830 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 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.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 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.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 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 1.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.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 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.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 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.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 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.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 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 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 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.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 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2486 unsolved
SMT process timed out in 32230ms, After SMT, problems are : Problem set: 0 solved, 2486 unsolved
Search for dead transitions found 0 dead transitions in 32236ms
Finished structural reductions in LTL mode , in 1 iterations and 60822 ms. Remains : 1084/1084 places, 2503/2503 transitions.
Built C files in :
/tmp/ltsmin4024706214061697215
[2025-06-03 04:38:10] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4024706214061697215
Running compilation step : cd /tmp/ltsmin4024706214061697215;'/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/ltsmin4024706214061697215;'/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/ltsmin4024706214061697215;'/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 04:38:13] [INFO ] Flatten gal took : 107 ms
[2025-06-03 04:38:14] [INFO ] Flatten gal took : 97 ms
[2025-06-03 04:38:14] [INFO ] Time to serialize gal into /tmp/LTL7174772220742268119.gal : 18 ms
[2025-06-03 04:38:14] [INFO ] Time to serialize properties into /tmp/LTL8793398839557022725.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/LTL7174772220742268119.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13549596622879675371.hoa' '-atoms' '/tmp/LTL8793398839557022725.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/LTL8793398839557022725.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13549596622879675371.hoa
Detected timeout of ITS tools.
[2025-06-03 04:38:29] [INFO ] Flatten gal took : 93 ms
[2025-06-03 04:38:29] [INFO ] Flatten gal took : 96 ms
[2025-06-03 04:38:29] [INFO ] Time to serialize gal into /tmp/LTL8857544023864642758.gal : 19 ms
[2025-06-03 04:38:29] [INFO ] Time to serialize properties into /tmp/LTL9387555243311332219.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/LTL8857544023864642758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9387555243311332219.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12<1)||(NodesCanDetectThatNode13HasCrashed<1))&&((Node0HasAskedItsLea...550
Formula 0 simplified : XXG(!"((Node1HasDetectedCrashOfNode16<1)||(Node16IsTheNodeMaster<1))" | X(!"(((Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12<1)...455
Detected timeout of ITS tools.
[2025-06-03 04:38:44] [INFO ] Flatten gal took : 52 ms
[2025-06-03 04:38:44] [INFO ] Applying decomposition
[2025-06-03 04:38:44] [INFO ] Flatten gal took : 53 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/graph10608661879035684143.txt' '-o' '/tmp/graph10608661879035684143.bin' '-w' '/tmp/graph10608661879035684143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10608661879035684143.bin' '-l' '-1' '-v' '-w' '/tmp/graph10608661879035684143.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:38:44] [INFO ] Decomposing Gal with order
[2025-06-03 04:38:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:38:45] [INFO ] Removed a total of 2198 redundant transitions.
[2025-06-03 04:38:45] [INFO ] Flatten gal took : 371 ms
[2025-06-03 04:38:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1178 labels/synchronizations in 86 ms.
[2025-06-03 04:38:45] [INFO ] Time to serialize gal into /tmp/LTL11227839059428699396.gal : 23 ms
[2025-06-03 04:38:45] [INFO ] Time to serialize properties into /tmp/LTL18139371973968323203.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/LTL11227839059428699396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18139371973968323203.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(X(F((X(("(((i14.u35.Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12<1)||(i14.u38.NodesCanDetectThatNode13HasCrashed<1))&&((i1....622
Formula 0 simplified : XXG(!"((u0.Node1HasDetectedCrashOfNode16<1)||(u0.Node16IsTheNodeMaster<1))" | X(!"(((i14.u35.Node1ThinksNode13ShouldBeNodeMasterToRe...521
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13 finished in 374333 ms.
[2025-06-03 04:39:00] [INFO ] Flatten gal took : 114 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5341834403864165425
[2025-06-03 04:39:00] [INFO ] Too many transitions (2695) to apply POR reductions. Disabling POR matrices.
[2025-06-03 04:39:00] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5341834403864165425
Running compilation step : cd /tmp/ltsmin5341834403864165425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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 04:39:00] [INFO ] Applying decomposition
[2025-06-03 04:39:00] [INFO ] Flatten gal took : 120 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/graph13287288221071464562.txt' '-o' '/tmp/graph13287288221071464562.bin' '-w' '/tmp/graph13287288221071464562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13287288221071464562.bin' '-l' '-1' '-v' '-w' '/tmp/graph13287288221071464562.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:39:00] [INFO ] Decomposing Gal with order
[2025-06-03 04:39:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:39:01] [INFO ] Removed a total of 2045 redundant transitions.
[2025-06-03 04:39:01] [INFO ] Flatten gal took : 250 ms
[2025-06-03 04:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1516 labels/synchronizations in 67 ms.
[2025-06-03 04:39:01] [INFO ] Time to serialize gal into /tmp/LTLFireability3550217299747986609.gal : 19 ms
[2025-06-03 04:39:01] [INFO ] Time to serialize properties into /tmp/LTLFireability9057228943988721313.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/LTLFireability3550217299747986609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9057228943988721313.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...276
Read 4 LTL properties
Checking formula 0 : !((G((G("((i4.i0.u104.Node10ManageTheCrashOfNode15<1)||(i4.i1.u181.Rx1IsAtTheRightExtremityOfTheLeafSet<1))"))||(X("((i16.i1.u5.Node5H...243
Formula 0 simplified : F(F!"((i4.i0.u104.Node10ManageTheCrashOfNode15<1)||(i4.i1.u181.Rx1IsAtTheRightExtremityOfTheLeafSet<1))" & X!"((i16.i1.u5.Node5HasAs...235
Compilation finished in 10844 ms.
Running link step : cd /tmp/ltsmin5341834403864165425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 116 ms.
Running LTSmin : cd /tmp/ltsmin5341834403864165425;'/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' '[](([]((LTLAPp0==true))||X((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 79217 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5341834403864165425;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5341834403864165425;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5341834403864165425;'/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' '(<>((LTLAPp3==true)) U []((!(LTLAPp4==true)||X((X((!(LTLAPp4==true)&&[](!(LTLAPp5==true)))) U (!(LTLAPp4==true)&&X((!(LTLAPp4==true)&&[](!(LTLAPp5==true))))))))))' '--buchi-type=spotba'
LTSmin run took 3900 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5341834403864165425;'/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(X(<>((!(LTLAPp6==true)&&X(((!(LTLAPp6==true) U (!(LTLAPp8==true)||[](!(LTLAPp6==true))))&&(LTLAPp7==true)))))))' '--buchi-type=spotba'
LTSmin run took 1266 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin5341834403864165425;'/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' '[](<>((LTLAPp2==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-S16C04"
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-S16C04, 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-174876524300300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 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 ;