About the Execution of ITS-Tools for MedleyA-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1165229.00 | 0.00 | 0.00 | TFFTFFTFTTFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is MedleyA-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100219
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 89K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-16-LTLCardinality-00
FORMULA_NAME MedleyA-PT-16-LTLCardinality-01
FORMULA_NAME MedleyA-PT-16-LTLCardinality-02
FORMULA_NAME MedleyA-PT-16-LTLCardinality-03
FORMULA_NAME MedleyA-PT-16-LTLCardinality-04
FORMULA_NAME MedleyA-PT-16-LTLCardinality-05
FORMULA_NAME MedleyA-PT-16-LTLCardinality-06
FORMULA_NAME MedleyA-PT-16-LTLCardinality-07
FORMULA_NAME MedleyA-PT-16-LTLCardinality-08
FORMULA_NAME MedleyA-PT-16-LTLCardinality-09
FORMULA_NAME MedleyA-PT-16-LTLCardinality-10
FORMULA_NAME MedleyA-PT-16-LTLCardinality-11
FORMULA_NAME MedleyA-PT-16-LTLCardinality-12
FORMULA_NAME MedleyA-PT-16-LTLCardinality-13
FORMULA_NAME MedleyA-PT-16-LTLCardinality-14
FORMULA_NAME MedleyA-PT-16-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748870182126
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 13:16:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 13:16:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 13:16:25] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2025-06-02 13:16:25] [INFO ] Transformed 196 places.
[2025-06-02 13:16:25] [INFO ] Transformed 392 transitions.
[2025-06-02 13:16:25] [INFO ] Found NUPN structural information;
[2025-06-02 13:16:25] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 173 transition count 354
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 173 transition count 354
Applied a total of 46 rules in 85 ms. Remains 173 /196 variables (removed 23) and now considering 354/390 (removed 36) transitions.
// Phase 1: matrix 354 rows 173 cols
[2025-06-02 13:16:25] [INFO ] Computed 7 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:26] [INFO ] Implicit Places using invariants in 512 ms returned []
[2025-06-02 13:16:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:16:26] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2025-06-02 13:16:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:35] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:35] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:35] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:35] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:36] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:36] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:36] [INFO ] Deduced a trap composed of 96 places in 195 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:36] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:37] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:37] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:37] [INFO ] Deduced a trap composed of 94 places in 196 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:38] [INFO ] Deduced a trap composed of 113 places in 219 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:38] [INFO ] Deduced a trap composed of 113 places in 176 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:38] [INFO ] Deduced a trap composed of 123 places in 220 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:39] [INFO ] Deduced a trap composed of 124 places in 231 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:39] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:39] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:40] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:42] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:42] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:43] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/527 variables, 173/201 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:16:55] [INFO ] Deduced a trap composed of 119 places in 198 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 202 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:01] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/527 variables, 173/203 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 353/556 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:19] [INFO ] Deduced a trap composed of 106 places in 217 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:19] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 26 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 558 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Starting structural reductions in LTL mode, iteration 1 : 173/196 places, 354/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61843 ms. Remains : 173/196 places, 354/390 transitions.
Support contains 38 out of 173 places after structural reductions.
[2025-06-02 13:17:27] [INFO ] Flatten gal took : 79 ms
[2025-06-02 13:17:27] [INFO ] Flatten gal took : 37 ms
[2025-06-02 13:17:27] [INFO ] Input system was already deterministic with 354 transitions.
RANDOM walk for 40000 steps (8 resets) in 2089 ms. (19 steps per ms) remains 17/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 107 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 126 ms. (31 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 121 ms. (32 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 149 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 106 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 95 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 104 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
[2025-06-02 13:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 134/164 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 9/173 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 354/527 variables, 173/180 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/527 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 180 constraints, problems are : Problem set: 1 solved, 15 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 136/164 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:30] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 9/173 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:30] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 354/527 variables, 173/182 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 15/197 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:31] [INFO ] Deduced a trap along path composed of 24 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:31] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 2/199 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:31] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:32] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 2/201 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:32] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 23 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/527 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 202 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5672ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 354/354 transitions.
Graph (trivial) has 134 edges and 173 vertex of which 9 / 173 are part of one of the 2 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 166 transition count 330
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 151 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 150 transition count 329
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 33 place count 150 transition count 323
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 45 place count 144 transition count 323
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 141 transition count 318
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 141 transition count 318
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 97 place count 118 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 118 transition count 293
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 117 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 117 transition count 291
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -135
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 141 place count 97 transition count 426
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 148 place count 97 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 5 with 60 rules applied. Total rules applied 208 place count 97 transition count 359
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 212 place count 95 transition count 385
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 213 place count 95 transition count 384
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 95 transition count 382
Free-agglomeration rule applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 227 place count 95 transition count 370
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 242 place count 83 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 245 place count 83 transition count 364
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 83 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 83 transition count 363
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 249 place count 82 transition count 362
Applied a total of 249 rules in 286 ms. Remains 82 /173 variables (removed 91) and now considering 362/354 (removed -8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 82/173 places, 362/354 transitions.
RANDOM walk for 40000 steps (8 resets) in 852 ms. (46 steps per ms) remains 9/15 properties
BEST_FIRST walk for 40000 steps (8 resets) in 396 ms. (100 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/4 properties
[2025-06-02 13:17:35] [INFO ] Flow matrix only has 308 transitions (discarded 54 similar events)
// Phase 1: matrix 308 rows 82 cols
[2025-06-02 13:17:35] [INFO ] Computed 7 invariants in 13 ms
[2025-06-02 13:17:35] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 161/192 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/360 variables, 30/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/376 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/385 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/386 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/386 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/389 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/390 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/390 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/390 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/390 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 140 constraints, problems are : Problem set: 0 solved, 2 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 161/192 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 168/360 variables, 30/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 16/376 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/385 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/385 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/386 variables, 11/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/386 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 3/389 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/390 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/390 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/390 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/390 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 142 constraints, problems are : Problem set: 0 solved, 2 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 763ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 22 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 362/362 transitions.
Graph (trivial) has 74 edges and 82 vertex of which 2 / 82 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 10 rules applied. Total rules applied 11 place count 81 transition count 350
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 71 transition count 349
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 71 transition count 348
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 70 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 66 transition count 340
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 66 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 66 transition count 337
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 52 place count 57 transition count 329
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 53 edges and 57 vertex of which 9 / 57 are part of one of the 4 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 67 place count 52 transition count 315
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 95 place count 52 transition count 287
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 96 place count 51 transition count 285
Iterating global reduction 5 with 1 rules applied. Total rules applied 97 place count 51 transition count 285
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 113 place count 43 transition count 331
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 128 place count 43 transition count 316
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 130 place count 41 transition count 292
Iterating global reduction 6 with 2 rules applied. Total rules applied 132 place count 41 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 6 with 75 rules applied. Total rules applied 207 place count 41 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 209 place count 40 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 215 place count 40 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 224 place count 40 transition count 215
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 228 place count 40 transition count 211
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 233 place count 36 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 246 place count 36 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 247 place count 35 transition count 196
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 17 edges and 34 vertex of which 2 / 34 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 249 place count 33 transition count 196
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 260 place count 33 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 10 with 28 rules applied. Total rules applied 288 place count 33 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 288 place count 33 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 290 place count 32 transition count 156
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 291 place count 31 transition count 155
Iterating global reduction 10 with 1 rules applied. Total rules applied 292 place count 31 transition count 155
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 293 place count 30 transition count 153
Iterating global reduction 10 with 1 rules applied. Total rules applied 294 place count 30 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 298 place count 28 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 309 place count 28 transition count 140
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 310 place count 28 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 311 place count 27 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 312 place count 27 transition count 138
Applied a total of 312 rules in 79 ms. Remains 27 /82 variables (removed 55) and now considering 138/362 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 27/82 places, 138/362 transitions.
RANDOM walk for 10509 steps (69 resets) in 71 ms. (145 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U ((X(X(X(p0)))&&G((!p1||F(!p2))))||X(X(X(G(p0)))))))'
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 354/354 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 159 transition count 332
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 159 transition count 332
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 38 place count 159 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 158 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 158 transition count 321
Applied a total of 40 rules in 16 ms. Remains 158 /173 variables (removed 15) and now considering 321/354 (removed 33) transitions.
// Phase 1: matrix 321 rows 158 cols
[2025-06-02 13:17:37] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:17:37] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 13:17:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:17:37] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2025-06-02 13:17:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:41] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:42] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:42] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:42] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:42] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:42] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:42] [INFO ] Deduced a trap composed of 88 places in 168 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:43] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:43] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:43] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:44] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:44] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:44] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:44] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:44] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:44] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:45] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:46] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:47] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:51] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:17:51] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 321/479 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:00] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/479 variables, and 187 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/479 variables, 158/187 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 320/507 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:20] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 508 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 158/173 places, 321/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60520 ms. Remains : 158/173 places, 321/354 transitions.
Stuttering acceptance computed with spot in 1492 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0) p1), true, (AND p1 p2 (NOT p0)), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), p2, (AND p2 p1 p0), (AND p2 p1 (NOT p0)), (AND p2 p1 p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-02
Product exploration explored 100000 steps with 16754 reset in 615 ms.
Product exploration explored 100000 steps with 16800 reset in 429 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 p2 p0)), (X p0), (X (NOT (AND p1 p2 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p2 p0))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2 p0))), (X (X p0)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 346 ms. Reduced automaton from 18 states, 45 edges and 3 AP (stutter sensitive) to 18 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 948 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), true, (AND p2 (NOT p0) p1), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), p2, (AND p2 p0 p1), (AND p2 (NOT p0) p1), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 627 ms. (63 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 286 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 281 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 224 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 257 ms. (155 steps per ms) remains 7/7 properties
[2025-06-02 13:18:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 140/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 12/158 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 321/479 variables, 158/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 165 constraints, problems are : Problem set: 0 solved, 7 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 140/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:43] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 12/158 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 321/479 variables, 158/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:44] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:44] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:44] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 176 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2183 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2775ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 1568 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 321/321 transitions.
Graph (trivial) has 156 edges and 158 vertex of which 9 / 158 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 151 transition count 284
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 123 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 121 transition count 280
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 63 place count 121 transition count 271
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 81 place count 112 transition count 271
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 108 transition count 263
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 108 transition count 263
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 137 place count 84 transition count 239
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 143 place count 84 transition count 233
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 82 transition count 227
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 82 transition count 227
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 183 place count 64 transition count 333
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 190 place count 64 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 5 with 47 rules applied. Total rules applied 237 place count 64 transition count 279
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 243 place count 61 transition count 318
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 61 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 61 transition count 316
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 257 place count 61 transition count 297
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 284 place count 49 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 301 place count 49 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 302 place count 48 transition count 264
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 24 edges and 47 vertex of which 2 / 47 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 304 place count 46 transition count 264
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 316 place count 46 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 347 place count 46 transition count 221
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 349 place count 44 transition count 211
Iterating global reduction 9 with 2 rules applied. Total rules applied 351 place count 44 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 353 place count 43 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 357 place count 43 transition count 206
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 359 place count 43 transition count 204
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 362 place count 41 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 366 place count 41 transition count 199
Applied a total of 366 rules in 98 ms. Remains 41 /158 variables (removed 117) and now considering 199/321 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 41/158 places, 199/321 transitions.
RANDOM walk for 40000 steps (292 resets) in 343 ms. (116 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (119 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
[2025-06-02 13:18:46] [INFO ] Flow matrix only has 161 transitions (discarded 38 similar events)
// Phase 1: matrix 161 rows 41 cols
[2025-06-02 13:18:46] [INFO ] Computed 6 invariants in 1 ms
[2025-06-02 13:18:46] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 159/198 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/202 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 24/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 89 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:47] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:47] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 159/198 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/202 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 41/41 places, 199/199 transitions.
RANDOM walk for 40000 steps (487 resets) in 339 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36907 steps (310 resets) in 85 ms. (429 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 p2 p0)), (X p0), (X (NOT (AND p1 p2 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p2 p0))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2 p0))), (X (X p0)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (AND p1 p2 p0))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) (NOT p0))))]
Knowledge based reduction with 18 factoid took 898 ms. Reduced automaton from 18 states, 41 edges and 3 AP (stutter sensitive) to 18 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1007 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), true, (AND p2 (NOT p0) p1), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), p2, (AND p2 p0 p1), (AND p2 (NOT p0) p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 1006 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), true, (AND p2 (NOT p0) p1), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), p2, (AND p2 p0 p1), (AND p2 (NOT p0) p1), (AND p2 p0 p1)]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 321/321 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 158 cols
[2025-06-02 13:18:50] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:18:50] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-02 13:18:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:18:50] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2025-06-02 13:18:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:56] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:56] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:56] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:57] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:57] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:57] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:57] [INFO ] Deduced a trap composed of 88 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:58] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:58] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:59] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:59] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:59] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:59] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:18:59] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:00] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:00] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:00] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:01] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:02] [INFO ] Deduced a trap composed of 108 places in 181 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:06] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:07] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 321/479 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:17] [INFO ] Deduced a trap composed of 109 places in 202 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/479 variables, and 187 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/479 variables, 158/187 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 320/507 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:34] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 508 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Finished structural reductions in LTL mode , in 1 iterations and 60658 ms. Remains : 158/158 places, 321/321 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 p2 p0)), (X p0), (X (NOT (AND p1 p2 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p2 p0))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2 p0))), (X (X p0)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 369 ms. Reduced automaton from 18 states, 41 edges and 3 AP (stutter sensitive) to 18 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1028 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), true, (AND p2 (NOT p0) p1), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), p2, (AND p2 p0 p1), (AND p2 (NOT p0) p1), (AND p2 p0 p1)]
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
[2025-06-02 13:19:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 140/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 12/158 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 321/479 variables, 158/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 165 constraints, problems are : Problem set: 0 solved, 7 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 140/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:53] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:54] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 12/158 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:54] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 321/479 variables, 158/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:54] [INFO ] Deduced a trap composed of 90 places in 176 ms of which 20 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:55] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:19:55] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/479 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 178 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2549 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3111ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 6 properties in 338 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 321/321 transitions.
Graph (trivial) has 156 edges and 158 vertex of which 9 / 158 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 151 transition count 284
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 123 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 121 transition count 280
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 63 place count 121 transition count 271
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 81 place count 112 transition count 271
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 108 transition count 263
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 108 transition count 263
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 137 place count 84 transition count 239
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 143 place count 84 transition count 233
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 82 transition count 227
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 82 transition count 227
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 183 place count 64 transition count 333
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 190 place count 64 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 5 with 47 rules applied. Total rules applied 237 place count 64 transition count 279
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 243 place count 61 transition count 318
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 61 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 61 transition count 316
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 257 place count 61 transition count 297
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 284 place count 49 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 301 place count 49 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 302 place count 48 transition count 264
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 24 edges and 47 vertex of which 2 / 47 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 304 place count 46 transition count 264
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 316 place count 46 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 347 place count 46 transition count 221
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 349 place count 44 transition count 211
Iterating global reduction 9 with 2 rules applied. Total rules applied 351 place count 44 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 353 place count 43 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 357 place count 43 transition count 206
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 359 place count 43 transition count 204
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 362 place count 41 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 366 place count 41 transition count 199
Applied a total of 366 rules in 91 ms. Remains 41 /158 variables (removed 117) and now considering 199/321 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 41/158 places, 199/321 transitions.
RANDOM walk for 40000 steps (300 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32235 steps (181 resets) in 53 ms. (596 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 p2 p0)), (X p0), (X (NOT (AND p1 p2 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) p2 p0))), (X (X p2)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2 p0))), (X (X p0)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 p2 p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p1)), (F (NOT (AND p2 p1))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 17 factoid took 951 ms. Reduced automaton from 18 states, 41 edges and 3 AP (stutter sensitive) to 18 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 998 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), true, (AND p2 (NOT p0) p1), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), p2, (AND p2 p0 p1), (AND p2 (NOT p0) p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 994 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), true, (AND p2 (NOT p0) p1), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), p2, (AND p2 p0 p1), (AND p2 (NOT p0) p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 995 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), true, (AND p2 (NOT p0) p1), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), p2, (AND p2 p0 p1), (AND p2 (NOT p0) p1), (AND p2 p0 p1)]
Product exploration explored 100000 steps with 17891 reset in 176 ms.
Product exploration explored 100000 steps with 17890 reset in 206 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, false, false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 1027 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), true, (AND p2 (NOT p0) p1), (AND p2 (NOT p0)), (AND p2 (NOT p0) p1), p2, (AND p2 p0 p1), (AND p2 (NOT p0) p1), (AND p2 p0 p1)]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 321/321 transitions.
Graph (trivial) has 156 edges and 158 vertex of which 9 / 158 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 151 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 151 transition count 312
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 31 place count 151 transition count 315
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 151 transition count 315
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 42 place count 143 transition count 305
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 143 transition count 305
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 77 place count 143 transition count 306
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 94 place count 126 transition count 282
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 111 place count 126 transition count 282
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -180
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 132 place count 126 transition count 462
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 126 transition count 459
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 146 place count 115 transition count 437
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 157 place count 115 transition count 437
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 115 transition count 451
Deduced a syphon composed of 51 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 3 with 65 rules applied. Total rules applied 223 place count 115 transition count 386
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 227 place count 111 transition count 380
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 231 place count 111 transition count 380
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 233 place count 111 transition count 412
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 233 rules in 123 ms. Remains 111 /158 variables (removed 47) and now considering 412/321 (removed -91) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:20:02] [INFO ] Redundant transitions in 51 ms returned []
Running 411 sub problems to find dead transitions.
[2025-06-02 13:20:02] [INFO ] Flow matrix only has 358 transitions (discarded 54 similar events)
// Phase 1: matrix 358 rows 111 cols
[2025-06-02 13:20:02] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 13:20:02] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:07] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 13 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:07] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:07] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 7 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:07] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:07] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 4 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:08] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:08] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:08] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 16 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:08] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 5 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:08] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 13 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 10/17 constraints. Problems are: Problem set: 72 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:20:10] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD131 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/18 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 5 (OVERLAPS) 357/468 variables, 111/129 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 78/207 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/207 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 1/469 variables, 1/208 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/208 constraints. Problems are: Problem set: 73 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 469/469 variables, and 208 constraints, problems are : Problem set: 73 solved, 338 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 111/111 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 73 solved, 338 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 50/111 variables, 7/7 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 11/18 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/18 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 357/468 variables, 111/129 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 78/207 constraints. Problems are: Problem set: 73 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 338/545 constraints. Problems are: Problem set: 73 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/469 variables, and 545 constraints, problems are : Problem set: 73 solved, 338 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 111/111 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 338/411 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60289ms problems are : Problem set: 73 solved, 338 unsolved
Search for dead transitions found 73 dead transitions in 60293ms
Found 73 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 73 transitions
Dead transitions reduction (with SMT) removed 73 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 111/158 places, 339/321 transitions.
Graph (complete) has 487 edges and 111 vertex of which 62 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.4 ms
Discarding 49 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 62 /111 variables (removed 49) and now considering 339/339 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/158 places, 339/321 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60508 ms. Remains : 62/158 places, 339/321 transitions.
Built C files in :
/tmp/ltsmin15675197488369643039
[2025-06-02 13:21:03] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15675197488369643039
Running compilation step : cd /tmp/ltsmin15675197488369643039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1402 ms.
Running link step : cd /tmp/ltsmin15675197488369643039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin15675197488369643039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3000993996863176850.hoa' '--buchi-type=spotba'
LTSmin run took 391 ms.
FORMULA MedleyA-PT-16-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLCardinality-02 finished in 207989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p1)||p0)))))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 354/354 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 156 transition count 326
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 156 transition count 326
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 49 place count 156 transition count 311
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 154 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 154 transition count 309
Applied a total of 53 rules in 12 ms. Remains 154 /173 variables (removed 19) and now considering 309/354 (removed 45) transitions.
// Phase 1: matrix 309 rows 154 cols
[2025-06-02 13:21:05] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:21:05] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 13:21:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:21:05] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2025-06-02 13:21:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:10] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:11] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:11] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:11] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:11] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:11] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:12] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:12] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:13] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:13] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:13] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:13] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:13] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:14] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:14] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:14] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:14] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:14] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:15] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/463 variables, 154/180 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:23] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:24] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 182 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/463 variables, 154/182 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 308/490 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:48] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:21:48] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:03] [INFO ] Deduced a trap composed of 86 places in 166 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 493 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 154/173 places, 309/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60610 ms. Remains : 154/173 places, 309/354 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-03
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Product exploration explored 100000 steps with 25000 reset in 164 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/4 properties
[2025-06-02 13:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/154 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 309/463 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 161 constraints, problems are : Problem set: 0 solved, 2 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/154 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 309/463 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:07] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:07] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:07] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/463 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 981ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 309/309 transitions.
Graph (trivial) has 154 edges and 154 vertex of which 13 / 154 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 144 transition count 270
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 28 rules applied. Total rules applied 55 place count 118 transition count 268
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 117 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 116 transition count 267
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 58 place count 116 transition count 260
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 72 place count 109 transition count 260
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 109 transition count 259
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 76 place count 106 transition count 253
Iterating global reduction 5 with 3 rules applied. Total rules applied 79 place count 106 transition count 253
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 125 place count 83 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 130 place count 83 transition count 225
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 133 place count 80 transition count 217
Iterating global reduction 6 with 3 rules applied. Total rules applied 136 place count 80 transition count 217
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -128
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 174 place count 61 transition count 345
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 180 place count 61 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 7 with 48 rules applied. Total rules applied 228 place count 61 transition count 291
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 234 place count 58 transition count 332
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 235 place count 58 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 236 place count 58 transition count 330
Free-agglomeration rule applied 13 times with reduction of 6 identical transitions.
Iterating global reduction 8 with 13 rules applied. Total rules applied 249 place count 58 transition count 311
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 286 place count 45 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 308 place count 45 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 309 place count 44 transition count 264
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 26 edges and 42 vertex of which 4 / 42 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 312 place count 40 transition count 264
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 338 place count 40 transition count 238
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 339 place count 39 transition count 232
Iterating global reduction 11 with 1 rules applied. Total rules applied 340 place count 39 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 11 with 53 rules applied. Total rules applied 393 place count 39 transition count 179
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 395 place count 37 transition count 175
Iterating global reduction 11 with 2 rules applied. Total rules applied 397 place count 37 transition count 175
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 398 place count 36 transition count 173
Iterating global reduction 11 with 1 rules applied. Total rules applied 399 place count 36 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 403 place count 34 transition count 171
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 405 place count 34 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 407 place count 32 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 409 place count 32 transition count 167
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 410 place count 32 transition count 167
Applied a total of 410 rules in 111 ms. Remains 32 /154 variables (removed 122) and now considering 167/309 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 32/154 places, 167/309 transitions.
RANDOM walk for 40000 steps (505 resets) in 223 ms. (178 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (86 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2025-06-02 13:22:08] [INFO ] Flow matrix only has 147 transitions (discarded 20 similar events)
// Phase 1: matrix 147 rows 32 cols
[2025-06-02 13:22:08] [INFO ] Computed 5 invariants in 2 ms
[2025-06-02 13:22:08] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/132 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/179 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/132 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/179 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:08] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/179 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 167/167 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 32/32 places, 167/167 transitions.
RANDOM walk for 40000 steps (309 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (77 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1789 steps, run visited all 1 properties in 15 ms. (steps per millisecond=119 )
Probabilistic random walk after 1789 steps, saw 668 distinct states, run finished after 21 ms. (steps per millisecond=85 ) properties seen :1
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 309/309 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 154 cols
[2025-06-02 13:22:09] [INFO ] Computed 7 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:22:09] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-02 13:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:22:09] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2025-06-02 13:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:13] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:13] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:14] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:14] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:14] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:14] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:14] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:15] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:15] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:16] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:16] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:16] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:16] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:16] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:17] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:17] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:17] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:17] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:17] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/463 variables, 154/180 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:25] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:26] [INFO ] Deduced a trap composed of 107 places in 95 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 182 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/463 variables, 154/182 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 308/490 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:51] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:22:52] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:05] [INFO ] Deduced a trap composed of 86 places in 165 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 493 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in LTL mode , in 1 iterations and 60494 ms. Remains : 154/154 places, 309/309 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
[2025-06-02 13:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/154 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 309/463 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 161 constraints, problems are : Problem set: 0 solved, 2 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/154 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 309/463 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:10] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:10] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:11] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/463 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1328ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 309/309 transitions.
Graph (trivial) has 154 edges and 154 vertex of which 13 / 154 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 144 transition count 270
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 28 rules applied. Total rules applied 55 place count 118 transition count 268
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 117 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 116 transition count 267
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 58 place count 116 transition count 260
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 72 place count 109 transition count 260
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 109 transition count 259
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 76 place count 106 transition count 253
Iterating global reduction 5 with 3 rules applied. Total rules applied 79 place count 106 transition count 253
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 125 place count 83 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 130 place count 83 transition count 225
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 133 place count 80 transition count 217
Iterating global reduction 6 with 3 rules applied. Total rules applied 136 place count 80 transition count 217
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -128
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 174 place count 61 transition count 345
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 180 place count 61 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 7 with 48 rules applied. Total rules applied 228 place count 61 transition count 291
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 234 place count 58 transition count 332
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 235 place count 58 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 236 place count 58 transition count 330
Free-agglomeration rule applied 13 times with reduction of 6 identical transitions.
Iterating global reduction 8 with 13 rules applied. Total rules applied 249 place count 58 transition count 311
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 286 place count 45 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 308 place count 45 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 309 place count 44 transition count 264
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 26 edges and 42 vertex of which 4 / 42 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 312 place count 40 transition count 264
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 10 with 26 rules applied. Total rules applied 338 place count 40 transition count 238
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 339 place count 39 transition count 232
Iterating global reduction 11 with 1 rules applied. Total rules applied 340 place count 39 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 11 with 53 rules applied. Total rules applied 393 place count 39 transition count 179
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 395 place count 37 transition count 175
Iterating global reduction 11 with 2 rules applied. Total rules applied 397 place count 37 transition count 175
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 398 place count 36 transition count 173
Iterating global reduction 11 with 1 rules applied. Total rules applied 399 place count 36 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 403 place count 34 transition count 171
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 405 place count 34 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 407 place count 32 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 409 place count 32 transition count 167
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 410 place count 32 transition count 167
Applied a total of 410 rules in 101 ms. Remains 32 /154 variables (removed 122) and now considering 167/309 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 32/154 places, 167/309 transitions.
RANDOM walk for 40000 steps (216 resets) in 155 ms. (256 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (58 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
[2025-06-02 13:23:11] [INFO ] Flow matrix only has 147 transitions (discarded 20 similar events)
// Phase 1: matrix 147 rows 32 cols
[2025-06-02 13:23:11] [INFO ] Computed 5 invariants in 2 ms
[2025-06-02 13:23:11] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/132 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/179 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/132 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 47/179 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:12] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/179 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 167/167 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 32/32 places, 167/167 transitions.
RANDOM walk for 40000 steps (106 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30685 steps (69 resets) in 116 ms. (262 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 229 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 87 ms.
Product exploration explored 100000 steps with 25000 reset in 102 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 309/309 transitions.
Graph (trivial) has 154 edges and 154 vertex of which 13 / 154 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 144 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 144 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 29 place count 144 transition count 300
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 144 transition count 300
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 38 place count 137 transition count 291
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 137 transition count 291
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 71 place count 137 transition count 292
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 87 place count 121 transition count 270
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 103 place count 121 transition count 270
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -198
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 123 place count 121 transition count 468
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 127 place count 121 transition count 464
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 136 place count 112 transition count 446
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 145 place count 112 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 112 transition count 456
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 111 transition count 454
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 111 transition count 454
Deduced a syphon composed of 49 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 223 place count 111 transition count 379
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 227 place count 107 transition count 375
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 231 place count 107 transition count 375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 5 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 232 place count 107 transition count 375
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 233 place count 106 transition count 374
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 234 place count 106 transition count 374
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 106 transition count 406
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 236 rules in 60 ms. Remains 106 /154 variables (removed 48) and now considering 406/309 (removed -97) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:23:13] [INFO ] Redundant transitions in 13 ms returned []
Running 405 sub problems to find dead transitions.
[2025-06-02 13:23:13] [INFO ] Flow matrix only has 352 transitions (discarded 54 similar events)
// Phase 1: matrix 352 rows 106 cols
[2025-06-02 13:23:13] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 13:23:13] [INFO ] State equation strengthened by 80 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:19] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 12 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:19] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:19] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 5 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:19] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 4 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:19] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:20] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 12 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:20] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 12 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:20] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 12 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:20] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 13 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD293 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 9/16 constraints. Problems are: Problem set: 66 solved, 339 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:22] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:23:22] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Problem TDEAD109 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 2/18 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 351/457 variables, 106/124 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 79/203 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/203 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 8 (OVERLAPS) 1/458 variables, 1/204 constraints. Problems are: Problem set: 68 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/458 variables, and 204 constraints, problems are : Problem set: 68 solved, 337 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 68 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 7/7 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 11/18 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 351/457 variables, 106/124 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 79/203 constraints. Problems are: Problem set: 68 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 337/540 constraints. Problems are: Problem set: 68 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/458 variables, and 540 constraints, problems are : Problem set: 68 solved, 337 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 106/106 constraints, ReadFeed: 79/80 constraints, PredecessorRefiner: 337/405 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60244ms problems are : Problem set: 68 solved, 337 unsolved
Search for dead transitions found 68 dead transitions in 60247ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 106/154 places, 338/309 transitions.
Graph (complete) has 458 edges and 106 vertex of which 59 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.1 ms
Discarding 47 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 59 /106 variables (removed 47) and now considering 338/338 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/154 places, 338/309 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60347 ms. Remains : 59/154 places, 338/309 transitions.
Built C files in :
/tmp/ltsmin16413303343556793456
[2025-06-02 13:24:14] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16413303343556793456
Running compilation step : cd /tmp/ltsmin16413303343556793456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1045 ms.
Running link step : cd /tmp/ltsmin16413303343556793456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin16413303343556793456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7769607747707779803.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA MedleyA-PT-16-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLCardinality-03 finished in 190377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 354/354 transitions.
Graph (trivial) has 185 edges and 173 vertex of which 9 / 173 are part of one of the 2 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 165 transition count 313
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 132 transition count 309
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 130 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 129 transition count 308
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 75 place count 129 transition count 300
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 91 place count 121 transition count 300
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 109 place count 103 transition count 268
Iterating global reduction 4 with 18 rules applied. Total rules applied 127 place count 103 transition count 268
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 4 with 16 rules applied. Total rules applied 143 place count 103 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 144 place count 102 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 144 place count 102 transition count 250
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 148 place count 100 transition count 250
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 150 place count 98 transition count 244
Iterating global reduction 6 with 2 rules applied. Total rules applied 152 place count 98 transition count 244
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 192 place count 78 transition count 224
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 197 place count 78 transition count 219
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 200 place count 75 transition count 212
Iterating global reduction 7 with 3 rules applied. Total rules applied 203 place count 75 transition count 212
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 237 place count 58 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 238 place count 58 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 8 with 27 rules applied. Total rules applied 265 place count 58 transition count 290
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 269 place count 56 transition count 316
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 270 place count 55 transition count 315
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 53 edges and 53 vertex of which 18 / 53 are part of one of the 7 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 273 place count 42 transition count 315
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 316 place count 42 transition count 272
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 318 place count 40 transition count 250
Iterating global reduction 10 with 2 rules applied. Total rules applied 320 place count 40 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 10 with 69 rules applied. Total rules applied 389 place count 40 transition count 181
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 391 place count 38 transition count 172
Iterating global reduction 10 with 2 rules applied. Total rules applied 393 place count 38 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 397 place count 36 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 399 place count 35 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 403 place count 35 transition count 172
Applied a total of 403 rules in 49 ms. Remains 35 /173 variables (removed 138) and now considering 172/354 (removed 182) transitions.
[2025-06-02 13:24:15] [INFO ] Flow matrix only has 153 transitions (discarded 19 similar events)
// Phase 1: matrix 153 rows 35 cols
[2025-06-02 13:24:15] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 13:24:15] [INFO ] Flow matrix only has 153 transitions (discarded 19 similar events)
[2025-06-02 13:24:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 13:24:15] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:24:15] [INFO ] Redundant transitions in 38 ms returned [117, 150, 151, 155]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 164 sub problems to find dead transitions.
[2025-06-02 13:24:15] [INFO ] Flow matrix only has 149 transitions (discarded 19 similar events)
// Phase 1: matrix 149 rows 35 cols
[2025-06-02 13:24:15] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 13:24:15] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:16] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:16] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:16] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:16] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 148/183 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 37/81 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/183 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/184 variables, and 81 constraints, problems are : Problem set: 0 solved, 164 unsolved in 6939 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 148/183 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 37/81 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 164/245 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:26] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/184 variables, and 246 constraints, problems are : Problem set: 0 solved, 164 unsolved in 15334 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22373ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 22375ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/173 places, 168/354 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 33 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 33 transition count 162
Applied a total of 8 rules in 6 ms. Remains 33 /35 variables (removed 2) and now considering 162/168 (removed 6) transitions.
[2025-06-02 13:24:38] [INFO ] Flow matrix only has 143 transitions (discarded 19 similar events)
// Phase 1: matrix 143 rows 33 cols
[2025-06-02 13:24:38] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-02 13:24:38] [INFO ] Flow matrix only has 143 transitions (discarded 19 similar events)
[2025-06-02 13:24:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-02 13:24:38] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/173 places, 162/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22833 ms. Remains : 33/173 places, 162/354 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 121 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2615 steps (592 resets) in 6 ms. (373 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2025-06-02 13:24:39] [INFO ] Flow matrix only has 143 transitions (discarded 19 similar events)
[2025-06-02 13:24:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-02 13:24:39] [INFO ] Flow matrix only has 143 transitions (discarded 19 similar events)
[2025-06-02 13:24:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:39] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-02 13:24:39] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:24:39] [INFO ] Redundant transitions in 55 ms returned [116, 117, 136]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 155 sub problems to find dead transitions.
[2025-06-02 13:24:39] [INFO ] Flow matrix only has 140 transitions (discarded 19 similar events)
// Phase 1: matrix 140 rows 33 cols
[2025-06-02 13:24:39] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 13:24:39] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:40] [INFO ] Deduced a trap composed of 7 places in 645 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:40] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:40] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:40] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:41] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:24:41] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 139/172 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 33/77 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 0/172 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/173 variables, and 77 constraints, problems are : Problem set: 0 solved, 155 unsolved in 7654 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 33/33 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 139/172 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 33/77 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 155/232 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/173 variables, and 232 constraints, problems are : Problem set: 0 solved, 155 unsolved in 10892 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 33/33 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18645ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 18645ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/33 places, 159/162 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 32 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 32 transition count 150
Applied a total of 10 rules in 11 ms. Remains 32 /33 variables (removed 1) and now considering 150/159 (removed 9) transitions.
[2025-06-02 13:24:57] [INFO ] Flow matrix only has 134 transitions (discarded 16 similar events)
// Phase 1: matrix 134 rows 32 cols
[2025-06-02 13:24:57] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:58] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 13:24:58] [INFO ] Flow matrix only has 134 transitions (discarded 16 similar events)
[2025-06-02 13:24:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:24:58] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-02 13:24:58] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/33 places, 150/162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19196 ms. Remains : 32/33 places, 150/162 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3124 steps (726 resets) in 7 ms. (390 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 483 ms.
Built C files in :
/tmp/ltsmin17392004238812544688
[2025-06-02 13:24:59] [INFO ] Computing symmetric may disable matrix : 150 transitions.
[2025-06-02 13:24:59] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:24:59] [INFO ] Computing symmetric may enable matrix : 150 transitions.
[2025-06-02 13:24:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:24:59] [INFO ] Computing Do-Not-Accords matrix : 150 transitions.
[2025-06-02 13:24:59] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 13:24:59] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17392004238812544688
Running compilation step : cd /tmp/ltsmin17392004238812544688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 694 ms.
Running link step : cd /tmp/ltsmin17392004238812544688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17392004238812544688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16931193933468014125.hoa' '--buchi-type=spotba'
LTSmin run took 280 ms.
FORMULA MedleyA-PT-16-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLCardinality-04 finished in 45163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 354/354 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 158 transition count 329
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 158 transition count 329
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 45 place count 158 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 156 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 156 transition count 312
Applied a total of 49 rules in 11 ms. Remains 156 /173 variables (removed 17) and now considering 312/354 (removed 42) transitions.
// Phase 1: matrix 312 rows 156 cols
[2025-06-02 13:25:00] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:25:00] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-02 13:25:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:25:01] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-06-02 13:25:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:06] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:06] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:07] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:07] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:07] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:07] [INFO ] Deduced a trap composed of 88 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:07] [INFO ] Deduced a trap composed of 88 places in 169 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:08] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:08] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:08] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:09] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:09] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:09] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:09] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:10] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:10] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:10] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:10] [INFO ] Deduced a trap composed of 109 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:11] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:12] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:13] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:13] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/468 variables, 156/185 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:20] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:22] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:22] [INFO ] Deduced a trap composed of 109 places in 164 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 188 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:33] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:33] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:34] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:34] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/468 variables, 156/192 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 311/503 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:49] [INFO ] Deduced a trap along path composed of 2 places in 88 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:49] [INFO ] Deduced a trap along path composed of 2 places in 173 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:25:49] [INFO ] Deduced a trap along path composed of 17 places in 94 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 506 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 156/173 places, 312/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60587 ms. Remains : 156/173 places, 312/354 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-07 finished in 60795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||X(X(p1))))))))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 354/354 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 156 transition count 327
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 156 transition count 327
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 49 place count 156 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 154 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 154 transition count 310
Applied a total of 53 rules in 7 ms. Remains 154 /173 variables (removed 19) and now considering 310/354 (removed 44) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:26:01] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:26:01] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 13:26:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:26:01] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:26:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:06] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:06] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:06] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:06] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:06] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:07] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:07] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:07] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:08] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:08] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:08] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:08] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:08] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:08] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:09] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:09] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:11] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:11] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:17] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:17] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:17] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 182 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:35] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:36] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:37] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:37] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/186 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 309/495 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:26:58] [INFO ] Deduced a trap along path composed of 16 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 496 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 154/173 places, 310/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60516 ms. Remains : 154/173 places, 310/354 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-08
Product exploration explored 100000 steps with 14172 reset in 89 ms.
Product exploration explored 100000 steps with 14131 reset in 175 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/154 stabilizing places and 14/310 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 43 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 310/310 transitions.
Applied a total of 0 rules in 1 ms. Remains 154 /154 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2025-06-02 13:27:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:27:03] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 13:27:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:27:03] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:27:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:09] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:09] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:09] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:09] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:09] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:10] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:10] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:10] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:11] [INFO ] Deduced a trap composed of 101 places in 176 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:11] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:11] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:11] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:12] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:12] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:12] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:12] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:14] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:15] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:23] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:23] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:23] [INFO ] Deduced a trap composed of 107 places in 180 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 182 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:37] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:39] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:39] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:27:40] [INFO ] Deduced a trap composed of 107 places in 175 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/186 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 309/495 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:01] [INFO ] Deduced a trap along path composed of 16 places in 56 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 496 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Finished structural reductions in LTL mode , in 1 iterations and 60552 ms. Remains : 154/154 places, 310/310 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Detected a total of 14/154 stabilizing places and 14/310 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 63 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 14191 reset in 144 ms.
Product exploration explored 100000 steps with 14167 reset in 191 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 310/310 transitions.
Graph (trivial) has 156 edges and 154 vertex of which 13 / 154 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 144 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 144 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 30 place count 144 transition count 300
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 144 transition count 300
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 136 transition count 290
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 136 transition count 290
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 75 place count 136 transition count 292
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 94 place count 117 transition count 264
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 113 place count 117 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -151
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 131 place count 117 transition count 415
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 136 place count 117 transition count 410
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 145 place count 108 transition count 392
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 154 place count 108 transition count 392
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 108 transition count 401
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 107 transition count 399
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 107 transition count 399
Deduced a syphon composed of 46 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 3 with 37 rules applied. Total rules applied 194 place count 107 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 105 transition count 360
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 105 transition count 360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 105 transition count 360
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 104 transition count 359
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 104 transition count 359
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 104 transition count 391
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 203 rules in 44 ms. Remains 104 /154 variables (removed 50) and now considering 391/310 (removed -81) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:28:06] [INFO ] Redundant transitions in 3 ms returned []
Running 390 sub problems to find dead transitions.
[2025-06-02 13:28:06] [INFO ] Flow matrix only has 339 transitions (discarded 52 similar events)
// Phase 1: matrix 339 rows 104 cols
[2025-06-02 13:28:06] [INFO ] Computed 7 invariants in 1 ms
[2025-06-02 13:28:06] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:11] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 11 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:12] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:12] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 13 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:12] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:12] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:12] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:12] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:12] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 12 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:13] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:13] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 12 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:13] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 10 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 11/18 constraints. Problems are: Problem set: 66 solved, 324 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD111 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 2/20 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 5 (OVERLAPS) 338/442 variables, 104/124 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 68/192 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/192 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 8 (OVERLAPS) 1/443 variables, 1/193 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/193 constraints. Problems are: Problem set: 68 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/443 variables, and 193 constraints, problems are : Problem set: 68 solved, 322 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 68 solved, 322 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 47/104 variables, 7/7 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 13/20 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 338/442 variables, 104/124 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 68/192 constraints. Problems are: Problem set: 68 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 322/514 constraints. Problems are: Problem set: 68 solved, 322 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:28:54] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 1/515 constraints. Problems are: Problem set: 68 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/443 variables, and 515 constraints, problems are : Problem set: 68 solved, 322 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 104/104 constraints, ReadFeed: 68/69 constraints, PredecessorRefiner: 322/390 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 68 solved, 322 unsolved
Search for dead transitions found 68 dead transitions in 60146ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/154 places, 323/310 transitions.
Graph (complete) has 445 edges and 104 vertex of which 58 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.0 ms
Discarding 46 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 58 /104 variables (removed 46) and now considering 323/323 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/154 places, 323/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60209 ms. Remains : 58/154 places, 323/310 transitions.
Built C files in :
/tmp/ltsmin17670715790343097133
[2025-06-02 13:29:06] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17670715790343097133
Running compilation step : cd /tmp/ltsmin17670715790343097133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 980 ms.
Running link step : cd /tmp/ltsmin17670715790343097133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin17670715790343097133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13796807225317775693.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 310/310 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 310/310 (removed 0) transitions.
// Phase 1: matrix 310 rows 154 cols
[2025-06-02 13:29:21] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:29:21] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 13:29:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:29:22] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-06-02 13:29:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:28] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:28] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:28] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:28] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:28] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:28] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:29] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:29] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:30] [INFO ] Deduced a trap composed of 101 places in 181 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:30] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:30] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:30] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:31] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:31] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:31] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:31] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:33] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:34] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:42] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:42] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:42] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 182 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:54] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:56] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:56] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:29:57] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/186 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 309/495 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:17] [INFO ] Deduced a trap along path composed of 16 places in 70 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:20] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:20] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 498 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Finished structural reductions in LTL mode , in 1 iterations and 60523 ms. Remains : 154/154 places, 310/310 transitions.
Built C files in :
/tmp/ltsmin17166380980894111550
[2025-06-02 13:30:22] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17166380980894111550
Running compilation step : cd /tmp/ltsmin17166380980894111550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 882 ms.
Running link step : cd /tmp/ltsmin17166380980894111550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17166380980894111550;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6384376724820462059.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 13:30:37] [INFO ] Flatten gal took : 22 ms
[2025-06-02 13:30:37] [INFO ] Flatten gal took : 20 ms
[2025-06-02 13:30:37] [INFO ] Time to serialize gal into /tmp/LTL15913231380711480980.gal : 8 ms
[2025-06-02 13:30:37] [INFO ] Time to serialize properties into /tmp/LTL12333390903196263213.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15913231380711480980.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6010623103996434443.hoa' '-atoms' '/tmp/LTL12333390903196263213.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12333390903196263213.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6010623103996434443.hoa
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t16, t20, t31, t32, t33, t35, t39, t40, t45, t50, t53, t54, t57, t64, t66, t68, t69,...556
54 unique states visited
0 strongly connected components in search stack
56 transitions explored
23 items max in DFS search stack
797 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.05316,172404,1,0,639,712694,647,285,7094,722380,917
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-16-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-16-LTLCardinality-08 finished in 285389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((p1&&X(p2)))) U (!p3&&F(p2))))'
Support contains 8 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 354/354 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 160 transition count 333
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 160 transition count 333
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 37 place count 160 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 158 transition count 320
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 158 transition count 320
Applied a total of 41 rules in 7 ms. Remains 158 /173 variables (removed 15) and now considering 320/354 (removed 34) transitions.
// Phase 1: matrix 320 rows 158 cols
[2025-06-02 13:30:46] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:30:46] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 13:30:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:30:47] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2025-06-02 13:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:53] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:53] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:53] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:53] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:53] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:54] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:54] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:54] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:55] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:55] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:55] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:55] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:56] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:56] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:56] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:56] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:56] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:58] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:30:59] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 320/478 variables, 158/184 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 184 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:20] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:20] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:20] [INFO ] Deduced a trap composed of 90 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:21] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:23] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:24] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:24] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:27] [INFO ] Deduced a trap composed of 108 places in 198 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 320/478 variables, 158/192 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 319/511 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:41] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:41] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:41] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 514 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 158/173 places, 320/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60590 ms. Remains : 158/173 places, 320/354 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) p3), true, (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-11
Product exploration explored 100000 steps with 24932 reset in 489 ms.
Product exploration explored 100000 steps with 24950 reset in 281 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p3 p0 p2 p1), (X p2), (X p3), (X (AND p3 p0)), (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (AND p3 p0))), (X (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 166 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p2) p3), true, (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/8 properties
[2025-06-02 13:31:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 105/111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 47/158 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 320/478 variables, 158/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/478 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 165 constraints, problems are : Problem set: 0 solved, 6 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 105/111 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 47/158 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:49] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 320/478 variables, 158/166 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 5/171 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:49] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:50] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/478 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 173 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1487ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 775 ms.
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 320/320 transitions.
Graph (trivial) has 156 edges and 158 vertex of which 13 / 158 are part of one of the 3 SCC in 5 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 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 24 place count 148 transition count 284
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 125 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 123 transition count 280
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 53 place count 123 transition count 272
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 69 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 75 place count 109 transition count 260
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 109 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 109 transition count 258
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 108 transition count 254
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 108 transition count 254
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 133 place count 84 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 136 place count 84 transition count 227
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 137 place count 83 transition count 224
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 83 transition count 224
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -116
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 176 place count 64 transition count 340
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 182 place count 64 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 6 with 47 rules applied. Total rules applied 229 place count 64 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 233 place count 62 transition count 313
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 234 place count 62 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 62 transition count 311
Free-agglomeration rule applied 11 times with reduction of 4 identical transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 246 place count 62 transition count 296
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 270 place count 51 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 272 place count 50 transition count 296
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 277 place count 50 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 294 place count 50 transition count 274
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 296 place count 50 transition count 291
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 303 place count 48 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 10 with 25 rules applied. Total rules applied 328 place count 48 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 329 place count 47 transition count 260
Applied a total of 329 rules in 62 ms. Remains 47 /158 variables (removed 111) and now considering 260/320 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 47/158 places, 260/320 transitions.
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/5 properties
BEST_FIRST walk for 26818 steps (6 resets) in 47 ms. (558 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 p2 p1), (X p2), (X p3), (X (AND p3 p0)), (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (AND p3 p0))), (X (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p3 p2))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p3) (OR p1 (NOT p0))))), (F (NOT p0)), (F (NOT (OR (NOT p3) p0))), (F (NOT p2)), (F (NOT (AND p3 p0))), (F (NOT p3)), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 462 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[p3, true, (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 194 ms :[p3, true, (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p1)) (AND p1 (NOT p2))), (NOT p2)]
[2025-06-02 13:31:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 13:31:52] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
Proved EG p3
Knowledge obtained : [(AND p3 p0 p2 p1), (X p2), (X p3), (X (AND p3 p0)), (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p3 (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X p3)), (X (X (AND p3 p0))), (X (X (NOT (OR (AND (NOT p3) (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p3 p2))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p3) (OR p1 (NOT p0))))), (F (NOT p0)), (F (NOT (OR (NOT p3) p0))), (F (NOT p2)), (F (NOT (AND p3 p0))), (F (NOT p3)), (F (NOT p1)), (G p3)]
Property proved to be false thanks to negative knowledge :(G p3)
Knowledge based reduction with 18 factoid took 528 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLCardinality-11 finished in 66437 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(X(p0)))&&((!p1&&F(!p2)) U (G((!p1&&F(!p2)))||(!p1&&G(!p2))))))))'
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 354/354 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 159 transition count 331
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 159 transition count 331
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 38 place count 159 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 158 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 158 transition count 320
Applied a total of 40 rules in 6 ms. Remains 158 /173 variables (removed 15) and now considering 320/354 (removed 34) transitions.
// Phase 1: matrix 320 rows 158 cols
[2025-06-02 13:31:53] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:31:53] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-02 13:31:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:31:53] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2025-06-02 13:31:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:59] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:31:59] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:00] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:00] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:00] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:00] [INFO ] Deduced a trap composed of 90 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:00] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:00] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:01] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:01] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:02] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:02] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:02] [INFO ] Deduced a trap composed of 104 places in 190 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:03] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:03] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:04] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:05] [INFO ] Deduced a trap composed of 96 places in 202 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:06] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:10] [INFO ] Deduced a trap composed of 96 places in 184 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:10] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 320/478 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 186 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:27] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:27] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:30] [INFO ] Deduced a trap composed of 113 places in 218 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:32] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:32] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 320/478 variables, 158/191 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 319/510 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:49] [INFO ] Deduced a trap along path composed of 2 places in 117 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:50] [INFO ] Deduced a trap along path composed of 18 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 512 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 158/173 places, 320/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60611 ms. Remains : 158/173 places, 320/354 transitions.
Stuttering acceptance computed with spot in 1775 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1 p2), (NOT p0), p2, p2, p1, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), p2, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 4 ms.
FORMULA MedleyA-PT-16-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-12 finished in 62709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 354/354 transitions.
Graph (trivial) has 189 edges and 173 vertex of which 13 / 173 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 162 transition count 308
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 127 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 125 transition count 304
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 77 place count 125 transition count 297
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 118 transition count 297
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 108 place count 101 transition count 266
Iterating global reduction 3 with 17 rules applied. Total rules applied 125 place count 101 transition count 266
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 3 with 16 rules applied. Total rules applied 141 place count 101 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 100 transition count 250
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 142 place count 100 transition count 248
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 146 place count 98 transition count 248
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 97 transition count 246
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 97 transition count 246
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 184 place count 79 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 190 place count 79 transition count 222
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 193 place count 76 transition count 214
Iterating global reduction 6 with 3 rules applied. Total rules applied 196 place count 76 transition count 214
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 230 place count 59 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 59 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 261 place count 59 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 265 place count 57 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 266 place count 56 transition count 323
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 54 vertex of which 19 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 269 place count 43 transition count 323
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 312 place count 43 transition count 280
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 314 place count 41 transition count 258
Iterating global reduction 9 with 2 rules applied. Total rules applied 316 place count 41 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 9 with 75 rules applied. Total rules applied 391 place count 41 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 391 place count 41 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 393 place count 40 transition count 182
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 395 place count 38 transition count 174
Iterating global reduction 9 with 2 rules applied. Total rules applied 397 place count 38 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 401 place count 36 transition count 172
Applied a total of 401 rules in 56 ms. Remains 36 /173 variables (removed 137) and now considering 172/354 (removed 182) transitions.
[2025-06-02 13:32:55] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
// Phase 1: matrix 152 rows 36 cols
[2025-06-02 13:32:55] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:32:56] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-02 13:32:56] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
[2025-06-02 13:32:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:32:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 13:32:56] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 13:32:56] [INFO ] Redundant transitions in 31 ms returned [129, 171]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 168 sub problems to find dead transitions.
[2025-06-02 13:32:56] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2025-06-02 13:32:56] [INFO ] Computed 5 invariants in 1 ms
[2025-06-02 13:32:56] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:57] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:58] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:58] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:58] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:58] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:58] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:58] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:58] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:32:59] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 149/185 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 56/106 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 106 constraints, problems are : Problem set: 0 solved, 168 unsolved in 11535 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 149/185 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 56/106 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 168/274 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:15] [INFO ] Deduced a trap along path composed of 8 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:26] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/186 variables, and 276 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41659ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 41660ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/173 places, 170/354 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 169
Applied a total of 2 rules in 6 ms. Remains 35 /36 variables (removed 1) and now considering 169/170 (removed 1) transitions.
[2025-06-02 13:33:37] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
// Phase 1: matrix 149 rows 35 cols
[2025-06-02 13:33:37] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:33:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 13:33:38] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
[2025-06-02 13:33:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:33:38] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 13:33:38] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/173 places, 169/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42361 ms. Remains : 35/173 places, 169/354 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-14 finished in 42486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||X(p2))))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 354/354 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 158 transition count 330
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 158 transition count 330
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 45 place count 158 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 157 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 157 transition count 314
Applied a total of 47 rules in 6 ms. Remains 157 /173 variables (removed 16) and now considering 314/354 (removed 40) transitions.
// Phase 1: matrix 314 rows 157 cols
[2025-06-02 13:33:38] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:33:38] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 13:33:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:33:38] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2025-06-02 13:33:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:44] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:44] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:44] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:45] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:45] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:45] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:45] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:45] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:46] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:47] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:47] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:47] [INFO ] Deduced a trap composed of 31 places in 236 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:47] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:47] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:48] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:48] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:50] [INFO ] Deduced a trap composed of 95 places in 179 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:54] [INFO ] Deduced a trap composed of 95 places in 221 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:55] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:57] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:33:58] [INFO ] Deduced a trap composed of 109 places in 172 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:06] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:07] [INFO ] Deduced a trap composed of 109 places in 190 ms of which 21 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 187 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:12] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/188 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:23] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:32] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:37] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:37] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:38] [INFO ] Deduced a trap composed of 120 places in 152 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 506 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 157/173 places, 314/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60623 ms. Remains : 157/173 places, 314/354 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 280 ms.
Product exploration explored 100000 steps with 0 reset in 433 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X p2), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND p1 p0 p2))), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 225 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 314 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 249 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 265 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 117 ms. (338 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 46982 steps, run visited all 8 properties in 343 ms. (steps per millisecond=136 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 343 ms. (steps per millisecond=136 ) properties seen :8
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X p2), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0 p2)), (X (NOT (AND p1 p0 p2))), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (OR (NOT p1) p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p2)), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 19 factoid took 724 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2025-06-02 13:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:34:42] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 13:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 13:34:42] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2025-06-02 13:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:48] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:48] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:48] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:48] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:49] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:49] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:49] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:49] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:50] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:50] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:51] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:51] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:51] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:51] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:51] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:52] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:54] [INFO ] Deduced a trap composed of 95 places in 195 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:58] [INFO ] Deduced a trap composed of 95 places in 204 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:34:59] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:01] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:01] [INFO ] Deduced a trap composed of 109 places in 184 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/185 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:10] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:11] [INFO ] Deduced a trap composed of 109 places in 152 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 187 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:16] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/188 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/501 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:26] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:35] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:39] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:39] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 13:35:40] [INFO ] Deduced a trap composed of 120 places in 161 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 506 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in LTL mode , in 1 iterations and 60579 ms. Remains : 157/157 places, 314/314 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 (NOT p1) p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (AND p0 (NOT p1) p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 234 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 267 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 46982 steps, run visited all 8 properties in 306 ms. (steps per millisecond=153 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 306 ms. (steps per millisecond=153 ) properties seen :8
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND p0 (NOT p1))), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND p0 (NOT p1) p2)), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X (AND p0 (NOT p1) p2))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (OR (NOT p1) p2)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p2)), (F p1), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 19 factoid took 712 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 303 ms.
Product exploration explored 100000 steps with 0 reset in 351 ms.
Built C files in :
/tmp/ltsmin6245044435343324116
[2025-06-02 13:35:46] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6245044435343324116
Running compilation step : cd /tmp/ltsmin6245044435343324116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1055 ms.
Running link step : cd /tmp/ltsmin6245044435343324116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6245044435343324116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13515219247079496348.hoa' '--buchi-type=spotba'
LTSmin run took 156 ms.
FORMULA MedleyA-PT-16-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLCardinality-15 finished in 128920 ms.
All properties solved by simple procedures.
Total runtime 1162479 ms.
BK_STOP 1748871347355
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="MedleyA-PT-16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-16, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524100219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;