About the Execution of ITS-Tools for DiscoveryGPU-PT-14b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1042976.00 | 0.00 | 0.00 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064700748.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 DiscoveryGPU-PT-14b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064700748
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 104K 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 DiscoveryGPU-PT-14b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-14b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748954396090
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 12:39:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 12:39:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 12:39:58] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2025-06-03 12:39:58] [INFO ] Transformed 408 places.
[2025-06-03 12:39:58] [INFO ] Transformed 434 transitions.
[2025-06-03 12:39:58] [INFO ] Found NUPN structural information;
[2025-06-03 12:39:58] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 380 transition count 434
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 93 place count 315 transition count 369
Iterating global reduction 1 with 65 rules applied. Total rules applied 158 place count 315 transition count 369
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 170 place count 303 transition count 357
Iterating global reduction 1 with 12 rules applied. Total rules applied 182 place count 303 transition count 357
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 191 place count 294 transition count 348
Iterating global reduction 1 with 9 rules applied. Total rules applied 200 place count 294 transition count 348
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 208 place count 286 transition count 340
Iterating global reduction 1 with 8 rules applied. Total rules applied 216 place count 286 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 223 place count 279 transition count 326
Iterating global reduction 1 with 7 rules applied. Total rules applied 230 place count 279 transition count 326
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 237 place count 272 transition count 319
Iterating global reduction 1 with 7 rules applied. Total rules applied 244 place count 272 transition count 319
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 251 place count 265 transition count 312
Iterating global reduction 1 with 7 rules applied. Total rules applied 258 place count 265 transition count 312
Applied a total of 258 rules in 166 ms. Remains 265 /408 variables (removed 143) and now considering 312/434 (removed 122) transitions.
// Phase 1: matrix 312 rows 265 cols
[2025-06-03 12:39:59] [INFO ] Computed 2 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:39:59] [INFO ] Implicit Places using invariants in 432 ms returned []
[2025-06-03 12:39:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:40:00] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2025-06-03 12:40:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 312/577 variables, 265/267 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:13] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:13] [INFO ] Deduced a trap composed of 8 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-03 12:40:14] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:14] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:14] [INFO ] Deduced a trap composed of 11 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-03 12:40:14] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:14] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:14] [INFO ] Deduced a trap composed of 14 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-03 12:40:15] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:15] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:15] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:15] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:15] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:40:15] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 14/281 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 281 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 14/14 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/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/577 variables, 265/281 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 311/592 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 timeout
2 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/577 variables, and 592 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60458ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Starting structural reductions in LTL mode, iteration 1 : 265/408 places, 312/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61544 ms. Remains : 265/408 places, 312/434 transitions.
Support contains 33 out of 265 places after structural reductions.
[2025-06-03 12:41:01] [INFO ] Flatten gal took : 102 ms
[2025-06-03 12:41:01] [INFO ] Flatten gal took : 49 ms
[2025-06-03 12:41:01] [INFO ] Input system was already deterministic with 312 transitions.
Support contains 31 out of 265 places (down from 33) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 15742 steps (32 resets) in 1190 ms. (13 steps per ms) remains 0/30 properties
Computed a total of 45 stabilizing places and 45 stable transitions
Graph (complete) has 528 edges and 265 vertex of which 259 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 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(F(((X(p0)&&G((p1||G(p2))))||G(p0)))))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 256 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 256 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 251 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 251 transition count 296
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 246 transition count 291
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 246 transition count 291
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 242 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 242 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 240 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 240 transition count 283
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 238 transition count 281
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 238 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 236 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 236 transition count 279
Applied a total of 58 rules in 57 ms. Remains 236 /265 variables (removed 29) and now considering 279/312 (removed 33) transitions.
// Phase 1: matrix 279 rows 236 cols
[2025-06-03 12:41:02] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:41:02] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-03 12:41:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:41:03] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2025-06-03 12:41: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/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/515 variables, 236/238 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:14] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:14] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:14] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:14] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:15] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:15] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:15] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:15] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:15] [INFO ] Deduced a trap composed of 15 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-03 12:41:15] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:15] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:16] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:16] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:41:16] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 14/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 0/515 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 252 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 279/515 variables, 236/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 278/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/515 variables, and 530 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 236/265 places, 279/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60647 ms. Remains : 236/265 places, 279/312 transitions.
Stuttering acceptance computed with spot in 827 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-00
Product exploration explored 100000 steps with 431 reset in 807 ms.
Product exploration explored 100000 steps with 485 reset in 485 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 478 edges and 236 vertex of which 234 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 9 states, 47 edges and 3 AP (stutter sensitive) to 9 states, 47 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 487 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (86 resets) in 389 ms. (102 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (15 resets) in 308 ms. (129 steps per ms) remains 2/3 properties
[2025-06-03 12:42:06] [INFO ] Invariant cache hit.
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) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 102/114 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 333/447 variables, 168/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 57/504 variables, 45/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 515/515 variables, and 238 constraints, problems are : Problem set: 2 solved, 0 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (G (OR p0 p1 (NOT p2))), (G (OR (NOT p0) p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT p1)), (F (NOT (AND p0 p1 (NOT p2)))), (F p2), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT (AND (OR p0 (NOT p1)) (OR p0 (NOT p2))))), (F (NOT p0)), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 3 factoid took 481 ms. Reduced automaton from 9 states, 47 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 236 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 279/279 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2025-06-03 12:42:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:42:08] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-03 12:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:42:08] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2025-06-03 12:42:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/515 variables, 236/238 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:23] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:23] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:23] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:23] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:24] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:24] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:24] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:24] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:24] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:25] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:25] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:25] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:25] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:42:25] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 14/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
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 515/515 variables, and 252 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 279/515 variables, 236/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 278/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/515 variables, and 530 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Finished structural reductions in LTL mode , in 1 iterations and 60857 ms. Remains : 236/236 places, 279/279 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 478 edges and 236 vertex of which 234 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (85 resets) in 239 ms. (166 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
[2025-06-03 12:43:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/89 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/93 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/96 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 312/408 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 95/503 variables, 65/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:09] [INFO ] Deduced a trap along path composed of 5 places in 64 ms of which 20 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/515 variables, 12/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/515 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/89 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/93 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/96 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/96 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 312/408 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 95/503 variables, 65/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/503 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/515 variables, 12/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/515 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/515 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 240 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1023ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 279/279 transitions.
Graph (complete) has 478 edges and 236 vertex of which 235 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 235 transition count 234
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 75 place count 205 transition count 234
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 75 place count 205 transition count 174
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 195 place count 145 transition count 174
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 291 place count 97 transition count 126
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (complete) has 190 edges and 97 vertex of which 22 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.1 ms
Discarding 75 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 29 rules applied. Total rules applied 320 place count 22 transition count 98
Drop transitions (Empty/Sink Transition effects.) removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 397 place count 22 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 398 place count 22 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 399 place count 21 transition count 19
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 15 rules applied. Total rules applied 414 place count 19 transition count 6
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 427 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 427 place count 6 transition count 4
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 431 place count 4 transition count 4
Applied a total of 431 rules in 107 ms. Remains 4 /236 variables (removed 232) and now considering 4/279 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 4/236 places, 4/279 transitions.
RANDOM walk for 18 steps (2 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 359 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 332 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 457 reset in 402 ms.
Product exploration explored 100000 steps with 415 reset in 312 ms.
Built C files in :
/tmp/ltsmin1542248525654580874
[2025-06-03 12:43:12] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1542248525654580874
Running compilation step : cd /tmp/ltsmin1542248525654580874;'/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 1275 ms.
Running link step : cd /tmp/ltsmin1542248525654580874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin1542248525654580874;'/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/stateBased5582836573743562002.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 279/279 transitions.
Applied a total of 0 rules in 23 ms. Remains 236 /236 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2025-06-03 12:43:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:43:28] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-03 12:43:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:43:28] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2025-06-03 12:43:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/515 variables, 236/238 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:40] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:40] [INFO ] Deduced a trap composed of 8 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-03 12:43:41] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:41] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:41] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:41] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:41] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:41] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:42] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:42] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:42] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:42] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:42] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:43:42] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 14/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/515 variables, and 252 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 279/515 variables, 236/252 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 278/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/515 variables, and 530 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Finished structural reductions in LTL mode , in 1 iterations and 60633 ms. Remains : 236/236 places, 279/279 transitions.
Built C files in :
/tmp/ltsmin12686060114985716088
[2025-06-03 12:44:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12686060114985716088
Running compilation step : cd /tmp/ltsmin12686060114985716088;'/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 879 ms.
Running link step : cd /tmp/ltsmin12686060114985716088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12686060114985716088;'/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/stateBased2382096179187477831.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 12:44:43] [INFO ] Flatten gal took : 35 ms
[2025-06-03 12:44:43] [INFO ] Flatten gal took : 32 ms
[2025-06-03 12:44:43] [INFO ] Time to serialize gal into /tmp/LTL5127591643562726957.gal : 9 ms
[2025-06-03 12:44:43] [INFO ] Time to serialize properties into /tmp/LTL12010924348393171897.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5127591643562726957.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1378025024342331097.hoa' '-atoms' '/tmp/LTL12010924348393171897.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12010924348393171897.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1378025024342331097.hoa
Detected timeout of ITS tools.
[2025-06-03 12:44:59] [INFO ] Flatten gal took : 20 ms
[2025-06-03 12:44:59] [INFO ] Flatten gal took : 19 ms
[2025-06-03 12:44:59] [INFO ] Time to serialize gal into /tmp/LTL9676473565841049965.gal : 4 ms
[2025-06-03 12:44:59] [INFO ] Time to serialize properties into /tmp/LTL14707071723449337098.ltl : 6 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/LTL9676473565841049965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14707071723449337098.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("(p73!=1)"))||((X("(p73!=1)"))&&(G(("(p44!=1)")||(G("((p62==1)&&(p406==1))")))))))))))
Formula 0 simplified : XXXG(F!"(p73!=1)" & (X!"(p73!=1)" | F(!"(p44!=1)" & F!"((p62==1)&&(p406==1))")))
Detected timeout of ITS tools.
[2025-06-03 12:45:14] [INFO ] Flatten gal took : 18 ms
[2025-06-03 12:45:14] [INFO ] Applying decomposition
[2025-06-03 12:45:14] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13484911260592774079.txt' '-o' '/tmp/graph13484911260592774079.bin' '-w' '/tmp/graph13484911260592774079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13484911260592774079.bin' '-l' '-1' '-v' '-w' '/tmp/graph13484911260592774079.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:45:14] [INFO ] Decomposing Gal with order
[2025-06-03 12:45:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:45:14] [INFO ] Removed a total of 112 redundant transitions.
[2025-06-03 12:45:14] [INFO ] Flatten gal took : 83 ms
[2025-06-03 12:45:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 11 ms.
[2025-06-03 12:45:14] [INFO ] Time to serialize gal into /tmp/LTL3426345498830827648.gal : 10 ms
[2025-06-03 12:45:14] [INFO ] Time to serialize properties into /tmp/LTL3759590349495466064.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3426345498830827648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3759590349495466064.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("(i4.u23.p73!=1)"))||((X("(i4.u23.p73!=1)"))&&(G(("(i4.u16.p44!=1)")||(G("((i7.u19.p62==1)&&(i4.u85.p406==1))"))))))))))...156
Formula 0 simplified : XXXG(F!"(i4.u23.p73!=1)" & (X!"(i4.u23.p73!=1)" | F(!"(i4.u16.p44!=1)" & F!"((i7.u19.p62==1)&&(i4.u85.p406==1))")))
Detected timeout of ITS tools.
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-00 finished in 267056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)||X(G(p1))) U X(X(p2))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 254 transition count 300
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 254 transition count 300
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 248 transition count 293
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 248 transition count 293
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 242 transition count 287
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 242 transition count 287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 237 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 237 transition count 282
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 233 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 233 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 230 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 230 transition count 271
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 227 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 227 transition count 268
Applied a total of 76 rules in 29 ms. Remains 227 /265 variables (removed 38) and now considering 268/312 (removed 44) transitions.
// Phase 1: matrix 268 rows 227 cols
[2025-06-03 12:45:29] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:45:29] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-03 12:45:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:45:30] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2025-06-03 12:45:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/495 variables, 227/229 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:43] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:43] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:44] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:44] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:44] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:44] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:45] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:45] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:45] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:45] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:45] [INFO ] Deduced a trap composed of 17 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-03 12:45:46] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:46] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:45:46] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 14/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/495 variables, and 243 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/495 variables, 227/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 267/510 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 510 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 227/265 places, 268/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60700 ms. Remains : 227/265 places, 268/312 transitions.
Stuttering acceptance computed with spot in 555 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (AND (NOT p1) p0), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) p0), (OR (NOT p1) (NOT p2)), p0, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 388 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-01 finished in 61292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1 U (p2||G(p1)))))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Graph (complete) has 528 edges and 265 vertex of which 259 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 258 transition count 267
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 220 transition count 267
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 77 place count 220 transition count 222
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 167 place count 175 transition count 222
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 172 place count 170 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 177 place count 170 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 181 place count 166 transition count 212
Iterating global reduction 2 with 4 rules applied. Total rules applied 185 place count 166 transition count 212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 188 place count 163 transition count 206
Iterating global reduction 2 with 3 rules applied. Total rules applied 191 place count 163 transition count 206
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 194 place count 160 transition count 203
Iterating global reduction 2 with 3 rules applied. Total rules applied 197 place count 160 transition count 203
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 317 place count 100 transition count 143
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 329 place count 88 transition count 120
Iterating global reduction 2 with 12 rules applied. Total rules applied 341 place count 88 transition count 120
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 352 place count 77 transition count 108
Iterating global reduction 2 with 11 rules applied. Total rules applied 363 place count 77 transition count 108
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 374 place count 66 transition count 86
Iterating global reduction 2 with 11 rules applied. Total rules applied 385 place count 66 transition count 86
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 396 place count 55 transition count 75
Iterating global reduction 2 with 11 rules applied. Total rules applied 407 place count 55 transition count 75
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 418 place count 44 transition count 53
Iterating global reduction 2 with 11 rules applied. Total rules applied 429 place count 44 transition count 53
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 440 place count 33 transition count 42
Iterating global reduction 2 with 11 rules applied. Total rules applied 451 place count 33 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 452 place count 32 transition count 40
Iterating global reduction 2 with 1 rules applied. Total rules applied 453 place count 32 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 454 place count 31 transition count 39
Iterating global reduction 2 with 1 rules applied. Total rules applied 455 place count 31 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 456 place count 31 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 458 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 48 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 with 4 rules applied. Total rules applied 462 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 464 place count 25 transition count 34
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 470 place count 22 transition count 31
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 4 with 2 rules applied. Total rules applied 472 place count 21 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 474 place count 19 transition count 28
Applied a total of 474 rules in 100 ms. Remains 19 /265 variables (removed 246) and now considering 28/312 (removed 284) transitions.
[2025-06-03 12:46:31] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 19 cols
[2025-06-03 12:46:31] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:46:31] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-03 12:46:31] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2025-06-03 12:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:46:31] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:46:31] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 12:46:31] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2025-06-03 12:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 23/38 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 4/42 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 20 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 23/38 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 4/42 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/43 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1298ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/265 places, 28/312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1503 ms. Remains : 19/265 places, 28/312 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-03 finished in 1696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0 U p1)||G(p2))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Graph (complete) has 528 edges and 265 vertex of which 259 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 258 transition count 269
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 222 transition count 269
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 73 place count 222 transition count 224
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 163 place count 177 transition count 224
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 169 place count 171 transition count 217
Iterating global reduction 2 with 6 rules applied. Total rules applied 175 place count 171 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 180 place count 166 transition count 211
Iterating global reduction 2 with 5 rules applied. Total rules applied 185 place count 166 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 189 place count 162 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 162 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 196 place count 159 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 199 place count 159 transition count 201
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 325 place count 96 transition count 138
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 338 place count 83 transition count 113
Iterating global reduction 2 with 13 rules applied. Total rules applied 351 place count 83 transition count 113
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 362 place count 72 transition count 101
Iterating global reduction 2 with 11 rules applied. Total rules applied 373 place count 72 transition count 101
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 384 place count 61 transition count 79
Iterating global reduction 2 with 11 rules applied. Total rules applied 395 place count 61 transition count 79
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 406 place count 50 transition count 68
Iterating global reduction 2 with 11 rules applied. Total rules applied 417 place count 50 transition count 68
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 428 place count 39 transition count 46
Iterating global reduction 2 with 11 rules applied. Total rules applied 439 place count 39 transition count 46
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 450 place count 28 transition count 35
Iterating global reduction 2 with 11 rules applied. Total rules applied 461 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 462 place count 27 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 463 place count 27 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 464 place count 26 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 465 place count 26 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 466 place count 26 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 468 place count 24 transition count 29
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 470 place count 23 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 471 place count 22 transition count 28
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 471 place count 22 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 479 place count 18 transition count 24
Applied a total of 479 rules in 92 ms. Remains 18 /265 variables (removed 247) and now considering 24/312 (removed 288) transitions.
[2025-06-03 12:46:32] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 18 cols
[2025-06-03 12:46:32] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:46:32] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-03 12:46:32] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2025-06-03 12:46:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 12:46:32] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:46:32] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-03 12:46:32] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2025-06-03 12:46:32] [INFO ] Invariant cache hit.
[2025-06-03 12:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 21/39 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 20 constraints, problems are : Problem set: 0 solved, 23 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 21/39 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 23 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1418ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1419ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/265 places, 24/312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1628 ms. Remains : 18/265 places, 24/312 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-04 finished in 1835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 255 transition count 301
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 255 transition count 301
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 250 transition count 295
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 245 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 245 transition count 290
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 241 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 241 transition count 286
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 238 transition count 280
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 238 transition count 280
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 235 transition count 277
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 235 transition count 277
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 232 transition count 274
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 232 transition count 274
Applied a total of 66 rules in 40 ms. Remains 232 /265 variables (removed 33) and now considering 274/312 (removed 38) transitions.
// Phase 1: matrix 274 rows 232 cols
[2025-06-03 12:46:34] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:46:34] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-03 12:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:46:35] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2025-06-03 12:46:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (OVERLAPS) 274/506 variables, 232/234 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:46:49] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:46:49] [INFO ] Deduced a trap composed of 8 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-03 12:46:50] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:46:50] [INFO ] Deduced a trap composed of 10 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-03 12:46:50] [INFO ] Deduced a trap composed of 11 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-03 12:46:50] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:46:50] [INFO ] Deduced a trap composed of 13 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-03 12:46:51] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:46:51] [INFO ] Deduced a trap composed of 15 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-03 12:46:51] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:46:51] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:46:51] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:46:52] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:46:52] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 14/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 506/506 variables, and 248 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/506 variables, 232/248 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 273/521 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 506/506 variables, and 521 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 232/265 places, 274/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60787 ms. Remains : 232/265 places, 274/312 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-05 finished in 61023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Graph (complete) has 528 edges and 265 vertex of which 259 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 258 transition count 268
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 221 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 220 transition count 267
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 77 place count 220 transition count 221
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 169 place count 174 transition count 221
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 175 place count 168 transition count 214
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 168 transition count 214
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 186 place count 163 transition count 208
Iterating global reduction 3 with 5 rules applied. Total rules applied 191 place count 163 transition count 208
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 195 place count 159 transition count 201
Iterating global reduction 3 with 4 rules applied. Total rules applied 199 place count 159 transition count 201
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 156 transition count 198
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 156 transition count 198
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 329 place count 94 transition count 136
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 342 place count 81 transition count 111
Iterating global reduction 3 with 13 rules applied. Total rules applied 355 place count 81 transition count 111
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 368 place count 68 transition count 97
Iterating global reduction 3 with 13 rules applied. Total rules applied 381 place count 68 transition count 97
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 393 place count 56 transition count 73
Iterating global reduction 3 with 12 rules applied. Total rules applied 405 place count 56 transition count 73
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 417 place count 44 transition count 61
Iterating global reduction 3 with 12 rules applied. Total rules applied 429 place count 44 transition count 61
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 441 place count 32 transition count 37
Iterating global reduction 3 with 12 rules applied. Total rules applied 453 place count 32 transition count 37
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 465 place count 20 transition count 25
Iterating global reduction 3 with 12 rules applied. Total rules applied 477 place count 20 transition count 25
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 478 place count 19 transition count 23
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 480 place count 18 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 481 place count 18 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 482 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 484 place count 16 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 16 edges and 14 vertex of which 11 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 3 with 5 rules applied. Total rules applied 489 place count 11 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 491 place count 9 transition count 14
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 5 with 4 rules applied. Total rules applied 495 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 497 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 499 place count 5 transition count 8
Applied a total of 499 rules in 77 ms. Remains 5 /265 variables (removed 260) and now considering 8/312 (removed 304) transitions.
[2025-06-03 12:47:35] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2025-06-03 12:47:35] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:47:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 12:47:35] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 12:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:47:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:47:35] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 12:47:35] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 12:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 106 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 103 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/265 places, 8/312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 394 ms. Remains : 5/265 places, 8/312 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-06 finished in 512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Graph (complete) has 528 edges and 265 vertex of which 259 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 258 transition count 267
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 220 transition count 267
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 77 place count 220 transition count 221
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 169 place count 174 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 169 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 169 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 165 transition count 211
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 165 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 191 place count 161 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 195 place count 161 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 198 place count 158 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 201 place count 158 transition count 201
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 327 place count 95 transition count 138
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 339 place count 83 transition count 115
Iterating global reduction 2 with 12 rules applied. Total rules applied 351 place count 83 transition count 115
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 363 place count 71 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 375 place count 71 transition count 102
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 387 place count 59 transition count 78
Iterating global reduction 2 with 12 rules applied. Total rules applied 399 place count 59 transition count 78
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 411 place count 47 transition count 66
Iterating global reduction 2 with 12 rules applied. Total rules applied 423 place count 47 transition count 66
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 435 place count 35 transition count 42
Iterating global reduction 2 with 12 rules applied. Total rules applied 447 place count 35 transition count 42
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 459 place count 23 transition count 30
Iterating global reduction 2 with 12 rules applied. Total rules applied 471 place count 23 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 472 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 473 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 474 place count 21 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 475 place count 21 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 476 place count 21 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 478 place count 19 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 485 place count 14 transition count 17
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 490 place count 10 transition count 16
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 4 with 4 rules applied. Total rules applied 494 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 495 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 497 place count 6 transition count 11
Applied a total of 497 rules in 48 ms. Remains 6 /265 variables (removed 259) and now considering 11/312 (removed 301) transitions.
[2025-06-03 12:47:36] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2025-06-03 12:47:36] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:47:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 12:47:36] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2025-06-03 12:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:47:36] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:47:36] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 12:47:36] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2025-06-03 12:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 138 ms.
Refiners :[State Equation: 6/6 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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 120 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 262ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/265 places, 11/312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 6/265 places, 11/312 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-07 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X(X((p1||X((p2 U p3))))))))'
Support contains 5 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 256 transition count 302
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 256 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 251 transition count 296
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 251 transition count 296
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 246 transition count 291
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 246 transition count 291
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 242 transition count 287
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 242 transition count 287
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 239 transition count 281
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 239 transition count 281
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 236 transition count 278
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 236 transition count 278
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 233 transition count 275
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 233 transition count 275
Applied a total of 64 rules in 40 ms. Remains 233 /265 variables (removed 32) and now considering 275/312 (removed 37) transitions.
// Phase 1: matrix 275 rows 233 cols
[2025-06-03 12:47:36] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:47:36] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-03 12:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:47:37] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-03 12:47: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/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 275/508 variables, 233/235 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:51] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:51] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:51] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:51] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:51] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:52] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:52] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:52] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:52] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:53] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:53] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:53] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:53] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:47:54] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 14/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 249 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/508 variables, 233/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 274/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 523 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 233/265 places, 275/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60737 ms. Remains : 233/265 places, 275/312 transitions.
Stuttering acceptance computed with spot in 632 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-09
Product exploration explored 100000 steps with 24945 reset in 209 ms.
Product exploration explored 100000 steps with 24954 reset in 193 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 471 edges and 233 vertex of which 230 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 185 ms. Reduced automaton from 10 states, 22 edges and 4 AP (stutter sensitive) to 10 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 553 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
RANDOM walk for 40000 steps (85 resets) in 298 ms. (133 steps per ms) remains 2/14 properties
BEST_FIRST walk for 11335 steps (1 resets) in 30 ms. (365 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p1 p0 p3))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p0) p3))), (F (NOT (OR (NOT p2) p0 p3))), (F p0), (F (NOT (OR p1 (NOT p0) p3))), (F (NOT (OR p1 (NOT p0)))), (F p2), (F p3), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p2 (NOT p0) p3))), (F (NOT (OR (NOT p2) p3)))]
Knowledge based reduction with 6 factoid took 742 ms. Reduced automaton from 10 states, 22 edges and 4 AP (stutter sensitive) to 10 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 553 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 547 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 275/275 transitions.
Applied a total of 0 rules in 5 ms. Remains 233 /233 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2025-06-03 12:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:48:41] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-03 12:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:48:41] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-03 12:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 275/508 variables, 233/235 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:56] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:56] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:57] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:57] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:57] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:57] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:57] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:58] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:58] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:58] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:58] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:59] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:59] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:48:59] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 14/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 249 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/508 variables, 233/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 274/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 523 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in LTL mode , in 1 iterations and 60740 ms. Remains : 233/233 places, 275/275 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 471 edges and 233 vertex of which 230 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 10 states, 22 edges and 4 AP (stutter sensitive) to 10 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 436 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
RANDOM walk for 40000 steps (85 resets) in 381 ms. (104 steps per ms) remains 1/14 properties
BEST_FIRST walk for 21854 steps (3 resets) in 41 ms. (520 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p0 p3))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p0) p3))), (F (NOT (OR (NOT p2) p0 p3))), (F p0), (F (NOT (OR p1 (NOT p0) p3))), (F (NOT (OR p1 (NOT p0)))), (F p2), (F p3), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p2 (NOT p0) p3))), (F (NOT (OR (NOT p2) p3)))]
Knowledge based reduction with 6 factoid took 668 ms. Reduced automaton from 10 states, 22 edges and 4 AP (stutter sensitive) to 10 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 531 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 546 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 543 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
Product exploration explored 100000 steps with 25051 reset in 167 ms.
Product exploration explored 100000 steps with 24899 reset in 177 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 544 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0)]
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 275/275 transitions.
Graph (complete) has 471 edges and 233 vertex of which 232 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 232 transition count 274
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 44 Pre rules applied. Total rules applied 30 place count 232 transition count 274
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 74 place count 232 transition count 274
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 107 place count 232 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 230 transition count 287
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 230 transition count 287
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 138 place count 230 transition count 341
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 149 place count 219 transition count 319
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 160 place count 219 transition count 319
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 193 place count 186 transition count 264
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 226 place count 186 transition count 264
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 257 place count 155 transition count 213
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 288 place count 155 transition count 213
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 298 place count 145 transition count 203
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 308 place count 145 transition count 203
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 327 place count 126 transition count 175
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 346 place count 126 transition count 175
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 382 place count 90 transition count 121
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 418 place count 90 transition count 121
Deduced a syphon composed of 51 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 421 place count 90 transition count 118
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 421 rules in 68 ms. Remains 90 /233 variables (removed 143) and now considering 118/275 (removed 157) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:49:45] [INFO ] Redundant transitions in 5 ms returned []
Running 117 sub problems to find dead transitions.
[2025-06-03 12:49:45] [INFO ] Flow matrix only has 113 transitions (discarded 5 similar events)
// Phase 1: matrix 113 rows 90 cols
[2025-06-03 12:49:46] [INFO ] Computed 2 invariants in 1 ms
[2025-06-03 12:49:46] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:49:47] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:49:47] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 3 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD90 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 114 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 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
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 4 (OVERLAPS) 113/203 variables, 90/94 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 10/104 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/104 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/104 constraints. Problems are: Problem set: 69 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 104 constraints, problems are : Problem set: 69 solved, 48 unsolved in 6193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 69 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 4/42 variables, 2/2 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/4 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 110/152 variables, 42/46 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 10/56 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 48/104 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/104 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 51/203 variables, 48/152 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/152 constraints. Problems are: Problem set: 69 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/152 constraints. Problems are: Problem set: 69 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 152 constraints, problems are : Problem set: 69 solved, 48 unsolved in 4903 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 48/117 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11136ms problems are : Problem set: 69 solved, 48 unsolved
Search for dead transitions found 69 dead transitions in 11137ms
Found 69 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 69 transitions
Dead transitions reduction (with SMT) removed 69 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 90/233 places, 49/275 transitions.
Graph (complete) has 109 edges and 90 vertex of which 39 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 39 /90 variables (removed 51) and now considering 49/49 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/233 places, 49/275 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11224 ms. Remains : 39/233 places, 49/275 transitions.
Built C files in :
/tmp/ltsmin765462708725419048
[2025-06-03 12:49:57] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin765462708725419048
Running compilation step : cd /tmp/ltsmin765462708725419048;'/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 738 ms.
Running link step : cd /tmp/ltsmin765462708725419048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin765462708725419048;'/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/stateBased15359734657516495613.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 275/275 transitions.
Applied a total of 0 rules in 4 ms. Remains 233 /233 variables (removed 0) and now considering 275/275 (removed 0) transitions.
// Phase 1: matrix 275 rows 233 cols
[2025-06-03 12:50:12] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:50:12] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-03 12:50:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:50:12] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-03 12:50:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 275/508 variables, 233/235 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:25] [INFO ] Deduced a trap composed of 7 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-03 12:50:26] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:26] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:26] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:26] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:26] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:26] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:27] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:27] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:27] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:27] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:27] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:27] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:50:27] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 14/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/508 variables, and 249 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/508 variables, 233/249 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 274/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 523 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Finished structural reductions in LTL mode , in 1 iterations and 60646 ms. Remains : 233/233 places, 275/275 transitions.
Built C files in :
/tmp/ltsmin936657361904305113
[2025-06-03 12:51:12] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin936657361904305113
Running compilation step : cd /tmp/ltsmin936657361904305113;'/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 943 ms.
Running link step : cd /tmp/ltsmin936657361904305113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin936657361904305113;'/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/stateBased9938033772369122966.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 12:51:28] [INFO ] Flatten gal took : 18 ms
[2025-06-03 12:51:28] [INFO ] Flatten gal took : 14 ms
[2025-06-03 12:51:28] [INFO ] Time to serialize gal into /tmp/LTL13464648174757786422.gal : 4 ms
[2025-06-03 12:51:28] [INFO ] Time to serialize properties into /tmp/LTL12441611218802523990.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13464648174757786422.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5363300974794538831.hoa' '-atoms' '/tmp/LTL12441611218802523990.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/LTL12441611218802523990.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5363300974794538831.hoa
Detected timeout of ITS tools.
[2025-06-03 12:51:43] [INFO ] Flatten gal took : 18 ms
[2025-06-03 12:51:43] [INFO ] Flatten gal took : 14 ms
[2025-06-03 12:51:43] [INFO ] Time to serialize gal into /tmp/LTL4369627826010453363.gal : 4 ms
[2025-06-03 12:51:43] [INFO ] Time to serialize properties into /tmp/LTL8704374389165916953.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4369627826010453363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8704374389165916953.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((G("(p46==1)"))U(X(X(("(p248!=1)")||(X(("((p362==1)&&(p399==1))")U("(p107==1)")))))))))
Formula 0 simplified : F(F!"(p46==1)" R XX(!"(p248!=1)" & X(!"((p362==1)&&(p399==1))" R !"(p107==1)")))
Detected timeout of ITS tools.
[2025-06-03 12:51:58] [INFO ] Flatten gal took : 14 ms
[2025-06-03 12:51:58] [INFO ] Applying decomposition
[2025-06-03 12:51:58] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16579697954994774363.txt' '-o' '/tmp/graph16579697954994774363.bin' '-w' '/tmp/graph16579697954994774363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16579697954994774363.bin' '-l' '-1' '-v' '-w' '/tmp/graph16579697954994774363.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:51:58] [INFO ] Decomposing Gal with order
[2025-06-03 12:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:51:58] [INFO ] Removed a total of 110 redundant transitions.
[2025-06-03 12:51:58] [INFO ] Flatten gal took : 48 ms
[2025-06-03 12:51:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2025-06-03 12:51:58] [INFO ] Time to serialize gal into /tmp/LTL14557704859369754635.gal : 9 ms
[2025-06-03 12:51:58] [INFO ] Time to serialize properties into /tmp/LTL7811940381171571591.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14557704859369754635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7811940381171571591.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((G("(i5.u15.p46==1)"))U(X(X(("(i16.u55.p248!=1)")||(X(("((i20.u75.p362==1)&&(u82.p399==1))")U("(i6.u28.p107==1)")))))))))
Formula 0 simplified : F(F!"(i5.u15.p46==1)" R XX(!"(i16.u55.p248!=1)" & X(!"((i20.u75.p362==1)&&(u82.p399==1))" R !"(i6.u28.p107==1)")))
Detected timeout of ITS tools.
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-09 finished in 277190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X((p1 U (G(p1)||(G(F(p3))&&p2))))&&p0)))))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 255 transition count 301
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 255 transition count 301
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 249 transition count 294
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 249 transition count 294
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 243 transition count 288
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 243 transition count 288
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 238 transition count 283
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 238 transition count 283
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 234 transition count 275
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 234 transition count 275
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 230 transition count 271
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 230 transition count 271
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 226 transition count 267
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 226 transition count 267
Applied a total of 78 rules in 25 ms. Remains 226 /265 variables (removed 39) and now considering 267/312 (removed 45) transitions.
// Phase 1: matrix 267 rows 226 cols
[2025-06-03 12:52:13] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:52:13] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-03 12:52:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:52:14] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-06-03 12:52:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/493 variables, 226/228 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:27] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:28] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:28] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:28] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:28] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:28] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:29] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:29] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:29] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:29] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:29] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:29] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:29] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:52:30] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 14/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/493 variables, and 242 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/493 variables, 226/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 266/508 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 266 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 Int declared 493/493 variables, and 508 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 226/265 places, 267/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60661 ms. Remains : 226/265 places, 267/312 transitions.
Stuttering acceptance computed with spot in 486 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-10 finished in 61177 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(X(p0))&&(F(p1) U p2)))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 255 transition count 301
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 255 transition count 301
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 251 transition count 297
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 251 transition count 297
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 247 transition count 293
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 247 transition count 293
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 244 transition count 290
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 244 transition count 290
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 241 transition count 284
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 241 transition count 284
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 238 transition count 281
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 238 transition count 281
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 235 transition count 278
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 235 transition count 278
Applied a total of 60 rules in 39 ms. Remains 235 /265 variables (removed 30) and now considering 278/312 (removed 34) transitions.
// Phase 1: matrix 278 rows 235 cols
[2025-06-03 12:53:14] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:53:15] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-03 12:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:53:15] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2025-06-03 12:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 278/513 variables, 235/237 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:30] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:30] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:31] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:31] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:31] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:31] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:32] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:32] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:32] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:32] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:32] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:33] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:33] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:53:33] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 14/251 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/513 variables, and 251 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 278/513 variables, 235/251 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 277/528 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 timeout
2 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 528 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 235/265 places, 278/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60772 ms. Remains : 235/265 places, 278/312 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-11 finished in 61233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Graph (complete) has 528 edges and 265 vertex of which 259 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 258 transition count 267
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 220 transition count 267
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 77 place count 220 transition count 223
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 165 place count 176 transition count 223
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 170 transition count 216
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 place count 170 transition count 216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 182 place count 165 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 187 place count 165 transition count 210
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 191 place count 161 transition count 203
Iterating global reduction 2 with 4 rules applied. Total rules applied 195 place count 161 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 198 place count 158 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 201 place count 158 transition count 200
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 327 place count 95 transition count 137
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 340 place count 82 transition count 112
Iterating global reduction 2 with 13 rules applied. Total rules applied 353 place count 82 transition count 112
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 366 place count 69 transition count 98
Iterating global reduction 2 with 13 rules applied. Total rules applied 379 place count 69 transition count 98
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 392 place count 56 transition count 72
Iterating global reduction 2 with 13 rules applied. Total rules applied 405 place count 56 transition count 72
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 418 place count 43 transition count 59
Iterating global reduction 2 with 13 rules applied. Total rules applied 431 place count 43 transition count 59
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 443 place count 31 transition count 35
Iterating global reduction 2 with 12 rules applied. Total rules applied 455 place count 31 transition count 35
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 467 place count 19 transition count 23
Iterating global reduction 2 with 12 rules applied. Total rules applied 479 place count 19 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 480 place count 18 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 481 place count 18 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 482 place count 17 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 483 place count 17 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 484 place count 17 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 486 place count 15 transition count 17
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 488 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 489 place count 13 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 489 place count 13 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 493 place count 11 transition count 14
Applied a total of 493 rules in 55 ms. Remains 11 /265 variables (removed 254) and now considering 14/312 (removed 298) transitions.
[2025-06-03 12:54:16] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2025-06-03 12:54:16] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:54:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 12:54:16] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-03 12:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:54:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 12:54:16] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:54:16] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-03 12:54:16] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2025-06-03 12:54:16] [INFO ] Invariant cache hit.
[2025-06-03 12:54:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 13/24 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 13 constraints, problems are : Problem set: 0 solved, 13 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 13/24 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 26 constraints, problems are : Problem set: 0 solved, 13 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 669ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 670ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/265 places, 14/312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 835 ms. Remains : 11/265 places, 14/312 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-12
Product exploration explored 100000 steps with 9717 reset in 293 ms.
Stack based approach found an accepted trace after 29 steps with 4 reset with depth 4 and stack size 4 in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-12 finished in 1202 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)))||F(p1))))'
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 255 transition count 301
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 255 transition count 301
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 249 transition count 294
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 249 transition count 294
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 243 transition count 288
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 243 transition count 288
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 238 transition count 283
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 238 transition count 283
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 234 transition count 275
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 234 transition count 275
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 230 transition count 271
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 230 transition count 271
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 226 transition count 267
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 226 transition count 267
Applied a total of 78 rules in 40 ms. Remains 226 /265 variables (removed 39) and now considering 267/312 (removed 45) transitions.
// Phase 1: matrix 267 rows 226 cols
[2025-06-03 12:54:17] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:54:17] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-06-03 12:54:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:54:17] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-06-03 12:54:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/493 variables, 226/228 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:32] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:32] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:32] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:32] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:32] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:33] [INFO ] Deduced a trap composed of 12 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-03 12:54:33] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:33] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:33] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:33] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:34] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:34] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:34] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 12:54:34] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 14/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 493/493 variables, and 242 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/493 variables, 226/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 266/508 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 508 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 226/265 places, 267/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60792 ms. Remains : 226/265 places, 267/312 transitions.
Stuttering acceptance computed with spot in 250 ms :[(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 : DiscoveryGPU-PT-14b-LTLFireability-13
Product exploration explored 100000 steps with 522 reset in 400 ms.
Stack based approach found an accepted trace after 497 steps with 2 reset with depth 93 and stack size 93 in 3 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-13 finished in 61475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0||G(F(p1))))) U G(p2)))'
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Graph (complete) has 528 edges and 265 vertex of which 259 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 258 transition count 268
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 221 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 220 transition count 267
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 77 place count 220 transition count 224
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 163 place count 177 transition count 224
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 169 place count 171 transition count 217
Iterating global reduction 3 with 6 rules applied. Total rules applied 175 place count 171 transition count 217
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 180 place count 166 transition count 211
Iterating global reduction 3 with 5 rules applied. Total rules applied 185 place count 166 transition count 211
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 189 place count 162 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 193 place count 162 transition count 204
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 196 place count 159 transition count 201
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 159 transition count 201
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 321 place count 98 transition count 140
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 334 place count 85 transition count 115
Iterating global reduction 3 with 13 rules applied. Total rules applied 347 place count 85 transition count 115
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 360 place count 72 transition count 101
Iterating global reduction 3 with 13 rules applied. Total rules applied 373 place count 72 transition count 101
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 385 place count 60 transition count 77
Iterating global reduction 3 with 12 rules applied. Total rules applied 397 place count 60 transition count 77
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 409 place count 48 transition count 65
Iterating global reduction 3 with 12 rules applied. Total rules applied 421 place count 48 transition count 65
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 433 place count 36 transition count 41
Iterating global reduction 3 with 12 rules applied. Total rules applied 445 place count 36 transition count 41
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 456 place count 25 transition count 30
Iterating global reduction 3 with 11 rules applied. Total rules applied 467 place count 25 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 468 place count 24 transition count 28
Iterating global reduction 3 with 1 rules applied. Total rules applied 469 place count 24 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 470 place count 23 transition count 27
Iterating global reduction 3 with 1 rules applied. Total rules applied 471 place count 23 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 472 place count 23 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 474 place count 21 transition count 24
Reduce places removed 1 places and 0 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 2 rules applied. Total rules applied 476 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 477 place count 19 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 477 place count 19 transition count 20
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 483 place count 16 transition count 20
Applied a total of 483 rules in 51 ms. Remains 16 /265 variables (removed 249) and now considering 20/312 (removed 292) transitions.
[2025-06-03 12:55:18] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 16 cols
[2025-06-03 12:55:18] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:55:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-03 12:55:18] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 12:55:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 12:55:18] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 12:55:18] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-03 12:55:18] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 12:55:18] [INFO ] Invariant cache hit.
[2025-06-03 12:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 18 constraints, problems are : Problem set: 0 solved, 18 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/34 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 36 constraints, problems are : Problem set: 0 solved, 18 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 950ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 951ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/265 places, 20/312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1124 ms. Remains : 16/265 places, 20/312 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-14
Product exploration explored 100000 steps with 33092 reset in 102 ms.
Stack based approach found an accepted trace after 114 steps with 37 reset with depth 4 and stack size 4 in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-14 finished in 1429 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(F(((X(p0)&&G((p1||G(p2))))||G(p0)))))))'
Found a Shortening insensitive property : DiscoveryGPU-PT-14b-LTLFireability-00
Stuttering acceptance computed with spot in 375 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 265/265 places, 312/312 transitions.
Graph (complete) has 528 edges and 265 vertex of which 260 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 259 transition count 270
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 223 transition count 270
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 73 place count 223 transition count 225
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 163 place count 178 transition count 225
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 168 place count 173 transition count 219
Iterating global reduction 2 with 5 rules applied. Total rules applied 173 place count 173 transition count 219
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 169 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 169 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 184 place count 166 transition count 209
Iterating global reduction 2 with 3 rules applied. Total rules applied 187 place count 166 transition count 209
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 189 place count 164 transition count 207
Iterating global reduction 2 with 2 rules applied. Total rules applied 191 place count 164 transition count 207
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 317 place count 101 transition count 144
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 329 place count 89 transition count 121
Iterating global reduction 2 with 12 rules applied. Total rules applied 341 place count 89 transition count 121
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 352 place count 78 transition count 110
Iterating global reduction 2 with 11 rules applied. Total rules applied 363 place count 78 transition count 110
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 374 place count 67 transition count 88
Iterating global reduction 2 with 11 rules applied. Total rules applied 385 place count 67 transition count 88
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 396 place count 56 transition count 77
Iterating global reduction 2 with 11 rules applied. Total rules applied 407 place count 56 transition count 77
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 418 place count 45 transition count 55
Iterating global reduction 2 with 11 rules applied. Total rules applied 429 place count 45 transition count 55
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 440 place count 34 transition count 44
Iterating global reduction 2 with 11 rules applied. Total rules applied 451 place count 34 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 452 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 454 place count 32 transition count 42
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 54 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 459 place count 30 transition count 38
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 462 place count 27 transition count 38
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 468 place count 24 transition count 35
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 471 place count 21 transition count 32
Applied a total of 471 rules in 32 ms. Remains 21 /265 variables (removed 244) and now considering 32/312 (removed 280) transitions.
[2025-06-03 12:55:20] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 21 cols
[2025-06-03 12:55:20] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:55:20] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 12:55:20] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2025-06-03 12:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 12:55:20] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 25 sub problems to find dead transitions.
[2025-06-03 12:55:20] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2025-06-03 12:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/44 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 3/47 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/48 variables, and 22 constraints, problems are : Problem set: 0 solved, 25 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 26/44 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 3/47 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/48 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1768ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1768ms
Starting structural reductions in LI_LTL mode, iteration 1 : 21/265 places, 32/312 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1902 ms. Remains : 21/265 places, 32/312 transitions.
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLFireability-00
Stuttering criterion allowed to conclude after 8307 steps with 190 reset in 60 ms.
Treatment of property DiscoveryGPU-PT-14b-LTLFireability-00 finished in 2626 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X(X((p1||X((p2 U p3))))))))'
[2025-06-03 12:55:23] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2909670683460279826
[2025-06-03 12:55:23] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2025-06-03 12:55:23] [INFO ] Applying decomposition
[2025-06-03 12:55:23] [INFO ] Flatten gal took : 16 ms
[2025-06-03 12:55:23] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 12:55:23] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2025-06-03 12:55:23] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12459557092676971253.txt' '-o' '/tmp/graph12459557092676971253.bin' '-w' '/tmp/graph12459557092676971253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12459557092676971253.bin' '-l' '-1' '-v' '-w' '/tmp/graph12459557092676971253.weights' '-q' '0' '-e' '0.001'
[2025-06-03 12:55:23] [INFO ] Decomposing Gal with order
[2025-06-03 12:55:23] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2025-06-03 12:55:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 12:55:23] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 12:55:23] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2909670683460279826
Running compilation step : cd /tmp/ltsmin2909670683460279826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 12:55:23] [INFO ] Removed a total of 118 redundant transitions.
[2025-06-03 12:55:23] [INFO ] Flatten gal took : 35 ms
[2025-06-03 12:55:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2025-06-03 12:55:23] [INFO ] Time to serialize gal into /tmp/LTLFireability14569686082137737447.gal : 14 ms
[2025-06-03 12:55:23] [INFO ] Time to serialize properties into /tmp/LTLFireability14603657770870231950.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14569686082137737447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14603657770870231950.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(X(X(F(((X("(i9.u23.p73!=1)"))&&(G(("(i7.i0.u16.p44!=1)")||(G("((i8.u20.p62==1)&&(i13.u93.p406==1))")))))||(G("(i9.u23.p73!=1)")))...160
Formula 0 simplified : XXXG(F!"(i9.u23.p73!=1)" & (X!"(i9.u23.p73!=1)" | F(!"(i7.i0.u16.p44!=1)" & F!"((i8.u20.p62==1)&&(i13.u93.p406==1))")))
Compilation finished in 1081 ms.
Running link step : cd /tmp/ltsmin2909670683460279826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2909670683460279826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>(((X((LTLAPp0==true))&&[](((LTLAPp1==true)||[]((LTLAPp2==true)))))||[]((LTLAPp0==true)))))))' '--buchi-type=spotba'
LTSmin run took 78111 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2909670683460279826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([]((LTLAPp3==true)) U X(X(((LTLAPp4==true)||X(((LTLAPp5==true) U (LTLAPp6==true))))))))' '--buchi-type=spotba'
LTSmin run took 36130 ms.
FORMULA DiscoveryGPU-PT-14b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1040379 ms.
BK_STOP 1748955439066
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-14b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-14b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854064700748"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-14b.tgz
mv DiscoveryGPU-PT-14b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;