About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2575411.00 | 0.00 | 0.00 | FFFFF?F?FFFF??TT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r246-tall-171654350700036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350700036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716571027213
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-S16C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 17:17:08] [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]
[2024-05-24 17:17:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:17:08] [INFO ] Load time of PNML (sax parser for PT used): 386 ms
[2024-05-24 17:17:08] [INFO ] Transformed 5568 places.
[2024-05-24 17:17:08] [INFO ] Transformed 7799 transitions.
[2024-05-24 17:17:08] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 5568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 5536 transition count 7799
Discarding 1614 places :
Symmetric choice reduction at 1 with 1614 rule applications. Total rules 1646 place count 3922 transition count 6185
Iterating global reduction 1 with 1614 rules applied. Total rules applied 3260 place count 3922 transition count 6185
Discarding 1420 places :
Symmetric choice reduction at 1 with 1420 rule applications. Total rules 4680 place count 2502 transition count 4765
Iterating global reduction 1 with 1420 rules applied. Total rules applied 6100 place count 2502 transition count 4765
Discarding 225 places :
Symmetric choice reduction at 1 with 225 rule applications. Total rules 6325 place count 2277 transition count 3415
Iterating global reduction 1 with 225 rules applied. Total rules applied 6550 place count 2277 transition count 3415
Applied a total of 6550 rules in 1017 ms. Remains 2277 /5568 variables (removed 3291) and now considering 3415/7799 (removed 4384) transitions.
[2024-05-24 17:17:10] [INFO ] Flow matrix only has 3143 transitions (discarded 272 similar events)
// Phase 1: matrix 3143 rows 2277 cols
[2024-05-24 17:17:10] [INFO ] Computed 541 invariants in 152 ms
[2024-05-24 17:17:13] [INFO ] Implicit Places using invariants in 2875 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 29, 36, 45, 56, 69, 84, 100, 116, 118, 120, 122, 126, 128, 143, 154, 163, 170, 175, 178, 205, 212, 215, 216, 217, 218, 219, 220, 221, 224, 229, 236, 245, 256, 269, 283, 297, 298, 299, 300, 301, 302, 303, 314, 323, 330, 335, 338, 340, 367, 374, 377, 378, 380, 381, 382, 383, 385, 388, 393, 400, 409, 423, 435, 447, 448, 449, 450, 452, 453, 462, 469, 474, 477, 482, 484, 511, 518, 521, 522, 523, 524, 525, 526, 527, 529, 531, 534, 539, 546, 555, 565, 575, 576, 577, 578, 579, 580, 581, 588, 593, 596, 598, 600, 602, 629, 636, 639, 640, 641, 642, 643, 644, 645, 647, 649, 651, 654, 659, 666, 674, 682, 683, 684, 685, 686, 687, 688, 693, 696, 698, 700, 702, 704, 731, 738, 741, 742, 743, 744, 745, 746, 747, 749, 751, 753, 755, 758, 763, 769, 775, 776, 777, 778, 779, 780, 781, 784, 786, 788, 790, 792, 794, 821, 828, 831, 832, 833, 834, 835, 836, 837, 839, 841, 843, 845, 848, 851, 855, 859, 860, 861, 862, 863, 864, 865, 867, 869, 871, 873, 875, 877, 904, 911, 914, 915, 916, 918, 919, 920, 922, 926, 928, 930, 932, 934, 936, 939, 940, 941, 942, 943, 944, 945, 947, 949, 951, 953, 955, 957, 984, 986, 990, 993, 994, 995, 996, 997, 998, 999, 1001, 1003, 1005, 1007, 1009, 1011, 1013, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1024, 1026, 1028, 1030, 1032, 1034, 1061, 1068, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1079, 1081, 1083, 1085, 1088, 1090, 1092, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1103, 1105, 1107, 1109, 1112, 1114, 1141, 1148, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1160, 1162, 1164, 1166, 1168, 1170, 1173, 1178, 1179, 1180, 1182, 1185, 1190, 1192, 1194, 1196, 1201, 1203, 1237, 1241, 1242, 1243, 1244, 1245, 1246, 1248, 1253, 1255, 1258, 1260, 1263, 1268, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1286, 1289, 1291, 1293, 1295, 1297, 1324, 1331, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1342, 1344, 1346, 1348, 1351, 1356, 1363, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1385, 1390, 1393, 1395, 1397, 1399, 1426, 1433, 1436, 1437, 1438, 1439, 1440, 1441, 1442, 1444, 1446, 1448, 1451, 1456, 1463, 1472, 1483, 1484, 1485, 1486, 1487, 1489, 1498, 1508, 1513, 1516, 1518, 1520, 1547, 1554, 1557, 1558, 1559, 1560, 1561, 1562, 1563, 1565, 1567, 1570, 1575, 1582, 1591, 1602, 1615, 1616, 1617, 1618, 1619, 1620, 1621, 1641, 1648, 1653, 1656, 1658, 1685, 1692, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1703, 1706, 1711, 1718, 1727, 1738, 1751, 1766, 1767, 1768, 1769, 1770, 1771, 1772, 1785, 1796, 1805, 1812, 1817, 1820, 1847, 1849, 1853, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1865, 1870, 1877, 1886, 1897, 1910, 1925, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1963, 1976, 1987, 1996, 2003, 2008, 2036]
[2024-05-24 17:17:13] [INFO ] Actually due to overlaps returned [205, 367, 511, 629, 731, 821, 904, 984, 1061, 1141, 1324, 1426, 1547, 1685, 1847, 2036, 4, 12, 14, 16, 18, 20, 22, 116, 118, 120, 122, 126, 128, 215, 216, 217, 218, 219, 220, 297, 298, 299, 300, 301, 302, 303, 377, 378, 380, 381, 382, 447, 448, 449, 450, 452, 453, 521, 522, 523, 524, 525, 526, 575, 576, 577, 578, 579, 580, 581, 639, 640, 641, 642, 643, 644, 682, 683, 684, 685, 686, 687, 688, 741, 742, 743, 744, 745, 746, 775, 776, 777, 778, 779, 780, 781, 831, 832, 833, 834, 835, 836, 859, 860, 861, 862, 863, 864, 865, 914, 915, 916, 918, 919, 939, 940, 941, 942, 943, 944, 945, 986, 993, 994, 995, 996, 997, 998, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1071, 1072, 1073, 1074, 1075, 1076, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1151, 1152, 1153, 1154, 1155, 1156, 1178, 1179, 1180, 1182, 1241, 1242, 1243, 1244, 1245, 1275, 1276, 1277, 1278, 1279, 1280, 1286, 1334, 1335, 1336, 1337, 1338, 1339, 1372, 1373, 1374, 1375, 1376, 1377, 1385, 1436, 1437, 1438, 1439, 1440, 1441, 1483, 1484, 1485, 1486, 1487, 1498, 1557, 1558, 1559, 1560, 1561, 1562, 1615, 1616, 1617, 1618, 1619, 1620, 1695, 1696, 1697, 1698, 1699, 1700, 1766, 1767, 1768, 1769, 1770, 1771, 1785, 1849, 1856, 1857, 1858, 1859, 1860, 1861, 1942, 1943, 1944, 1945, 1946, 1947, 1963]
Discarding 230 places :
Implicit Place search using SMT only with invariants took 2916 ms to find 230 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2047/5568 places, 3415/7799 transitions.
Discarding 184 places :
Symmetric choice reduction at 0 with 184 rule applications. Total rules 184 place count 1863 transition count 3231
Iterating global reduction 0 with 184 rules applied. Total rules applied 368 place count 1863 transition count 3231
Discarding 183 places :
Symmetric choice reduction at 0 with 183 rule applications. Total rules 551 place count 1680 transition count 3048
Iterating global reduction 0 with 183 rules applied. Total rules applied 734 place count 1680 transition count 3048
Discarding 183 places :
Symmetric choice reduction at 0 with 183 rule applications. Total rules 917 place count 1497 transition count 2865
Iterating global reduction 0 with 183 rules applied. Total rules applied 1100 place count 1497 transition count 2865
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 1124 place count 1473 transition count 2721
Iterating global reduction 0 with 24 rules applied. Total rules applied 1148 place count 1473 transition count 2721
Applied a total of 1148 rules in 305 ms. Remains 1473 /2047 variables (removed 574) and now considering 2721/3415 (removed 694) transitions.
[2024-05-24 17:17:13] [INFO ] Flow matrix only has 2449 transitions (discarded 272 similar events)
// Phase 1: matrix 2449 rows 1473 cols
[2024-05-24 17:17:13] [INFO ] Computed 311 invariants in 69 ms
[2024-05-24 17:17:14] [INFO ] Implicit Places using invariants in 1363 ms returned [7, 17, 22, 29, 38, 49, 62, 77, 93, 130, 141, 150, 157, 162, 165, 198, 200, 203, 208, 215, 224, 235, 248, 262, 286, 295, 302, 307, 310, 312, 323, 327, 329, 332, 337, 344, 353, 367, 379, 400, 407, 412, 415, 420, 422, 435, 437, 439, 441, 444, 449, 456, 465, 475, 490, 495, 498, 500, 502, 504, 513, 515, 517, 519, 521, 524, 529, 536, 544, 555, 558, 560, 562, 564, 566, 575, 577, 579, 581, 583, 585, 588, 593, 599, 606, 608, 610, 612, 614, 616, 625, 627, 629, 631, 633, 635, 638, 641, 645, 649, 651, 653, 655, 657, 659, 668, 672, 674, 678, 680, 682, 684, 686, 688, 691, 693, 695, 697, 699, 701, 710, 712, 714, 716, 718, 720, 722, 724, 726, 729, 731, 733, 735, 737, 739, 748, 750, 752, 754, 756, 758, 761, 763, 765, 768, 770, 772, 774, 777, 779, 788, 791, 794, 796, 798, 800, 802, 804, 807, 815, 820, 822, 824, 826, 831, 833, 848, 852, 854, 859, 861, 864, 866, 869, 874, 880, 887, 889, 891, 893, 895, 906, 908, 910, 912, 914, 916, 919, 924, 931, 939, 950, 953, 955, 957, 959, 968, 970, 972, 974, 976, 979, 984, 991, 1000, 1012, 1030, 1035, 1038, 1040, 1042, 1053, 1055, 1057, 1059, 1062, 1067, 1074, 1083, 1094, 1106, 1126, 1133, 1138, 1141, 1143, 1152, 1154, 1156, 1159, 1164, 1171, 1180, 1191, 1204, 1218, 1241, 1250, 1257, 1262, 1265, 1272, 1274, 1277, 1282, 1289, 1298, 1309, 1322, 1337, 1353, 1380, 1391, 1400, 1407, 1412]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 1373 ms to find 256 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1217/5568 places, 2721/7799 transitions.
Applied a total of 0 rules in 31 ms. Remains 1217 /1217 variables (removed 0) and now considering 2721/2721 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5658 ms. Remains : 1217/5568 places, 2721/7799 transitions.
Support contains 48 out of 1217 places after structural reductions.
[2024-05-24 17:17:15] [INFO ] Flatten gal took : 196 ms
[2024-05-24 17:17:15] [INFO ] Flatten gal took : 131 ms
[2024-05-24 17:17:15] [INFO ] Input system was already deterministic with 2721 transitions.
Support contains 44 out of 1217 places (down from 48) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 28 to 25
RANDOM walk for 40000 steps (641 resets) in 2756 ms. (14 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40003 steps (172 resets) in 402 ms. (99 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (172 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (172 resets) in 185 ms. (215 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 317 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 184 ms. (216 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (172 resets) in 249 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (172 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (172 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (172 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
[2024-05-24 17:17:17] [INFO ] Flow matrix only has 2449 transitions (discarded 272 similar events)
// Phase 1: matrix 2449 rows 1217 cols
[2024-05-24 17:17:17] [INFO ] Computed 55 invariants in 60 ms
[2024-05-24 17:17:17] [INFO ] State equation strengthened by 933 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 1110/1132 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-24 17:17:18] [INFO ] Deduced a trap composed of 391 places in 517 ms of which 20 ms to minimize.
[2024-05-24 17:17:18] [INFO ] Deduced a trap composed of 487 places in 500 ms of which 9 ms to minimize.
[2024-05-24 17:17:19] [INFO ] Deduced a trap composed of 442 places in 476 ms of which 7 ms to minimize.
[2024-05-24 17:17:19] [INFO ] Deduced a trap composed of 672 places in 466 ms of which 7 ms to minimize.
[2024-05-24 17:17:20] [INFO ] Deduced a trap composed of 745 places in 494 ms of which 7 ms to minimize.
[2024-05-24 17:17:20] [INFO ] Deduced a trap composed of 977 places in 472 ms of which 7 ms to minimize.
[2024-05-24 17:17:21] [INFO ] Deduced a trap composed of 626 places in 472 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1132 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1132 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 2/1134 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1134/3666 variables, and 22 constraints, problems are : Problem set: 1 solved, 11 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 15/31 constraints, Generalized P Invariants (flows): 0/24 constraints, State Equation: 0/1217 constraints, ReadFeed: 0/933 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 1 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1111/1131 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1131 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1131 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 2/1133 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1133 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 61/1194 variables, 17/39 constraints. Problems are: Problem set: 1 solved, 11 unsolved
[2024-05-24 17:17:23] [INFO ] Deduced a trap composed of 335 places in 554 ms of which 9 ms to minimize.
[2024-05-24 17:17:24] [INFO ] Deduced a trap composed of 131 places in 579 ms of which 9 ms to minimize.
[2024-05-24 17:17:25] [INFO ] Deduced a trap composed of 130 places in 580 ms of which 9 ms to minimize.
[2024-05-24 17:17:25] [INFO ] Deduced a trap composed of 131 places in 592 ms of which 9 ms to minimize.
[2024-05-24 17:17:26] [INFO ] Deduced a trap composed of 128 places in 554 ms of which 8 ms to minimize.
[2024-05-24 17:17:26] [INFO ] Deduced a trap composed of 150 places in 569 ms of which 8 ms to minimize.
[2024-05-24 17:17:27] [INFO ] Deduced a trap composed of 132 places in 562 ms of which 8 ms to minimize.
SMT process timed out in 10247ms, After SMT, problems are : Problem set: 1 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 1217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1217 transition count 2700
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1196 transition count 2700
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 42 place count 1196 transition count 2685
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 72 place count 1181 transition count 2685
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 79 place count 1174 transition count 2653
Iterating global reduction 2 with 7 rules applied. Total rules applied 86 place count 1174 transition count 2653
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 86 place count 1174 transition count 2652
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 88 place count 1173 transition count 2652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1172 transition count 2646
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1172 transition count 2646
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 144 place count 1145 transition count 2619
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 148 place count 1141 transition count 2615
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 1141 transition count 2615
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 156 place count 1137 transition count 2591
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 1137 transition count 2591
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 291 place count 1137 transition count 3720
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 422 place count 1006 transition count 3720
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 429 place count 1006 transition count 3720
Applied a total of 429 rules in 892 ms. Remains 1006 /1217 variables (removed 211) and now considering 3720/2721 (removed -999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 893 ms. Remains : 1006/1217 places, 3720/2721 transitions.
RANDOM walk for 40000 steps (1123 resets) in 1063 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (123 resets) in 228 ms. (174 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (142 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (123 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (160 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (124 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (125 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (141 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (123 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (142 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (141 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (143 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 61497 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 11
Probabilistic random walk after 61497 steps, saw 25939 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 17:17:32] [INFO ] Flow matrix only has 3331 transitions (discarded 389 similar events)
// Phase 1: matrix 3331 rows 1006 cols
[2024-05-24 17:17:32] [INFO ] Computed 55 invariants in 35 ms
[2024-05-24 17:17:32] [INFO ] State equation strengthened by 2143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 923/943 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 17:17:33] [INFO ] Deduced a trap composed of 99 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:17:33] [INFO ] Deduced a trap composed of 258 places in 521 ms of which 6 ms to minimize.
[2024-05-24 17:17:34] [INFO ] Deduced a trap composed of 309 places in 513 ms of which 6 ms to minimize.
[2024-05-24 17:17:34] [INFO ] Deduced a trap composed of 354 places in 552 ms of which 5 ms to minimize.
[2024-05-24 17:17:35] [INFO ] Deduced a trap composed of 159 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:17:35] [INFO ] Deduced a trap composed of 237 places in 557 ms of which 6 ms to minimize.
[2024-05-24 17:17:36] [INFO ] Deduced a trap composed of 95 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:17:36] [INFO ] Deduced a trap composed of 167 places in 556 ms of which 6 ms to minimize.
[2024-05-24 17:17:37] [INFO ] Deduced a trap composed of 102 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:17:38] [INFO ] Deduced a trap composed of 121 places in 552 ms of which 5 ms to minimize.
[2024-05-24 17:17:38] [INFO ] Deduced a trap composed of 100 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:17:39] [INFO ] Deduced a trap composed of 473 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:17:39] [INFO ] Deduced a trap composed of 146 places in 82 ms of which 2 ms to minimize.
[2024-05-24 17:17:39] [INFO ] Deduced a trap composed of 114 places in 499 ms of which 6 ms to minimize.
[2024-05-24 17:17:40] [INFO ] Deduced a trap composed of 79 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:17:40] [INFO ] Deduced a trap composed of 734 places in 441 ms of which 5 ms to minimize.
[2024-05-24 17:17:41] [INFO ] Deduced a trap composed of 694 places in 455 ms of which 6 ms to minimize.
[2024-05-24 17:17:41] [INFO ] Deduced a trap composed of 181 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:17:42] [INFO ] Deduced a trap composed of 93 places in 540 ms of which 6 ms to minimize.
[2024-05-24 17:17:42] [INFO ] Deduced a trap composed of 365 places in 442 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/943 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 17:17:43] [INFO ] Deduced a trap composed of 535 places in 449 ms of which 7 ms to minimize.
[2024-05-24 17:17:44] [INFO ] Deduced a trap composed of 100 places in 551 ms of which 7 ms to minimize.
[2024-05-24 17:17:44] [INFO ] Deduced a trap composed of 79 places in 557 ms of which 7 ms to minimize.
[2024-05-24 17:17:45] [INFO ] Deduced a trap composed of 119 places in 553 ms of which 6 ms to minimize.
[2024-05-24 17:17:46] [INFO ] Deduced a trap composed of 132 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:17:46] [INFO ] Deduced a trap composed of 92 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:17:47] [INFO ] Deduced a trap composed of 103 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:17:47] [INFO ] Deduced a trap composed of 104 places in 537 ms of which 5 ms to minimize.
[2024-05-24 17:17:48] [INFO ] Deduced a trap composed of 108 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:17:48] [INFO ] Deduced a trap composed of 135 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:17:49] [INFO ] Deduced a trap composed of 121 places in 537 ms of which 6 ms to minimize.
[2024-05-24 17:17:49] [INFO ] Deduced a trap composed of 113 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:17:50] [INFO ] Deduced a trap composed of 104 places in 518 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/943 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 17:17:51] [INFO ] Deduced a trap composed of 309 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:17:51] [INFO ] Deduced a trap composed of 199 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:17:52] [INFO ] Deduced a trap composed of 93 places in 510 ms of which 11 ms to minimize.
[2024-05-24 17:17:52] [INFO ] Deduced a trap composed of 196 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:17:53] [INFO ] Deduced a trap composed of 108 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:17:53] [INFO ] Deduced a trap composed of 94 places in 537 ms of which 6 ms to minimize.
[2024-05-24 17:17:54] [INFO ] Deduced a trap composed of 157 places in 541 ms of which 6 ms to minimize.
[2024-05-24 17:17:54] [INFO ] Deduced a trap composed of 121 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:17:55] [INFO ] Deduced a trap composed of 120 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:17:56] [INFO ] Deduced a trap composed of 341 places in 425 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/943 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 17:17:56] [INFO ] Deduced a trap composed of 502 places in 442 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/943 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 17:17:57] [INFO ] Deduced a trap composed of 181 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:17:58] [INFO ] Deduced a trap composed of 151 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:17:58] [INFO ] Deduced a trap composed of 397 places in 396 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/943 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/943 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2/945 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 17:17:59] [INFO ] Deduced a trap composed of 355 places in 420 ms of which 5 ms to minimize.
[2024-05-24 17:18:00] [INFO ] Deduced a trap composed of 180 places in 505 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/945 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 17:18:01] [INFO ] Deduced a trap composed of 536 places in 411 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/945 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 17:18:02] [INFO ] Deduced a trap composed of 328 places in 437 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/945 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/945 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 36/981 variables, 13/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/981 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 16/997 variables, 16/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/997 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 9/1006 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 3331/4337 variables, 1006/1112 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 20 (INCLUDED_ONLY) 0/4337 variables, 2143/3255 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 17:18:06] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/4337 variables, 1/3256 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4337 variables, 0/3256 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/4337 variables, 0/3256 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4337/4337 variables, and 3256 constraints, problems are : Problem set: 2 solved, 9 unsolved in 37477 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1006/1006 constraints, ReadFeed: 2143/2143 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 922/937 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/937 variables, 37/48 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 17:18:10] [INFO ] Deduced a trap composed of 179 places in 499 ms of which 6 ms to minimize.
[2024-05-24 17:18:11] [INFO ] Deduced a trap composed of 128 places in 496 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/937 variables, 2/50 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/937 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/939 variables, 2/52 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 17:18:12] [INFO ] Deduced a trap composed of 118 places in 496 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 1/53 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 17:18:12] [INFO ] Deduced a trap composed of 522 places in 440 ms of which 8 ms to minimize.
[2024-05-24 17:18:13] [INFO ] Deduced a trap composed of 572 places in 404 ms of which 6 ms to minimize.
[2024-05-24 17:18:13] [INFO ] Deduced a trap composed of 681 places in 432 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/939 variables, 3/56 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 38/977 variables, 13/69 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 2/71 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 17:18:14] [INFO ] Deduced a trap composed of 83 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:18:15] [INFO ] Deduced a trap composed of 83 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:18:15] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-24 17:18:16] [INFO ] Deduced a trap composed of 152 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:18:16] [INFO ] Deduced a trap composed of 95 places in 537 ms of which 6 ms to minimize.
[2024-05-24 17:18:17] [INFO ] Deduced a trap composed of 74 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:18:17] [INFO ] Deduced a trap composed of 71 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:18:18] [INFO ] Deduced a trap composed of 85 places in 583 ms of which 6 ms to minimize.
[2024-05-24 17:18:18] [INFO ] Deduced a trap composed of 92 places in 596 ms of which 6 ms to minimize.
[2024-05-24 17:18:19] [INFO ] Deduced a trap composed of 82 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:18:19] [INFO ] Deduced a trap composed of 84 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:18:20] [INFO ] Deduced a trap composed of 162 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:18:21] [INFO ] Deduced a trap composed of 79 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:18:21] [INFO ] Deduced a trap composed of 89 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:18:22] [INFO ] Deduced a trap composed of 78 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:18:22] [INFO ] Deduced a trap composed of 87 places in 556 ms of which 6 ms to minimize.
[2024-05-24 17:18:23] [INFO ] Deduced a trap composed of 103 places in 536 ms of which 6 ms to minimize.
[2024-05-24 17:18:23] [INFO ] Deduced a trap composed of 102 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:18:24] [INFO ] Deduced a trap composed of 88 places in 566 ms of which 6 ms to minimize.
[2024-05-24 17:18:25] [INFO ] Deduced a trap composed of 91 places in 537 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 20/91 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 17:18:25] [INFO ] Deduced a trap composed of 170 places in 454 ms of which 5 ms to minimize.
[2024-05-24 17:18:26] [INFO ] Deduced a trap composed of 164 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:18:26] [INFO ] Deduced a trap composed of 148 places in 468 ms of which 6 ms to minimize.
[2024-05-24 17:18:27] [INFO ] Deduced a trap composed of 144 places in 471 ms of which 6 ms to minimize.
[2024-05-24 17:18:27] [INFO ] Deduced a trap composed of 149 places in 479 ms of which 6 ms to minimize.
[2024-05-24 17:18:28] [INFO ] Deduced a trap composed of 142 places in 443 ms of which 6 ms to minimize.
[2024-05-24 17:18:28] [INFO ] Deduced a trap composed of 147 places in 439 ms of which 6 ms to minimize.
[2024-05-24 17:18:29] [INFO ] Deduced a trap composed of 151 places in 442 ms of which 6 ms to minimize.
[2024-05-24 17:18:29] [INFO ] Deduced a trap composed of 152 places in 442 ms of which 5 ms to minimize.
[2024-05-24 17:18:29] [INFO ] Deduced a trap composed of 152 places in 434 ms of which 6 ms to minimize.
[2024-05-24 17:18:30] [INFO ] Deduced a trap composed of 182 places in 433 ms of which 5 ms to minimize.
[2024-05-24 17:18:30] [INFO ] Deduced a trap composed of 174 places in 439 ms of which 5 ms to minimize.
[2024-05-24 17:18:31] [INFO ] Deduced a trap composed of 188 places in 427 ms of which 6 ms to minimize.
[2024-05-24 17:18:31] [INFO ] Deduced a trap composed of 166 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:18:32] [INFO ] Deduced a trap composed of 72 places in 506 ms of which 7 ms to minimize.
[2024-05-24 17:18:32] [INFO ] Deduced a trap composed of 73 places in 574 ms of which 6 ms to minimize.
[2024-05-24 17:18:33] [INFO ] Deduced a trap composed of 70 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:18:34] [INFO ] Deduced a trap composed of 27 places in 534 ms of which 6 ms to minimize.
[2024-05-24 17:18:34] [INFO ] Deduced a trap composed of 78 places in 545 ms of which 6 ms to minimize.
[2024-05-24 17:18:35] [INFO ] Deduced a trap composed of 87 places in 608 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 20/111 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 17:18:35] [INFO ] Deduced a trap composed of 79 places in 610 ms of which 7 ms to minimize.
[2024-05-24 17:18:36] [INFO ] Deduced a trap composed of 86 places in 547 ms of which 5 ms to minimize.
[2024-05-24 17:18:37] [INFO ] Deduced a trap composed of 75 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:18:37] [INFO ] Deduced a trap composed of 67 places in 543 ms of which 6 ms to minimize.
[2024-05-24 17:18:38] [INFO ] Deduced a trap composed of 78 places in 565 ms of which 6 ms to minimize.
[2024-05-24 17:18:38] [INFO ] Deduced a trap composed of 70 places in 537 ms of which 6 ms to minimize.
[2024-05-24 17:18:39] [INFO ] Deduced a trap composed of 65 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:18:39] [INFO ] Deduced a trap composed of 91 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:18:40] [INFO ] Deduced a trap composed of 88 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:18:40] [INFO ] Deduced a trap composed of 65 places in 549 ms of which 6 ms to minimize.
[2024-05-24 17:18:41] [INFO ] Deduced a trap composed of 61 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:18:42] [INFO ] Deduced a trap composed of 83 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:18:42] [INFO ] Deduced a trap composed of 93 places in 571 ms of which 7 ms to minimize.
[2024-05-24 17:18:43] [INFO ] Deduced a trap composed of 65 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:18:43] [INFO ] Deduced a trap composed of 79 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:18:44] [INFO ] Deduced a trap composed of 90 places in 611 ms of which 6 ms to minimize.
[2024-05-24 17:18:44] [INFO ] Deduced a trap composed of 82 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:18:45] [INFO ] Deduced a trap composed of 73 places in 556 ms of which 6 ms to minimize.
[2024-05-24 17:18:46] [INFO ] Deduced a trap composed of 62 places in 588 ms of which 7 ms to minimize.
[2024-05-24 17:18:46] [INFO ] Deduced a trap composed of 66 places in 545 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 20/131 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-24 17:18:47] [INFO ] Deduced a trap composed of 189 places in 513 ms of which 6 ms to minimize.
[2024-05-24 17:18:47] [INFO ] Deduced a trap composed of 83 places in 573 ms of which 6 ms to minimize.
[2024-05-24 17:18:48] [INFO ] Deduced a trap composed of 104 places in 584 ms of which 6 ms to minimize.
[2024-05-24 17:18:49] [INFO ] Deduced a trap composed of 84 places in 560 ms of which 6 ms to minimize.
[2024-05-24 17:18:49] [INFO ] Deduced a trap composed of 104 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:18:50] [INFO ] Deduced a trap composed of 76 places in 576 ms of which 6 ms to minimize.
[2024-05-24 17:18:50] [INFO ] Deduced a trap composed of 91 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:18:51] [INFO ] Deduced a trap composed of 68 places in 563 ms of which 6 ms to minimize.
[2024-05-24 17:18:51] [INFO ] Deduced a trap composed of 66 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:18:52] [INFO ] Deduced a trap composed of 71 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:18:53] [INFO ] Deduced a trap composed of 65 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:18:53] [INFO ] Deduced a trap composed of 76 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:18:54] [INFO ] Deduced a trap composed of 76 places in 577 ms of which 16 ms to minimize.
[2024-05-24 17:18:54] [INFO ] Deduced a trap composed of 89 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:18:55] [INFO ] Deduced a trap composed of 65 places in 560 ms of which 6 ms to minimize.
SMT process timed out in 83058ms, After SMT, problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 15 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 3720/3720 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1005 transition count 3719
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1004 transition count 3718
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1004 transition count 3718
Applied a total of 4 rules in 163 ms. Remains 1004 /1006 variables (removed 2) and now considering 3718/3720 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1004/1006 places, 3718/3720 transitions.
RANDOM walk for 40000 steps (1122 resets) in 841 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (143 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (122 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (160 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (126 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (140 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (123 resets) in 102 ms. (388 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (141 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (141 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
[2024-05-24 17:18:55] [INFO ] Flow matrix only has 3329 transitions (discarded 389 similar events)
// Phase 1: matrix 3329 rows 1004 cols
[2024-05-24 17:18:55] [INFO ] Computed 55 invariants in 29 ms
[2024-05-24 17:18:56] [INFO ] State equation strengthened by 2143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 921/934 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:18:56] [INFO ] Deduced a trap composed of 97 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:18:57] [INFO ] Deduced a trap composed of 533 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:18:57] [INFO ] Deduced a trap composed of 177 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:18:58] [INFO ] Deduced a trap composed of 108 places in 576 ms of which 6 ms to minimize.
[2024-05-24 17:18:58] [INFO ] Deduced a trap composed of 415 places in 546 ms of which 5 ms to minimize.
[2024-05-24 17:18:59] [INFO ] Deduced a trap composed of 134 places in 578 ms of which 6 ms to minimize.
[2024-05-24 17:19:00] [INFO ] Deduced a trap composed of 93 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:19:00] [INFO ] Deduced a trap composed of 110 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:19:01] [INFO ] Deduced a trap composed of 117 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:19:01] [INFO ] Deduced a trap composed of 124 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:19:02] [INFO ] Deduced a trap composed of 108 places in 529 ms of which 5 ms to minimize.
[2024-05-24 17:19:02] [INFO ] Deduced a trap composed of 231 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:19:03] [INFO ] Deduced a trap composed of 354 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:19:03] [INFO ] Deduced a trap composed of 153 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:19:04] [INFO ] Deduced a trap composed of 188 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:19:05] [INFO ] Deduced a trap composed of 131 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:19:05] [INFO ] Deduced a trap composed of 146 places in 404 ms of which 5 ms to minimize.
[2024-05-24 17:19:05] [INFO ] Deduced a trap composed of 143 places in 500 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:06] [INFO ] Deduced a trap composed of 115 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:19:07] [INFO ] Deduced a trap composed of 121 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:19:07] [INFO ] Deduced a trap composed of 113 places in 527 ms of which 6 ms to minimize.
[2024-05-24 17:19:08] [INFO ] Deduced a trap composed of 110 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:19:08] [INFO ] Deduced a trap composed of 124 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:19:09] [INFO ] Deduced a trap composed of 145 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:19:09] [INFO ] Deduced a trap composed of 224 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:19:10] [INFO ] Deduced a trap composed of 173 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:19:10] [INFO ] Deduced a trap composed of 224 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:19:11] [INFO ] Deduced a trap composed of 163 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:19:11] [INFO ] Deduced a trap composed of 630 places in 422 ms of which 5 ms to minimize.
[2024-05-24 17:19:12] [INFO ] Deduced a trap composed of 139 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:19:12] [INFO ] Deduced a trap composed of 421 places in 406 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/934 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:13] [INFO ] Deduced a trap composed of 126 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:19:14] [INFO ] Deduced a trap composed of 123 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:19:14] [INFO ] Deduced a trap composed of 128 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:19:15] [INFO ] Deduced a trap composed of 516 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:19:15] [INFO ] Deduced a trap composed of 137 places in 483 ms of which 6 ms to minimize.
[2024-05-24 17:19:16] [INFO ] Deduced a trap composed of 133 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:19:16] [INFO ] Deduced a trap composed of 141 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:19:17] [INFO ] Deduced a trap composed of 91 places in 520 ms of which 5 ms to minimize.
[2024-05-24 17:19:17] [INFO ] Deduced a trap composed of 324 places in 527 ms of which 6 ms to minimize.
[2024-05-24 17:19:18] [INFO ] Deduced a trap composed of 362 places in 434 ms of which 5 ms to minimize.
[2024-05-24 17:19:18] [INFO ] Deduced a trap composed of 380 places in 494 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:19] [INFO ] Deduced a trap composed of 165 places in 515 ms of which 5 ms to minimize.
[2024-05-24 17:19:20] [INFO ] Deduced a trap composed of 93 places in 491 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/934 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:20] [INFO ] Deduced a trap composed of 530 places in 401 ms of which 5 ms to minimize.
[2024-05-24 17:19:21] [INFO ] Deduced a trap composed of 462 places in 399 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/934 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/934 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/936 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:22] [INFO ] Deduced a trap composed of 488 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:19:22] [INFO ] Deduced a trap composed of 108 places in 501 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:23] [INFO ] Deduced a trap composed of 511 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:19:24] [INFO ] Deduced a trap composed of 155 places in 493 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:24] [INFO ] Deduced a trap composed of 124 places in 514 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 36/972 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/972 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 20/992 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:26] [INFO ] Deduced a trap composed of 5 places in 457 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/992 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/992 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 12/1004 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1004 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 3329/4333 variables, 1004/1111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4333 variables, 2143/3254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4333 variables, 0/3254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 0/4333 variables, 0/3254 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4333/4333 variables, and 3254 constraints, problems are : Problem set: 0 solved, 8 unsolved in 36638 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1004/1004 constraints, ReadFeed: 2143/2143 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 921/934 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:33] [INFO ] Deduced a trap composed of 125 places in 494 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/934 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:34] [INFO ] Deduced a trap composed of 134 places in 537 ms of which 6 ms to minimize.
[2024-05-24 17:19:34] [INFO ] Deduced a trap composed of 126 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:19:35] [INFO ] Deduced a trap composed of 534 places in 403 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/934 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/936 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 36/972 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:36] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-24 17:19:37] [INFO ] Deduced a trap composed of 85 places in 554 ms of which 6 ms to minimize.
[2024-05-24 17:19:37] [INFO ] Deduced a trap composed of 96 places in 556 ms of which 6 ms to minimize.
[2024-05-24 17:19:38] [INFO ] Deduced a trap composed of 91 places in 561 ms of which 6 ms to minimize.
[2024-05-24 17:19:38] [INFO ] Deduced a trap composed of 91 places in 558 ms of which 6 ms to minimize.
[2024-05-24 17:19:39] [INFO ] Deduced a trap composed of 102 places in 544 ms of which 6 ms to minimize.
[2024-05-24 17:19:40] [INFO ] Deduced a trap composed of 85 places in 594 ms of which 6 ms to minimize.
[2024-05-24 17:19:40] [INFO ] Deduced a trap composed of 72 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:19:41] [INFO ] Deduced a trap composed of 91 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:19:41] [INFO ] Deduced a trap composed of 80 places in 548 ms of which 6 ms to minimize.
[2024-05-24 17:19:42] [INFO ] Deduced a trap composed of 78 places in 527 ms of which 6 ms to minimize.
[2024-05-24 17:19:42] [INFO ] Deduced a trap composed of 77 places in 541 ms of which 6 ms to minimize.
[2024-05-24 17:19:43] [INFO ] Deduced a trap composed of 81 places in 527 ms of which 6 ms to minimize.
[2024-05-24 17:19:43] [INFO ] Deduced a trap composed of 91 places in 547 ms of which 6 ms to minimize.
[2024-05-24 17:19:44] [INFO ] Deduced a trap composed of 169 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:19:45] [INFO ] Deduced a trap composed of 93 places in 546 ms of which 6 ms to minimize.
[2024-05-24 17:19:45] [INFO ] Deduced a trap composed of 101 places in 545 ms of which 6 ms to minimize.
[2024-05-24 17:19:46] [INFO ] Deduced a trap composed of 81 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:19:46] [INFO ] Deduced a trap composed of 76 places in 548 ms of which 6 ms to minimize.
[2024-05-24 17:19:47] [INFO ] Deduced a trap composed of 137 places in 429 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/972 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:47] [INFO ] Deduced a trap composed of 100 places in 551 ms of which 6 ms to minimize.
[2024-05-24 17:19:48] [INFO ] Deduced a trap composed of 78 places in 548 ms of which 6 ms to minimize.
[2024-05-24 17:19:49] [INFO ] Deduced a trap composed of 69 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:19:49] [INFO ] Deduced a trap composed of 113 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:19:50] [INFO ] Deduced a trap composed of 78 places in 538 ms of which 6 ms to minimize.
[2024-05-24 17:19:50] [INFO ] Deduced a trap composed of 95 places in 590 ms of which 7 ms to minimize.
[2024-05-24 17:19:51] [INFO ] Deduced a trap composed of 89 places in 579 ms of which 6 ms to minimize.
[2024-05-24 17:19:52] [INFO ] Deduced a trap composed of 81 places in 582 ms of which 7 ms to minimize.
[2024-05-24 17:19:52] [INFO ] Deduced a trap composed of 93 places in 603 ms of which 6 ms to minimize.
[2024-05-24 17:19:53] [INFO ] Deduced a trap composed of 91 places in 584 ms of which 6 ms to minimize.
[2024-05-24 17:19:53] [INFO ] Deduced a trap composed of 95 places in 594 ms of which 6 ms to minimize.
[2024-05-24 17:19:54] [INFO ] Deduced a trap composed of 88 places in 590 ms of which 6 ms to minimize.
[2024-05-24 17:19:55] [INFO ] Deduced a trap composed of 89 places in 581 ms of which 7 ms to minimize.
[2024-05-24 17:19:55] [INFO ] Deduced a trap composed of 96 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:19:56] [INFO ] Deduced a trap composed of 80 places in 546 ms of which 6 ms to minimize.
[2024-05-24 17:19:56] [INFO ] Deduced a trap composed of 90 places in 536 ms of which 6 ms to minimize.
[2024-05-24 17:19:57] [INFO ] Deduced a trap composed of 79 places in 544 ms of which 6 ms to minimize.
[2024-05-24 17:19:57] [INFO ] Deduced a trap composed of 98 places in 538 ms of which 6 ms to minimize.
[2024-05-24 17:19:58] [INFO ] Deduced a trap composed of 103 places in 583 ms of which 6 ms to minimize.
[2024-05-24 17:19:59] [INFO ] Deduced a trap composed of 96 places in 589 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:19:59] [INFO ] Deduced a trap composed of 94 places in 538 ms of which 6 ms to minimize.
[2024-05-24 17:20:00] [INFO ] Deduced a trap composed of 79 places in 553 ms of which 6 ms to minimize.
[2024-05-24 17:20:00] [INFO ] Deduced a trap composed of 89 places in 543 ms of which 10 ms to minimize.
[2024-05-24 17:20:01] [INFO ] Deduced a trap composed of 91 places in 538 ms of which 6 ms to minimize.
[2024-05-24 17:20:02] [INFO ] Deduced a trap composed of 79 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:20:02] [INFO ] Deduced a trap composed of 102 places in 560 ms of which 6 ms to minimize.
[2024-05-24 17:20:03] [INFO ] Deduced a trap composed of 101 places in 564 ms of which 6 ms to minimize.
[2024-05-24 17:20:03] [INFO ] Deduced a trap composed of 87 places in 544 ms of which 5 ms to minimize.
[2024-05-24 17:20:04] [INFO ] Deduced a trap composed of 105 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:20:04] [INFO ] Deduced a trap composed of 79 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:20:05] [INFO ] Deduced a trap composed of 202 places in 572 ms of which 6 ms to minimize.
[2024-05-24 17:20:06] [INFO ] Deduced a trap composed of 98 places in 573 ms of which 7 ms to minimize.
[2024-05-24 17:20:06] [INFO ] Deduced a trap composed of 109 places in 591 ms of which 8 ms to minimize.
[2024-05-24 17:20:07] [INFO ] Deduced a trap composed of 105 places in 593 ms of which 6 ms to minimize.
[2024-05-24 17:20:08] [INFO ] Deduced a trap composed of 87 places in 560 ms of which 6 ms to minimize.
[2024-05-24 17:20:08] [INFO ] Deduced a trap composed of 81 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:20:09] [INFO ] Deduced a trap composed of 86 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:20:09] [INFO ] Deduced a trap composed of 88 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:20:10] [INFO ] Deduced a trap composed of 122 places in 583 ms of which 5 ms to minimize.
[2024-05-24 17:20:10] [INFO ] Deduced a trap composed of 82 places in 581 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/972 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:20:11] [INFO ] Deduced a trap composed of 82 places in 593 ms of which 6 ms to minimize.
[2024-05-24 17:20:12] [INFO ] Deduced a trap composed of 198 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:20:12] [INFO ] Deduced a trap composed of 74 places in 543 ms of which 5 ms to minimize.
[2024-05-24 17:20:13] [INFO ] Deduced a trap composed of 96 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:20:13] [INFO ] Deduced a trap composed of 108 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:20:14] [INFO ] Deduced a trap composed of 77 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:20:15] [INFO ] Deduced a trap composed of 84 places in 513 ms of which 6 ms to minimize.
[2024-05-24 17:20:15] [INFO ] Deduced a trap composed of 105 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:20:16] [INFO ] Deduced a trap composed of 95 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:20:16] [INFO ] Deduced a trap composed of 95 places in 511 ms of which 6 ms to minimize.
[2024-05-24 17:20:17] [INFO ] Deduced a trap composed of 96 places in 534 ms of which 8 ms to minimize.
[2024-05-24 17:20:17] [INFO ] Deduced a trap composed of 78 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:20:18] [INFO ] Deduced a trap composed of 82 places in 536 ms of which 5 ms to minimize.
[2024-05-24 17:20:18] [INFO ] Deduced a trap composed of 83 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:20:19] [INFO ] Deduced a trap composed of 82 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:20:19] [INFO ] Deduced a trap composed of 85 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:20:20] [INFO ] Deduced a trap composed of 79 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:20:20] [INFO ] Deduced a trap composed of 80 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:20:21] [INFO ] Deduced a trap composed of 85 places in 517 ms of which 5 ms to minimize.
[2024-05-24 17:20:22] [INFO ] Deduced a trap composed of 83 places in 528 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/972 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:20:22] [INFO ] Deduced a trap composed of 90 places in 535 ms of which 5 ms to minimize.
[2024-05-24 17:20:23] [INFO ] Deduced a trap composed of 90 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:20:24] [INFO ] Deduced a trap composed of 83 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:20:24] [INFO ] Deduced a trap composed of 81 places in 534 ms of which 6 ms to minimize.
[2024-05-24 17:20:25] [INFO ] Deduced a trap composed of 82 places in 545 ms of which 6 ms to minimize.
[2024-05-24 17:20:25] [INFO ] Deduced a trap composed of 95 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:20:26] [INFO ] Deduced a trap composed of 113 places in 519 ms of which 5 ms to minimize.
[2024-05-24 17:20:26] [INFO ] Deduced a trap composed of 74 places in 523 ms of which 5 ms to minimize.
[2024-05-24 17:20:27] [INFO ] Deduced a trap composed of 89 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:20:27] [INFO ] Deduced a trap composed of 115 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:20:28] [INFO ] Deduced a trap composed of 90 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:20:28] [INFO ] Deduced a trap composed of 94 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:20:29] [INFO ] Deduced a trap composed of 112 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:20:30] [INFO ] Deduced a trap composed of 94 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:20:30] [INFO ] Deduced a trap composed of 81 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:20:31] [INFO ] Deduced a trap composed of 98 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:20:31] [INFO ] Deduced a trap composed of 88 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:20:32] [INFO ] Deduced a trap composed of 116 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:20:32] [INFO ] Deduced a trap composed of 81 places in 521 ms of which 6 ms to minimize.
[2024-05-24 17:20:33] [INFO ] Deduced a trap composed of 111 places in 521 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/972 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:20:33] [INFO ] Deduced a trap composed of 97 places in 194 ms of which 3 ms to minimize.
[2024-05-24 17:20:34] [INFO ] Deduced a trap composed of 83 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:20:34] [INFO ] Deduced a trap composed of 90 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:20:35] [INFO ] Deduced a trap composed of 91 places in 534 ms of which 6 ms to minimize.
[2024-05-24 17:20:35] [INFO ] Deduced a trap composed of 97 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:20:36] [INFO ] Deduced a trap composed of 81 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:20:36] [INFO ] Deduced a trap composed of 89 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:20:37] [INFO ] Deduced a trap composed of 93 places in 540 ms of which 6 ms to minimize.
[2024-05-24 17:20:38] [INFO ] Deduced a trap composed of 118 places in 521 ms of which 6 ms to minimize.
[2024-05-24 17:20:38] [INFO ] Deduced a trap composed of 88 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:20:39] [INFO ] Deduced a trap composed of 81 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:20:39] [INFO ] Deduced a trap composed of 78 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:20:40] [INFO ] Deduced a trap composed of 102 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:20:40] [INFO ] Deduced a trap composed of 109 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:20:41] [INFO ] Deduced a trap composed of 108 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:20:41] [INFO ] Deduced a trap composed of 77 places in 511 ms of which 6 ms to minimize.
[2024-05-24 17:20:42] [INFO ] Deduced a trap composed of 88 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:20:42] [INFO ] Deduced a trap composed of 91 places in 521 ms of which 6 ms to minimize.
[2024-05-24 17:20:43] [INFO ] Deduced a trap composed of 79 places in 527 ms of which 6 ms to minimize.
[2024-05-24 17:20:44] [INFO ] Deduced a trap composed of 89 places in 517 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/972 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 17:20:44] [INFO ] Deduced a trap composed of 82 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:20:45] [INFO ] Deduced a trap composed of 111 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:20:45] [INFO ] Deduced a trap composed of 80 places in 539 ms of which 5 ms to minimize.
[2024-05-24 17:20:46] [INFO ] Deduced a trap composed of 89 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:20:47] [INFO ] Deduced a trap composed of 90 places in 533 ms of which 5 ms to minimize.
[2024-05-24 17:20:47] [INFO ] Deduced a trap composed of 91 places in 547 ms of which 5 ms to minimize.
[2024-05-24 17:20:48] [INFO ] Deduced a trap composed of 83 places in 519 ms of which 6 ms to minimize.
SMT process timed out in 112162ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 3718/3718 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1004 transition count 3717
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1003 transition count 3717
Applied a total of 2 rules in 199 ms. Remains 1003 /1004 variables (removed 1) and now considering 3717/3718 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 1003/1004 places, 3717/3718 transitions.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 385 stabilizing places and 1088 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X(p1)))))'
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1205 transition count 2689
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1205 transition count 2689
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 1197 transition count 2676
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 1197 transition count 2676
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 1190 transition count 2634
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 1190 transition count 2634
Applied a total of 54 rules in 211 ms. Remains 1190 /1217 variables (removed 27) and now considering 2634/2721 (removed 87) transitions.
[2024-05-24 17:20:48] [INFO ] Flow matrix only has 2362 transitions (discarded 272 similar events)
// Phase 1: matrix 2362 rows 1190 cols
[2024-05-24 17:20:48] [INFO ] Computed 55 invariants in 38 ms
[2024-05-24 17:20:49] [INFO ] Implicit Places using invariants in 1103 ms returned [104, 293, 347, 641, 642, 656, 665, 783, 870]
[2024-05-24 17:20:49] [INFO ] Actually due to overlaps returned [656, 104, 293, 347, 641, 642, 665, 783]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1106 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1182/1217 places, 2634/2721 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1175 transition count 2627
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1175 transition count 2627
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1168 transition count 2620
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1168 transition count 2620
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1161 transition count 2613
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1161 transition count 2613
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1155 transition count 2577
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1155 transition count 2577
Applied a total of 54 rules in 242 ms. Remains 1155 /1182 variables (removed 27) and now considering 2577/2634 (removed 57) transitions.
[2024-05-24 17:20:50] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1155 cols
[2024-05-24 17:20:50] [INFO ] Computed 47 invariants in 34 ms
[2024-05-24 17:20:51] [INFO ] Implicit Places using invariants in 1013 ms returned [842]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1154/1217 places, 2577/2721 transitions.
Applied a total of 0 rules in 52 ms. Remains 1154 /1154 variables (removed 0) and now considering 2577/2577 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2629 ms. Remains : 1154/1217 places, 2577/2721 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-02 finished in 3012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2688
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2688
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1195 transition count 2669
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1195 transition count 2669
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1188 transition count 2627
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1188 transition count 2627
Applied a total of 58 rules in 184 ms. Remains 1188 /1217 variables (removed 29) and now considering 2627/2721 (removed 94) transitions.
[2024-05-24 17:20:51] [INFO ] Flow matrix only has 2355 transitions (discarded 272 similar events)
// Phase 1: matrix 2355 rows 1188 cols
[2024-05-24 17:20:51] [INFO ] Computed 55 invariants in 31 ms
[2024-05-24 17:20:52] [INFO ] Implicit Places using invariants in 1070 ms returned [104, 293, 347, 556, 639, 640, 654, 663, 781, 868]
[2024-05-24 17:20:52] [INFO ] Actually due to overlaps returned [654, 104, 293, 347, 556, 639, 640, 663, 781]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1072 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1179/1217 places, 2627/2721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1171 transition count 2619
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1171 transition count 2619
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1163 transition count 2611
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1163 transition count 2611
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1155 transition count 2603
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1155 transition count 2603
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 1148 transition count 2561
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 1148 transition count 2561
Applied a total of 62 rules in 228 ms. Remains 1148 /1179 variables (removed 31) and now considering 2561/2627 (removed 66) transitions.
[2024-05-24 17:20:53] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1148 cols
[2024-05-24 17:20:53] [INFO ] Computed 46 invariants in 27 ms
[2024-05-24 17:20:54] [INFO ] Implicit Places using invariants in 998 ms returned [836]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1000 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1217 places, 2561/2721 transitions.
Applied a total of 0 rules in 41 ms. Remains 1147 /1147 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2526 ms. Remains : 1147/1217 places, 2561/2721 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03
Product exploration explored 100000 steps with 1605 reset in 584 ms.
Entered a terminal (fully accepting) state of product in 12584 steps with 201 reset in 68 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-03 finished in 3289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||G(p2))))'
Support contains 6 out of 1217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1217 transition count 2698
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1194 transition count 2698
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 46 place count 1194 transition count 2682
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 78 place count 1178 transition count 2682
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 86 place count 1170 transition count 2649
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 1170 transition count 2649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 94 place count 1170 transition count 2648
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 96 place count 1169 transition count 2648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 1166 transition count 2635
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 1166 transition count 2635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1165 transition count 2629
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1165 transition count 2629
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 158 place count 1138 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 164 place count 1132 transition count 2596
Iterating global reduction 2 with 6 rules applied. Total rules applied 170 place count 1132 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 176 place count 1126 transition count 2560
Iterating global reduction 2 with 6 rules applied. Total rules applied 182 place count 1126 transition count 2560
Applied a total of 182 rules in 546 ms. Remains 1126 /1217 variables (removed 91) and now considering 2560/2721 (removed 161) transitions.
[2024-05-24 17:20:55] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1126 cols
[2024-05-24 17:20:55] [INFO ] Computed 55 invariants in 34 ms
[2024-05-24 17:20:56] [INFO ] Implicit Places using invariants in 1024 ms returned [93, 265, 319, 521, 599, 600, 612, 620, 735, 820]
[2024-05-24 17:20:56] [INFO ] Actually due to overlaps returned [612, 93, 265, 319, 521, 599, 600, 620, 735]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1027 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1117/1217 places, 2560/2721 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1114 transition count 2557
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1114 transition count 2557
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1111 transition count 2554
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1111 transition count 2554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1109 transition count 2542
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1109 transition count 2542
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 1104 transition count 2537
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 1099 transition count 2532
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 1099 transition count 2532
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1094 transition count 2502
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1094 transition count 2502
Applied a total of 46 rules in 352 ms. Remains 1094 /1117 variables (removed 23) and now considering 2502/2560 (removed 58) transitions.
[2024-05-24 17:20:56] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1094 cols
[2024-05-24 17:20:56] [INFO ] Computed 46 invariants in 29 ms
[2024-05-24 17:20:57] [INFO ] Implicit Places using invariants in 920 ms returned [796]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 921 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1093/1217 places, 2502/2721 transitions.
Applied a total of 0 rules in 70 ms. Remains 1093 /1093 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2919 ms. Remains : 1093/1217 places, 2502/2721 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-05
Product exploration explored 100000 steps with 2660 reset in 584 ms.
Product exploration explored 100000 steps with 2692 reset in 667 ms.
Computed a total of 278 stabilizing places and 886 stable transitions
Computed a total of 278 stabilizing places and 886 stable transitions
Detected a total of 278/1093 stabilizing places and 886/2502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 16 factoid took 692 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (909 resets) in 306 ms. (130 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40002 steps (188 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (188 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (188 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (188 resets) in 418 ms. (95 steps per ms) remains 4/4 properties
[2024-05-24 17:21:00] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1093 cols
[2024-05-24 17:21:00] [INFO ] Computed 45 invariants in 19 ms
[2024-05-24 17:21:00] [INFO ] State equation strengthened by 828 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 1025/1031 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 17:21:01] [INFO ] Deduced a trap composed of 152 places in 445 ms of which 6 ms to minimize.
[2024-05-24 17:21:01] [INFO ] Deduced a trap composed of 76 places in 415 ms of which 6 ms to minimize.
[2024-05-24 17:21:01] [INFO ] Deduced a trap composed of 89 places in 442 ms of which 7 ms to minimize.
[2024-05-24 17:21:02] [INFO ] Deduced a trap composed of 166 places in 412 ms of which 7 ms to minimize.
[2024-05-24 17:21:02] [INFO ] Deduced a trap composed of 131 places in 411 ms of which 6 ms to minimize.
[2024-05-24 17:21:03] [INFO ] Deduced a trap composed of 94 places in 407 ms of which 6 ms to minimize.
[2024-05-24 17:21:03] [INFO ] Deduced a trap composed of 107 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:21:04] [INFO ] Deduced a trap composed of 117 places in 472 ms of which 7 ms to minimize.
[2024-05-24 17:21:04] [INFO ] Deduced a trap composed of 99 places in 460 ms of which 7 ms to minimize.
[2024-05-24 17:21:05] [INFO ] Deduced a trap composed of 657 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:21:05] [INFO ] Deduced a trap composed of 205 places in 436 ms of which 7 ms to minimize.
SMT process timed out in 5135ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2502/2502 transitions.
Free-agglomeration rule (complex) applied 130 times.
Iterating global reduction 0 with 130 rules applied. Total rules applied 130 place count 1093 transition count 3722
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 260 place count 963 transition count 3722
Applied a total of 260 rules in 197 ms. Remains 963 /1093 variables (removed 130) and now considering 3722/2502 (removed -1220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 963/1093 places, 3722/2502 transitions.
RANDOM walk for 40000 steps (1130 resets) in 1206 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (123 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (125 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (126 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 64069 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 3
Probabilistic random walk after 64069 steps, saw 26811 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 17:21:09] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
// Phase 1: matrix 3325 rows 963 cols
[2024-05-24 17:21:09] [INFO ] Computed 45 invariants in 31 ms
[2024-05-24 17:21:09] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 895/901 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:21:10] [INFO ] Deduced a trap composed of 201 places in 475 ms of which 5 ms to minimize.
[2024-05-24 17:21:10] [INFO ] Deduced a trap composed of 638 places in 411 ms of which 6 ms to minimize.
[2024-05-24 17:21:10] [INFO ] Deduced a trap composed of 72 places in 483 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/901 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/901 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/902 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 27/929 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 22/951 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/963 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3325/4288 variables, 963/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4288 variables, 2178/3189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4288 variables, 0/3189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4288 variables, 0/3189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4288/4288 variables, and 3189 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3094 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 963/963 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 895/901 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/901 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:21:13] [INFO ] Deduced a trap composed of 142 places in 486 ms of which 5 ms to minimize.
[2024-05-24 17:21:13] [INFO ] Deduced a trap composed of 71 places in 473 ms of which 6 ms to minimize.
[2024-05-24 17:21:14] [INFO ] Deduced a trap composed of 83 places in 469 ms of which 5 ms to minimize.
[2024-05-24 17:21:14] [INFO ] Deduced a trap composed of 139 places in 475 ms of which 6 ms to minimize.
[2024-05-24 17:21:15] [INFO ] Deduced a trap composed of 88 places in 480 ms of which 5 ms to minimize.
[2024-05-24 17:21:15] [INFO ] Deduced a trap composed of 142 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:21:16] [INFO ] Deduced a trap composed of 220 places in 468 ms of which 5 ms to minimize.
[2024-05-24 17:21:16] [INFO ] Deduced a trap composed of 142 places in 479 ms of which 6 ms to minimize.
[2024-05-24 17:21:17] [INFO ] Deduced a trap composed of 102 places in 483 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/901 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/902 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 27/929 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:21:17] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-24 17:21:17] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 22/951 variables, 22/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/951 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 12/963 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/963 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3325/4288 variables, 963/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4288 variables, 2178/3200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4288 variables, 3/3203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4288 variables, 0/3203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/4288 variables, 0/3203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4288/4288 variables, and 3203 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8019 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 963/963 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 11184ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 111 ms.
Support contains 6 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 101 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 963/963 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 90 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2024-05-24 17:21:20] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
[2024-05-24 17:21:20] [INFO ] Invariant cache hit.
[2024-05-24 17:21:21] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2024-05-24 17:21:21] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
[2024-05-24 17:21:21] [INFO ] Invariant cache hit.
[2024-05-24 17:21:22] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:21:45] [INFO ] Implicit Places using invariants and state equation in 23769 ms returned []
Implicit Place search using SMT with State Equation took 24838 ms to find 0 implicit places.
[2024-05-24 17:21:45] [INFO ] Redundant transitions in 236 ms returned []
Running 3660 sub problems to find dead transitions.
[2024-05-24 17:21:45] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
[2024-05-24 17:21:45] [INFO ] Invariant cache hit.
[2024-05-24 17:21:45] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 52556ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 52597ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77780 ms. Remains : 963/963 places, 3722/3722 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1046 edges and 963 vertex of which 17 / 963 are part of one of the 1 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 299 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 4264 edges and 947 vertex of which 935 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1199.t1393 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 918 transition count 2954
Reduce places removed 97 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 289 rules applied. Total rules applied 390 place count 821 transition count 2762
Reduce places removed 95 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 651 place count 726 transition count 2596
Reduce places removed 71 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 3 with 210 rules applied. Total rules applied 861 place count 655 transition count 2457
Reduce places removed 68 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 185 rules applied. Total rules applied 1046 place count 587 transition count 2340
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1191 place count 538 transition count 2244
Reduce places removed 47 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1316 place count 491 transition count 2166
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1407 place count 460 transition count 2106
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1482 place count 431 transition count 2060
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 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 9 with 49 rules applied. Total rules applied 1531 place count 414 transition count 2028
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 37 rules applied. Total rules applied 1568 place count 399 transition count 2006
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 19 rules applied. Total rules applied 1587 place count 392 transition count 1994
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 11 rules applied. Total rules applied 1598 place count 387 transition count 1988
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 4 rules applied. Total rules applied 1602 place count 386 transition count 1985
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1606 place count 384 transition count 1983
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 12 Pre rules applied. Total rules applied 1606 place count 384 transition count 1971
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 1630 place count 372 transition count 1971
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1914 place count 88 transition count 347
Iterating global reduction 15 with 284 rules applied. Total rules applied 2198 place count 88 transition count 347
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 15 with 262 rules applied. Total rules applied 2460 place count 88 transition count 85
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 2470 place count 78 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2470 place count 78 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2472 place count 77 transition count 84
Discarding 10 places :
Symmetric choice reduction at 17 with 10 rule applications. Total rules 2482 place count 67 transition count 74
Iterating global reduction 17 with 10 rules applied. Total rules applied 2492 place count 67 transition count 74
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 17 with 24 rules applied. Total rules applied 2516 place count 55 transition count 62
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 2525 place count 55 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 2526 place count 55 transition count 52
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 18 with 13 rules applied. Total rules applied 2539 place count 55 transition count 39
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 2552 place count 42 transition count 39
Applied a total of 2552 rules in 354 ms. Remains 42 /963 variables (removed 921) and now considering 39/3722 (removed 3683) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 39 rows 42 cols
[2024-05-24 17:22:38] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 17:22:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 17:22:38] [INFO ] [Real]Absence check using 5 positive and 12 generalized place invariants in 18 ms returned sat
[2024-05-24 17:22:38] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 17:22:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 17:22:38] [INFO ] [Nat]Absence check using 5 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 17:22:38] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 17:22:39] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 17:22:39] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 526 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 p2))), (F p1), (F (NOT p0)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 17 factoid took 920 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2502/2502 transitions.
Applied a total of 0 rules in 72 ms. Remains 1093 /1093 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
[2024-05-24 17:22:40] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1093 cols
[2024-05-24 17:22:40] [INFO ] Computed 45 invariants in 19 ms
[2024-05-24 17:22:41] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-05-24 17:22:41] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 17:22:41] [INFO ] Invariant cache hit.
[2024-05-24 17:22:41] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 17:22:51] [INFO ] Implicit Places using invariants and state equation in 9977 ms returned [1070, 1086]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10895 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1093 places, 2502/2502 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 1091 transition count 2500
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1089 transition count 2500
Applied a total of 4 rules in 119 ms. Remains 1089 /1091 variables (removed 2) and now considering 2500/2502 (removed 2) transitions.
[2024-05-24 17:22:51] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1089 cols
[2024-05-24 17:22:51] [INFO ] Computed 43 invariants in 20 ms
[2024-05-24 17:22:52] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-05-24 17:22:52] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-24 17:22:52] [INFO ] Invariant cache hit.
[2024-05-24 17:22:52] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 17:23:00] [INFO ] Implicit Places using invariants and state equation in 8874 ms returned []
Implicit Place search using SMT with State Equation took 9768 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1089/1093 places, 2500/2502 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20855 ms. Remains : 1089/1093 places, 2500/2502 transitions.
Computed a total of 274 stabilizing places and 884 stable transitions
Computed a total of 274 stabilizing places and 884 stable transitions
Detected a total of 274/1089 stabilizing places and 884/2500 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 16 factoid took 663 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (910 resets) in 616 ms. (64 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (188 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (188 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (188 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (188 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
[2024-05-24 17:23:02] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-24 17:23:02] [INFO ] Invariant cache hit.
[2024-05-24 17:23:02] [INFO ] State equation strengthened by 828 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 1023/1029 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 17:23:02] [INFO ] Deduced a trap composed of 87 places in 431 ms of which 7 ms to minimize.
[2024-05-24 17:23:03] [INFO ] Deduced a trap composed of 75 places in 425 ms of which 7 ms to minimize.
[2024-05-24 17:23:03] [INFO ] Deduced a trap composed of 165 places in 413 ms of which 7 ms to minimize.
[2024-05-24 17:23:04] [INFO ] Deduced a trap composed of 94 places in 412 ms of which 6 ms to minimize.
[2024-05-24 17:23:04] [INFO ] Deduced a trap composed of 87 places in 412 ms of which 6 ms to minimize.
[2024-05-24 17:23:05] [INFO ] Deduced a trap composed of 75 places in 406 ms of which 6 ms to minimize.
[2024-05-24 17:23:05] [INFO ] Deduced a trap composed of 75 places in 413 ms of which 7 ms to minimize.
[2024-05-24 17:23:05] [INFO ] Deduced a trap composed of 97 places in 411 ms of which 7 ms to minimize.
[2024-05-24 17:23:06] [INFO ] Deduced a trap composed of 78 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:23:06] [INFO ] Deduced a trap composed of 105 places in 405 ms of which 6 ms to minimize.
[2024-05-24 17:23:07] [INFO ] Deduced a trap composed of 655 places in 354 ms of which 5 ms to minimize.
[2024-05-24 17:23:07] [INFO ] Deduced a trap composed of 159 places in 422 ms of which 8 ms to minimize.
SMT process timed out in 5298ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1089 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1089/1089 places, 2500/2500 transitions.
Free-agglomeration rule (complex) applied 130 times.
Iterating global reduction 0 with 130 rules applied. Total rules applied 130 place count 1089 transition count 3720
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 260 place count 959 transition count 3720
Applied a total of 260 rules in 194 ms. Remains 959 /1089 variables (removed 130) and now considering 3720/2500 (removed -1220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 959/1089 places, 3720/2500 transitions.
RANDOM walk for 40000 steps (1129 resets) in 1379 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (123 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (125 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (126 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 65144 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 3
Probabilistic random walk after 65144 steps, saw 27249 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 17:23:11] [INFO ] Flow matrix only has 3323 transitions (discarded 397 similar events)
// Phase 1: matrix 3323 rows 959 cols
[2024-05-24 17:23:11] [INFO ] Computed 43 invariants in 43 ms
[2024-05-24 17:23:11] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 893/899 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/899 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/900 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/927 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 22/949 variables, 22/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/949 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 10/959 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/959 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3323/4282 variables, 959/1002 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4282 variables, 2178/3180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4282 variables, 0/3180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4282 variables, 0/3180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4282/4282 variables, and 3180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 959/959 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 893/899 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:23:13] [INFO ] Deduced a trap composed of 140 places in 469 ms of which 5 ms to minimize.
[2024-05-24 17:23:14] [INFO ] Deduced a trap composed of 139 places in 475 ms of which 5 ms to minimize.
[2024-05-24 17:23:14] [INFO ] Deduced a trap composed of 108 places in 522 ms of which 5 ms to minimize.
[2024-05-24 17:23:15] [INFO ] Deduced a trap composed of 87 places in 484 ms of which 5 ms to minimize.
[2024-05-24 17:23:15] [INFO ] Deduced a trap composed of 86 places in 485 ms of which 5 ms to minimize.
[2024-05-24 17:23:16] [INFO ] Deduced a trap composed of 95 places in 484 ms of which 6 ms to minimize.
[2024-05-24 17:23:16] [INFO ] Deduced a trap composed of 228 places in 476 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/899 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/899 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/900 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 27/927 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:23:16] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-24 17:23:16] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/927 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 22/949 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 10/959 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/959 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3323/4282 variables, 959/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4282 variables, 2178/3189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4282 variables, 3/3192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 17:23:19] [INFO ] Deduced a trap composed of 173 places in 460 ms of which 5 ms to minimize.
[2024-05-24 17:23:20] [INFO ] Deduced a trap composed of 58 places in 508 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4282 variables, 2/3194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4282 variables, 0/3194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/4282 variables, 0/3194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4282/4282 variables, and 3194 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8481 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 959/959 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 10041ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 6 out of 959 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 3720/3720 transitions.
Applied a total of 0 rules in 92 ms. Remains 959 /959 variables (removed 0) and now considering 3720/3720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 959/959 places, 3720/3720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 959/959 places, 3720/3720 transitions.
Applied a total of 0 rules in 92 ms. Remains 959 /959 variables (removed 0) and now considering 3720/3720 (removed 0) transitions.
[2024-05-24 17:23:21] [INFO ] Flow matrix only has 3323 transitions (discarded 397 similar events)
[2024-05-24 17:23:21] [INFO ] Invariant cache hit.
[2024-05-24 17:23:22] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2024-05-24 17:23:22] [INFO ] Flow matrix only has 3323 transitions (discarded 397 similar events)
[2024-05-24 17:23:22] [INFO ] Invariant cache hit.
[2024-05-24 17:23:23] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:23:50] [INFO ] Implicit Places using invariants and state equation in 27291 ms returned []
Implicit Place search using SMT with State Equation took 28349 ms to find 0 implicit places.
[2024-05-24 17:23:50] [INFO ] Redundant transitions in 164 ms returned []
Running 3658 sub problems to find dead transitions.
[2024-05-24 17:23:50] [INFO ] Flow matrix only has 3323 transitions (discarded 397 similar events)
[2024-05-24 17:23:50] [INFO ] Invariant cache hit.
[2024-05-24 17:23:50] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/957 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3658 unsolved
SMT process timed out in 52540ms, After SMT, problems are : Problem set: 0 solved, 3658 unsolved
Search for dead transitions found 0 dead transitions in 52574ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81196 ms. Remains : 959/959 places, 3720/3720 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 p2))), (F p1), (F (NOT p0)), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 17 factoid took 942 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 2639 reset in 493 ms.
Product exploration explored 100000 steps with 2681 reset in 524 ms.
Built C files in :
/tmp/ltsmin8789223528277393224
[2024-05-24 17:24:45] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:24:45] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8789223528277393224
Running compilation step : cd /tmp/ltsmin8789223528277393224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8789223528277393224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8789223528277393224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 6 out of 1089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1089/1089 places, 2500/2500 transitions.
Applied a total of 0 rules in 71 ms. Remains 1089 /1089 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-24 17:24:48] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1089 cols
[2024-05-24 17:24:48] [INFO ] Computed 43 invariants in 18 ms
[2024-05-24 17:24:49] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-05-24 17:24:49] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-24 17:24:49] [INFO ] Invariant cache hit.
[2024-05-24 17:24:49] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 17:24:58] [INFO ] Implicit Places using invariants and state equation in 8994 ms returned []
Implicit Place search using SMT with State Equation took 9900 ms to find 0 implicit places.
[2024-05-24 17:24:58] [INFO ] Redundant transitions in 69 ms returned []
Running 2483 sub problems to find dead transitions.
[2024-05-24 17:24:58] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-24 17:24:58] [INFO ] Invariant cache hit.
[2024-05-24 17:24:58] [INFO ] State equation strengthened by 828 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1087 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2483 unsolved
SMT process timed out in 32613ms, After SMT, problems are : Problem set: 0 solved, 2483 unsolved
Search for dead transitions found 0 dead transitions in 32636ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42690 ms. Remains : 1089/1089 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin15838055194136047626
[2024-05-24 17:25:30] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:25:30] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15838055194136047626
Running compilation step : cd /tmp/ltsmin15838055194136047626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15838055194136047626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15838055194136047626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-24 17:25:34] [INFO ] Flatten gal took : 81 ms
[2024-05-24 17:25:34] [INFO ] Flatten gal took : 77 ms
[2024-05-24 17:25:34] [INFO ] Time to serialize gal into /tmp/LTL6892875659134916109.gal : 24 ms
[2024-05-24 17:25:34] [INFO ] Time to serialize properties into /tmp/LTL1319819924764442818.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6892875659134916109.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9408360732347392321.hoa' '-atoms' '/tmp/LTL1319819924764442818.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1319819924764442818.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9408360732347392321.hoa
Detected timeout of ITS tools.
[2024-05-24 17:25:49] [INFO ] Flatten gal took : 63 ms
[2024-05-24 17:25:49] [INFO ] Flatten gal took : 63 ms
[2024-05-24 17:25:49] [INFO ] Time to serialize gal into /tmp/LTL4046205026664455393.gal : 18 ms
[2024-05-24 17:25:49] [INFO ] Time to serialize properties into /tmp/LTL12070168578164995658.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4046205026664455393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12070168578164995658.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((Node6DontAnswerToAnyNode<1)||(Node11IsActive<1))&&((Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetect...352
Formula 0 simplified : G(F(!"(((Node6DontAnswerToAnyNode<1)||(Node11IsActive<1))&&((Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)||(NodesCanDetectTh...342
Detected timeout of ITS tools.
[2024-05-24 17:26:04] [INFO ] Flatten gal took : 58 ms
[2024-05-24 17:26:04] [INFO ] Applying decomposition
[2024-05-24 17:26:04] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11007913254422327466.txt' '-o' '/tmp/graph11007913254422327466.bin' '-w' '/tmp/graph11007913254422327466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11007913254422327466.bin' '-l' '-1' '-v' '-w' '/tmp/graph11007913254422327466.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:26:04] [INFO ] Decomposing Gal with order
[2024-05-24 17:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:26:05] [INFO ] Removed a total of 3505 redundant transitions.
[2024-05-24 17:26:05] [INFO ] Flatten gal took : 335 ms
[2024-05-24 17:26:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1104 labels/synchronizations in 160 ms.
[2024-05-24 17:26:05] [INFO ] Time to serialize gal into /tmp/LTL13307549446790076113.gal : 24 ms
[2024-05-24 17:26:05] [INFO ] Time to serialize properties into /tmp/LTL9240039359966900985.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13307549446790076113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9240039359966900985.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(("(((i1.u74.Node6DontAnswerToAnyNode<1)||(i1.u95.Node11IsActive<1))&&((i6.u9.Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8...410
Formula 0 simplified : G(F(!"(((i1.u74.Node6DontAnswerToAnyNode<1)||(i1.u95.Node11IsActive<1))&&((i6.u9.Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1...400
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-05 finished in 325749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2683
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2683
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1196 transition count 2665
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1196 transition count 2665
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1190 transition count 2629
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1190 transition count 2629
Applied a total of 54 rules in 177 ms. Remains 1190 /1217 variables (removed 27) and now considering 2629/2721 (removed 92) transitions.
[2024-05-24 17:26:20] [INFO ] Flow matrix only has 2357 transitions (discarded 272 similar events)
// Phase 1: matrix 2357 rows 1190 cols
[2024-05-24 17:26:20] [INFO ] Computed 55 invariants in 32 ms
[2024-05-24 17:26:21] [INFO ] Implicit Places using invariants in 1017 ms returned [104, 293, 559, 641, 642, 656, 665, 783, 870]
[2024-05-24 17:26:21] [INFO ] Actually due to overlaps returned [656, 104, 293, 559, 641, 642, 665, 783]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1182/1217 places, 2629/2721 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1175 transition count 2622
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1175 transition count 2622
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1168 transition count 2615
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1168 transition count 2615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1161 transition count 2608
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1161 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1155 transition count 2572
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1155 transition count 2572
Applied a total of 54 rules in 273 ms. Remains 1155 /1182 variables (removed 27) and now considering 2572/2629 (removed 57) transitions.
[2024-05-24 17:26:22] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1155 cols
[2024-05-24 17:26:22] [INFO ] Computed 47 invariants in 22 ms
[2024-05-24 17:26:23] [INFO ] Implicit Places using invariants in 1031 ms returned [842]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1035 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1154/1217 places, 2572/2721 transitions.
Applied a total of 0 rules in 42 ms. Remains 1154 /1154 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2547 ms. Remains : 1154/1217 places, 2572/2721 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-06 finished in 2704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(F(p1)))))))'
Support contains 3 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2683
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2683
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 1196 transition count 2665
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 1196 transition count 2665
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1190 transition count 2629
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1190 transition count 2629
Applied a total of 54 rules in 178 ms. Remains 1190 /1217 variables (removed 27) and now considering 2629/2721 (removed 92) transitions.
[2024-05-24 17:26:23] [INFO ] Flow matrix only has 2357 transitions (discarded 272 similar events)
// Phase 1: matrix 2357 rows 1190 cols
[2024-05-24 17:26:23] [INFO ] Computed 55 invariants in 31 ms
[2024-05-24 17:26:24] [INFO ] Implicit Places using invariants in 1007 ms returned [104, 350, 559, 641, 642, 656, 665, 783, 870]
[2024-05-24 17:26:24] [INFO ] Actually due to overlaps returned [656, 104, 350, 559, 641, 642, 665, 783]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1009 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1182/1217 places, 2629/2721 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1175 transition count 2622
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1175 transition count 2622
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1168 transition count 2615
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1168 transition count 2615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1161 transition count 2608
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1161 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1155 transition count 2572
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1155 transition count 2572
Applied a total of 54 rules in 226 ms. Remains 1155 /1182 variables (removed 27) and now considering 2572/2629 (removed 57) transitions.
[2024-05-24 17:26:24] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1155 cols
[2024-05-24 17:26:24] [INFO ] Computed 47 invariants in 27 ms
[2024-05-24 17:26:25] [INFO ] Implicit Places using invariants in 954 ms returned [842]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 955 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1154/1217 places, 2572/2721 transitions.
Applied a total of 0 rules in 41 ms. Remains 1154 /1154 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2409 ms. Remains : 1154/1217 places, 2572/2721 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07
Product exploration explored 100000 steps with 20000 reset in 719 ms.
Product exploration explored 100000 steps with 20000 reset in 746 ms.
Computed a total of 322 stabilizing places and 939 stable transitions
Computed a total of 322 stabilizing places and 939 stable transitions
Detected a total of 322/1154 stabilizing places and 939/2572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (640 resets) in 365 ms. (109 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (172 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
[2024-05-24 17:26:27] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1154 cols
[2024-05-24 17:26:27] [INFO ] Computed 46 invariants in 21 ms
[2024-05-24 17:26:28] [INFO ] State equation strengthened by 838 read => feed constraints.
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) 1067/1069 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1069 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 47/1116 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/1142 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1142 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/1154 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1154 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2300/3454 variables, 1154/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3454 variables, 838/2038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3454 variables, 0/2038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3454 variables, 0/2038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3454/3454 variables, and 2038 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1084 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1154/1154 constraints, ReadFeed: 838/838 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1067/1069 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1069 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/1116 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:26:29] [INFO ] Deduced a trap composed of 175 places in 479 ms of which 9 ms to minimize.
[2024-05-24 17:26:30] [INFO ] Deduced a trap composed of 50 places in 539 ms of which 8 ms to minimize.
[2024-05-24 17:26:30] [INFO ] Deduced a trap composed of 98 places in 552 ms of which 7 ms to minimize.
[2024-05-24 17:26:31] [INFO ] Deduced a trap composed of 98 places in 464 ms of which 7 ms to minimize.
[2024-05-24 17:26:31] [INFO ] Deduced a trap composed of 128 places in 478 ms of which 6 ms to minimize.
[2024-05-24 17:26:32] [INFO ] Deduced a trap composed of 112 places in 494 ms of which 7 ms to minimize.
[2024-05-24 17:26:32] [INFO ] Deduced a trap composed of 105 places in 467 ms of which 7 ms to minimize.
[2024-05-24 17:26:33] [INFO ] Deduced a trap composed of 152 places in 473 ms of which 7 ms to minimize.
[2024-05-24 17:26:33] [INFO ] Deduced a trap composed of 133 places in 484 ms of which 7 ms to minimize.
[2024-05-24 17:26:34] [INFO ] Deduced a trap composed of 125 places in 498 ms of which 7 ms to minimize.
SMT process timed out in 6487ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1154/1154 places, 2572/2572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1154 transition count 2548
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1130 transition count 2548
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 1130 transition count 2536
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 1118 transition count 2536
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 110 place count 1099 transition count 2517
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 1098 transition count 2516
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 1098 transition count 2516
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 1097 transition count 2510
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 1097 transition count 2510
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 246 place count 1097 transition count 3723
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 378 place count 965 transition count 3723
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 379 place count 965 transition count 3723
Applied a total of 379 rules in 452 ms. Remains 965 /1154 variables (removed 189) and now considering 3723/2572 (removed -1151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 965/1154 places, 3723/2572 transitions.
RANDOM walk for 40000 steps (1130 resets) in 986 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (124 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 74459 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 74459 steps, saw 31128 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 17:26:38] [INFO ] Flow matrix only has 3325 transitions (discarded 398 similar events)
// Phase 1: matrix 3325 rows 965 cols
[2024-05-24 17:26:38] [INFO ] Computed 46 invariants in 25 ms
[2024-05-24 17:26:38] [INFO ] State equation strengthened by 2178 read => feed constraints.
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) 877/879 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/879 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/897 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/927 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/953 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:26:38] [INFO ] Deduced a trap composed of 5 places in 430 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/953 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/953 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/965 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:26:39] [INFO ] Deduced a trap composed of 136 places in 456 ms of which 5 ms to minimize.
[2024-05-24 17:26:39] [INFO ] Deduced a trap composed of 129 places in 463 ms of which 6 ms to minimize.
[2024-05-24 17:26:40] [INFO ] Deduced a trap composed of 137 places in 444 ms of which 6 ms to minimize.
[2024-05-24 17:26:40] [INFO ] Deduced a trap composed of 138 places in 443 ms of which 6 ms to minimize.
[2024-05-24 17:26:41] [INFO ] Deduced a trap composed of 143 places in 426 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/965 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/965 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3325/4290 variables, 965/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4290 variables, 2178/3195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4290 variables, 0/3195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4290 variables, 0/3195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4290/4290 variables, and 3195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4201 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 965/965 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 877/879 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/879 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/897 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:26:43] [INFO ] Deduced a trap composed of 235 places in 488 ms of which 6 ms to minimize.
[2024-05-24 17:26:43] [INFO ] Deduced a trap composed of 288 places in 480 ms of which 6 ms to minimize.
[2024-05-24 17:26:44] [INFO ] Deduced a trap composed of 111 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:26:44] [INFO ] Deduced a trap composed of 104 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:26:45] [INFO ] Deduced a trap composed of 116 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:26:45] [INFO ] Deduced a trap composed of 104 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:26:46] [INFO ] Deduced a trap composed of 148 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:26:46] [INFO ] Deduced a trap composed of 103 places in 485 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/927 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:26:47] [INFO ] Deduced a trap composed of 27 places in 460 ms of which 6 ms to minimize.
[2024-05-24 17:26:47] [INFO ] Deduced a trap composed of 132 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:26:48] [INFO ] Deduced a trap composed of 136 places in 462 ms of which 6 ms to minimize.
[2024-05-24 17:26:48] [INFO ] Deduced a trap composed of 62 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:26:49] [INFO ] Deduced a trap composed of 150 places in 442 ms of which 5 ms to minimize.
[2024-05-24 17:26:49] [INFO ] Deduced a trap composed of 141 places in 412 ms of which 5 ms to minimize.
[2024-05-24 17:26:50] [INFO ] Deduced a trap composed of 129 places in 487 ms of which 6 ms to minimize.
[2024-05-24 17:26:50] [INFO ] Deduced a trap composed of 135 places in 419 ms of which 6 ms to minimize.
[2024-05-24 17:26:50] [INFO ] Deduced a trap composed of 152 places in 409 ms of which 5 ms to minimize.
[2024-05-24 17:26:51] [INFO ] Deduced a trap composed of 134 places in 421 ms of which 6 ms to minimize.
[2024-05-24 17:26:51] [INFO ] Deduced a trap composed of 131 places in 422 ms of which 6 ms to minimize.
[2024-05-24 17:26:52] [INFO ] Deduced a trap composed of 135 places in 436 ms of which 5 ms to minimize.
[2024-05-24 17:26:52] [INFO ] Deduced a trap composed of 136 places in 409 ms of which 5 ms to minimize.
[2024-05-24 17:26:53] [INFO ] Deduced a trap composed of 136 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:26:53] [INFO ] Deduced a trap composed of 161 places in 409 ms of which 5 ms to minimize.
[2024-05-24 17:26:53] [INFO ] Deduced a trap composed of 168 places in 412 ms of which 5 ms to minimize.
[2024-05-24 17:26:54] [INFO ] Deduced a trap composed of 164 places in 408 ms of which 6 ms to minimize.
[2024-05-24 17:26:54] [INFO ] Deduced a trap composed of 150 places in 403 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/927 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/953 variables, 26/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:26:55] [INFO ] Deduced a trap composed of 165 places in 435 ms of which 6 ms to minimize.
[2024-05-24 17:26:55] [INFO ] Deduced a trap composed of 84 places in 504 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/953 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/953 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/965 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/965 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/965 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3325/4290 variables, 965/1045 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4290 variables, 2178/3223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4290 variables, 1/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4290 variables, 0/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/4290 variables, 0/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4290/4290 variables, and 3224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15940 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 965/965 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 34/34 constraints]
After SMT, in 20201ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 2 out of 965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 3723/3723 transitions.
Applied a total of 0 rules in 92 ms. Remains 965 /965 variables (removed 0) and now considering 3723/3723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 965/965 places, 3723/3723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 3723/3723 transitions.
Applied a total of 0 rules in 91 ms. Remains 965 /965 variables (removed 0) and now considering 3723/3723 (removed 0) transitions.
[2024-05-24 17:26:58] [INFO ] Flow matrix only has 3325 transitions (discarded 398 similar events)
[2024-05-24 17:26:58] [INFO ] Invariant cache hit.
[2024-05-24 17:26:59] [INFO ] Implicit Places using invariants in 1069 ms returned [230]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1073 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 964/965 places, 3723/3723 transitions.
Applied a total of 0 rules in 92 ms. Remains 964 /964 variables (removed 0) and now considering 3723/3723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1258 ms. Remains : 964/965 places, 3723/3723 transitions.
RANDOM walk for 40000 steps (1130 resets) in 745 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (123 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 74997 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 74997 steps, saw 31345 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 17:27:03] [INFO ] Flow matrix only has 3325 transitions (discarded 398 similar events)
// Phase 1: matrix 3325 rows 964 cols
[2024-05-24 17:27:03] [INFO ] Computed 45 invariants in 27 ms
[2024-05-24 17:27:03] [INFO ] State equation strengthened by 2178 read => feed constraints.
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) 877/879 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/879 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/897 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/926 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:03] [INFO ] Deduced a trap composed of 5 places in 415 ms of which 5 ms to minimize.
[2024-05-24 17:27:04] [INFO ] Deduced a trap composed of 127 places in 405 ms of which 5 ms to minimize.
[2024-05-24 17:27:04] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 5 ms to minimize.
[2024-05-24 17:27:05] [INFO ] Deduced a trap composed of 145 places in 439 ms of which 5 ms to minimize.
[2024-05-24 17:27:05] [INFO ] Deduced a trap composed of 62 places in 442 ms of which 6 ms to minimize.
[2024-05-24 17:27:05] [INFO ] Deduced a trap composed of 130 places in 407 ms of which 5 ms to minimize.
[2024-05-24 17:27:06] [INFO ] Deduced a trap composed of 134 places in 415 ms of which 5 ms to minimize.
[2024-05-24 17:27:06] [INFO ] Deduced a trap composed of 127 places in 423 ms of which 6 ms to minimize.
[2024-05-24 17:27:07] [INFO ] Deduced a trap composed of 138 places in 417 ms of which 6 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/926 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/952 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/952 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/964 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/964 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3325/4289 variables, 964/1018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4289 variables, 2178/3196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4289 variables, 0/3196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4289 variables, 0/3196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4289/4289 variables, and 3196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5536 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 964/964 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 877/879 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/879 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/897 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:09] [INFO ] Deduced a trap composed of 116 places in 474 ms of which 6 ms to minimize.
[2024-05-24 17:27:09] [INFO ] Deduced a trap composed of 154 places in 472 ms of which 5 ms to minimize.
[2024-05-24 17:27:10] [INFO ] Deduced a trap composed of 104 places in 479 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/897 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 29/926 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:10] [INFO ] Deduced a trap composed of 27 places in 532 ms of which 5 ms to minimize.
[2024-05-24 17:27:11] [INFO ] Deduced a trap composed of 87 places in 558 ms of which 5 ms to minimize.
[2024-05-24 17:27:12] [INFO ] Deduced a trap composed of 87 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:27:12] [INFO ] Deduced a trap composed of 68 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:27:13] [INFO ] Deduced a trap composed of 130 places in 444 ms of which 5 ms to minimize.
[2024-05-24 17:27:13] [INFO ] Deduced a trap composed of 62 places in 441 ms of which 5 ms to minimize.
[2024-05-24 17:27:14] [INFO ] Deduced a trap composed of 75 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:27:14] [INFO ] Deduced a trap composed of 90 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:27:15] [INFO ] Deduced a trap composed of 90 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:27:15] [INFO ] Deduced a trap composed of 78 places in 512 ms of which 5 ms to minimize.
[2024-05-24 17:27:16] [INFO ] Deduced a trap composed of 72 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:27:16] [INFO ] Deduced a trap composed of 82 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:27:17] [INFO ] Deduced a trap composed of 82 places in 463 ms of which 5 ms to minimize.
[2024-05-24 17:27:17] [INFO ] Deduced a trap composed of 61 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:27:18] [INFO ] Deduced a trap composed of 67 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:27:18] [INFO ] Deduced a trap composed of 162 places in 520 ms of which 5 ms to minimize.
[2024-05-24 17:27:19] [INFO ] Deduced a trap composed of 69 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:27:19] [INFO ] Deduced a trap composed of 75 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:27:20] [INFO ] Deduced a trap composed of 74 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:27:20] [INFO ] Deduced a trap composed of 80 places in 503 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:21] [INFO ] Deduced a trap composed of 85 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:27:21] [INFO ] Deduced a trap composed of 61 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:27:22] [INFO ] Deduced a trap composed of 141 places in 410 ms of which 5 ms to minimize.
[2024-05-24 17:27:22] [INFO ] Deduced a trap composed of 153 places in 426 ms of which 6 ms to minimize.
[2024-05-24 17:27:23] [INFO ] Deduced a trap composed of 137 places in 415 ms of which 5 ms to minimize.
[2024-05-24 17:27:23] [INFO ] Deduced a trap composed of 130 places in 410 ms of which 5 ms to minimize.
[2024-05-24 17:27:24] [INFO ] Deduced a trap composed of 156 places in 410 ms of which 6 ms to minimize.
[2024-05-24 17:27:24] [INFO ] Deduced a trap composed of 131 places in 413 ms of which 5 ms to minimize.
[2024-05-24 17:27:25] [INFO ] Deduced a trap composed of 139 places in 422 ms of which 6 ms to minimize.
[2024-05-24 17:27:25] [INFO ] Deduced a trap composed of 141 places in 443 ms of which 5 ms to minimize.
[2024-05-24 17:27:25] [INFO ] Deduced a trap composed of 136 places in 438 ms of which 5 ms to minimize.
[2024-05-24 17:27:26] [INFO ] Deduced a trap composed of 135 places in 412 ms of which 5 ms to minimize.
[2024-05-24 17:27:26] [INFO ] Deduced a trap composed of 151 places in 450 ms of which 6 ms to minimize.
[2024-05-24 17:27:27] [INFO ] Deduced a trap composed of 76 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:27:27] [INFO ] Deduced a trap composed of 78 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:27:28] [INFO ] Deduced a trap composed of 78 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:27:28] [INFO ] Deduced a trap composed of 73 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:27:29] [INFO ] Deduced a trap composed of 77 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:27:30] [INFO ] Deduced a trap composed of 153 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:27:30] [INFO ] Deduced a trap composed of 71 places in 519 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/926 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:31] [INFO ] Deduced a trap composed of 71 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:27:31] [INFO ] Deduced a trap composed of 84 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:27:32] [INFO ] Deduced a trap composed of 61 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:27:32] [INFO ] Deduced a trap composed of 135 places in 411 ms of which 6 ms to minimize.
[2024-05-24 17:27:33] [INFO ] Deduced a trap composed of 73 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:27:33] [INFO ] Deduced a trap composed of 86 places in 484 ms of which 5 ms to minimize.
[2024-05-24 17:27:34] [INFO ] Deduced a trap composed of 89 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:27:34] [INFO ] Deduced a trap composed of 137 places in 420 ms of which 6 ms to minimize.
[2024-05-24 17:27:35] [INFO ] Deduced a trap composed of 153 places in 430 ms of which 5 ms to minimize.
[2024-05-24 17:27:35] [INFO ] Deduced a trap composed of 135 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:27:36] [INFO ] Deduced a trap composed of 70 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:27:36] [INFO ] Deduced a trap composed of 69 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:27:37] [INFO ] Deduced a trap composed of 137 places in 408 ms of which 6 ms to minimize.
[2024-05-24 17:27:37] [INFO ] Deduced a trap composed of 84 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:27:38] [INFO ] Deduced a trap composed of 120 places in 536 ms of which 5 ms to minimize.
[2024-05-24 17:27:38] [INFO ] Deduced a trap composed of 90 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:27:39] [INFO ] Deduced a trap composed of 79 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:27:39] [INFO ] Deduced a trap composed of 126 places in 521 ms of which 6 ms to minimize.
[2024-05-24 17:27:40] [INFO ] Deduced a trap composed of 88 places in 568 ms of which 6 ms to minimize.
[2024-05-24 17:27:40] [INFO ] Deduced a trap composed of 74 places in 549 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/926 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:41] [INFO ] Deduced a trap composed of 80 places in 589 ms of which 5 ms to minimize.
[2024-05-24 17:27:42] [INFO ] Deduced a trap composed of 98 places in 568 ms of which 6 ms to minimize.
[2024-05-24 17:27:42] [INFO ] Deduced a trap composed of 71 places in 557 ms of which 6 ms to minimize.
[2024-05-24 17:27:43] [INFO ] Deduced a trap composed of 140 places in 452 ms of which 6 ms to minimize.
[2024-05-24 17:27:43] [INFO ] Deduced a trap composed of 124 places in 591 ms of which 6 ms to minimize.
[2024-05-24 17:27:44] [INFO ] Deduced a trap composed of 134 places in 478 ms of which 5 ms to minimize.
[2024-05-24 17:27:44] [INFO ] Deduced a trap composed of 142 places in 456 ms of which 5 ms to minimize.
[2024-05-24 17:27:45] [INFO ] Deduced a trap composed of 86 places in 495 ms of which 5 ms to minimize.
[2024-05-24 17:27:45] [INFO ] Deduced a trap composed of 153 places in 413 ms of which 5 ms to minimize.
[2024-05-24 17:27:46] [INFO ] Deduced a trap composed of 67 places in 593 ms of which 6 ms to minimize.
[2024-05-24 17:27:46] [INFO ] Deduced a trap composed of 133 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:27:47] [INFO ] Deduced a trap composed of 78 places in 575 ms of which 7 ms to minimize.
[2024-05-24 17:27:47] [INFO ] Deduced a trap composed of 151 places in 567 ms of which 6 ms to minimize.
[2024-05-24 17:27:48] [INFO ] Deduced a trap composed of 73 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:27:49] [INFO ] Deduced a trap composed of 68 places in 555 ms of which 6 ms to minimize.
[2024-05-24 17:27:49] [INFO ] Deduced a trap composed of 79 places in 582 ms of which 6 ms to minimize.
[2024-05-24 17:27:50] [INFO ] Deduced a trap composed of 68 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:27:50] [INFO ] Deduced a trap composed of 153 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:27:51] [INFO ] Deduced a trap composed of 137 places in 410 ms of which 6 ms to minimize.
[2024-05-24 17:27:51] [INFO ] Deduced a trap composed of 79 places in 515 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/926 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:27:52] [INFO ] Deduced a trap composed of 68 places in 553 ms of which 6 ms to minimize.
[2024-05-24 17:27:52] [INFO ] Deduced a trap composed of 140 places in 404 ms of which 5 ms to minimize.
[2024-05-24 17:27:53] [INFO ] Deduced a trap composed of 138 places in 403 ms of which 5 ms to minimize.
[2024-05-24 17:27:53] [INFO ] Deduced a trap composed of 71 places in 483 ms of which 5 ms to minimize.
[2024-05-24 17:27:54] [INFO ] Deduced a trap composed of 142 places in 483 ms of which 6 ms to minimize.
[2024-05-24 17:27:54] [INFO ] Deduced a trap composed of 70 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:27:55] [INFO ] Deduced a trap composed of 69 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:27:55] [INFO ] Deduced a trap composed of 63 places in 488 ms of which 5 ms to minimize.
[2024-05-24 17:27:55] [INFO ] Deduced a trap composed of 137 places in 405 ms of which 5 ms to minimize.
[2024-05-24 17:27:56] [INFO ] Deduced a trap composed of 74 places in 557 ms of which 6 ms to minimize.
[2024-05-24 17:27:57] [INFO ] Deduced a trap composed of 75 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:27:57] [INFO ] Deduced a trap composed of 138 places in 447 ms of which 5 ms to minimize.
[2024-05-24 17:27:58] [INFO ] Deduced a trap composed of 70 places in 552 ms of which 6 ms to minimize.
[2024-05-24 17:27:58] [INFO ] Deduced a trap composed of 77 places in 541 ms of which 6 ms to minimize.
[2024-05-24 17:27:59] [INFO ] Deduced a trap composed of 142 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:27:59] [INFO ] Deduced a trap composed of 140 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:28:00] [INFO ] Deduced a trap composed of 70 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:28:00] [INFO ] Deduced a trap composed of 151 places in 425 ms of which 5 ms to minimize.
[2024-05-24 17:28:01] [INFO ] Deduced a trap composed of 142 places in 413 ms of which 5 ms to minimize.
[2024-05-24 17:28:01] [INFO ] Deduced a trap composed of 138 places in 454 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/926 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:02] [INFO ] Deduced a trap composed of 142 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:28:02] [INFO ] Deduced a trap composed of 143 places in 412 ms of which 5 ms to minimize.
[2024-05-24 17:28:03] [INFO ] Deduced a trap composed of 159 places in 447 ms of which 6 ms to minimize.
[2024-05-24 17:28:03] [INFO ] Deduced a trap composed of 140 places in 405 ms of which 5 ms to minimize.
[2024-05-24 17:28:03] [INFO ] Deduced a trap composed of 138 places in 418 ms of which 5 ms to minimize.
[2024-05-24 17:28:04] [INFO ] Deduced a trap composed of 154 places in 423 ms of which 5 ms to minimize.
[2024-05-24 17:28:04] [INFO ] Deduced a trap composed of 174 places in 440 ms of which 6 ms to minimize.
[2024-05-24 17:28:05] [INFO ] Deduced a trap composed of 138 places in 419 ms of which 6 ms to minimize.
[2024-05-24 17:28:05] [INFO ] Deduced a trap composed of 144 places in 397 ms of which 5 ms to minimize.
[2024-05-24 17:28:06] [INFO ] Deduced a trap composed of 154 places in 399 ms of which 5 ms to minimize.
[2024-05-24 17:28:06] [INFO ] Deduced a trap composed of 145 places in 448 ms of which 5 ms to minimize.
[2024-05-24 17:28:07] [INFO ] Deduced a trap composed of 150 places in 440 ms of which 5 ms to minimize.
[2024-05-24 17:28:07] [INFO ] Deduced a trap composed of 151 places in 429 ms of which 6 ms to minimize.
[2024-05-24 17:28:07] [INFO ] Deduced a trap composed of 67 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:28:08] [INFO ] Deduced a trap composed of 80 places in 532 ms of which 5 ms to minimize.
[2024-05-24 17:28:09] [INFO ] Deduced a trap composed of 62 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:28:09] [INFO ] Deduced a trap composed of 66 places in 554 ms of which 6 ms to minimize.
[2024-05-24 17:28:10] [INFO ] Deduced a trap composed of 75 places in 517 ms of which 5 ms to minimize.
[2024-05-24 17:28:10] [INFO ] Deduced a trap composed of 76 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:28:11] [INFO ] Deduced a trap composed of 73 places in 529 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/926 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:11] [INFO ] Deduced a trap composed of 75 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:28:12] [INFO ] Deduced a trap composed of 94 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:28:13] [INFO ] Deduced a trap composed of 83 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:28:13] [INFO ] Deduced a trap composed of 78 places in 517 ms of which 5 ms to minimize.
[2024-05-24 17:28:14] [INFO ] Deduced a trap composed of 60 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:28:14] [INFO ] Deduced a trap composed of 65 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:28:15] [INFO ] Deduced a trap composed of 63 places in 510 ms of which 5 ms to minimize.
[2024-05-24 17:28:15] [INFO ] Deduced a trap composed of 55 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:28:16] [INFO ] Deduced a trap composed of 87 places in 513 ms of which 6 ms to minimize.
[2024-05-24 17:28:16] [INFO ] Deduced a trap composed of 87 places in 486 ms of which 6 ms to minimize.
[2024-05-24 17:28:17] [INFO ] Deduced a trap composed of 67 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:28:17] [INFO ] Deduced a trap composed of 61 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:28:18] [INFO ] Deduced a trap composed of 67 places in 568 ms of which 6 ms to minimize.
[2024-05-24 17:28:19] [INFO ] Deduced a trap composed of 71 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:28:19] [INFO ] Deduced a trap composed of 61 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:28:20] [INFO ] Deduced a trap composed of 71 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:28:21] [INFO ] Deduced a trap composed of 67 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:28:21] [INFO ] Deduced a trap composed of 69 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:28:22] [INFO ] Deduced a trap composed of 58 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:28:22] [INFO ] Deduced a trap composed of 60 places in 507 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:23] [INFO ] Deduced a trap composed of 83 places in 527 ms of which 5 ms to minimize.
[2024-05-24 17:28:23] [INFO ] Deduced a trap composed of 63 places in 514 ms of which 6 ms to minimize.
SMT process timed out in 80810ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3723/3723 transitions.
Applied a total of 0 rules in 94 ms. Remains 964 /964 variables (removed 0) and now considering 3723/3723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 964/964 places, 3723/3723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3723/3723 transitions.
Applied a total of 0 rules in 96 ms. Remains 964 /964 variables (removed 0) and now considering 3723/3723 (removed 0) transitions.
[2024-05-24 17:28:24] [INFO ] Flow matrix only has 3325 transitions (discarded 398 similar events)
[2024-05-24 17:28:24] [INFO ] Invariant cache hit.
[2024-05-24 17:28:25] [INFO ] Implicit Places using invariants in 1132 ms returned []
[2024-05-24 17:28:25] [INFO ] Flow matrix only has 3325 transitions (discarded 398 similar events)
[2024-05-24 17:28:25] [INFO ] Invariant cache hit.
[2024-05-24 17:28:26] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:28:56] [INFO ] Performed 945/964 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:28:59] [INFO ] Implicit Places using invariants and state equation in 34174 ms returned []
Implicit Place search using SMT with State Equation took 35307 ms to find 0 implicit places.
[2024-05-24 17:28:59] [INFO ] Redundant transitions in 145 ms returned []
Running 3661 sub problems to find dead transitions.
[2024-05-24 17:28:59] [INFO ] Flow matrix only has 3325 transitions (discarded 398 similar events)
[2024-05-24 17:28:59] [INFO ] Invariant cache hit.
[2024-05-24 17:28:59] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3661 unsolved
SMT process timed out in 52123ms, After SMT, problems are : Problem set: 0 solved, 3661 unsolved
Search for dead transitions found 0 dead transitions in 52154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87718 ms. Remains : 964/964 places, 3723/3723 transitions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Support contains 3 out of 1154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1154/1154 places, 2572/2572 transitions.
Applied a total of 0 rules in 46 ms. Remains 1154 /1154 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
[2024-05-24 17:29:52] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1154 cols
[2024-05-24 17:29:52] [INFO ] Computed 46 invariants in 20 ms
[2024-05-24 17:29:53] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-05-24 17:29:53] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-24 17:29:53] [INFO ] Invariant cache hit.
[2024-05-24 17:29:53] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 17:30:06] [INFO ] Implicit Places using invariants and state equation in 12989 ms returned [1139]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13936 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1153/1154 places, 2572/2572 transitions.
Applied a total of 0 rules in 45 ms. Remains 1153 /1153 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14028 ms. Remains : 1153/1154 places, 2572/2572 transitions.
Computed a total of 321 stabilizing places and 939 stable transitions
Computed a total of 321 stabilizing places and 939 stable transitions
Detected a total of 321/1153 stabilizing places and 939/2572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (640 resets) in 187 ms. (212 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (172 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
[2024-05-24 17:30:06] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1153 cols
[2024-05-24 17:30:06] [INFO ] Computed 45 invariants in 20 ms
[2024-05-24 17:30:06] [INFO ] State equation strengthened by 838 read => feed constraints.
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) 1067/1069 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1069 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 47/1116 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/1142 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1142 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1153 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2300/3453 variables, 1153/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3453 variables, 838/2036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3453 variables, 0/2036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/3453 variables, 0/2036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3453/3453 variables, and 2036 constraints, problems are : Problem set: 0 solved, 1 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1153/1153 constraints, ReadFeed: 838/838 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1067/1069 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1069 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/1116 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:08] [INFO ] Deduced a trap composed of 170 places in 485 ms of which 7 ms to minimize.
[2024-05-24 17:30:08] [INFO ] Deduced a trap composed of 145 places in 516 ms of which 7 ms to minimize.
[2024-05-24 17:30:09] [INFO ] Deduced a trap composed of 113 places in 523 ms of which 7 ms to minimize.
[2024-05-24 17:30:09] [INFO ] Deduced a trap composed of 268 places in 496 ms of which 7 ms to minimize.
[2024-05-24 17:30:10] [INFO ] Deduced a trap composed of 50 places in 504 ms of which 7 ms to minimize.
[2024-05-24 17:30:10] [INFO ] Deduced a trap composed of 121 places in 491 ms of which 7 ms to minimize.
[2024-05-24 17:30:11] [INFO ] Deduced a trap composed of 87 places in 507 ms of which 7 ms to minimize.
[2024-05-24 17:30:11] [INFO ] Deduced a trap composed of 89 places in 487 ms of which 7 ms to minimize.
[2024-05-24 17:30:12] [INFO ] Deduced a trap composed of 98 places in 484 ms of which 6 ms to minimize.
[2024-05-24 17:30:12] [INFO ] Deduced a trap composed of 111 places in 469 ms of which 6 ms to minimize.
SMT process timed out in 6306ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1153/1153 places, 2572/2572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1153 transition count 2547
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1128 transition count 2547
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 50 place count 1128 transition count 2535
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 1116 transition count 2535
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 112 place count 1097 transition count 2516
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 1096 transition count 2515
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 1096 transition count 2515
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 1095 transition count 2509
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 1095 transition count 2509
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 248 place count 1095 transition count 3722
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 380 place count 963 transition count 3722
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 381 place count 963 transition count 3722
Applied a total of 381 rules in 445 ms. Remains 963 /1153 variables (removed 190) and now considering 3722/2572 (removed -1150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 963/1153 places, 3722/2572 transitions.
RANDOM walk for 40000 steps (1129 resets) in 903 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (123 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 75425 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 75425 steps, saw 31513 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-24 17:30:16] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 963 cols
[2024-05-24 17:30:16] [INFO ] Computed 45 invariants in 27 ms
[2024-05-24 17:30:16] [INFO ] State equation strengthened by 2178 read => feed constraints.
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) 876/878 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/896 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/926 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/926 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/952 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:17] [INFO ] Deduced a trap composed of 5 places in 437 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/952 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/952 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/963 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3324/4287 variables, 963/1009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4287 variables, 2178/3187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4287 variables, 0/3187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4287 variables, 0/3187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4287/4287 variables, and 3187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 963/963 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 876/878 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/896 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:19] [INFO ] Deduced a trap composed of 238 places in 463 ms of which 6 ms to minimize.
[2024-05-24 17:30:19] [INFO ] Deduced a trap composed of 166 places in 471 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/926 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:20] [INFO ] Deduced a trap composed of 27 places in 448 ms of which 5 ms to minimize.
[2024-05-24 17:30:20] [INFO ] Deduced a trap composed of 57 places in 442 ms of which 5 ms to minimize.
[2024-05-24 17:30:21] [INFO ] Deduced a trap composed of 62 places in 447 ms of which 5 ms to minimize.
[2024-05-24 17:30:21] [INFO ] Deduced a trap composed of 137 places in 415 ms of which 5 ms to minimize.
[2024-05-24 17:30:21] [INFO ] Deduced a trap composed of 130 places in 412 ms of which 5 ms to minimize.
[2024-05-24 17:30:22] [INFO ] Deduced a trap composed of 132 places in 407 ms of which 5 ms to minimize.
[2024-05-24 17:30:22] [INFO ] Deduced a trap composed of 134 places in 420 ms of which 5 ms to minimize.
[2024-05-24 17:30:23] [INFO ] Deduced a trap composed of 148 places in 432 ms of which 6 ms to minimize.
[2024-05-24 17:30:23] [INFO ] Deduced a trap composed of 161 places in 420 ms of which 6 ms to minimize.
[2024-05-24 17:30:24] [INFO ] Deduced a trap composed of 138 places in 420 ms of which 5 ms to minimize.
[2024-05-24 17:30:24] [INFO ] Deduced a trap composed of 136 places in 418 ms of which 5 ms to minimize.
[2024-05-24 17:30:24] [INFO ] Deduced a trap composed of 135 places in 426 ms of which 5 ms to minimize.
[2024-05-24 17:30:25] [INFO ] Deduced a trap composed of 155 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:30:25] [INFO ] Deduced a trap composed of 136 places in 426 ms of which 6 ms to minimize.
[2024-05-24 17:30:26] [INFO ] Deduced a trap composed of 134 places in 405 ms of which 5 ms to minimize.
[2024-05-24 17:30:26] [INFO ] Deduced a trap composed of 138 places in 399 ms of which 5 ms to minimize.
[2024-05-24 17:30:27] [INFO ] Deduced a trap composed of 152 places in 411 ms of which 5 ms to minimize.
[2024-05-24 17:30:27] [INFO ] Deduced a trap composed of 156 places in 411 ms of which 5 ms to minimize.
[2024-05-24 17:30:27] [INFO ] Deduced a trap composed of 136 places in 406 ms of which 6 ms to minimize.
[2024-05-24 17:30:28] [INFO ] Deduced a trap composed of 152 places in 425 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:28] [INFO ] Deduced a trap composed of 141 places in 411 ms of which 5 ms to minimize.
[2024-05-24 17:30:29] [INFO ] Deduced a trap composed of 141 places in 406 ms of which 5 ms to minimize.
[2024-05-24 17:30:29] [INFO ] Deduced a trap composed of 133 places in 432 ms of which 5 ms to minimize.
[2024-05-24 17:30:30] [INFO ] Deduced a trap composed of 135 places in 436 ms of which 5 ms to minimize.
[2024-05-24 17:30:30] [INFO ] Deduced a trap composed of 136 places in 407 ms of which 5 ms to minimize.
[2024-05-24 17:30:31] [INFO ] Deduced a trap composed of 137 places in 419 ms of which 5 ms to minimize.
[2024-05-24 17:30:31] [INFO ] Deduced a trap composed of 140 places in 409 ms of which 5 ms to minimize.
[2024-05-24 17:30:31] [INFO ] Deduced a trap composed of 157 places in 407 ms of which 5 ms to minimize.
[2024-05-24 17:30:32] [INFO ] Deduced a trap composed of 141 places in 437 ms of which 6 ms to minimize.
[2024-05-24 17:30:32] [INFO ] Deduced a trap composed of 150 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:30:33] [INFO ] Deduced a trap composed of 148 places in 418 ms of which 6 ms to minimize.
[2024-05-24 17:30:33] [INFO ] Deduced a trap composed of 141 places in 425 ms of which 5 ms to minimize.
[2024-05-24 17:30:34] [INFO ] Deduced a trap composed of 147 places in 413 ms of which 5 ms to minimize.
[2024-05-24 17:30:34] [INFO ] Deduced a trap composed of 163 places in 412 ms of which 5 ms to minimize.
[2024-05-24 17:30:34] [INFO ] Deduced a trap composed of 149 places in 421 ms of which 5 ms to minimize.
[2024-05-24 17:30:35] [INFO ] Deduced a trap composed of 147 places in 416 ms of which 5 ms to minimize.
[2024-05-24 17:30:35] [INFO ] Deduced a trap composed of 134 places in 411 ms of which 5 ms to minimize.
[2024-05-24 17:30:36] [INFO ] Deduced a trap composed of 202 places in 424 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/926 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/926 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/952 variables, 26/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:36] [INFO ] Deduced a trap composed of 179 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:30:37] [INFO ] Deduced a trap composed of 76 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:30:37] [INFO ] Deduced a trap composed of 87 places in 517 ms of which 5 ms to minimize.
[2024-05-24 17:30:38] [INFO ] Deduced a trap composed of 85 places in 514 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/963 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/963 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3324/4287 variables, 963/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4287 variables, 2178/3231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4287 variables, 1/3232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:42] [INFO ] Deduced a trap composed of 62 places in 539 ms of which 7 ms to minimize.
[2024-05-24 17:30:42] [INFO ] Deduced a trap composed of 168 places in 454 ms of which 6 ms to minimize.
[2024-05-24 17:30:43] [INFO ] Deduced a trap composed of 91 places in 523 ms of which 5 ms to minimize.
[2024-05-24 17:30:44] [INFO ] Deduced a trap composed of 61 places in 534 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4287 variables, 4/3236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4287 variables, 0/3236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/4287 variables, 0/3236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4287/4287 variables, and 3236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26065 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 963/963 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 49/49 constraints]
After SMT, in 27860ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 2 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 91 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 963/963 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 91 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2024-05-24 17:30:44] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:30:44] [INFO ] Invariant cache hit.
[2024-05-24 17:30:45] [INFO ] Implicit Places using invariants in 1062 ms returned [230]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1065 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 962/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 94 ms. Remains 962 /962 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1252 ms. Remains : 962/963 places, 3722/3722 transitions.
RANDOM walk for 40000 steps (1129 resets) in 648 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (125 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 75448 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 75448 steps, saw 31528 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-24 17:30:49] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 962 cols
[2024-05-24 17:30:49] [INFO ] Computed 44 invariants in 23 ms
[2024-05-24 17:30:49] [INFO ] State equation strengthened by 2178 read => feed constraints.
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) 876/878 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/896 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:49] [INFO ] Deduced a trap composed of 170 places in 469 ms of which 5 ms to minimize.
[2024-05-24 17:30:50] [INFO ] Deduced a trap composed of 170 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:30:50] [INFO ] Deduced a trap composed of 95 places in 477 ms of which 6 ms to minimize.
[2024-05-24 17:30:51] [INFO ] Deduced a trap composed of 185 places in 473 ms of which 5 ms to minimize.
[2024-05-24 17:30:51] [INFO ] Deduced a trap composed of 88 places in 469 ms of which 5 ms to minimize.
[2024-05-24 17:30:52] [INFO ] Deduced a trap composed of 186 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:30:52] [INFO ] Deduced a trap composed of 238 places in 459 ms of which 5 ms to minimize.
[2024-05-24 17:30:53] [INFO ] Deduced a trap composed of 89 places in 491 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 29/925 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/951 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:53] [INFO ] Deduced a trap composed of 27 places in 431 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/951 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/962 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3324/4286 variables, 962/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4286 variables, 2178/3193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4286 variables, 0/3193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4286 variables, 0/3193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4286/4286 variables, and 3193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5797 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 962/962 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 876/878 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/896 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:55] [INFO ] Deduced a trap composed of 346 places in 482 ms of which 5 ms to minimize.
[2024-05-24 17:30:56] [INFO ] Deduced a trap composed of 166 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:30:56] [INFO ] Deduced a trap composed of 105 places in 466 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/925 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:57] [INFO ] Deduced a trap composed of 72 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:30:57] [INFO ] Deduced a trap composed of 68 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:30:58] [INFO ] Deduced a trap composed of 27 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:30:58] [INFO ] Deduced a trap composed of 79 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:30:59] [INFO ] Deduced a trap composed of 87 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:30:59] [INFO ] Deduced a trap composed of 85 places in 488 ms of which 6 ms to minimize.
[2024-05-24 17:31:00] [INFO ] Deduced a trap composed of 82 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:31:00] [INFO ] Deduced a trap composed of 76 places in 485 ms of which 5 ms to minimize.
[2024-05-24 17:31:01] [INFO ] Deduced a trap composed of 66 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:31:01] [INFO ] Deduced a trap composed of 68 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:31:02] [INFO ] Deduced a trap composed of 77 places in 520 ms of which 5 ms to minimize.
[2024-05-24 17:31:02] [INFO ] Deduced a trap composed of 135 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:31:03] [INFO ] Deduced a trap composed of 136 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:31:03] [INFO ] Deduced a trap composed of 5 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:31:04] [INFO ] Deduced a trap composed of 88 places in 544 ms of which 6 ms to minimize.
[2024-05-24 17:31:04] [INFO ] Deduced a trap composed of 74 places in 479 ms of which 6 ms to minimize.
[2024-05-24 17:31:05] [INFO ] Deduced a trap composed of 80 places in 499 ms of which 5 ms to minimize.
[2024-05-24 17:31:05] [INFO ] Deduced a trap composed of 91 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:31:06] [INFO ] Deduced a trap composed of 62 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:31:06] [INFO ] Deduced a trap composed of 133 places in 399 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:31:07] [INFO ] Deduced a trap composed of 139 places in 405 ms of which 5 ms to minimize.
[2024-05-24 17:31:07] [INFO ] Deduced a trap composed of 68 places in 484 ms of which 5 ms to minimize.
[2024-05-24 17:31:08] [INFO ] Deduced a trap composed of 139 places in 403 ms of which 5 ms to minimize.
[2024-05-24 17:31:08] [INFO ] Deduced a trap composed of 169 places in 406 ms of which 5 ms to minimize.
[2024-05-24 17:31:08] [INFO ] Deduced a trap composed of 139 places in 397 ms of which 5 ms to minimize.
[2024-05-24 17:31:09] [INFO ] Deduced a trap composed of 141 places in 419 ms of which 5 ms to minimize.
[2024-05-24 17:31:09] [INFO ] Deduced a trap composed of 83 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:31:10] [INFO ] Deduced a trap composed of 72 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:31:11] [INFO ] Deduced a trap composed of 67 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:31:11] [INFO ] Deduced a trap composed of 63 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:31:12] [INFO ] Deduced a trap composed of 64 places in 509 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/925 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 26/951 variables, 26/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/951 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/962 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/962 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3324/4286 variables, 962/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4286 variables, 2178/3227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4286 variables, 1/3228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:31:16] [INFO ] Deduced a trap composed of 75 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:31:16] [INFO ] Deduced a trap composed of 98 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:31:17] [INFO ] Deduced a trap composed of 195 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:31:18] [INFO ] Deduced a trap composed of 94 places in 535 ms of which 5 ms to minimize.
[2024-05-24 17:31:19] [INFO ] Deduced a trap composed of 72 places in 523 ms of which 5 ms to minimize.
[2024-05-24 17:31:20] [INFO ] Deduced a trap composed of 206 places in 447 ms of which 6 ms to minimize.
[2024-05-24 17:31:20] [INFO ] Deduced a trap composed of 178 places in 452 ms of which 5 ms to minimize.
[2024-05-24 17:31:21] [INFO ] Deduced a trap composed of 80 places in 519 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4286 variables, 8/3236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4286 variables, 0/3236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/4286 variables, 0/3236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4286/4286 variables, and 3236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27003 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 962/962 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 51/51 constraints]
After SMT, in 32853ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 2 out of 962 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 3722/3722 transitions.
Applied a total of 0 rules in 93 ms. Remains 962 /962 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 962/962 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 962/962 places, 3722/3722 transitions.
Applied a total of 0 rules in 92 ms. Remains 962 /962 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2024-05-24 17:31:22] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:31:22] [INFO ] Invariant cache hit.
[2024-05-24 17:31:23] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2024-05-24 17:31:23] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:31:23] [INFO ] Invariant cache hit.
[2024-05-24 17:31:24] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:31:53] [INFO ] Implicit Places using invariants and state equation in 30092 ms returned []
Implicit Place search using SMT with State Equation took 31187 ms to find 0 implicit places.
[2024-05-24 17:31:53] [INFO ] Redundant transitions in 143 ms returned []
Running 3660 sub problems to find dead transitions.
[2024-05-24 17:31:53] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:31:53] [INFO ] Invariant cache hit.
[2024-05-24 17:31:53] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 52358ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 52389ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83827 ms. Remains : 962/962 places, 3722/3722 transitions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 20000 reset in 645 ms.
Product exploration explored 100000 steps with 20000 reset in 673 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Support contains 3 out of 1153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1153/1153 places, 2572/2572 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1153 transition count 2572
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 24 place count 1153 transition count 2573
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 1153 transition count 2573
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 48 place count 1141 transition count 2561
Deduced a syphon composed of 24 places in 2 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 60 place count 1141 transition count 2561
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 1141 transition count 2561
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 1139 transition count 2559
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 1139 transition count 2559
Deduced a syphon composed of 41 places in 1 ms
Applied a total of 83 rules in 491 ms. Remains 1139 /1153 variables (removed 14) and now considering 2559/2572 (removed 13) transitions.
[2024-05-24 17:32:49] [INFO ] Redundant transitions in 76 ms returned []
Running 2542 sub problems to find dead transitions.
[2024-05-24 17:32:49] [INFO ] Flow matrix only has 2287 transitions (discarded 272 similar events)
// Phase 1: matrix 2287 rows 1139 cols
[2024-05-24 17:32:49] [INFO ] Computed 45 invariants in 27 ms
[2024-05-24 17:32:49] [INFO ] State equation strengthened by 838 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 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 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.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 0.0)
(s44 1.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 0.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 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 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.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 0.0)
(s99 0.0)
(s100 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1137 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2542 unsolved
SMT process timed out in 32781ms, After SMT, problems are : Problem set: 0 solved, 2542 unsolved
Search for dead transitions found 0 dead transitions in 32804ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1139/1153 places, 2559/2572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33386 ms. Remains : 1139/1153 places, 2559/2572 transitions.
Built C files in :
/tmp/ltsmin10537976987645487447
[2024-05-24 17:33:21] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10537976987645487447
Running compilation step : cd /tmp/ltsmin10537976987645487447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10537976987645487447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10537976987645487447;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 3 out of 1153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1153/1153 places, 2572/2572 transitions.
Applied a total of 0 rules in 82 ms. Remains 1153 /1153 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
[2024-05-24 17:33:24] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1153 cols
[2024-05-24 17:33:24] [INFO ] Computed 45 invariants in 24 ms
[2024-05-24 17:33:25] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-05-24 17:33:25] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-24 17:33:25] [INFO ] Invariant cache hit.
[2024-05-24 17:33:26] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 17:33:38] [INFO ] Implicit Places using invariants and state equation in 12349 ms returned []
Implicit Place search using SMT with State Equation took 13303 ms to find 0 implicit places.
Running 2555 sub problems to find dead transitions.
[2024-05-24 17:33:38] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2024-05-24 17:33:38] [INFO ] Invariant cache hit.
[2024-05-24 17:33:38] [INFO ] State equation strengthened by 838 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1151 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2555 unsolved
SMT process timed out in 32163ms, After SMT, problems are : Problem set: 0 solved, 2555 unsolved
Search for dead transitions found 0 dead transitions in 32188ms
Finished structural reductions in LTL mode , in 1 iterations and 45579 ms. Remains : 1153/1153 places, 2572/2572 transitions.
Built C files in :
/tmp/ltsmin13699131665299496620
[2024-05-24 17:34:10] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13699131665299496620
Running compilation step : cd /tmp/ltsmin13699131665299496620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin13699131665299496620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin13699131665299496620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-24 17:34:13] [INFO ] Flatten gal took : 67 ms
[2024-05-24 17:34:13] [INFO ] Flatten gal took : 65 ms
[2024-05-24 17:34:13] [INFO ] Time to serialize gal into /tmp/LTL8932228457799203596.gal : 12 ms
[2024-05-24 17:34:13] [INFO ] Time to serialize properties into /tmp/LTL2649172260327072028.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8932228457799203596.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16037522138761308034.hoa' '-atoms' '/tmp/LTL2649172260327072028.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2649172260327072028.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16037522138761308034.hoa
Detected timeout of ITS tools.
[2024-05-24 17:34:28] [INFO ] Flatten gal took : 63 ms
[2024-05-24 17:34:28] [INFO ] Flatten gal took : 62 ms
[2024-05-24 17:34:28] [INFO ] Time to serialize gal into /tmp/LTL18313504218833690345.gal : 16 ms
[2024-05-24 17:34:28] [INFO ] Time to serialize properties into /tmp/LTL9241247684025215462.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18313504218833690345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9241247684025215462.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X(F("(Node2HasTheLeafSetOfLx2ToReplaceNode7<1)")))&&("((Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6<1)||(NodesCanDetect...185
Formula 0 simplified : XXX(!"((Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6<1)||(NodesCanDetectThatNode5HasCrashed<1))" | XG!"(Node2HasTheLeafSetOfLx2T...173
Detected timeout of ITS tools.
[2024-05-24 17:34:44] [INFO ] Flatten gal took : 60 ms
[2024-05-24 17:34:44] [INFO ] Applying decomposition
[2024-05-24 17:34:44] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6182580994902001594.txt' '-o' '/tmp/graph6182580994902001594.bin' '-w' '/tmp/graph6182580994902001594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6182580994902001594.bin' '-l' '-1' '-v' '-w' '/tmp/graph6182580994902001594.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:34:44] [INFO ] Decomposing Gal with order
[2024-05-24 17:34:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:34:44] [INFO ] Removed a total of 2773 redundant transitions.
[2024-05-24 17:34:44] [INFO ] Flatten gal took : 168 ms
[2024-05-24 17:34:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 1220 labels/synchronizations in 130 ms.
[2024-05-24 17:34:44] [INFO ] Time to serialize gal into /tmp/LTL5144659706541778988.gal : 19 ms
[2024-05-24 17:34:44] [INFO ] Time to serialize properties into /tmp/LTL18055715353016888517.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5144659706541778988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18055715353016888517.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X(F("(i1.i1.i2.u61.Node2HasTheLeafSetOfLx2ToReplaceNode7<1)")))&&("((i7.u46.Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6...214
Formula 0 simplified : XXX(!"((i7.u46.Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6<1)||(i14.u116.NodesCanDetectThatNode5HasCrashed<1))" | XG!"(i1.i1.i2...202
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-07 finished in 516449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 1217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1217 transition count 2700
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1196 transition count 2700
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 1196 transition count 2684
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 74 place count 1180 transition count 2684
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 1172 transition count 2651
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 1172 transition count 2651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 90 place count 1172 transition count 2650
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 1171 transition count 2650
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 1168 transition count 2637
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 1168 transition count 2637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 1167 transition count 2631
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 1167 transition count 2631
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 154 place count 1140 transition count 2604
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 158 place count 1136 transition count 2600
Iterating global reduction 2 with 4 rules applied. Total rules applied 162 place count 1136 transition count 2600
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 166 place count 1132 transition count 2576
Iterating global reduction 2 with 4 rules applied. Total rules applied 170 place count 1132 transition count 2576
Applied a total of 170 rules in 367 ms. Remains 1132 /1217 variables (removed 85) and now considering 2576/2721 (removed 145) transitions.
[2024-05-24 17:35:00] [INFO ] Flow matrix only has 2304 transitions (discarded 272 similar events)
// Phase 1: matrix 2304 rows 1132 cols
[2024-05-24 17:35:00] [INFO ] Computed 55 invariants in 33 ms
[2024-05-24 17:35:01] [INFO ] Implicit Places using invariants in 1050 ms returned [93, 265, 319, 521, 599, 600, 612, 826]
[2024-05-24 17:35:01] [INFO ] Actually due to overlaps returned [612, 93, 265, 319, 521, 599, 600]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1052 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1125/1217 places, 2576/2721 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1123 transition count 2574
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1123 transition count 2574
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1121 transition count 2572
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1121 transition count 2572
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1119 transition count 2560
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1119 transition count 2560
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 1115 transition count 2556
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1111 transition count 2552
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1111 transition count 2552
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 1108 transition count 2534
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 1108 transition count 2534
Applied a total of 34 rules in 297 ms. Remains 1108 /1125 variables (removed 17) and now considering 2534/2576 (removed 42) transitions.
[2024-05-24 17:35:01] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1108 cols
[2024-05-24 17:35:01] [INFO ] Computed 48 invariants in 31 ms
[2024-05-24 17:35:02] [INFO ] Implicit Places using invariants in 978 ms returned [808]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 979 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1217 places, 2534/2721 transitions.
Applied a total of 0 rules in 66 ms. Remains 1107 /1107 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2761 ms. Remains : 1107/1217 places, 2534/2721 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-09 finished in 2885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1217 transition count 2698
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1194 transition count 2698
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 46 place count 1194 transition count 2682
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 78 place count 1178 transition count 2682
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 86 place count 1170 transition count 2649
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 1170 transition count 2649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 94 place count 1170 transition count 2648
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 1169 transition count 2648
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 1166 transition count 2635
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 1166 transition count 2635
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1165 transition count 2629
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1165 transition count 2629
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 158 place count 1138 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 164 place count 1132 transition count 2596
Iterating global reduction 2 with 6 rules applied. Total rules applied 170 place count 1132 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 176 place count 1126 transition count 2560
Iterating global reduction 2 with 6 rules applied. Total rules applied 182 place count 1126 transition count 2560
Applied a total of 182 rules in 355 ms. Remains 1126 /1217 variables (removed 91) and now considering 2560/2721 (removed 161) transitions.
[2024-05-24 17:35:02] [INFO ] Flow matrix only has 2288 transitions (discarded 272 similar events)
// Phase 1: matrix 2288 rows 1126 cols
[2024-05-24 17:35:03] [INFO ] Computed 55 invariants in 31 ms
[2024-05-24 17:35:03] [INFO ] Implicit Places using invariants in 990 ms returned [93, 265, 319, 521, 599, 600, 612, 620, 735, 820]
[2024-05-24 17:35:03] [INFO ] Actually due to overlaps returned [612, 93, 265, 319, 521, 599, 600, 620, 735]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 991 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1117/1217 places, 2560/2721 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1114 transition count 2557
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1114 transition count 2557
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1111 transition count 2554
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1111 transition count 2554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1109 transition count 2542
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1109 transition count 2542
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 1104 transition count 2537
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 1099 transition count 2532
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 1099 transition count 2532
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1094 transition count 2502
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1094 transition count 2502
Applied a total of 46 rules in 315 ms. Remains 1094 /1117 variables (removed 23) and now considering 2502/2560 (removed 58) transitions.
[2024-05-24 17:35:04] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1094 cols
[2024-05-24 17:35:04] [INFO ] Computed 46 invariants in 22 ms
[2024-05-24 17:35:05] [INFO ] Implicit Places using invariants in 925 ms returned [796]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 927 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1093/1217 places, 2502/2721 transitions.
Applied a total of 0 rules in 66 ms. Remains 1093 /1093 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2656 ms. Remains : 1093/1217 places, 2502/2721 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-10 finished in 2818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(!p0)))||G(p1)))'
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1203 transition count 2682
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1203 transition count 2682
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 1195 transition count 2669
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 1195 transition count 2669
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1188 transition count 2627
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1188 transition count 2627
Applied a total of 58 rules in 161 ms. Remains 1188 /1217 variables (removed 29) and now considering 2627/2721 (removed 94) transitions.
[2024-05-24 17:35:05] [INFO ] Flow matrix only has 2355 transitions (discarded 272 similar events)
// Phase 1: matrix 2355 rows 1188 cols
[2024-05-24 17:35:05] [INFO ] Computed 55 invariants in 27 ms
[2024-05-24 17:35:06] [INFO ] Implicit Places using invariants in 1024 ms returned [104, 293, 347, 556, 639, 640, 654, 663, 781, 868]
[2024-05-24 17:35:06] [INFO ] Actually due to overlaps returned [654, 104, 293, 347, 556, 639, 640, 663, 781]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1025 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1179/1217 places, 2627/2721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1171 transition count 2619
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1171 transition count 2619
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1163 transition count 2611
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1163 transition count 2611
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1155 transition count 2603
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1155 transition count 2603
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 1148 transition count 2561
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 1148 transition count 2561
Applied a total of 62 rules in 196 ms. Remains 1148 /1179 variables (removed 31) and now considering 2561/2627 (removed 66) transitions.
[2024-05-24 17:35:06] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1148 cols
[2024-05-24 17:35:06] [INFO ] Computed 46 invariants in 29 ms
[2024-05-24 17:35:07] [INFO ] Implicit Places using invariants in 970 ms returned [836]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 972 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1217 places, 2561/2721 transitions.
Applied a total of 0 rules in 37 ms. Remains 1147 /1147 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2391 ms. Remains : 1147/1217 places, 2561/2721 transitions.
Stuttering acceptance computed with spot in 255 ms :[p0, (NOT p1), (AND p0 (NOT p1)), true, true, (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-12
Product exploration explored 100000 steps with 1605 reset in 491 ms.
Product exploration explored 100000 steps with 1607 reset in 527 ms.
Computed a total of 315 stabilizing places and 928 stable transitions
Computed a total of 315 stabilizing places and 928 stable transitions
Detected a total of 315/1147 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 132 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (640 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (172 resets) in 130 ms. (305 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (172 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
[2024-05-24 17:35:09] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2024-05-24 17:35:09] [INFO ] Computed 45 invariants in 19 ms
[2024-05-24 17:35:09] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 332 places in 463 ms of which 8 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 280 places in 499 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1078 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 34/1112 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/1140 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1140 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/1147 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1147 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2289/3436 variables, 1147/1194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3436 variables, 833/2027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3436 variables, 0/2027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3436 variables, 0/2027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 2027 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1147/1147 constraints, ReadFeed: 833/833 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1078 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:12] [INFO ] Deduced a trap composed of 175 places in 484 ms of which 7 ms to minimize.
[2024-05-24 17:35:12] [INFO ] Deduced a trap composed of 247 places in 458 ms of which 6 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 340 places in 478 ms of which 7 ms to minimize.
[2024-05-24 17:35:13] [INFO ] Deduced a trap composed of 161 places in 473 ms of which 7 ms to minimize.
[2024-05-24 17:35:14] [INFO ] Deduced a trap composed of 352 places in 462 ms of which 6 ms to minimize.
[2024-05-24 17:35:14] [INFO ] Deduced a trap composed of 187 places in 456 ms of which 7 ms to minimize.
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 302 places in 480 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/1112 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:15] [INFO ] Deduced a trap composed of 50 places in 467 ms of which 7 ms to minimize.
[2024-05-24 17:35:16] [INFO ] Deduced a trap composed of 98 places in 505 ms of which 7 ms to minimize.
[2024-05-24 17:35:16] [INFO ] Deduced a trap composed of 224 places in 467 ms of which 8 ms to minimize.
SMT process timed out in 7315ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1147 transition count 2537
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1123 transition count 2537
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 1123 transition count 2525
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 1111 transition count 2525
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 104 place count 1095 transition count 2509
Free-agglomeration rule (complex) applied 122 times.
Iterating global reduction 2 with 122 rules applied. Total rules applied 226 place count 1095 transition count 3062
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 348 place count 973 transition count 3062
Applied a total of 348 rules in 232 ms. Remains 973 /1147 variables (removed 174) and now considering 3062/2561 (removed -501) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 973/1147 places, 3062/2561 transitions.
RANDOM walk for 40000 steps (1040 resets) in 1154 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (140 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 74438 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 74438 steps, saw 31159 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 17:35:20] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
// Phase 1: matrix 2672 rows 973 cols
[2024-05-24 17:35:20] [INFO ] Computed 45 invariants in 40 ms
[2024-05-24 17:35:20] [INFO ] State equation strengthened by 1508 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 900/904 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 124 places in 463 ms of which 5 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 74 places in 462 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/904 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/904 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 34/938 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:22] [INFO ] Deduced a trap composed of 5 places in 482 ms of which 6 ms to minimize.
[2024-05-24 17:35:22] [INFO ] Deduced a trap composed of 46 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:35:23] [INFO ] Deduced a trap composed of 73 places in 489 ms of which 6 ms to minimize.
[2024-05-24 17:35:23] [INFO ] Deduced a trap composed of 71 places in 499 ms of which 5 ms to minimize.
[2024-05-24 17:35:24] [INFO ] Deduced a trap composed of 75 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:35:24] [INFO ] Deduced a trap composed of 88 places in 466 ms of which 5 ms to minimize.
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 82 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 80 places in 473 ms of which 6 ms to minimize.
[2024-05-24 17:35:26] [INFO ] Deduced a trap composed of 75 places in 467 ms of which 6 ms to minimize.
[2024-05-24 17:35:26] [INFO ] Deduced a trap composed of 68 places in 454 ms of which 6 ms to minimize.
[2024-05-24 17:35:27] [INFO ] Deduced a trap composed of 80 places in 480 ms of which 6 ms to minimize.
[2024-05-24 17:35:27] [INFO ] Deduced a trap composed of 74 places in 463 ms of which 6 ms to minimize.
[2024-05-24 17:35:28] [INFO ] Deduced a trap composed of 140 places in 405 ms of which 6 ms to minimize.
[2024-05-24 17:35:28] [INFO ] Deduced a trap composed of 79 places in 458 ms of which 6 ms to minimize.
[2024-05-24 17:35:29] [INFO ] Deduced a trap composed of 80 places in 453 ms of which 6 ms to minimize.
[2024-05-24 17:35:29] [INFO ] Deduced a trap composed of 142 places in 387 ms of which 6 ms to minimize.
[2024-05-24 17:35:30] [INFO ] Deduced a trap composed of 82 places in 453 ms of which 5 ms to minimize.
[2024-05-24 17:35:30] [INFO ] Deduced a trap composed of 78 places in 449 ms of which 6 ms to minimize.
[2024-05-24 17:35:30] [INFO ] Deduced a trap composed of 141 places in 386 ms of which 6 ms to minimize.
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 80 places in 460 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/938 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/966 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/966 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/973 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/973 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2672/3645 variables, 973/1040 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3645 variables, 1508/2548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3645 variables, 0/2548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3645 variables, 0/2548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3645/3645 variables, and 2548 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11891 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 973/973 constraints, ReadFeed: 1508/1508 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 900/904 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/904 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 74 places in 429 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/904 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/938 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 27 places in 399 ms of which 6 ms to minimize.
[2024-05-24 17:35:34] [INFO ] Deduced a trap composed of 46 places in 379 ms of which 6 ms to minimize.
[2024-05-24 17:35:34] [INFO ] Deduced a trap composed of 139 places in 404 ms of which 6 ms to minimize.
[2024-05-24 17:35:34] [INFO ] Deduced a trap composed of 158 places in 398 ms of which 5 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 149 places in 409 ms of which 6 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 142 places in 399 ms of which 6 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 152 places in 401 ms of which 6 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 132 places in 395 ms of which 5 ms to minimize.
[2024-05-24 17:35:36] [INFO ] Deduced a trap composed of 142 places in 386 ms of which 5 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 137 places in 404 ms of which 5 ms to minimize.
[2024-05-24 17:35:37] [INFO ] Deduced a trap composed of 138 places in 375 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/938 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/938 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/966 variables, 28/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 168 places in 418 ms of which 7 ms to minimize.
[2024-05-24 17:35:38] [INFO ] Deduced a trap composed of 72 places in 472 ms of which 6 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 73 places in 474 ms of which 6 ms to minimize.
[2024-05-24 17:35:39] [INFO ] Deduced a trap composed of 85 places in 440 ms of which 5 ms to minimize.
[2024-05-24 17:35:40] [INFO ] Deduced a trap composed of 94 places in 462 ms of which 6 ms to minimize.
[2024-05-24 17:35:40] [INFO ] Deduced a trap composed of 64 places in 469 ms of which 6 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 54 places in 470 ms of which 6 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 72 places in 470 ms of which 6 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 79 places in 470 ms of which 7 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 86 places in 454 ms of which 5 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 82 places in 457 ms of which 6 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 161 places in 428 ms of which 5 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 154 places in 448 ms of which 5 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 83 places in 471 ms of which 5 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 67 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 87 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:35:45] [INFO ] Deduced a trap composed of 72 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:35:46] [INFO ] Deduced a trap composed of 67 places in 458 ms of which 6 ms to minimize.
[2024-05-24 17:35:46] [INFO ] Deduced a trap composed of 96 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:35:47] [INFO ] Deduced a trap composed of 81 places in 456 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:47] [INFO ] Deduced a trap composed of 150 places in 407 ms of which 6 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 117 places in 449 ms of which 5 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 158 places in 419 ms of which 5 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 90 places in 466 ms of which 6 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 77 places in 456 ms of which 5 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 73 places in 469 ms of which 5 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 61 places in 467 ms of which 6 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 81 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 88 places in 456 ms of which 5 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 67 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 75 places in 468 ms of which 6 ms to minimize.
[2024-05-24 17:35:53] [INFO ] Deduced a trap composed of 73 places in 475 ms of which 6 ms to minimize.
[2024-05-24 17:35:53] [INFO ] Deduced a trap composed of 80 places in 449 ms of which 6 ms to minimize.
[2024-05-24 17:35:53] [INFO ] Deduced a trap composed of 65 places in 455 ms of which 5 ms to minimize.
[2024-05-24 17:35:54] [INFO ] Deduced a trap composed of 93 places in 457 ms of which 5 ms to minimize.
[2024-05-24 17:35:54] [INFO ] Deduced a trap composed of 78 places in 456 ms of which 6 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 88 places in 459 ms of which 6 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 78 places in 450 ms of which 6 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 65 places in 478 ms of which 6 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 96 places in 467 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:35:57] [INFO ] Deduced a trap composed of 86 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:35:57] [INFO ] Deduced a trap composed of 149 places in 395 ms of which 6 ms to minimize.
[2024-05-24 17:35:58] [INFO ] Deduced a trap composed of 151 places in 422 ms of which 6 ms to minimize.
[2024-05-24 17:35:58] [INFO ] Deduced a trap composed of 148 places in 388 ms of which 6 ms to minimize.
[2024-05-24 17:35:59] [INFO ] Deduced a trap composed of 153 places in 376 ms of which 6 ms to minimize.
[2024-05-24 17:35:59] [INFO ] Deduced a trap composed of 85 places in 449 ms of which 5 ms to minimize.
[2024-05-24 17:36:00] [INFO ] Deduced a trap composed of 61 places in 433 ms of which 6 ms to minimize.
[2024-05-24 17:36:00] [INFO ] Deduced a trap composed of 155 places in 408 ms of which 5 ms to minimize.
[2024-05-24 17:36:00] [INFO ] Deduced a trap composed of 155 places in 381 ms of which 6 ms to minimize.
[2024-05-24 17:36:01] [INFO ] Deduced a trap composed of 72 places in 476 ms of which 6 ms to minimize.
[2024-05-24 17:36:01] [INFO ] Deduced a trap composed of 85 places in 446 ms of which 5 ms to minimize.
[2024-05-24 17:36:02] [INFO ] Deduced a trap composed of 95 places in 450 ms of which 6 ms to minimize.
[2024-05-24 17:36:02] [INFO ] Deduced a trap composed of 154 places in 390 ms of which 5 ms to minimize.
[2024-05-24 17:36:03] [INFO ] Deduced a trap composed of 149 places in 392 ms of which 6 ms to minimize.
[2024-05-24 17:36:03] [INFO ] Deduced a trap composed of 82 places in 464 ms of which 6 ms to minimize.
[2024-05-24 17:36:04] [INFO ] Deduced a trap composed of 65 places in 467 ms of which 6 ms to minimize.
[2024-05-24 17:36:04] [INFO ] Deduced a trap composed of 61 places in 444 ms of which 6 ms to minimize.
[2024-05-24 17:36:05] [INFO ] Deduced a trap composed of 61 places in 457 ms of which 6 ms to minimize.
[2024-05-24 17:36:05] [INFO ] Deduced a trap composed of 150 places in 455 ms of which 6 ms to minimize.
[2024-05-24 17:36:06] [INFO ] Deduced a trap composed of 86 places in 450 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:36:07] [INFO ] Deduced a trap composed of 75 places in 449 ms of which 6 ms to minimize.
[2024-05-24 17:36:07] [INFO ] Deduced a trap composed of 62 places in 464 ms of which 6 ms to minimize.
[2024-05-24 17:36:08] [INFO ] Deduced a trap composed of 58 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:36:08] [INFO ] Deduced a trap composed of 73 places in 446 ms of which 6 ms to minimize.
[2024-05-24 17:36:09] [INFO ] Deduced a trap composed of 69 places in 455 ms of which 6 ms to minimize.
[2024-05-24 17:36:09] [INFO ] Deduced a trap composed of 123 places in 404 ms of which 6 ms to minimize.
[2024-05-24 17:36:10] [INFO ] Deduced a trap composed of 46 places in 441 ms of which 5 ms to minimize.
[2024-05-24 17:36:10] [INFO ] Deduced a trap composed of 72 places in 459 ms of which 5 ms to minimize.
[2024-05-24 17:36:11] [INFO ] Deduced a trap composed of 75 places in 468 ms of which 6 ms to minimize.
[2024-05-24 17:36:11] [INFO ] Deduced a trap composed of 141 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:36:12] [INFO ] Deduced a trap composed of 90 places in 456 ms of which 6 ms to minimize.
[2024-05-24 17:36:12] [INFO ] Deduced a trap composed of 155 places in 395 ms of which 6 ms to minimize.
[2024-05-24 17:36:13] [INFO ] Deduced a trap composed of 91 places in 442 ms of which 6 ms to minimize.
[2024-05-24 17:36:13] [INFO ] Deduced a trap composed of 133 places in 388 ms of which 6 ms to minimize.
[2024-05-24 17:36:13] [INFO ] Deduced a trap composed of 138 places in 396 ms of which 6 ms to minimize.
[2024-05-24 17:36:14] [INFO ] Deduced a trap composed of 57 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:36:15] [INFO ] Deduced a trap composed of 79 places in 453 ms of which 6 ms to minimize.
[2024-05-24 17:36:15] [INFO ] Deduced a trap composed of 91 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:36:15] [INFO ] Deduced a trap composed of 92 places in 432 ms of which 6 ms to minimize.
[2024-05-24 17:36:16] [INFO ] Deduced a trap composed of 88 places in 384 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/966 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:36:16] [INFO ] Deduced a trap composed of 85 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:36:17] [INFO ] Deduced a trap composed of 136 places in 392 ms of which 5 ms to minimize.
[2024-05-24 17:36:17] [INFO ] Deduced a trap composed of 139 places in 381 ms of which 6 ms to minimize.
SMT process timed out in 57041ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 973 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 3062/3062 transitions.
Applied a total of 0 rules in 73 ms. Remains 973 /973 variables (removed 0) and now considering 3062/3062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 973/973 places, 3062/3062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 973/973 places, 3062/3062 transitions.
Applied a total of 0 rules in 70 ms. Remains 973 /973 variables (removed 0) and now considering 3062/3062 (removed 0) transitions.
[2024-05-24 17:36:17] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2024-05-24 17:36:17] [INFO ] Invariant cache hit.
[2024-05-24 17:36:18] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2024-05-24 17:36:18] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2024-05-24 17:36:18] [INFO ] Invariant cache hit.
[2024-05-24 17:36:19] [INFO ] State equation strengthened by 1508 read => feed constraints.
[2024-05-24 17:36:39] [INFO ] Implicit Places using invariants and state equation in 20475 ms returned []
Implicit Place search using SMT with State Equation took 21484 ms to find 0 implicit places.
[2024-05-24 17:36:39] [INFO ] Redundant transitions in 99 ms returned []
Running 3000 sub problems to find dead transitions.
[2024-05-24 17:36:39] [INFO ] Flow matrix only has 2672 transitions (discarded 390 similar events)
[2024-05-24 17:36:39] [INFO ] Invariant cache hit.
[2024-05-24 17:36:39] [INFO ] State equation strengthened by 1508 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/971 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3000 unsolved
SMT process timed out in 47377ms, After SMT, problems are : Problem set: 0 solved, 3000 unsolved
Search for dead transitions found 0 dead transitions in 47404ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69070 ms. Remains : 973/973 places, 3062/3062 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 227 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Applied a total of 0 rules in 42 ms. Remains 1147 /1147 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2024-05-24 17:37:27] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2024-05-24 17:37:27] [INFO ] Computed 45 invariants in 27 ms
[2024-05-24 17:37:28] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-24 17:37:28] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-24 17:37:28] [INFO ] Invariant cache hit.
[2024-05-24 17:37:29] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:37:38] [INFO ] Implicit Places using invariants and state equation in 10251 ms returned [1132]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1146/1147 places, 2561/2561 transitions.
Applied a total of 0 rules in 38 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11261 ms. Remains : 1146/1147 places, 2561/2561 transitions.
Computed a total of 314 stabilizing places and 928 stable transitions
Computed a total of 314 stabilizing places and 928 stable transitions
Detected a total of 314/1146 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (640 resets) in 897 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (172 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 297 ms. (134 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 69059 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 4
Probabilistic random walk after 69059 steps, saw 29629 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 17:37:42] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2024-05-24 17:37:42] [INFO ] Computed 44 invariants in 19 ms
[2024-05-24 17:37:42] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1074/1078 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:37:43] [INFO ] Deduced a trap composed of 206 places in 466 ms of which 7 ms to minimize.
[2024-05-24 17:37:43] [INFO ] Deduced a trap composed of 434 places in 446 ms of which 7 ms to minimize.
[2024-05-24 17:37:44] [INFO ] Deduced a trap composed of 201 places in 461 ms of which 7 ms to minimize.
[2024-05-24 17:37:44] [INFO ] Deduced a trap composed of 251 places in 466 ms of which 7 ms to minimize.
[2024-05-24 17:37:45] [INFO ] Deduced a trap composed of 255 places in 458 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1078 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/1112 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:37:45] [INFO ] Deduced a trap composed of 50 places in 442 ms of which 7 ms to minimize.
[2024-05-24 17:37:46] [INFO ] Deduced a trap composed of 164 places in 420 ms of which 6 ms to minimize.
[2024-05-24 17:37:46] [INFO ] Deduced a trap composed of 159 places in 454 ms of which 6 ms to minimize.
[2024-05-24 17:37:47] [INFO ] Deduced a trap composed of 167 places in 448 ms of which 7 ms to minimize.
[2024-05-24 17:37:47] [INFO ] Deduced a trap composed of 161 places in 431 ms of which 6 ms to minimize.
SMT process timed out in 5110ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2536
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1121 transition count 2536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 50 place count 1121 transition count 2524
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 1109 transition count 2524
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 106 place count 1093 transition count 2508
Free-agglomeration rule (complex) applied 122 times.
Iterating global reduction 2 with 122 rules applied. Total rules applied 228 place count 1093 transition count 3061
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 350 place count 971 transition count 3061
Applied a total of 350 rules in 221 ms. Remains 971 /1146 variables (removed 175) and now considering 3061/2561 (removed -500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 971/1146 places, 3061/2561 transitions.
RANDOM walk for 40000 steps (1040 resets) in 1874 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (138 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (140 resets) in 289 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (138 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 66283 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 4
Probabilistic random walk after 66283 steps, saw 27803 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 17:37:51] [INFO ] Flow matrix only has 2671 transitions (discarded 390 similar events)
// Phase 1: matrix 2671 rows 971 cols
[2024-05-24 17:37:51] [INFO ] Computed 44 invariants in 43 ms
[2024-05-24 17:37:51] [INFO ] State equation strengthened by 1508 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 899/903 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:37:52] [INFO ] Deduced a trap composed of 73 places in 474 ms of which 5 ms to minimize.
[2024-05-24 17:37:52] [INFO ] Deduced a trap composed of 180 places in 423 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/903 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/937 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/937 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/965 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/965 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/971 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2671/3642 variables, 971/1017 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3642 variables, 1508/2525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3642 variables, 0/2525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/3642 variables, 0/2525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3642/3642 variables, and 2525 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2649 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 971/971 constraints, ReadFeed: 1508/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 899/903 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/903 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/937 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:37:55] [INFO ] Deduced a trap composed of 5 places in 427 ms of which 5 ms to minimize.
[2024-05-24 17:37:55] [INFO ] Deduced a trap composed of 27 places in 392 ms of which 6 ms to minimize.
[2024-05-24 17:37:56] [INFO ] Deduced a trap composed of 27 places in 428 ms of which 6 ms to minimize.
[2024-05-24 17:37:56] [INFO ] Deduced a trap composed of 57 places in 425 ms of which 6 ms to minimize.
[2024-05-24 17:37:56] [INFO ] Deduced a trap composed of 151 places in 384 ms of which 6 ms to minimize.
[2024-05-24 17:37:57] [INFO ] Deduced a trap composed of 46 places in 411 ms of which 6 ms to minimize.
[2024-05-24 17:37:57] [INFO ] Deduced a trap composed of 135 places in 419 ms of which 6 ms to minimize.
[2024-05-24 17:37:58] [INFO ] Deduced a trap composed of 138 places in 416 ms of which 6 ms to minimize.
[2024-05-24 17:37:58] [INFO ] Deduced a trap composed of 131 places in 416 ms of which 6 ms to minimize.
[2024-05-24 17:37:59] [INFO ] Deduced a trap composed of 136 places in 407 ms of which 6 ms to minimize.
[2024-05-24 17:37:59] [INFO ] Deduced a trap composed of 167 places in 424 ms of which 5 ms to minimize.
[2024-05-24 17:37:59] [INFO ] Deduced a trap composed of 158 places in 388 ms of which 5 ms to minimize.
[2024-05-24 17:38:00] [INFO ] Deduced a trap composed of 151 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:38:00] [INFO ] Deduced a trap composed of 176 places in 411 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/937 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/965 variables, 28/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:38:01] [INFO ] Deduced a trap composed of 163 places in 449 ms of which 6 ms to minimize.
[2024-05-24 17:38:01] [INFO ] Deduced a trap composed of 76 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:38:02] [INFO ] Deduced a trap composed of 66 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:38:02] [INFO ] Deduced a trap composed of 75 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:38:03] [INFO ] Deduced a trap composed of 79 places in 488 ms of which 6 ms to minimize.
[2024-05-24 17:38:03] [INFO ] Deduced a trap composed of 77 places in 495 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/965 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:38:04] [INFO ] Deduced a trap composed of 65 places in 484 ms of which 6 ms to minimize.
[2024-05-24 17:38:05] [INFO ] Deduced a trap composed of 88 places in 493 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/965 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/965 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/971 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/971 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2671/3642 variables, 971/1039 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3642 variables, 1508/2547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3642 variables, 4/2551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:38:07] [INFO ] Deduced a trap composed of 160 places in 445 ms of which 6 ms to minimize.
[2024-05-24 17:38:08] [INFO ] Deduced a trap composed of 165 places in 428 ms of which 5 ms to minimize.
[2024-05-24 17:38:09] [INFO ] Deduced a trap composed of 180 places in 422 ms of which 5 ms to minimize.
[2024-05-24 17:38:09] [INFO ] Deduced a trap composed of 132 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:38:11] [INFO ] Deduced a trap composed of 63 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:38:11] [INFO ] Deduced a trap composed of 178 places in 448 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3642 variables, 6/2557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:38:13] [INFO ] Deduced a trap composed of 72 places in 486 ms of which 6 ms to minimize.
[2024-05-24 17:38:13] [INFO ] Deduced a trap composed of 68 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:38:14] [INFO ] Deduced a trap composed of 181 places in 421 ms of which 6 ms to minimize.
[2024-05-24 17:38:15] [INFO ] Deduced a trap composed of 151 places in 452 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3642 variables, 4/2561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:38:17] [INFO ] Deduced a trap composed of 158 places in 444 ms of which 6 ms to minimize.
[2024-05-24 17:38:17] [INFO ] Deduced a trap composed of 178 places in 437 ms of which 6 ms to minimize.
[2024-05-24 17:38:18] [INFO ] Deduced a trap composed of 165 places in 435 ms of which 6 ms to minimize.
[2024-05-24 17:38:19] [INFO ] Deduced a trap composed of 181 places in 444 ms of which 6 ms to minimize.
[2024-05-24 17:38:19] [INFO ] Deduced a trap composed of 234 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:38:20] [INFO ] Deduced a trap composed of 171 places in 444 ms of which 6 ms to minimize.
[2024-05-24 17:38:20] [INFO ] Deduced a trap composed of 157 places in 476 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3642 variables, 7/2568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:38:22] [INFO ] Deduced a trap composed of 81 places in 486 ms of which 6 ms to minimize.
[2024-05-24 17:38:22] [INFO ] Deduced a trap composed of 65 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:38:23] [INFO ] Deduced a trap composed of 71 places in 499 ms of which 6 ms to minimize.
[2024-05-24 17:38:24] [INFO ] Deduced a trap composed of 178 places in 451 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3642 variables, 4/2572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:38:24] [INFO ] Deduced a trap composed of 79 places in 482 ms of which 5 ms to minimize.
[2024-05-24 17:38:25] [INFO ] Deduced a trap composed of 79 places in 504 ms of which 7 ms to minimize.
[2024-05-24 17:38:26] [INFO ] Deduced a trap composed of 74 places in 493 ms of which 7 ms to minimize.
[2024-05-24 17:38:26] [INFO ] Deduced a trap composed of 70 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:38:27] [INFO ] Deduced a trap composed of 79 places in 501 ms of which 19 ms to minimize.
[2024-05-24 17:38:28] [INFO ] Deduced a trap composed of 63 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:38:28] [INFO ] Deduced a trap composed of 72 places in 480 ms of which 6 ms to minimize.
[2024-05-24 17:38:29] [INFO ] Deduced a trap composed of 61 places in 487 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3642 variables, 8/2580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:38:32] [INFO ] Deduced a trap composed of 156 places in 408 ms of which 6 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3642 variables, 1/2581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3642 variables, 0/2581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/3642 variables, 0/2581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3642/3642 variables, and 2581 constraints, problems are : Problem set: 0 solved, 4 unsolved in 40804 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 971/971 constraints, ReadFeed: 1508/1508 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 54/54 constraints]
After SMT, in 43527ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 298 ms.
Support contains 4 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3061/3061 transitions.
Applied a total of 0 rules in 71 ms. Remains 971 /971 variables (removed 0) and now considering 3061/3061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 971/971 places, 3061/3061 transitions.
RANDOM walk for 40000 steps (1042 resets) in 1037 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (140 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (138 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 70696 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 70696 steps, saw 29617 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 17:38:39] [INFO ] Flow matrix only has 2671 transitions (discarded 390 similar events)
[2024-05-24 17:38:39] [INFO ] Invariant cache hit.
[2024-05-24 17:38:39] [INFO ] State equation strengthened by 1508 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 899/903 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:38:39] [INFO ] Deduced a trap composed of 73 places in 432 ms of which 5 ms to minimize.
[2024-05-24 17:38:40] [INFO ] Deduced a trap composed of 104 places in 423 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/903 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 34/937 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/937 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/965 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/965 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/971 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2671/3642 variables, 971/1017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3642 variables, 1508/2525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3642 variables, 0/2525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3642 variables, 0/2525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3642/3642 variables, and 2525 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 971/971 constraints, ReadFeed: 1508/1508 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 899/903 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:38:41] [INFO ] Deduced a trap composed of 123 places in 431 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/903 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/937 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:38:42] [INFO ] Deduced a trap composed of 5 places in 392 ms of which 6 ms to minimize.
[2024-05-24 17:38:42] [INFO ] Deduced a trap composed of 118 places in 392 ms of which 6 ms to minimize.
[2024-05-24 17:38:43] [INFO ] Deduced a trap composed of 27 places in 382 ms of which 6 ms to minimize.
[2024-05-24 17:38:43] [INFO ] Deduced a trap composed of 128 places in 388 ms of which 5 ms to minimize.
[2024-05-24 17:38:43] [INFO ] Deduced a trap composed of 155 places in 384 ms of which 5 ms to minimize.
[2024-05-24 17:38:44] [INFO ] Deduced a trap composed of 147 places in 388 ms of which 6 ms to minimize.
[2024-05-24 17:38:44] [INFO ] Deduced a trap composed of 118 places in 390 ms of which 6 ms to minimize.
[2024-05-24 17:38:45] [INFO ] Deduced a trap composed of 57 places in 395 ms of which 5 ms to minimize.
[2024-05-24 17:38:45] [INFO ] Deduced a trap composed of 139 places in 387 ms of which 5 ms to minimize.
[2024-05-24 17:38:45] [INFO ] Deduced a trap composed of 139 places in 390 ms of which 5 ms to minimize.
[2024-05-24 17:38:46] [INFO ] Deduced a trap composed of 144 places in 392 ms of which 5 ms to minimize.
[2024-05-24 17:38:46] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 6 ms to minimize.
[2024-05-24 17:38:47] [INFO ] Deduced a trap composed of 166 places in 382 ms of which 5 ms to minimize.
[2024-05-24 17:38:47] [INFO ] Deduced a trap composed of 149 places in 384 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/937 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/965 variables, 28/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:38:48] [INFO ] Deduced a trap composed of 151 places in 420 ms of which 6 ms to minimize.
[2024-05-24 17:38:48] [INFO ] Deduced a trap composed of 138 places in 393 ms of which 6 ms to minimize.
[2024-05-24 17:38:48] [INFO ] Deduced a trap composed of 190 places in 381 ms of which 6 ms to minimize.
[2024-05-24 17:38:49] [INFO ] Deduced a trap composed of 143 places in 390 ms of which 5 ms to minimize.
[2024-05-24 17:38:49] [INFO ] Deduced a trap composed of 146 places in 401 ms of which 6 ms to minimize.
[2024-05-24 17:38:50] [INFO ] Deduced a trap composed of 139 places in 390 ms of which 5 ms to minimize.
[2024-05-24 17:38:50] [INFO ] Deduced a trap composed of 144 places in 392 ms of which 5 ms to minimize.
[2024-05-24 17:38:50] [INFO ] Deduced a trap composed of 160 places in 397 ms of which 6 ms to minimize.
[2024-05-24 17:38:51] [INFO ] Deduced a trap composed of 135 places in 401 ms of which 6 ms to minimize.
[2024-05-24 17:38:51] [INFO ] Deduced a trap composed of 133 places in 386 ms of which 5 ms to minimize.
[2024-05-24 17:38:52] [INFO ] Deduced a trap composed of 173 places in 398 ms of which 6 ms to minimize.
[2024-05-24 17:38:52] [INFO ] Deduced a trap composed of 197 places in 404 ms of which 6 ms to minimize.
[2024-05-24 17:38:53] [INFO ] Deduced a trap composed of 184 places in 392 ms of which 5 ms to minimize.
[2024-05-24 17:38:53] [INFO ] Deduced a trap composed of 189 places in 389 ms of which 5 ms to minimize.
[2024-05-24 17:38:53] [INFO ] Deduced a trap composed of 143 places in 401 ms of which 5 ms to minimize.
[2024-05-24 17:38:54] [INFO ] Deduced a trap composed of 138 places in 427 ms of which 6 ms to minimize.
[2024-05-24 17:38:54] [INFO ] Deduced a trap composed of 146 places in 383 ms of which 6 ms to minimize.
[2024-05-24 17:38:55] [INFO ] Deduced a trap composed of 138 places in 411 ms of which 5 ms to minimize.
[2024-05-24 17:38:55] [INFO ] Deduced a trap composed of 147 places in 397 ms of which 5 ms to minimize.
[2024-05-24 17:38:56] [INFO ] Deduced a trap composed of 159 places in 400 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/965 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:38:56] [INFO ] Deduced a trap composed of 144 places in 384 ms of which 6 ms to minimize.
[2024-05-24 17:38:56] [INFO ] Deduced a trap composed of 129 places in 386 ms of which 6 ms to minimize.
[2024-05-24 17:38:57] [INFO ] Deduced a trap composed of 157 places in 384 ms of which 6 ms to minimize.
[2024-05-24 17:38:57] [INFO ] Deduced a trap composed of 145 places in 385 ms of which 6 ms to minimize.
[2024-05-24 17:38:58] [INFO ] Deduced a trap composed of 144 places in 387 ms of which 6 ms to minimize.
[2024-05-24 17:38:58] [INFO ] Deduced a trap composed of 144 places in 408 ms of which 5 ms to minimize.
[2024-05-24 17:38:58] [INFO ] Deduced a trap composed of 172 places in 393 ms of which 5 ms to minimize.
[2024-05-24 17:38:59] [INFO ] Deduced a trap composed of 144 places in 407 ms of which 6 ms to minimize.
[2024-05-24 17:38:59] [INFO ] Deduced a trap composed of 144 places in 388 ms of which 6 ms to minimize.
[2024-05-24 17:39:00] [INFO ] Deduced a trap composed of 150 places in 397 ms of which 5 ms to minimize.
[2024-05-24 17:39:00] [INFO ] Deduced a trap composed of 143 places in 387 ms of which 6 ms to minimize.
[2024-05-24 17:39:01] [INFO ] Deduced a trap composed of 143 places in 386 ms of which 5 ms to minimize.
[2024-05-24 17:39:01] [INFO ] Deduced a trap composed of 159 places in 396 ms of which 5 ms to minimize.
[2024-05-24 17:39:01] [INFO ] Deduced a trap composed of 158 places in 392 ms of which 6 ms to minimize.
[2024-05-24 17:39:02] [INFO ] Deduced a trap composed of 178 places in 386 ms of which 6 ms to minimize.
[2024-05-24 17:39:02] [INFO ] Deduced a trap composed of 173 places in 402 ms of which 5 ms to minimize.
[2024-05-24 17:39:03] [INFO ] Deduced a trap composed of 186 places in 391 ms of which 6 ms to minimize.
[2024-05-24 17:39:03] [INFO ] Deduced a trap composed of 161 places in 423 ms of which 6 ms to minimize.
[2024-05-24 17:39:04] [INFO ] Deduced a trap composed of 143 places in 385 ms of which 6 ms to minimize.
[2024-05-24 17:39:04] [INFO ] Deduced a trap composed of 146 places in 389 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/965 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:39:04] [INFO ] Deduced a trap composed of 150 places in 398 ms of which 5 ms to minimize.
[2024-05-24 17:39:05] [INFO ] Deduced a trap composed of 147 places in 395 ms of which 5 ms to minimize.
[2024-05-24 17:39:06] [INFO ] Deduced a trap composed of 131 places in 398 ms of which 5 ms to minimize.
[2024-05-24 17:39:06] [INFO ] Deduced a trap composed of 128 places in 388 ms of which 6 ms to minimize.
[2024-05-24 17:39:06] [INFO ] Deduced a trap composed of 135 places in 401 ms of which 5 ms to minimize.
[2024-05-24 17:39:07] [INFO ] Deduced a trap composed of 128 places in 416 ms of which 5 ms to minimize.
[2024-05-24 17:39:07] [INFO ] Deduced a trap composed of 144 places in 400 ms of which 5 ms to minimize.
[2024-05-24 17:39:08] [INFO ] Deduced a trap composed of 129 places in 400 ms of which 5 ms to minimize.
[2024-05-24 17:39:08] [INFO ] Deduced a trap composed of 132 places in 391 ms of which 5 ms to minimize.
[2024-05-24 17:39:09] [INFO ] Deduced a trap composed of 131 places in 381 ms of which 6 ms to minimize.
[2024-05-24 17:39:09] [INFO ] Deduced a trap composed of 131 places in 394 ms of which 5 ms to minimize.
[2024-05-24 17:39:09] [INFO ] Deduced a trap composed of 134 places in 395 ms of which 5 ms to minimize.
[2024-05-24 17:39:10] [INFO ] Deduced a trap composed of 145 places in 385 ms of which 6 ms to minimize.
[2024-05-24 17:39:10] [INFO ] Deduced a trap composed of 135 places in 366 ms of which 5 ms to minimize.
[2024-05-24 17:39:11] [INFO ] Deduced a trap composed of 156 places in 417 ms of which 6 ms to minimize.
[2024-05-24 17:39:11] [INFO ] Deduced a trap composed of 157 places in 407 ms of which 5 ms to minimize.
[2024-05-24 17:39:11] [INFO ] Deduced a trap composed of 129 places in 399 ms of which 5 ms to minimize.
[2024-05-24 17:39:12] [INFO ] Deduced a trap composed of 155 places in 375 ms of which 5 ms to minimize.
[2024-05-24 17:39:12] [INFO ] Deduced a trap composed of 135 places in 381 ms of which 5 ms to minimize.
[2024-05-24 17:39:13] [INFO ] Deduced a trap composed of 130 places in 382 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/965 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:39:13] [INFO ] Deduced a trap composed of 137 places in 388 ms of which 6 ms to minimize.
[2024-05-24 17:39:13] [INFO ] Deduced a trap composed of 136 places in 390 ms of which 6 ms to minimize.
[2024-05-24 17:39:14] [INFO ] Deduced a trap composed of 130 places in 388 ms of which 5 ms to minimize.
[2024-05-24 17:39:14] [INFO ] Deduced a trap composed of 213 places in 401 ms of which 7 ms to minimize.
[2024-05-24 17:39:15] [INFO ] Deduced a trap composed of 233 places in 396 ms of which 5 ms to minimize.
[2024-05-24 17:39:15] [INFO ] Deduced a trap composed of 147 places in 401 ms of which 5 ms to minimize.
[2024-05-24 17:39:16] [INFO ] Deduced a trap composed of 144 places in 393 ms of which 5 ms to minimize.
[2024-05-24 17:39:16] [INFO ] Deduced a trap composed of 147 places in 399 ms of which 5 ms to minimize.
[2024-05-24 17:39:16] [INFO ] Deduced a trap composed of 144 places in 409 ms of which 5 ms to minimize.
[2024-05-24 17:39:17] [INFO ] Deduced a trap composed of 145 places in 410 ms of which 5 ms to minimize.
[2024-05-24 17:39:17] [INFO ] Deduced a trap composed of 150 places in 384 ms of which 5 ms to minimize.
[2024-05-24 17:39:18] [INFO ] Deduced a trap composed of 150 places in 398 ms of which 6 ms to minimize.
[2024-05-24 17:39:18] [INFO ] Deduced a trap composed of 162 places in 396 ms of which 5 ms to minimize.
[2024-05-24 17:39:19] [INFO ] Deduced a trap composed of 156 places in 393 ms of which 6 ms to minimize.
[2024-05-24 17:39:19] [INFO ] Deduced a trap composed of 173 places in 393 ms of which 6 ms to minimize.
[2024-05-24 17:39:19] [INFO ] Deduced a trap composed of 166 places in 376 ms of which 5 ms to minimize.
[2024-05-24 17:39:20] [INFO ] Deduced a trap composed of 164 places in 398 ms of which 5 ms to minimize.
[2024-05-24 17:39:20] [INFO ] Deduced a trap composed of 159 places in 388 ms of which 5 ms to minimize.
[2024-05-24 17:39:21] [INFO ] Deduced a trap composed of 160 places in 388 ms of which 6 ms to minimize.
[2024-05-24 17:39:21] [INFO ] Deduced a trap composed of 187 places in 395 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/965 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:39:21] [INFO ] Deduced a trap composed of 179 places in 402 ms of which 6 ms to minimize.
[2024-05-24 17:39:22] [INFO ] Deduced a trap composed of 181 places in 386 ms of which 6 ms to minimize.
[2024-05-24 17:39:22] [INFO ] Deduced a trap composed of 189 places in 406 ms of which 6 ms to minimize.
[2024-05-24 17:39:23] [INFO ] Deduced a trap composed of 190 places in 388 ms of which 6 ms to minimize.
[2024-05-24 17:39:23] [INFO ] Deduced a trap composed of 182 places in 386 ms of which 5 ms to minimize.
[2024-05-24 17:39:24] [INFO ] Deduced a trap composed of 190 places in 388 ms of which 5 ms to minimize.
[2024-05-24 17:39:24] [INFO ] Deduced a trap composed of 182 places in 388 ms of which 5 ms to minimize.
[2024-05-24 17:39:24] [INFO ] Deduced a trap composed of 187 places in 401 ms of which 5 ms to minimize.
[2024-05-24 17:39:25] [INFO ] Deduced a trap composed of 183 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:39:25] [INFO ] Deduced a trap composed of 182 places in 400 ms of which 5 ms to minimize.
[2024-05-24 17:39:26] [INFO ] Deduced a trap composed of 191 places in 382 ms of which 6 ms to minimize.
[2024-05-24 17:39:26] [INFO ] Deduced a trap composed of 162 places in 392 ms of which 5 ms to minimize.
[2024-05-24 17:39:26] [INFO ] Deduced a trap composed of 160 places in 381 ms of which 6 ms to minimize.
[2024-05-24 17:39:27] [INFO ] Deduced a trap composed of 167 places in 388 ms of which 5 ms to minimize.
[2024-05-24 17:39:27] [INFO ] Deduced a trap composed of 168 places in 374 ms of which 5 ms to minimize.
[2024-05-24 17:39:28] [INFO ] Deduced a trap composed of 167 places in 395 ms of which 6 ms to minimize.
[2024-05-24 17:39:28] [INFO ] Deduced a trap composed of 171 places in 389 ms of which 5 ms to minimize.
[2024-05-24 17:39:28] [INFO ] Deduced a trap composed of 164 places in 396 ms of which 5 ms to minimize.
[2024-05-24 17:39:29] [INFO ] Deduced a trap composed of 163 places in 402 ms of which 5 ms to minimize.
[2024-05-24 17:39:29] [INFO ] Deduced a trap composed of 240 places in 402 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/965 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:39:30] [INFO ] Deduced a trap composed of 230 places in 407 ms of which 5 ms to minimize.
[2024-05-24 17:39:30] [INFO ] Deduced a trap composed of 235 places in 390 ms of which 5 ms to minimize.
[2024-05-24 17:39:31] [INFO ] Deduced a trap composed of 231 places in 389 ms of which 6 ms to minimize.
[2024-05-24 17:39:31] [INFO ] Deduced a trap composed of 204 places in 399 ms of which 6 ms to minimize.
[2024-05-24 17:39:31] [INFO ] Deduced a trap composed of 205 places in 395 ms of which 5 ms to minimize.
[2024-05-24 17:39:32] [INFO ] Deduced a trap composed of 186 places in 396 ms of which 6 ms to minimize.
[2024-05-24 17:39:32] [INFO ] Deduced a trap composed of 207 places in 404 ms of which 6 ms to minimize.
[2024-05-24 17:39:33] [INFO ] Deduced a trap composed of 205 places in 392 ms of which 6 ms to minimize.
[2024-05-24 17:39:33] [INFO ] Deduced a trap composed of 205 places in 442 ms of which 6 ms to minimize.
[2024-05-24 17:39:34] [INFO ] Deduced a trap composed of 224 places in 437 ms of which 7 ms to minimize.
[2024-05-24 17:39:34] [INFO ] Deduced a trap composed of 202 places in 442 ms of which 6 ms to minimize.
[2024-05-24 17:39:35] [INFO ] Deduced a trap composed of 204 places in 448 ms of which 7 ms to minimize.
[2024-05-24 17:39:35] [INFO ] Deduced a trap composed of 172 places in 419 ms of which 6 ms to minimize.
[2024-05-24 17:39:36] [INFO ] Deduced a trap composed of 151 places in 424 ms of which 5 ms to minimize.
[2024-05-24 17:39:37] [INFO ] Deduced a trap composed of 176 places in 418 ms of which 6 ms to minimize.
[2024-05-24 17:39:37] [INFO ] Deduced a trap composed of 166 places in 460 ms of which 6 ms to minimize.
[2024-05-24 17:39:37] [INFO ] Deduced a trap composed of 74 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:39:38] [INFO ] Deduced a trap composed of 83 places in 455 ms of which 5 ms to minimize.
[2024-05-24 17:39:38] [INFO ] Deduced a trap composed of 91 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:39:39] [INFO ] Deduced a trap composed of 72 places in 448 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/965 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:39:39] [INFO ] Deduced a trap composed of 78 places in 446 ms of which 6 ms to minimize.
[2024-05-24 17:39:40] [INFO ] Deduced a trap composed of 70 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:39:40] [INFO ] Deduced a trap composed of 77 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:39:41] [INFO ] Deduced a trap composed of 80 places in 442 ms of which 6 ms to minimize.
[2024-05-24 17:39:41] [INFO ] Deduced a trap composed of 83 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:39:42] [INFO ] Deduced a trap composed of 69 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:39:42] [INFO ] Deduced a trap composed of 100 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:39:43] [INFO ] Deduced a trap composed of 91 places in 489 ms of which 6 ms to minimize.
[2024-05-24 17:39:43] [INFO ] Deduced a trap composed of 194 places in 430 ms of which 6 ms to minimize.
[2024-05-24 17:39:44] [INFO ] Deduced a trap composed of 197 places in 471 ms of which 6 ms to minimize.
[2024-05-24 17:39:44] [INFO ] Deduced a trap composed of 81 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:39:45] [INFO ] Deduced a trap composed of 68 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:39:45] [INFO ] Deduced a trap composed of 195 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:39:46] [INFO ] Deduced a trap composed of 69 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:39:46] [INFO ] Deduced a trap composed of 62 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:39:47] [INFO ] Deduced a trap composed of 75 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:39:47] [INFO ] Deduced a trap composed of 98 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:39:48] [INFO ] Deduced a trap composed of 209 places in 428 ms of which 6 ms to minimize.
[2024-05-24 17:39:48] [INFO ] Deduced a trap composed of 192 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:39:49] [INFO ] Deduced a trap composed of 90 places in 515 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/965 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:39:50] [INFO ] Deduced a trap composed of 176 places in 419 ms of which 6 ms to minimize.
[2024-05-24 17:39:50] [INFO ] Deduced a trap composed of 181 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:39:51] [INFO ] Deduced a trap composed of 70 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:39:51] [INFO ] Deduced a trap composed of 186 places in 377 ms of which 5 ms to minimize.
[2024-05-24 17:39:51] [INFO ] Deduced a trap composed of 72 places in 462 ms of which 6 ms to minimize.
[2024-05-24 17:39:52] [INFO ] Deduced a trap composed of 187 places in 383 ms of which 5 ms to minimize.
[2024-05-24 17:39:52] [INFO ] Deduced a trap composed of 81 places in 457 ms of which 5 ms to minimize.
[2024-05-24 17:39:53] [INFO ] Deduced a trap composed of 180 places in 377 ms of which 5 ms to minimize.
[2024-05-24 17:39:53] [INFO ] Deduced a trap composed of 86 places in 446 ms of which 6 ms to minimize.
[2024-05-24 17:39:54] [INFO ] Deduced a trap composed of 180 places in 379 ms of which 5 ms to minimize.
[2024-05-24 17:39:54] [INFO ] Deduced a trap composed of 87 places in 488 ms of which 5 ms to minimize.
[2024-05-24 17:39:54] [INFO ] Deduced a trap composed of 173 places in 382 ms of which 6 ms to minimize.
[2024-05-24 17:39:55] [INFO ] Deduced a trap composed of 81 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:39:55] [INFO ] Deduced a trap composed of 178 places in 398 ms of which 6 ms to minimize.
[2024-05-24 17:39:56] [INFO ] Deduced a trap composed of 206 places in 392 ms of which 6 ms to minimize.
SMT process timed out in 77197ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3061/3061 transitions.
Applied a total of 0 rules in 79 ms. Remains 971 /971 variables (removed 0) and now considering 3061/3061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 971/971 places, 3061/3061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 3061/3061 transitions.
Applied a total of 0 rules in 76 ms. Remains 971 /971 variables (removed 0) and now considering 3061/3061 (removed 0) transitions.
[2024-05-24 17:39:56] [INFO ] Flow matrix only has 2671 transitions (discarded 390 similar events)
[2024-05-24 17:39:56] [INFO ] Invariant cache hit.
[2024-05-24 17:39:57] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2024-05-24 17:39:57] [INFO ] Flow matrix only has 2671 transitions (discarded 390 similar events)
[2024-05-24 17:39:57] [INFO ] Invariant cache hit.
[2024-05-24 17:39:58] [INFO ] State equation strengthened by 1508 read => feed constraints.
[2024-05-24 17:40:16] [INFO ] Implicit Places using invariants and state equation in 18959 ms returned []
Implicit Place search using SMT with State Equation took 20045 ms to find 0 implicit places.
[2024-05-24 17:40:16] [INFO ] Redundant transitions in 97 ms returned []
Running 2999 sub problems to find dead transitions.
[2024-05-24 17:40:16] [INFO ] Flow matrix only has 2671 transitions (discarded 390 similar events)
[2024-05-24 17:40:16] [INFO ] Invariant cache hit.
[2024-05-24 17:40:16] [INFO ] State equation strengthened by 1508 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/969 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2999 unsolved
SMT process timed out in 46827ms, After SMT, problems are : Problem set: 0 solved, 2999 unsolved
Search for dead transitions found 0 dead transitions in 46853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67090 ms. Remains : 971/971 places, 3061/3061 transitions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 188 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1604 reset in 409 ms.
Product exploration explored 100000 steps with 1607 reset in 430 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 164 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2561
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 25 place count 1146 transition count 2561
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 37 place count 1146 transition count 2561
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 1133 transition count 2548
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 1133 transition count 2548
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 79 place count 1133 transition count 2548
Deduced a syphon composed of 40 places in 1 ms
Applied a total of 79 rules in 181 ms. Remains 1133 /1146 variables (removed 13) and now considering 2548/2561 (removed 13) transitions.
[2024-05-24 17:41:05] [INFO ] Redundant transitions in 75 ms returned []
Running 2531 sub problems to find dead transitions.
[2024-05-24 17:41:05] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1133 cols
[2024-05-24 17:41:05] [INFO ] Computed 44 invariants in 27 ms
[2024-05-24 17:41:05] [INFO ] State equation strengthened by 833 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 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 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.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 0.0)
(s44 1.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 0.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 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 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.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 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.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 0.0)
(s117 0.0)
(s118 1.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 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.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 1.0)
(s147 0.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 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.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 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 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 1.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 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.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 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.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 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.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 1.0)
(s382 0.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 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.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 0.0)
(s444 1.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 1.0)
(s455 0.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1131 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2531 unsolved
SMT process timed out in 32807ms, After SMT, problems are : Problem set: 0 solved, 2531 unsolved
Search for dead transitions found 0 dead transitions in 32828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1133/1146 places, 2548/2561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33099 ms. Remains : 1133/1146 places, 2548/2561 transitions.
Built C files in :
/tmp/ltsmin8507310118406008709
[2024-05-24 17:41:38] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8507310118406008709
Running compilation step : cd /tmp/ltsmin8507310118406008709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8507310118406008709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8507310118406008709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Applied a total of 0 rules in 45 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2024-05-24 17:41:41] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2024-05-24 17:41:41] [INFO ] Computed 44 invariants in 26 ms
[2024-05-24 17:41:42] [INFO ] Implicit Places using invariants in 945 ms returned []
[2024-05-24 17:41:42] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-24 17:41:42] [INFO ] Invariant cache hit.
[2024-05-24 17:41:43] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:41:53] [INFO ] Implicit Places using invariants and state equation in 10596 ms returned []
Implicit Place search using SMT with State Equation took 11543 ms to find 0 implicit places.
Running 2544 sub problems to find dead transitions.
[2024-05-24 17:41:53] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-24 17:41:53] [INFO ] Invariant cache hit.
[2024-05-24 17:41:53] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1144 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2544 unsolved
SMT process timed out in 32132ms, After SMT, problems are : Problem set: 0 solved, 2544 unsolved
Search for dead transitions found 0 dead transitions in 32153ms
Finished structural reductions in LTL mode , in 1 iterations and 43746 ms. Remains : 1146/1146 places, 2561/2561 transitions.
Built C files in :
/tmp/ltsmin1196654300956253955
[2024-05-24 17:42:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1196654300956253955
Running compilation step : cd /tmp/ltsmin1196654300956253955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin1196654300956253955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin1196654300956253955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-24 17:42:28] [INFO ] Flatten gal took : 64 ms
[2024-05-24 17:42:28] [INFO ] Flatten gal took : 64 ms
[2024-05-24 17:42:28] [INFO ] Time to serialize gal into /tmp/LTL5016742246878551719.gal : 13 ms
[2024-05-24 17:42:28] [INFO ] Time to serialize properties into /tmp/LTL16264697562062246317.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5016742246878551719.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13717704841960193160.hoa' '-atoms' '/tmp/LTL16264697562062246317.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16264697562062246317.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13717704841960193160.hoa
Detected timeout of ITS tools.
[2024-05-24 17:42:43] [INFO ] Flatten gal took : 76 ms
[2024-05-24 17:42:43] [INFO ] Flatten gal took : 60 ms
[2024-05-24 17:42:43] [INFO ] Time to serialize gal into /tmp/LTL14917320023303843774.gal : 12 ms
[2024-05-24 17:42:43] [INFO ] Time to serialize properties into /tmp/LTL13077939811146403309.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14917320023303843774.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13077939811146403309.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(("((Node7ManageTheCrashOfNode2<1)||(Lx4IsAtTheLeftExtremityOfTheLeafSet<1))")&&(F("((Node7ManageTheCrashOfNode2>=1)&&(Lx4IsAtThe...262
Formula 0 simplified : X(!"((Node7ManageTheCrashOfNode2<1)||(Lx4IsAtTheLeftExtremityOfTheLeafSet<1))" | G!"((Node7ManageTheCrashOfNode2>=1)&&(Lx4IsAtTheLef...252
Detected timeout of ITS tools.
[2024-05-24 17:42:58] [INFO ] Flatten gal took : 68 ms
[2024-05-24 17:42:58] [INFO ] Applying decomposition
[2024-05-24 17:42:58] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15675236270924482043.txt' '-o' '/tmp/graph15675236270924482043.bin' '-w' '/tmp/graph15675236270924482043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15675236270924482043.bin' '-l' '-1' '-v' '-w' '/tmp/graph15675236270924482043.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:42:58] [INFO ] Decomposing Gal with order
[2024-05-24 17:42:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:42:59] [INFO ] Removed a total of 3154 redundant transitions.
[2024-05-24 17:42:59] [INFO ] Flatten gal took : 139 ms
[2024-05-24 17:42:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1188 labels/synchronizations in 60 ms.
[2024-05-24 17:42:59] [INFO ] Time to serialize gal into /tmp/LTL9175752789128802608.gal : 26 ms
[2024-05-24 17:42:59] [INFO ] Time to serialize properties into /tmp/LTL9565816435696034585.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9175752789128802608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9565816435696034585.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(("((i13.i1.i6.u99.Node7ManageTheCrashOfNode2<1)||(i13.i1.i6.u180.Lx4IsAtTheLeftExtremityOfTheLeafSet<1))")&&(F("((i13.i1.i6.u99....335
Formula 0 simplified : X(!"((i13.i1.i6.u99.Node7ManageTheCrashOfNode2<1)||(i13.i1.i6.u180.Lx4IsAtTheLeftExtremityOfTheLeafSet<1))" | G!"((i13.i1.i6.u99.Nod...325
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-12 finished in 488958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2688
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2688
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1195 transition count 2669
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1195 transition count 2669
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 1188 transition count 2627
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 1188 transition count 2627
Applied a total of 58 rules in 159 ms. Remains 1188 /1217 variables (removed 29) and now considering 2627/2721 (removed 94) transitions.
[2024-05-24 17:43:14] [INFO ] Flow matrix only has 2355 transitions (discarded 272 similar events)
// Phase 1: matrix 2355 rows 1188 cols
[2024-05-24 17:43:14] [INFO ] Computed 55 invariants in 30 ms
[2024-05-24 17:43:15] [INFO ] Implicit Places using invariants in 1093 ms returned [104, 293, 347, 556, 638, 639, 653, 662, 781, 868]
[2024-05-24 17:43:15] [INFO ] Actually due to overlaps returned [653, 104, 293, 347, 556, 638, 639, 662, 781]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 1096 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1179/1217 places, 2627/2721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1171 transition count 2619
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1171 transition count 2619
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1163 transition count 2611
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1163 transition count 2611
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 1155 transition count 2603
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 1155 transition count 2603
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 1148 transition count 2561
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 1148 transition count 2561
Applied a total of 62 rules in 194 ms. Remains 1148 /1179 variables (removed 31) and now considering 2561/2627 (removed 66) transitions.
[2024-05-24 17:43:15] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1148 cols
[2024-05-24 17:43:15] [INFO ] Computed 46 invariants in 25 ms
[2024-05-24 17:43:16] [INFO ] Implicit Places using invariants in 932 ms returned [836]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 933 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1217 places, 2561/2721 transitions.
Applied a total of 0 rules in 38 ms. Remains 1147 /1147 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2420 ms. Remains : 1147/1217 places, 2561/2721 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
Product exploration explored 100000 steps with 1610 reset in 408 ms.
Product exploration explored 100000 steps with 1618 reset in 427 ms.
Computed a total of 315 stabilizing places and 928 stable transitions
Computed a total of 315 stabilizing places and 928 stable transitions
Detected a total of 315/1147 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (639 resets) in 365 ms. (109 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (172 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (172 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
[2024-05-24 17:43:18] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2024-05-24 17:43:18] [INFO ] Computed 45 invariants in 17 ms
[2024-05-24 17:43:18] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1076/1080 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:43:18] [INFO ] Deduced a trap composed of 172 places in 420 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1081 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 29/1110 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/1136 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1136 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/1147 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1147 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2289/3436 variables, 1147/1193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3436 variables, 833/2026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3436 variables, 0/2026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3436 variables, 0/2026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 2026 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1147/1147 constraints, ReadFeed: 833/833 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1076/1080 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:43:20] [INFO ] Deduced a trap composed of 217 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:43:21] [INFO ] Deduced a trap composed of 141 places in 417 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1080 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/1081 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/1110 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:43:21] [INFO ] Deduced a trap composed of 50 places in 480 ms of which 6 ms to minimize.
[2024-05-24 17:43:22] [INFO ] Deduced a trap composed of 98 places in 513 ms of which 7 ms to minimize.
[2024-05-24 17:43:22] [INFO ] Deduced a trap composed of 139 places in 515 ms of which 7 ms to minimize.
[2024-05-24 17:43:23] [INFO ] Deduced a trap composed of 233 places in 508 ms of which 7 ms to minimize.
[2024-05-24 17:43:23] [INFO ] Deduced a trap composed of 249 places in 517 ms of which 7 ms to minimize.
[2024-05-24 17:43:24] [INFO ] Deduced a trap composed of 428 places in 479 ms of which 7 ms to minimize.
[2024-05-24 17:43:24] [INFO ] Deduced a trap composed of 200 places in 504 ms of which 7 ms to minimize.
[2024-05-24 17:43:25] [INFO ] Deduced a trap composed of 334 places in 490 ms of which 6 ms to minimize.
SMT process timed out in 7079ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1147 transition count 2537
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1123 transition count 2537
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 1123 transition count 2525
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 1111 transition count 2525
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 106 place count 1094 transition count 2508
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 237 place count 1094 transition count 3722
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 368 place count 963 transition count 3722
Applied a total of 368 rules in 264 ms. Remains 963 /1147 variables (removed 184) and now considering 3722/2561 (removed -1161) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 963/1147 places, 3722/2561 transitions.
RANDOM walk for 40000 steps (1129 resets) in 1150 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (141 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (145 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 66867 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 66867 steps, saw 27976 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 17:43:29] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 963 cols
[2024-05-24 17:43:29] [INFO ] Computed 45 invariants in 26 ms
[2024-05-24 17:43:29] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:43:29] [INFO ] Deduced a trap composed of 96 places in 515 ms of which 7 ms to minimize.
[2024-05-24 17:43:30] [INFO ] Deduced a trap composed of 104 places in 473 ms of which 6 ms to minimize.
[2024-05-24 17:43:30] [INFO ] Deduced a trap composed of 73 places in 463 ms of which 6 ms to minimize.
[2024-05-24 17:43:31] [INFO ] Deduced a trap composed of 101 places in 472 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/897 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/926 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:43:32] [INFO ] Deduced a trap composed of 73 places in 567 ms of which 6 ms to minimize.
[2024-05-24 17:43:32] [INFO ] Deduced a trap composed of 27 places in 556 ms of which 6 ms to minimize.
[2024-05-24 17:43:33] [INFO ] Deduced a trap composed of 108 places in 559 ms of which 5 ms to minimize.
[2024-05-24 17:43:33] [INFO ] Deduced a trap composed of 133 places in 555 ms of which 6 ms to minimize.
[2024-05-24 17:43:34] [INFO ] Deduced a trap composed of 71 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:43:35] [INFO ] Deduced a trap composed of 57 places in 603 ms of which 5 ms to minimize.
[2024-05-24 17:43:35] [INFO ] Deduced a trap composed of 72 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:43:36] [INFO ] Deduced a trap composed of 83 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:43:36] [INFO ] Deduced a trap composed of 46 places in 588 ms of which 6 ms to minimize.
[2024-05-24 17:43:37] [INFO ] Deduced a trap composed of 76 places in 557 ms of which 6 ms to minimize.
[2024-05-24 17:43:37] [INFO ] Deduced a trap composed of 71 places in 570 ms of which 5 ms to minimize.
[2024-05-24 17:43:38] [INFO ] Deduced a trap composed of 78 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:43:38] [INFO ] Deduced a trap composed of 73 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:43:39] [INFO ] Deduced a trap composed of 46 places in 503 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/952 variables, 26/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/963 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3324/4287 variables, 963/1026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4287 variables, 2178/3204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4287 variables, 0/3204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4287 variables, 0/3204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4287/4287 variables, and 3204 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11708 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 963/963 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:43:41] [INFO ] Deduced a trap composed of 74 places in 471 ms of which 5 ms to minimize.
[2024-05-24 17:43:41] [INFO ] Deduced a trap composed of 84 places in 501 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/897 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/897 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/926 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:43:42] [INFO ] Deduced a trap composed of 5 places in 520 ms of which 5 ms to minimize.
[2024-05-24 17:43:43] [INFO ] Deduced a trap composed of 75 places in 515 ms of which 5 ms to minimize.
[2024-05-24 17:43:43] [INFO ] Deduced a trap composed of 73 places in 510 ms of which 5 ms to minimize.
[2024-05-24 17:43:44] [INFO ] Deduced a trap composed of 46 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:43:44] [INFO ] Deduced a trap composed of 71 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:43:45] [INFO ] Deduced a trap composed of 74 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:43:45] [INFO ] Deduced a trap composed of 70 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:43:46] [INFO ] Deduced a trap composed of 92 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:43:46] [INFO ] Deduced a trap composed of 80 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:43:47] [INFO ] Deduced a trap composed of 75 places in 527 ms of which 5 ms to minimize.
[2024-05-24 17:43:47] [INFO ] Deduced a trap composed of 75 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:43:48] [INFO ] Deduced a trap composed of 88 places in 492 ms of which 5 ms to minimize.
[2024-05-24 17:43:49] [INFO ] Deduced a trap composed of 66 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:43:49] [INFO ] Deduced a trap composed of 69 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:43:50] [INFO ] Deduced a trap composed of 89 places in 498 ms of which 6 ms to minimize.
[2024-05-24 17:43:50] [INFO ] Deduced a trap composed of 81 places in 515 ms of which 5 ms to minimize.
[2024-05-24 17:43:51] [INFO ] Deduced a trap composed of 62 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:43:51] [INFO ] Deduced a trap composed of 80 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:43:52] [INFO ] Deduced a trap composed of 73 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:43:52] [INFO ] Deduced a trap composed of 83 places in 493 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/926 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:43:53] [INFO ] Deduced a trap composed of 73 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:43:53] [INFO ] Deduced a trap composed of 79 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:43:54] [INFO ] Deduced a trap composed of 94 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:43:54] [INFO ] Deduced a trap composed of 82 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:43:55] [INFO ] Deduced a trap composed of 75 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:43:55] [INFO ] Deduced a trap composed of 69 places in 483 ms of which 6 ms to minimize.
[2024-05-24 17:43:56] [INFO ] Deduced a trap composed of 85 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:43:56] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:43:57] [INFO ] Deduced a trap composed of 55 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:43:57] [INFO ] Deduced a trap composed of 65 places in 490 ms of which 5 ms to minimize.
[2024-05-24 17:43:58] [INFO ] Deduced a trap composed of 70 places in 480 ms of which 5 ms to minimize.
[2024-05-24 17:43:58] [INFO ] Deduced a trap composed of 86 places in 485 ms of which 5 ms to minimize.
[2024-05-24 17:43:59] [INFO ] Deduced a trap composed of 71 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:43:59] [INFO ] Deduced a trap composed of 63 places in 482 ms of which 6 ms to minimize.
[2024-05-24 17:44:00] [INFO ] Deduced a trap composed of 98 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:44:00] [INFO ] Deduced a trap composed of 65 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:44:01] [INFO ] Deduced a trap composed of 80 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:44:01] [INFO ] Deduced a trap composed of 92 places in 480 ms of which 5 ms to minimize.
[2024-05-24 17:44:02] [INFO ] Deduced a trap composed of 71 places in 525 ms of which 5 ms to minimize.
[2024-05-24 17:44:03] [INFO ] Deduced a trap composed of 94 places in 509 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/926 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:44:03] [INFO ] Deduced a trap composed of 87 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:44:04] [INFO ] Deduced a trap composed of 79 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:44:04] [INFO ] Deduced a trap composed of 70 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:44:05] [INFO ] Deduced a trap composed of 72 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:44:05] [INFO ] Deduced a trap composed of 69 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:44:06] [INFO ] Deduced a trap composed of 96 places in 510 ms of which 5 ms to minimize.
[2024-05-24 17:44:06] [INFO ] Deduced a trap composed of 79 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:44:07] [INFO ] Deduced a trap composed of 75 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:44:07] [INFO ] Deduced a trap composed of 70 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:44:08] [INFO ] Deduced a trap composed of 95 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:44:08] [INFO ] Deduced a trap composed of 90 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:44:09] [INFO ] Deduced a trap composed of 84 places in 489 ms of which 6 ms to minimize.
[2024-05-24 17:44:09] [INFO ] Deduced a trap composed of 67 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:44:10] [INFO ] Deduced a trap composed of 79 places in 485 ms of which 5 ms to minimize.
[2024-05-24 17:44:10] [INFO ] Deduced a trap composed of 75 places in 495 ms of which 5 ms to minimize.
[2024-05-24 17:44:11] [INFO ] Deduced a trap composed of 90 places in 481 ms of which 6 ms to minimize.
[2024-05-24 17:44:11] [INFO ] Deduced a trap composed of 66 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:44:12] [INFO ] Deduced a trap composed of 70 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:44:12] [INFO ] Deduced a trap composed of 64 places in 512 ms of which 5 ms to minimize.
[2024-05-24 17:44:13] [INFO ] Deduced a trap composed of 95 places in 492 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/926 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:44:13] [INFO ] Deduced a trap composed of 75 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:44:14] [INFO ] Deduced a trap composed of 78 places in 480 ms of which 5 ms to minimize.
[2024-05-24 17:44:14] [INFO ] Deduced a trap composed of 72 places in 494 ms of which 5 ms to minimize.
[2024-05-24 17:44:15] [INFO ] Deduced a trap composed of 100 places in 488 ms of which 6 ms to minimize.
[2024-05-24 17:44:15] [INFO ] Deduced a trap composed of 108 places in 489 ms of which 6 ms to minimize.
[2024-05-24 17:44:16] [INFO ] Deduced a trap composed of 72 places in 494 ms of which 5 ms to minimize.
[2024-05-24 17:44:16] [INFO ] Deduced a trap composed of 94 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:44:17] [INFO ] Deduced a trap composed of 94 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:44:17] [INFO ] Deduced a trap composed of 95 places in 494 ms of which 5 ms to minimize.
[2024-05-24 17:44:18] [INFO ] Deduced a trap composed of 85 places in 480 ms of which 6 ms to minimize.
[2024-05-24 17:44:18] [INFO ] Deduced a trap composed of 94 places in 483 ms of which 5 ms to minimize.
[2024-05-24 17:44:19] [INFO ] Deduced a trap composed of 82 places in 514 ms of which 5 ms to minimize.
[2024-05-24 17:44:20] [INFO ] Deduced a trap composed of 99 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:44:20] [INFO ] Deduced a trap composed of 97 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:44:21] [INFO ] Deduced a trap composed of 97 places in 512 ms of which 5 ms to minimize.
[2024-05-24 17:44:21] [INFO ] Deduced a trap composed of 93 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:44:22] [INFO ] Deduced a trap composed of 106 places in 485 ms of which 6 ms to minimize.
[2024-05-24 17:44:22] [INFO ] Deduced a trap composed of 91 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:44:23] [INFO ] Deduced a trap composed of 101 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:44:23] [INFO ] Deduced a trap composed of 132 places in 503 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/926 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:44:24] [INFO ] Deduced a trap composed of 103 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:44:24] [INFO ] Deduced a trap composed of 62 places in 514 ms of which 5 ms to minimize.
[2024-05-24 17:44:25] [INFO ] Deduced a trap composed of 77 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:44:25] [INFO ] Deduced a trap composed of 92 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:44:26] [INFO ] Deduced a trap composed of 65 places in 499 ms of which 5 ms to minimize.
SMT process timed out in 57224ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 92 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 963/963 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 89 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2024-05-24 17:44:26] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:44:26] [INFO ] Invariant cache hit.
[2024-05-24 17:44:27] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2024-05-24 17:44:27] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:44:27] [INFO ] Invariant cache hit.
[2024-05-24 17:44:28] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:44:58] [INFO ] Performed 840/963 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:45:04] [INFO ] Implicit Places using invariants and state equation in 37212 ms returned []
Implicit Place search using SMT with State Equation took 38270 ms to find 0 implicit places.
[2024-05-24 17:45:04] [INFO ] Redundant transitions in 142 ms returned []
Running 3660 sub problems to find dead transitions.
[2024-05-24 17:45:04] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:45:04] [INFO ] Invariant cache hit.
[2024-05-24 17:45:04] [INFO ] State equation strengthened by 2178 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 52362ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 52393ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90913 ms. Remains : 963/963 places, 3722/3722 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1147/1147 places, 2561/2561 transitions.
Applied a total of 0 rules in 42 ms. Remains 1147 /1147 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2024-05-24 17:45:57] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1147 cols
[2024-05-24 17:45:57] [INFO ] Computed 45 invariants in 27 ms
[2024-05-24 17:45:58] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-24 17:45:58] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-24 17:45:58] [INFO ] Invariant cache hit.
[2024-05-24 17:45:59] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:46:08] [INFO ] Implicit Places using invariants and state equation in 10262 ms returned [1132]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11177 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1146/1147 places, 2561/2561 transitions.
Applied a total of 0 rules in 40 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11260 ms. Remains : 1146/1147 places, 2561/2561 transitions.
Computed a total of 314 stabilizing places and 928 stable transitions
Computed a total of 314 stabilizing places and 928 stable transitions
Detected a total of 314/1146 stabilizing places and 928/2561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (639 resets) in 1218 ms. (32 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (172 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (172 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
[2024-05-24 17:46:09] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2024-05-24 17:46:09] [INFO ] Computed 44 invariants in 17 ms
[2024-05-24 17:46:09] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1076/1080 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:46:10] [INFO ] Deduced a trap composed of 217 places in 416 ms of which 7 ms to minimize.
[2024-05-24 17:46:10] [INFO ] Deduced a trap composed of 206 places in 414 ms of which 7 ms to minimize.
[2024-05-24 17:46:11] [INFO ] Deduced a trap composed of 172 places in 418 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1080 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1081 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1081 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/1110 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:46:11] [INFO ] Deduced a trap composed of 50 places in 468 ms of which 7 ms to minimize.
[2024-05-24 17:46:12] [INFO ] Deduced a trap composed of 115 places in 457 ms of which 7 ms to minimize.
[2024-05-24 17:46:12] [INFO ] Deduced a trap composed of 98 places in 454 ms of which 7 ms to minimize.
[2024-05-24 17:46:13] [INFO ] Deduced a trap composed of 140 places in 489 ms of which 7 ms to minimize.
[2024-05-24 17:46:13] [INFO ] Deduced a trap composed of 139 places in 466 ms of which 7 ms to minimize.
[2024-05-24 17:46:14] [INFO ] Deduced a trap composed of 139 places in 480 ms of which 7 ms to minimize.
[2024-05-24 17:46:14] [INFO ] Deduced a trap composed of 98 places in 467 ms of which 7 ms to minimize.
SMT process timed out in 5126ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2536
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 1121 transition count 2536
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 50 place count 1121 transition count 2524
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 74 place count 1109 transition count 2524
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 108 place count 1092 transition count 2507
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 239 place count 1092 transition count 3721
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 370 place count 961 transition count 3721
Applied a total of 370 rules in 252 ms. Remains 961 /1146 variables (removed 185) and now considering 3721/2561 (removed -1160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 961/1146 places, 3721/2561 transitions.
RANDOM walk for 40000 steps (1128 resets) in 1307 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (144 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (140 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 68900 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 68900 steps, saw 28788 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 17:46:18] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 961 cols
[2024-05-24 17:46:18] [INFO ] Computed 44 invariants in 24 ms
[2024-05-24 17:46:18] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 891/895 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:46:19] [INFO ] Deduced a trap composed of 88 places in 472 ms of which 6 ms to minimize.
[2024-05-24 17:46:19] [INFO ] Deduced a trap composed of 72 places in 463 ms of which 5 ms to minimize.
[2024-05-24 17:46:20] [INFO ] Deduced a trap composed of 89 places in 466 ms of which 5 ms to minimize.
[2024-05-24 17:46:20] [INFO ] Deduced a trap composed of 112 places in 465 ms of which 5 ms to minimize.
[2024-05-24 17:46:21] [INFO ] Deduced a trap composed of 87 places in 474 ms of which 6 ms to minimize.
[2024-05-24 17:46:21] [INFO ] Deduced a trap composed of 95 places in 468 ms of which 6 ms to minimize.
[2024-05-24 17:46:22] [INFO ] Deduced a trap composed of 89 places in 467 ms of which 5 ms to minimize.
[2024-05-24 17:46:22] [INFO ] Deduced a trap composed of 100 places in 484 ms of which 5 ms to minimize.
[2024-05-24 17:46:23] [INFO ] Deduced a trap composed of 72 places in 471 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/896 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 29/925 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/951 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/961 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/961 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3323/4284 variables, 961/1014 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4284 variables, 2178/3192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4284 variables, 0/3192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4284 variables, 0/3192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4284/4284 variables, and 3192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5929 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 961/961 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 891/895 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/896 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/925 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:46:25] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 5 ms to minimize.
[2024-05-24 17:46:25] [INFO ] Deduced a trap composed of 27 places in 434 ms of which 5 ms to minimize.
[2024-05-24 17:46:26] [INFO ] Deduced a trap composed of 116 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:46:26] [INFO ] Deduced a trap composed of 81 places in 524 ms of which 5 ms to minimize.
[2024-05-24 17:46:27] [INFO ] Deduced a trap composed of 84 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:46:27] [INFO ] Deduced a trap composed of 46 places in 498 ms of which 6 ms to minimize.
[2024-05-24 17:46:28] [INFO ] Deduced a trap composed of 46 places in 432 ms of which 5 ms to minimize.
[2024-05-24 17:46:28] [INFO ] Deduced a trap composed of 157 places in 446 ms of which 6 ms to minimize.
[2024-05-24 17:46:29] [INFO ] Deduced a trap composed of 71 places in 434 ms of which 6 ms to minimize.
[2024-05-24 17:46:29] [INFO ] Deduced a trap composed of 62 places in 444 ms of which 6 ms to minimize.
[2024-05-24 17:46:30] [INFO ] Deduced a trap composed of 141 places in 445 ms of which 6 ms to minimize.
[2024-05-24 17:46:30] [INFO ] Deduced a trap composed of 162 places in 447 ms of which 5 ms to minimize.
[2024-05-24 17:46:31] [INFO ] Deduced a trap composed of 199 places in 434 ms of which 6 ms to minimize.
[2024-05-24 17:46:31] [INFO ] Deduced a trap composed of 85 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:46:32] [INFO ] Deduced a trap composed of 114 places in 458 ms of which 6 ms to minimize.
[2024-05-24 17:46:32] [INFO ] Deduced a trap composed of 61 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:46:33] [INFO ] Deduced a trap composed of 145 places in 524 ms of which 5 ms to minimize.
[2024-05-24 17:46:33] [INFO ] Deduced a trap composed of 85 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:46:34] [INFO ] Deduced a trap composed of 75 places in 461 ms of which 5 ms to minimize.
[2024-05-24 17:46:34] [INFO ] Deduced a trap composed of 137 places in 453 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:46:35] [INFO ] Deduced a trap composed of 97 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:46:35] [INFO ] Deduced a trap composed of 157 places in 454 ms of which 5 ms to minimize.
[2024-05-24 17:46:35] [INFO ] Deduced a trap composed of 110 places in 452 ms of which 5 ms to minimize.
[2024-05-24 17:46:36] [INFO ] Deduced a trap composed of 114 places in 444 ms of which 5 ms to minimize.
[2024-05-24 17:46:36] [INFO ] Deduced a trap composed of 203 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:46:37] [INFO ] Deduced a trap composed of 120 places in 446 ms of which 7 ms to minimize.
[2024-05-24 17:46:37] [INFO ] Deduced a trap composed of 85 places in 461 ms of which 5 ms to minimize.
[2024-05-24 17:46:38] [INFO ] Deduced a trap composed of 149 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:46:38] [INFO ] Deduced a trap composed of 164 places in 456 ms of which 6 ms to minimize.
[2024-05-24 17:46:39] [INFO ] Deduced a trap composed of 85 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:46:39] [INFO ] Deduced a trap composed of 175 places in 453 ms of which 5 ms to minimize.
[2024-05-24 17:46:40] [INFO ] Deduced a trap composed of 91 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:46:40] [INFO ] Deduced a trap composed of 110 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:46:41] [INFO ] Deduced a trap composed of 206 places in 457 ms of which 6 ms to minimize.
[2024-05-24 17:46:41] [INFO ] Deduced a trap composed of 221 places in 460 ms of which 5 ms to minimize.
[2024-05-24 17:46:42] [INFO ] Deduced a trap composed of 206 places in 440 ms of which 6 ms to minimize.
[2024-05-24 17:46:42] [INFO ] Deduced a trap composed of 120 places in 440 ms of which 5 ms to minimize.
[2024-05-24 17:46:43] [INFO ] Deduced a trap composed of 94 places in 434 ms of which 5 ms to minimize.
[2024-05-24 17:46:43] [INFO ] Deduced a trap composed of 114 places in 441 ms of which 5 ms to minimize.
[2024-05-24 17:46:44] [INFO ] Deduced a trap composed of 180 places in 443 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:46:44] [INFO ] Deduced a trap composed of 95 places in 461 ms of which 5 ms to minimize.
[2024-05-24 17:46:45] [INFO ] Deduced a trap composed of 94 places in 450 ms of which 5 ms to minimize.
[2024-05-24 17:46:45] [INFO ] Deduced a trap composed of 194 places in 455 ms of which 5 ms to minimize.
[2024-05-24 17:46:45] [INFO ] Deduced a trap composed of 186 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:46:46] [INFO ] Deduced a trap composed of 94 places in 447 ms of which 6 ms to minimize.
[2024-05-24 17:46:46] [INFO ] Deduced a trap composed of 94 places in 455 ms of which 5 ms to minimize.
[2024-05-24 17:46:47] [INFO ] Deduced a trap composed of 123 places in 448 ms of which 5 ms to minimize.
[2024-05-24 17:46:47] [INFO ] Deduced a trap composed of 150 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:46:48] [INFO ] Deduced a trap composed of 66 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:46:48] [INFO ] Deduced a trap composed of 69 places in 513 ms of which 6 ms to minimize.
[2024-05-24 17:46:49] [INFO ] Deduced a trap composed of 64 places in 515 ms of which 5 ms to minimize.
[2024-05-24 17:46:49] [INFO ] Deduced a trap composed of 74 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:46:50] [INFO ] Deduced a trap composed of 162 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:46:51] [INFO ] Deduced a trap composed of 90 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:46:51] [INFO ] Deduced a trap composed of 193 places in 473 ms of which 6 ms to minimize.
[2024-05-24 17:46:52] [INFO ] Deduced a trap composed of 106 places in 452 ms of which 5 ms to minimize.
[2024-05-24 17:46:52] [INFO ] Deduced a trap composed of 46 places in 466 ms of which 5 ms to minimize.
[2024-05-24 17:46:52] [INFO ] Deduced a trap composed of 88 places in 450 ms of which 6 ms to minimize.
[2024-05-24 17:46:53] [INFO ] Deduced a trap composed of 27 places in 475 ms of which 5 ms to minimize.
[2024-05-24 17:46:53] [INFO ] Deduced a trap composed of 57 places in 445 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:46:54] [INFO ] Deduced a trap composed of 159 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:46:54] [INFO ] Deduced a trap composed of 150 places in 443 ms of which 5 ms to minimize.
[2024-05-24 17:46:55] [INFO ] Deduced a trap composed of 73 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:46:55] [INFO ] Deduced a trap composed of 76 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:46:56] [INFO ] Deduced a trap composed of 70 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:46:56] [INFO ] Deduced a trap composed of 73 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:46:57] [INFO ] Deduced a trap composed of 78 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:46:58] [INFO ] Deduced a trap composed of 67 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:46:58] [INFO ] Deduced a trap composed of 75 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:46:59] [INFO ] Deduced a trap composed of 65 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:46:59] [INFO ] Deduced a trap composed of 70 places in 519 ms of which 5 ms to minimize.
[2024-05-24 17:47:00] [INFO ] Deduced a trap composed of 82 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:47:00] [INFO ] Deduced a trap composed of 170 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:47:01] [INFO ] Deduced a trap composed of 180 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:47:01] [INFO ] Deduced a trap composed of 194 places in 512 ms of which 5 ms to minimize.
[2024-05-24 17:47:02] [INFO ] Deduced a trap composed of 62 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:47:02] [INFO ] Deduced a trap composed of 78 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:47:03] [INFO ] Deduced a trap composed of 117 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:47:03] [INFO ] Deduced a trap composed of 85 places in 457 ms of which 6 ms to minimize.
[2024-05-24 17:47:04] [INFO ] Deduced a trap composed of 127 places in 447 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:47:04] [INFO ] Deduced a trap composed of 62 places in 469 ms of which 6 ms to minimize.
[2024-05-24 17:47:05] [INFO ] Deduced a trap composed of 148 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:47:05] [INFO ] Deduced a trap composed of 104 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:47:06] [INFO ] Deduced a trap composed of 94 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:47:06] [INFO ] Deduced a trap composed of 134 places in 485 ms of which 6 ms to minimize.
[2024-05-24 17:47:07] [INFO ] Deduced a trap composed of 196 places in 458 ms of which 5 ms to minimize.
[2024-05-24 17:47:07] [INFO ] Deduced a trap composed of 266 places in 448 ms of which 5 ms to minimize.
[2024-05-24 17:47:08] [INFO ] Deduced a trap composed of 136 places in 440 ms of which 5 ms to minimize.
[2024-05-24 17:47:08] [INFO ] Deduced a trap composed of 112 places in 440 ms of which 6 ms to minimize.
[2024-05-24 17:47:09] [INFO ] Deduced a trap composed of 62 places in 457 ms of which 5 ms to minimize.
[2024-05-24 17:47:09] [INFO ] Deduced a trap composed of 71 places in 468 ms of which 5 ms to minimize.
[2024-05-24 17:47:10] [INFO ] Deduced a trap composed of 97 places in 457 ms of which 6 ms to minimize.
SMT process timed out in 51360ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 91 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 90 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2024-05-24 17:47:10] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-24 17:47:10] [INFO ] Invariant cache hit.
[2024-05-24 17:47:11] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2024-05-24 17:47:11] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-24 17:47:11] [INFO ] Invariant cache hit.
[2024-05-24 17:47:12] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:47:43] [INFO ] Performed 959/961 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:47:43] [INFO ] Implicit Places using invariants and state equation in 31880 ms returned []
Implicit Place search using SMT with State Equation took 32936 ms to find 0 implicit places.
[2024-05-24 17:47:43] [INFO ] Redundant transitions in 139 ms returned []
Running 3659 sub problems to find dead transitions.
[2024-05-24 17:47:43] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-24 17:47:43] [INFO ] Invariant cache hit.
[2024-05-24 17:47:43] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3659 unsolved
SMT process timed out in 51704ms, After SMT, problems are : Problem set: 0 solved, 3659 unsolved
Search for dead transitions found 0 dead transitions in 51735ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84916 ms. Remains : 961/961 places, 3721/3721 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 170 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1613 reset in 410 ms.
Product exploration explored 100000 steps with 1619 reset in 436 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 1146 transition count 2561
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 25 place count 1146 transition count 2561
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 37 place count 1146 transition count 2561
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 1133 transition count 2548
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 1133 transition count 2548
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 1133 transition count 2548
Deduced a syphon composed of 41 places in 1 ms
Applied a total of 80 rules in 178 ms. Remains 1133 /1146 variables (removed 13) and now considering 2548/2561 (removed 13) transitions.
[2024-05-24 17:48:36] [INFO ] Redundant transitions in 72 ms returned []
Running 2531 sub problems to find dead transitions.
[2024-05-24 17:48:36] [INFO ] Flow matrix only has 2276 transitions (discarded 272 similar events)
// Phase 1: matrix 2276 rows 1133 cols
[2024-05-24 17:48:36] [INFO ] Computed 44 invariants in 27 ms
[2024-05-24 17:48:36] [INFO ] State equation strengthened by 833 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1131 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2531 unsolved
SMT process timed out in 32597ms, After SMT, problems are : Problem set: 0 solved, 2531 unsolved
Search for dead transitions found 0 dead transitions in 32619ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1133/1146 places, 2548/2561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32880 ms. Remains : 1133/1146 places, 2548/2561 transitions.
Built C files in :
/tmp/ltsmin13137596734353279238
[2024-05-24 17:49:09] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13137596734353279238
Running compilation step : cd /tmp/ltsmin13137596734353279238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin13137596734353279238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin13137596734353279238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 4 out of 1146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1146/1146 places, 2561/2561 transitions.
Applied a total of 0 rules in 39 ms. Remains 1146 /1146 variables (removed 0) and now considering 2561/2561 (removed 0) transitions.
[2024-05-24 17:49:12] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
// Phase 1: matrix 2289 rows 1146 cols
[2024-05-24 17:49:12] [INFO ] Computed 44 invariants in 22 ms
[2024-05-24 17:49:13] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-24 17:49:13] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-24 17:49:13] [INFO ] Invariant cache hit.
[2024-05-24 17:49:14] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:49:24] [INFO ] Implicit Places using invariants and state equation in 11384 ms returned []
Implicit Place search using SMT with State Equation took 12292 ms to find 0 implicit places.
Running 2544 sub problems to find dead transitions.
[2024-05-24 17:49:24] [INFO ] Flow matrix only has 2289 transitions (discarded 272 similar events)
[2024-05-24 17:49:24] [INFO ] Invariant cache hit.
[2024-05-24 17:49:24] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1144 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2544 unsolved
SMT process timed out in 32196ms, After SMT, problems are : Problem set: 0 solved, 2544 unsolved
Search for dead transitions found 0 dead transitions in 32221ms
Finished structural reductions in LTL mode , in 1 iterations and 44559 ms. Remains : 1146/1146 places, 2561/2561 transitions.
Built C files in :
/tmp/ltsmin6471843409443711628
[2024-05-24 17:49:57] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6471843409443711628
Running compilation step : cd /tmp/ltsmin6471843409443711628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6471843409443711628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6471843409443711628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-24 17:50:00] [INFO ] Flatten gal took : 59 ms
[2024-05-24 17:50:00] [INFO ] Flatten gal took : 61 ms
[2024-05-24 17:50:00] [INFO ] Time to serialize gal into /tmp/LTL11060676980959177510.gal : 10 ms
[2024-05-24 17:50:00] [INFO ] Time to serialize properties into /tmp/LTL9842649965584288617.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11060676980959177510.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6360873530318215580.hoa' '-atoms' '/tmp/LTL9842649965584288617.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9842649965584288617.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6360873530318215580.hoa
Detected timeout of ITS tools.
[2024-05-24 17:50:15] [INFO ] Flatten gal took : 57 ms
[2024-05-24 17:50:15] [INFO ] Flatten gal took : 58 ms
[2024-05-24 17:50:15] [INFO ] Time to serialize gal into /tmp/LTL10441939391709978826.gal : 10 ms
[2024-05-24 17:50:15] [INFO ] Time to serialize properties into /tmp/LTL1064757682815010242.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10441939391709978826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1064757682815010242.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(Node11NotifyThatHeIsActive<1))"))||("((Node11ManageTheCrashOfNod...211
Formula 0 simplified : XXG(!"((Node11ManageTheCrashOfNode4>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((Node2ThinksNode11ShouldBeNodeMasterToRepl...201
Detected timeout of ITS tools.
[2024-05-24 17:50:30] [INFO ] Flatten gal took : 55 ms
[2024-05-24 17:50:30] [INFO ] Applying decomposition
[2024-05-24 17:50:30] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4241725471039343300.txt' '-o' '/tmp/graph4241725471039343300.bin' '-w' '/tmp/graph4241725471039343300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4241725471039343300.bin' '-l' '-1' '-v' '-w' '/tmp/graph4241725471039343300.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:50:30] [INFO ] Decomposing Gal with order
[2024-05-24 17:50:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:50:31] [INFO ] Removed a total of 2886 redundant transitions.
[2024-05-24 17:50:31] [INFO ] Flatten gal took : 144 ms
[2024-05-24 17:50:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 1204 labels/synchronizations in 52 ms.
[2024-05-24 17:50:31] [INFO ] Time to serialize gal into /tmp/LTL2120928838158567540.gal : 17 ms
[2024-05-24 17:50:31] [INFO ] Time to serialize properties into /tmp/LTL10436503021401025773.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2120928838158567540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10436503021401025773.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((u60.Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(i7.u104.Node11NotifyThatHeIsActive<1))"))||("((i17.u105.Node...241
Formula 0 simplified : XXG(!"((i17.u105.Node11ManageTheCrashOfNode4>=1)&&(i17.u175.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((u60.Node2ThinksNode11Sh...231
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13 finished in 451805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||X(p2)||(G(p4)&&p3))))'
Support contains 7 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1204 transition count 2683
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1204 transition count 2683
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 1197 transition count 2671
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 1197 transition count 2671
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 1191 transition count 2635
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1191 transition count 2635
Applied a total of 52 rules in 170 ms. Remains 1191 /1217 variables (removed 26) and now considering 2635/2721 (removed 86) transitions.
[2024-05-24 17:50:46] [INFO ] Flow matrix only has 2363 transitions (discarded 272 similar events)
// Phase 1: matrix 2363 rows 1191 cols
[2024-05-24 17:50:46] [INFO ] Computed 55 invariants in 31 ms
[2024-05-24 17:50:47] [INFO ] Implicit Places using invariants in 964 ms returned [104, 294, 348, 557, 640, 666, 784]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 965 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1184/1217 places, 2635/2721 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1177 transition count 2628
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1177 transition count 2628
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1170 transition count 2621
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1170 transition count 2621
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1163 transition count 2614
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1163 transition count 2614
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 1157 transition count 2578
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 1157 transition count 2578
Applied a total of 54 rules in 212 ms. Remains 1157 /1184 variables (removed 27) and now considering 2578/2635 (removed 57) transitions.
[2024-05-24 17:50:47] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
// Phase 1: matrix 2306 rows 1157 cols
[2024-05-24 17:50:47] [INFO ] Computed 48 invariants in 30 ms
[2024-05-24 17:50:48] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-05-24 17:50:48] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
[2024-05-24 17:50:48] [INFO ] Invariant cache hit.
[2024-05-24 17:50:49] [INFO ] State equation strengthened by 843 read => feed constraints.
[2024-05-24 17:51:00] [INFO ] Implicit Places using invariants and state equation in 11544 ms returned [1123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12464 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1156/1217 places, 2578/2721 transitions.
Applied a total of 0 rules in 47 ms. Remains 1156 /1156 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13859 ms. Remains : 1156/1217 places, 2578/2721 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 648 ms.
Product exploration explored 100000 steps with 50000 reset in 680 ms.
Computed a total of 324 stabilizing places and 945 stable transitions
Computed a total of 324 stabilizing places and 945 stable transitions
Detected a total of 324/1156 stabilizing places and 945/2578 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/5 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p4) (NOT p0) (NOT p1) p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p2))))), (X (NOT (AND (NOT p0) p3 p4 (NOT p2)))), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p0 p3 p4 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p4) (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p4) (NOT p2)))), (X (NOT (AND p0 p4 (NOT p2)))), (X (NOT (AND p3 p4 (NOT p1) (NOT p2)))), (X (NOT (AND p4 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 p4 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p4 (NOT p2)))), (X (NOT (AND p0 p4 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p4) (NOT p2)))), (X (NOT (AND (NOT p4) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND p0 (NOT p4) (NOT p2))))), (X (NOT (AND p0 (NOT p4) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p3 p4 (NOT p2))))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p0 p3 p4 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p4) (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p4) (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p2))))), (X (X (NOT (AND p0 p4 (NOT p2))))), (X (X (NOT (AND p3 p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p4 (NOT p2))))), (X (X (NOT (AND p0 p4 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p3) (NOT p2)) (AND p0 (NOT p4) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p4) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 47 factoid took 21 ms. Reduced automaton from 5 states, 20 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-15 finished in 15465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))||G(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(F(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(!p0)))||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1217 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1217/1217 places, 2721/2721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1217 transition count 2698
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1194 transition count 2698
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 46 place count 1194 transition count 2682
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 78 place count 1178 transition count 2682
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 85 place count 1171 transition count 2655
Iterating global reduction 2 with 7 rules applied. Total rules applied 92 place count 1171 transition count 2655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 92 place count 1171 transition count 2654
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 1170 transition count 2654
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 1167 transition count 2641
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 1167 transition count 2641
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1166 transition count 2635
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1166 transition count 2635
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 156 place count 1139 transition count 2608
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 162 place count 1133 transition count 2602
Iterating global reduction 2 with 6 rules applied. Total rules applied 168 place count 1133 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 174 place count 1127 transition count 2566
Iterating global reduction 2 with 6 rules applied. Total rules applied 180 place count 1127 transition count 2566
Applied a total of 180 rules in 359 ms. Remains 1127 /1217 variables (removed 90) and now considering 2566/2721 (removed 155) transitions.
[2024-05-24 17:51:02] [INFO ] Flow matrix only has 2294 transitions (discarded 272 similar events)
// Phase 1: matrix 2294 rows 1127 cols
[2024-05-24 17:51:02] [INFO ] Computed 55 invariants in 28 ms
[2024-05-24 17:51:03] [INFO ] Implicit Places using invariants in 954 ms returned [93, 265, 319, 521, 599, 600, 612, 620, 736, 821]
[2024-05-24 17:51:03] [INFO ] Actually due to overlaps returned [612, 93, 265, 319, 521, 599, 600, 620, 736]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 957 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1118/1217 places, 2566/2721 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1115 transition count 2563
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1115 transition count 2563
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1112 transition count 2560
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1112 transition count 2560
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1110 transition count 2548
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1110 transition count 2548
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 1105 transition count 2543
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 1100 transition count 2538
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 1100 transition count 2538
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1095 transition count 2508
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1095 transition count 2508
Applied a total of 46 rules in 298 ms. Remains 1095 /1118 variables (removed 23) and now considering 2508/2566 (removed 58) transitions.
[2024-05-24 17:51:03] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1095 cols
[2024-05-24 17:51:03] [INFO ] Computed 46 invariants in 23 ms
[2024-05-24 17:51:04] [INFO ] Implicit Places using invariants in 911 ms returned [797]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 912 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1094/1217 places, 2508/2721 transitions.
Applied a total of 0 rules in 47 ms. Remains 1094 /1094 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2575 ms. Remains : 1094/1217 places, 2508/2721 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13
Product exploration explored 100000 steps with 2292 reset in 486 ms.
Product exploration explored 100000 steps with 2290 reset in 512 ms.
Computed a total of 279 stabilizing places and 892 stable transitions
Computed a total of 279 stabilizing places and 892 stable transitions
Detected a total of 279/1094 stabilizing places and 892/2508 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (912 resets) in 932 ms. (42 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (188 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (188 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
[2024-05-24 17:51:06] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1094 cols
[2024-05-24 17:51:06] [INFO ] Computed 45 invariants in 18 ms
[2024-05-24 17:51:06] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1023/1027 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:51:06] [INFO ] Deduced a trap composed of 127 places in 389 ms of which 6 ms to minimize.
[2024-05-24 17:51:07] [INFO ] Deduced a trap composed of 78 places in 388 ms of which 6 ms to minimize.
[2024-05-24 17:51:07] [INFO ] Deduced a trap composed of 118 places in 388 ms of which 9 ms to minimize.
[2024-05-24 17:51:08] [INFO ] Deduced a trap composed of 113 places in 385 ms of which 6 ms to minimize.
[2024-05-24 17:51:08] [INFO ] Deduced a trap composed of 82 places in 391 ms of which 6 ms to minimize.
[2024-05-24 17:51:08] [INFO ] Deduced a trap composed of 102 places in 390 ms of which 6 ms to minimize.
[2024-05-24 17:51:09] [INFO ] Deduced a trap composed of 77 places in 391 ms of which 6 ms to minimize.
[2024-05-24 17:51:09] [INFO ] Deduced a trap composed of 100 places in 387 ms of which 6 ms to minimize.
[2024-05-24 17:51:10] [INFO ] Deduced a trap composed of 90 places in 391 ms of which 6 ms to minimize.
[2024-05-24 17:51:10] [INFO ] Deduced a trap composed of 78 places in 384 ms of which 6 ms to minimize.
[2024-05-24 17:51:11] [INFO ] Deduced a trap composed of 82 places in 390 ms of which 6 ms to minimize.
[2024-05-24 17:51:11] [INFO ] Deduced a trap composed of 95 places in 389 ms of which 6 ms to minimize.
SMT process timed out in 5046ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1094 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1094/1094 places, 2508/2508 transitions.
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 131 place count 1094 transition count 3722
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 262 place count 963 transition count 3722
Applied a total of 262 rules in 183 ms. Remains 963 /1094 variables (removed 131) and now considering 3722/2508 (removed -1214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 963/1094 places, 3722/2508 transitions.
RANDOM walk for 40000 steps (1129 resets) in 1320 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (142 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (145 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 68886 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 68886 steps, saw 28785 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 17:51:15] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
// Phase 1: matrix 3324 rows 963 cols
[2024-05-24 17:51:15] [INFO ] Computed 45 invariants in 24 ms
[2024-05-24 17:51:15] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:51:15] [INFO ] Deduced a trap composed of 74 places in 486 ms of which 5 ms to minimize.
[2024-05-24 17:51:16] [INFO ] Deduced a trap composed of 80 places in 459 ms of which 5 ms to minimize.
[2024-05-24 17:51:16] [INFO ] Deduced a trap composed of 96 places in 470 ms of which 5 ms to minimize.
[2024-05-24 17:51:17] [INFO ] Deduced a trap composed of 84 places in 455 ms of which 5 ms to minimize.
[2024-05-24 17:51:17] [INFO ] Deduced a trap composed of 73 places in 475 ms of which 5 ms to minimize.
[2024-05-24 17:51:18] [INFO ] Deduced a trap composed of 113 places in 465 ms of which 5 ms to minimize.
[2024-05-24 17:51:18] [INFO ] Deduced a trap composed of 104 places in 461 ms of which 5 ms to minimize.
[2024-05-24 17:51:19] [INFO ] Deduced a trap composed of 90 places in 469 ms of which 5 ms to minimize.
[2024-05-24 17:51:19] [INFO ] Deduced a trap composed of 101 places in 464 ms of which 5 ms to minimize.
[2024-05-24 17:51:20] [INFO ] Deduced a trap composed of 108 places in 465 ms of which 5 ms to minimize.
[2024-05-24 17:51:20] [INFO ] Deduced a trap composed of 80 places in 460 ms of which 5 ms to minimize.
[2024-05-24 17:51:21] [INFO ] Deduced a trap composed of 88 places in 470 ms of which 5 ms to minimize.
[2024-05-24 17:51:21] [INFO ] Deduced a trap composed of 73 places in 461 ms of which 5 ms to minimize.
[2024-05-24 17:51:22] [INFO ] Deduced a trap composed of 74 places in 476 ms of which 5 ms to minimize.
[2024-05-24 17:51:22] [INFO ] Deduced a trap composed of 89 places in 465 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/897 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/926 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:51:23] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 5 ms to minimize.
[2024-05-24 17:51:23] [INFO ] Deduced a trap composed of 27 places in 434 ms of which 6 ms to minimize.
[2024-05-24 17:51:24] [INFO ] Deduced a trap composed of 46 places in 458 ms of which 5 ms to minimize.
[2024-05-24 17:51:24] [INFO ] Deduced a trap composed of 46 places in 443 ms of which 5 ms to minimize.
[2024-05-24 17:51:25] [INFO ] Deduced a trap composed of 161 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:51:25] [INFO ] Deduced a trap composed of 71 places in 444 ms of which 5 ms to minimize.
[2024-05-24 17:51:25] [INFO ] Deduced a trap composed of 57 places in 447 ms of which 6 ms to minimize.
[2024-05-24 17:51:26] [INFO ] Deduced a trap composed of 62 places in 464 ms of which 5 ms to minimize.
[2024-05-24 17:51:26] [INFO ] Deduced a trap composed of 158 places in 456 ms of which 6 ms to minimize.
[2024-05-24 17:51:27] [INFO ] Deduced a trap composed of 75 places in 453 ms of which 6 ms to minimize.
[2024-05-24 17:51:27] [INFO ] Deduced a trap composed of 178 places in 428 ms of which 5 ms to minimize.
[2024-05-24 17:51:28] [INFO ] Deduced a trap composed of 176 places in 455 ms of which 5 ms to minimize.
[2024-05-24 17:51:28] [INFO ] Deduced a trap composed of 106 places in 433 ms of which 6 ms to minimize.
[2024-05-24 17:51:29] [INFO ] Deduced a trap composed of 166 places in 468 ms of which 5 ms to minimize.
[2024-05-24 17:51:29] [INFO ] Deduced a trap composed of 168 places in 464 ms of which 5 ms to minimize.
[2024-05-24 17:51:30] [INFO ] Deduced a trap composed of 63 places in 522 ms of which 5 ms to minimize.
[2024-05-24 17:51:30] [INFO ] Deduced a trap composed of 64 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:51:31] [INFO ] Deduced a trap composed of 70 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:51:31] [INFO ] Deduced a trap composed of 73 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:51:32] [INFO ] Deduced a trap composed of 75 places in 510 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:51:32] [INFO ] Deduced a trap composed of 90 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:51:33] [INFO ] Deduced a trap composed of 68 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:51:34] [INFO ] Deduced a trap composed of 156 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:51:34] [INFO ] Deduced a trap composed of 95 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:51:35] [INFO ] Deduced a trap composed of 92 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:51:35] [INFO ] Deduced a trap composed of 92 places in 535 ms of which 5 ms to minimize.
[2024-05-24 17:51:36] [INFO ] Deduced a trap composed of 64 places in 521 ms of which 6 ms to minimize.
[2024-05-24 17:51:36] [INFO ] Deduced a trap composed of 66 places in 502 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/926 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 26/952 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 11/963 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/963 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3324/4287 variables, 963/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4287 variables, 2178/3229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4287 variables, 0/3229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/4287 variables, 0/3229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4287/4287 variables, and 3229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23406 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 963/963 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/897 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/897 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/926 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:51:39] [INFO ] Deduced a trap composed of 66 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:51:39] [INFO ] Deduced a trap composed of 75 places in 523 ms of which 5 ms to minimize.
[2024-05-24 17:51:40] [INFO ] Deduced a trap composed of 74 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:51:40] [INFO ] Deduced a trap composed of 62 places in 436 ms of which 5 ms to minimize.
[2024-05-24 17:51:41] [INFO ] Deduced a trap composed of 63 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:51:41] [INFO ] Deduced a trap composed of 62 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:51:42] [INFO ] Deduced a trap composed of 75 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:51:43] [INFO ] Deduced a trap composed of 92 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:51:43] [INFO ] Deduced a trap composed of 78 places in 494 ms of which 5 ms to minimize.
[2024-05-24 17:51:44] [INFO ] Deduced a trap composed of 95 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:51:44] [INFO ] Deduced a trap composed of 61 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:51:45] [INFO ] Deduced a trap composed of 63 places in 486 ms of which 5 ms to minimize.
[2024-05-24 17:51:45] [INFO ] Deduced a trap composed of 97 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:51:46] [INFO ] Deduced a trap composed of 70 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:51:46] [INFO ] Deduced a trap composed of 190 places in 436 ms of which 5 ms to minimize.
[2024-05-24 17:51:46] [INFO ] Deduced a trap composed of 208 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:51:47] [INFO ] Deduced a trap composed of 72 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:51:48] [INFO ] Deduced a trap composed of 69 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:51:48] [INFO ] Deduced a trap composed of 75 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:51:49] [INFO ] Deduced a trap composed of 147 places in 486 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:51:49] [INFO ] Deduced a trap composed of 63 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:51:50] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:51:50] [INFO ] Deduced a trap composed of 64 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:51:51] [INFO ] Deduced a trap composed of 64 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:51:51] [INFO ] Deduced a trap composed of 203 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:51:52] [INFO ] Deduced a trap composed of 190 places in 433 ms of which 5 ms to minimize.
[2024-05-24 17:51:52] [INFO ] Deduced a trap composed of 221 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:51:52] [INFO ] Deduced a trap composed of 85 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:51:53] [INFO ] Deduced a trap composed of 92 places in 510 ms of which 5 ms to minimize.
[2024-05-24 17:51:53] [INFO ] Deduced a trap composed of 94 places in 483 ms of which 6 ms to minimize.
[2024-05-24 17:51:54] [INFO ] Deduced a trap composed of 68 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:51:54] [INFO ] Deduced a trap composed of 62 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:51:55] [INFO ] Deduced a trap composed of 76 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:51:56] [INFO ] Deduced a trap composed of 62 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:51:56] [INFO ] Deduced a trap composed of 59 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:51:57] [INFO ] Deduced a trap composed of 85 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:51:57] [INFO ] Deduced a trap composed of 77 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:51:58] [INFO ] Deduced a trap composed of 61 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:51:58] [INFO ] Deduced a trap composed of 163 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:51:59] [INFO ] Deduced a trap composed of 75 places in 502 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/926 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:51:59] [INFO ] Deduced a trap composed of 85 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:52:00] [INFO ] Deduced a trap composed of 79 places in 495 ms of which 5 ms to minimize.
[2024-05-24 17:52:00] [INFO ] Deduced a trap composed of 63 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:52:01] [INFO ] Deduced a trap composed of 77 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:52:01] [INFO ] Deduced a trap composed of 73 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:52:02] [INFO ] Deduced a trap composed of 80 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:52:02] [INFO ] Deduced a trap composed of 91 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:52:03] [INFO ] Deduced a trap composed of 78 places in 498 ms of which 6 ms to minimize.
[2024-05-24 17:52:03] [INFO ] Deduced a trap composed of 81 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:52:04] [INFO ] Deduced a trap composed of 76 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:52:04] [INFO ] Deduced a trap composed of 102 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:52:05] [INFO ] Deduced a trap composed of 67 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:52:05] [INFO ] Deduced a trap composed of 67 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:52:06] [INFO ] Deduced a trap composed of 106 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:52:06] [INFO ] Deduced a trap composed of 70 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:52:07] [INFO ] Deduced a trap composed of 68 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:52:07] [INFO ] Deduced a trap composed of 61 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:52:08] [INFO ] Deduced a trap composed of 79 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:52:09] [INFO ] Deduced a trap composed of 97 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:52:09] [INFO ] Deduced a trap composed of 120 places in 507 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/926 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:52:10] [INFO ] Deduced a trap composed of 66 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:52:10] [INFO ] Deduced a trap composed of 123 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:52:11] [INFO ] Deduced a trap composed of 104 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:52:11] [INFO ] Deduced a trap composed of 70 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:52:12] [INFO ] Deduced a trap composed of 67 places in 501 ms of which 5 ms to minimize.
[2024-05-24 17:52:12] [INFO ] Deduced a trap composed of 68 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:52:13] [INFO ] Deduced a trap composed of 75 places in 513 ms of which 6 ms to minimize.
[2024-05-24 17:52:13] [INFO ] Deduced a trap composed of 149 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:52:14] [INFO ] Deduced a trap composed of 96 places in 489 ms of which 5 ms to minimize.
[2024-05-24 17:52:14] [INFO ] Deduced a trap composed of 86 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:52:15] [INFO ] Deduced a trap composed of 88 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:52:15] [INFO ] Deduced a trap composed of 69 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:52:16] [INFO ] Deduced a trap composed of 71 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:52:16] [INFO ] Deduced a trap composed of 65 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:52:17] [INFO ] Deduced a trap composed of 65 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:52:17] [INFO ] Deduced a trap composed of 70 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:52:18] [INFO ] Deduced a trap composed of 71 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:52:19] [INFO ] Deduced a trap composed of 71 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:52:19] [INFO ] Deduced a trap composed of 144 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:52:20] [INFO ] Deduced a trap composed of 74 places in 509 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/926 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:52:20] [INFO ] Deduced a trap composed of 79 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:52:21] [INFO ] Deduced a trap composed of 71 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:52:21] [INFO ] Deduced a trap composed of 113 places in 519 ms of which 5 ms to minimize.
[2024-05-24 17:52:22] [INFO ] Deduced a trap composed of 85 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:52:22] [INFO ] Deduced a trap composed of 90 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:52:23] [INFO ] Deduced a trap composed of 70 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:52:23] [INFO ] Deduced a trap composed of 71 places in 511 ms of which 5 ms to minimize.
SMT process timed out in 68693ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 94 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 963/963 places, 3722/3722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 92 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2024-05-24 17:52:24] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:52:24] [INFO ] Invariant cache hit.
[2024-05-24 17:52:25] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-05-24 17:52:25] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:52:25] [INFO ] Invariant cache hit.
[2024-05-24 17:52:25] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:52:55] [INFO ] Performed 775/963 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:53:00] [INFO ] Implicit Places using invariants and state equation in 35939 ms returned []
Implicit Place search using SMT with State Equation took 36982 ms to find 0 implicit places.
[2024-05-24 17:53:01] [INFO ] Redundant transitions in 149 ms returned []
Running 3660 sub problems to find dead transitions.
[2024-05-24 17:53:01] [INFO ] Flow matrix only has 3324 transitions (discarded 398 similar events)
[2024-05-24 17:53:01] [INFO ] Invariant cache hit.
[2024-05-24 17:53:01] [INFO ] State equation strengthened by 2178 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3660 unsolved
SMT process timed out in 51713ms, After SMT, problems are : Problem set: 0 solved, 3660 unsolved
Search for dead transitions found 0 dead transitions in 51745ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88983 ms. Remains : 963/963 places, 3722/3722 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1094/1094 places, 2508/2508 transitions.
Applied a total of 0 rules in 38 ms. Remains 1094 /1094 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2024-05-24 17:53:53] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1094 cols
[2024-05-24 17:53:53] [INFO ] Computed 45 invariants in 26 ms
[2024-05-24 17:53:54] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-24 17:53:54] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:53:54] [INFO ] Invariant cache hit.
[2024-05-24 17:53:54] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:54:03] [INFO ] Implicit Places using invariants and state equation in 9174 ms returned [1087]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10077 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1093/1094 places, 2508/2508 transitions.
Applied a total of 0 rules in 39 ms. Remains 1093 /1093 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10155 ms. Remains : 1093/1094 places, 2508/2508 transitions.
Computed a total of 278 stabilizing places and 892 stable transitions
Computed a total of 278 stabilizing places and 892 stable transitions
Detected a total of 278/1093 stabilizing places and 892/2508 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (910 resets) in 747 ms. (53 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (188 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (188 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
[2024-05-24 17:54:04] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1093 cols
[2024-05-24 17:54:04] [INFO ] Computed 44 invariants in 20 ms
[2024-05-24 17:54:04] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1023/1027 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:54:04] [INFO ] Deduced a trap composed of 90 places in 427 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1027 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/1028 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 29/1057 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1057 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/1083 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1083 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/1093 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1093 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2236/3329 variables, 1093/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3329 variables, 833/1971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3329 variables, 0/1971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3329 variables, 0/1971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3329/3329 variables, and 1971 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1597 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 1093/1093 constraints, ReadFeed: 833/833 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1023/1027 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1027 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:54:06] [INFO ] Deduced a trap composed of 77 places in 401 ms of which 6 ms to minimize.
[2024-05-24 17:54:06] [INFO ] Deduced a trap composed of 103 places in 399 ms of which 6 ms to minimize.
[2024-05-24 17:54:07] [INFO ] Deduced a trap composed of 78 places in 403 ms of which 7 ms to minimize.
[2024-05-24 17:54:07] [INFO ] Deduced a trap composed of 78 places in 401 ms of which 6 ms to minimize.
[2024-05-24 17:54:07] [INFO ] Deduced a trap composed of 97 places in 409 ms of which 6 ms to minimize.
[2024-05-24 17:54:08] [INFO ] Deduced a trap composed of 113 places in 398 ms of which 6 ms to minimize.
[2024-05-24 17:54:08] [INFO ] Deduced a trap composed of 118 places in 409 ms of which 6 ms to minimize.
[2024-05-24 17:54:09] [INFO ] Deduced a trap composed of 127 places in 413 ms of which 6 ms to minimize.
[2024-05-24 17:54:09] [INFO ] Deduced a trap composed of 82 places in 419 ms of which 6 ms to minimize.
[2024-05-24 17:54:10] [INFO ] Deduced a trap composed of 82 places in 387 ms of which 6 ms to minimize.
[2024-05-24 17:54:10] [INFO ] Deduced a trap composed of 100 places in 399 ms of which 6 ms to minimize.
[2024-05-24 17:54:10] [INFO ] Deduced a trap composed of 95 places in 394 ms of which 6 ms to minimize.
SMT process timed out in 6834ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2508/2508 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 1093 transition count 2507
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 1092 transition count 2507
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 133 place count 1092 transition count 3721
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 264 place count 961 transition count 3721
Applied a total of 264 rules in 189 ms. Remains 961 /1093 variables (removed 132) and now considering 3721/2508 (removed -1213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 961/1093 places, 3721/2508 transitions.
RANDOM walk for 40000 steps (1128 resets) in 1165 ms. (34 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (143 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (140 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 68774 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 68774 steps, saw 28749 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 17:54:14] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 961 cols
[2024-05-24 17:54:14] [INFO ] Computed 44 invariants in 34 ms
[2024-05-24 17:54:14] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 891/895 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:54:15] [INFO ] Deduced a trap composed of 107 places in 473 ms of which 5 ms to minimize.
[2024-05-24 17:54:15] [INFO ] Deduced a trap composed of 79 places in 476 ms of which 6 ms to minimize.
[2024-05-24 17:54:16] [INFO ] Deduced a trap composed of 87 places in 467 ms of which 5 ms to minimize.
[2024-05-24 17:54:16] [INFO ] Deduced a trap composed of 73 places in 477 ms of which 5 ms to minimize.
[2024-05-24 17:54:17] [INFO ] Deduced a trap composed of 88 places in 476 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/896 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 29/925 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/951 variables, 26/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/961 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/961 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3323/4284 variables, 961/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4284 variables, 2178/3188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4284 variables, 0/3188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4284 variables, 0/3188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4284/4284 variables, and 3188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4054 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 961/961 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 891/895 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:54:19] [INFO ] Deduced a trap composed of 72 places in 467 ms of which 5 ms to minimize.
[2024-05-24 17:54:19] [INFO ] Deduced a trap composed of 72 places in 462 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/896 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 29/925 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:54:20] [INFO ] Deduced a trap composed of 5 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:54:21] [INFO ] Deduced a trap composed of 27 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:54:21] [INFO ] Deduced a trap composed of 46 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:54:22] [INFO ] Deduced a trap composed of 46 places in 529 ms of which 5 ms to minimize.
[2024-05-24 17:54:22] [INFO ] Deduced a trap composed of 71 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:54:23] [INFO ] Deduced a trap composed of 79 places in 528 ms of which 5 ms to minimize.
[2024-05-24 17:54:23] [INFO ] Deduced a trap composed of 62 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:54:24] [INFO ] Deduced a trap composed of 63 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:54:24] [INFO ] Deduced a trap composed of 72 places in 524 ms of which 5 ms to minimize.
[2024-05-24 17:54:25] [INFO ] Deduced a trap composed of 82 places in 536 ms of which 6 ms to minimize.
[2024-05-24 17:54:25] [INFO ] Deduced a trap composed of 75 places in 581 ms of which 6 ms to minimize.
[2024-05-24 17:54:26] [INFO ] Deduced a trap composed of 93 places in 522 ms of which 5 ms to minimize.
[2024-05-24 17:54:27] [INFO ] Deduced a trap composed of 67 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:54:27] [INFO ] Deduced a trap composed of 71 places in 514 ms of which 5 ms to minimize.
[2024-05-24 17:54:27] [INFO ] Deduced a trap composed of 134 places in 435 ms of which 5 ms to minimize.
[2024-05-24 17:54:28] [INFO ] Deduced a trap composed of 74 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:54:29] [INFO ] Deduced a trap composed of 61 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:54:29] [INFO ] Deduced a trap composed of 73 places in 511 ms of which 6 ms to minimize.
[2024-05-24 17:54:30] [INFO ] Deduced a trap composed of 75 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:54:30] [INFO ] Deduced a trap composed of 145 places in 514 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:54:31] [INFO ] Deduced a trap composed of 59 places in 499 ms of which 5 ms to minimize.
[2024-05-24 17:54:31] [INFO ] Deduced a trap composed of 60 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:54:32] [INFO ] Deduced a trap composed of 63 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:54:32] [INFO ] Deduced a trap composed of 149 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:54:33] [INFO ] Deduced a trap composed of 155 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:54:33] [INFO ] Deduced a trap composed of 73 places in 522 ms of which 5 ms to minimize.
[2024-05-24 17:54:34] [INFO ] Deduced a trap composed of 135 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:54:34] [INFO ] Deduced a trap composed of 67 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:54:35] [INFO ] Deduced a trap composed of 154 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:54:35] [INFO ] Deduced a trap composed of 143 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:54:36] [INFO ] Deduced a trap composed of 52 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:54:36] [INFO ] Deduced a trap composed of 139 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:54:37] [INFO ] Deduced a trap composed of 85 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:54:37] [INFO ] Deduced a trap composed of 183 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:54:38] [INFO ] Deduced a trap composed of 66 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:54:38] [INFO ] Deduced a trap composed of 72 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:54:39] [INFO ] Deduced a trap composed of 72 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:54:40] [INFO ] Deduced a trap composed of 69 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:54:40] [INFO ] Deduced a trap composed of 76 places in 485 ms of which 5 ms to minimize.
[2024-05-24 17:54:41] [INFO ] Deduced a trap composed of 75 places in 490 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:54:41] [INFO ] Deduced a trap composed of 90 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:54:41] [INFO ] Deduced a trap composed of 71 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:54:42] [INFO ] Deduced a trap composed of 72 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:54:43] [INFO ] Deduced a trap composed of 67 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:54:43] [INFO ] Deduced a trap composed of 72 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:54:44] [INFO ] Deduced a trap composed of 84 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:54:44] [INFO ] Deduced a trap composed of 70 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:54:45] [INFO ] Deduced a trap composed of 63 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:54:45] [INFO ] Deduced a trap composed of 62 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:54:46] [INFO ] Deduced a trap composed of 71 places in 495 ms of which 9 ms to minimize.
[2024-05-24 17:54:46] [INFO ] Deduced a trap composed of 62 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:54:47] [INFO ] Deduced a trap composed of 96 places in 525 ms of which 5 ms to minimize.
[2024-05-24 17:54:47] [INFO ] Deduced a trap composed of 78 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:54:48] [INFO ] Deduced a trap composed of 77 places in 514 ms of which 5 ms to minimize.
[2024-05-24 17:54:48] [INFO ] Deduced a trap composed of 74 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:54:49] [INFO ] Deduced a trap composed of 84 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:54:49] [INFO ] Deduced a trap composed of 83 places in 501 ms of which 5 ms to minimize.
[2024-05-24 17:54:50] [INFO ] Deduced a trap composed of 62 places in 433 ms of which 5 ms to minimize.
[2024-05-24 17:54:50] [INFO ] Deduced a trap composed of 73 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:54:51] [INFO ] Deduced a trap composed of 74 places in 500 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:54:51] [INFO ] Deduced a trap composed of 177 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:54:52] [INFO ] Deduced a trap composed of 66 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:54:52] [INFO ] Deduced a trap composed of 62 places in 481 ms of which 5 ms to minimize.
[2024-05-24 17:54:53] [INFO ] Deduced a trap composed of 73 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:54:53] [INFO ] Deduced a trap composed of 61 places in 499 ms of which 6 ms to minimize.
[2024-05-24 17:54:54] [INFO ] Deduced a trap composed of 75 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:54:54] [INFO ] Deduced a trap composed of 97 places in 429 ms of which 5 ms to minimize.
[2024-05-24 17:54:55] [INFO ] Deduced a trap composed of 63 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:54:55] [INFO ] Deduced a trap composed of 73 places in 510 ms of which 5 ms to minimize.
[2024-05-24 17:54:56] [INFO ] Deduced a trap composed of 173 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:54:56] [INFO ] Deduced a trap composed of 81 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:54:57] [INFO ] Deduced a trap composed of 71 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:54:57] [INFO ] Deduced a trap composed of 77 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:54:58] [INFO ] Deduced a trap composed of 74 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:54:58] [INFO ] Deduced a trap composed of 103 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:54:59] [INFO ] Deduced a trap composed of 77 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:55:00] [INFO ] Deduced a trap composed of 87 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:55:00] [INFO ] Deduced a trap composed of 69 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:55:01] [INFO ] Deduced a trap composed of 100 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:55:01] [INFO ] Deduced a trap composed of 69 places in 510 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/925 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:55:02] [INFO ] Deduced a trap composed of 57 places in 430 ms of which 5 ms to minimize.
[2024-05-24 17:55:02] [INFO ] Deduced a trap composed of 82 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:55:03] [INFO ] Deduced a trap composed of 103 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:55:03] [INFO ] Deduced a trap composed of 83 places in 515 ms of which 5 ms to minimize.
[2024-05-24 17:55:04] [INFO ] Deduced a trap composed of 79 places in 503 ms of which 5 ms to minimize.
SMT process timed out in 49569ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 92 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 961/961 places, 3721/3721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 3721/3721 transitions.
Applied a total of 0 rules in 90 ms. Remains 961 /961 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2024-05-24 17:55:04] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-24 17:55:04] [INFO ] Invariant cache hit.
[2024-05-24 17:55:05] [INFO ] Implicit Places using invariants in 1042 ms returned []
[2024-05-24 17:55:05] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-24 17:55:05] [INFO ] Invariant cache hit.
[2024-05-24 17:55:06] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:55:29] [INFO ] Implicit Places using invariants and state equation in 24353 ms returned []
Implicit Place search using SMT with State Equation took 25396 ms to find 0 implicit places.
[2024-05-24 17:55:29] [INFO ] Redundant transitions in 150 ms returned []
Running 3659 sub problems to find dead transitions.
[2024-05-24 17:55:29] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
[2024-05-24 17:55:29] [INFO ] Invariant cache hit.
[2024-05-24 17:55:29] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3659 unsolved
SMT process timed out in 51780ms, After SMT, problems are : Problem set: 0 solved, 3659 unsolved
Search for dead transitions found 0 dead transitions in 51812ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77462 ms. Remains : 961/961 places, 3721/3721 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 163 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2299 reset in 497 ms.
Product exploration explored 100000 steps with 2293 reset in 515 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 2508/2508 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 1093 transition count 2508
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1093 transition count 2508
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 74 ms. Remains 1093 /1093 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2024-05-24 17:56:23] [INFO ] Redundant transitions in 65 ms returned []
Running 2491 sub problems to find dead transitions.
[2024-05-24 17:56:23] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1093 cols
[2024-05-24 17:56:23] [INFO ] Computed 44 invariants in 27 ms
[2024-05-24 17:56:23] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1091 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2491 unsolved
SMT process timed out in 32489ms, After SMT, problems are : Problem set: 0 solved, 2491 unsolved
Search for dead transitions found 0 dead transitions in 32510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1093/1093 places, 2508/2508 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32662 ms. Remains : 1093/1093 places, 2508/2508 transitions.
Built C files in :
/tmp/ltsmin8838261986506861502
[2024-05-24 17:56:56] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8838261986506861502
Running compilation step : cd /tmp/ltsmin8838261986506861502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8838261986506861502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8838261986506861502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 4 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 2508/2508 transitions.
Applied a total of 0 rules in 45 ms. Remains 1093 /1093 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2024-05-24 17:56:59] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1093 cols
[2024-05-24 17:56:59] [INFO ] Computed 44 invariants in 24 ms
[2024-05-24 17:57:00] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-24 17:57:00] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:57:00] [INFO ] Invariant cache hit.
[2024-05-24 17:57:00] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:57:10] [INFO ] Implicit Places using invariants and state equation in 10058 ms returned []
Implicit Place search using SMT with State Equation took 10957 ms to find 0 implicit places.
Running 2491 sub problems to find dead transitions.
[2024-05-24 17:57:10] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:57:10] [INFO ] Invariant cache hit.
[2024-05-24 17:57:10] [INFO ] State equation strengthened by 833 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.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 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 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.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 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.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 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.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 0.0)
(s209 0.0)
(s210 1.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 0.0)
(s222 1.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 1.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 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 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 1.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 1.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 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 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.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 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.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 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 0.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 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 1.0)
(s552 timeout
1.0)
(s553 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1091 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2491 unsolved
SMT process timed out in 32592ms, After SMT, problems are : Problem set: 0 solved, 2491 unsolved
Search for dead transitions found 0 dead transitions in 32613ms
Finished structural reductions in LTL mode , in 1 iterations and 43618 ms. Remains : 1093/1093 places, 2508/2508 transitions.
Built C files in :
/tmp/ltsmin12796839330100787845
[2024-05-24 17:57:42] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12796839330100787845
Running compilation step : cd /tmp/ltsmin12796839330100787845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12796839330100787845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12796839330100787845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-24 17:57:45] [INFO ] Flatten gal took : 49 ms
[2024-05-24 17:57:45] [INFO ] Flatten gal took : 50 ms
[2024-05-24 17:57:45] [INFO ] Time to serialize gal into /tmp/LTL14109359821895685202.gal : 11 ms
[2024-05-24 17:57:45] [INFO ] Time to serialize properties into /tmp/LTL18391492811730403207.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14109359821895685202.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3120040258717752822.hoa' '-atoms' '/tmp/LTL18391492811730403207.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18391492811730403207.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3120040258717752822.hoa
Detected timeout of ITS tools.
[2024-05-24 17:58:01] [INFO ] Flatten gal took : 49 ms
[2024-05-24 17:58:01] [INFO ] Flatten gal took : 50 ms
[2024-05-24 17:58:01] [INFO ] Time to serialize gal into /tmp/LTL16453971078230448741.gal : 10 ms
[2024-05-24 17:58:01] [INFO ] Time to serialize properties into /tmp/LTL14459058879709799206.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16453971078230448741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14459058879709799206.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(Node11NotifyThatHeIsActive<1))"))||("((Node11ManageTheCrashOfNod...211
Formula 0 simplified : XXG(!"((Node11ManageTheCrashOfNode4>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((Node2ThinksNode11ShouldBeNodeMasterToRepl...201
Detected timeout of ITS tools.
[2024-05-24 17:58:16] [INFO ] Flatten gal took : 49 ms
[2024-05-24 17:58:16] [INFO ] Applying decomposition
[2024-05-24 17:58:16] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7505927620862780858.txt' '-o' '/tmp/graph7505927620862780858.bin' '-w' '/tmp/graph7505927620862780858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7505927620862780858.bin' '-l' '-1' '-v' '-w' '/tmp/graph7505927620862780858.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:58:16] [INFO ] Decomposing Gal with order
[2024-05-24 17:58:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:58:16] [INFO ] Removed a total of 2258 redundant transitions.
[2024-05-24 17:58:16] [INFO ] Flatten gal took : 179 ms
[2024-05-24 17:58:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1358 labels/synchronizations in 75 ms.
[2024-05-24 17:58:16] [INFO ] Time to serialize gal into /tmp/LTL17635637674563912331.gal : 80 ms
[2024-05-24 17:58:16] [INFO ] Time to serialize properties into /tmp/LTL3283134735659992461.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17635637674563912331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3283134735659992461.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("((u45.Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8<1)||(i3.u85.Node11NotifyThatHeIsActive<1))"))||("((i17.u86.Node11...238
Formula 0 simplified : XXG(!"((i17.u86.Node11ManageTheCrashOfNode4>=1)&&(i17.u20.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))" & F!"((u45.Node2ThinksNode11Shou...228
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLFireability-13 finished in 449872 ms.
[2024-05-24 17:58:31] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3097700865920486558
[2024-05-24 17:58:31] [INFO ] Too many transitions (2721) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:58:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3097700865920486558
Running compilation step : cd /tmp/ltsmin3097700865920486558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 17:58:31] [INFO ] Applying decomposition
[2024-05-24 17:58:32] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3455547367818268473.txt' '-o' '/tmp/graph3455547367818268473.bin' '-w' '/tmp/graph3455547367818268473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3455547367818268473.bin' '-l' '-1' '-v' '-w' '/tmp/graph3455547367818268473.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:58:32] [INFO ] Decomposing Gal with order
[2024-05-24 17:58:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:58:32] [INFO ] Removed a total of 3230 redundant transitions.
[2024-05-24 17:58:32] [INFO ] Flatten gal took : 134 ms
[2024-05-24 17:58:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1723 labels/synchronizations in 70 ms.
[2024-05-24 17:58:32] [INFO ] Time to serialize gal into /tmp/LTLFireability13439998638224694495.gal : 153 ms
[2024-05-24 17:58:32] [INFO ] Time to serialize properties into /tmp/LTLFireability15789464945616516637.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13439998638224694495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15789464945616516637.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((F((G(("(((i8.u88.Node6DontAnswerToAnyNode<1)||(i8.u116.Node11IsActive<1))&&((u11.Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<...419
Formula 0 simplified : G(F(!"(((i8.u88.Node6DontAnswerToAnyNode<1)||(i8.u116.Node11IsActive<1))&&((u11.Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8<1)...409
Compilation finished in 7293 ms.
Running link step : cd /tmp/ltsmin3097700865920486558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin3097700865920486558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((<>((LTLAPp1==true))&&(LTLAPp0==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
BK_STOP 1716573602624
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-S16C06"
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-5568"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, 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 r246-tall-171654350700036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;