About the Execution of ITS-Tools for NoC3x3-PT-8B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | F?FFFTFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812300276.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 NoC3x3-PT-8B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812300276
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 NoC3x3-PT-8B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748854725788
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 08:58:46] [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-02 08:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:58:47] [INFO ] Load time of PNML (sax parser for PT used): 369 ms
[2025-06-02 08:58:47] [INFO ] Transformed 9140 places.
[2025-06-02 08:58:47] [INFO ] Transformed 14577 transitions.
[2025-06-02 08:58:47] [INFO ] Found NUPN structural information;
[2025-06-02 08:58:47] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 561 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-8B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 9140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 9107 transition count 14577
Discarding 5496 places :
Symmetric choice reduction at 1 with 5496 rule applications. Total rules 5529 place count 3611 transition count 9081
Iterating global reduction 1 with 5496 rules applied. Total rules applied 11025 place count 3611 transition count 9081
Ensure Unique test removed 3045 transitions
Reduce isomorphic transitions removed 3045 transitions.
Iterating post reduction 1 with 3045 rules applied. Total rules applied 14070 place count 3611 transition count 6036
Discarding 1996 places :
Symmetric choice reduction at 2 with 1996 rule applications. Total rules 16066 place count 1615 transition count 4040
Iterating global reduction 2 with 1996 rules applied. Total rules applied 18062 place count 1615 transition count 4040
Ensure Unique test removed 1867 transitions
Reduce isomorphic transitions removed 1867 transitions.
Iterating post reduction 2 with 1867 rules applied. Total rules applied 19929 place count 1615 transition count 2173
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 19994 place count 1550 transition count 2108
Iterating global reduction 3 with 65 rules applied. Total rules applied 20059 place count 1550 transition count 2108
Applied a total of 20059 rules in 1312 ms. Remains 1550 /9140 variables (removed 7590) and now considering 2108/14577 (removed 12469) transitions.
// Phase 1: matrix 2108 rows 1550 cols
[2025-06-02 08:58:49] [INFO ] Computed 66 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:58:49] [INFO ] Implicit Places using invariants in 774 ms returned []
[2025-06-02 08:58:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:58:51] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 2059 ms to find 0 implicit places.
Running 2107 sub problems to find dead transitions.
[2025-06-02 08:58:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1549/3658 variables, and 0 constraints, problems are : Problem set: 0 solved, 2107 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1550 constraints, PredecessorRefiner: 2107/2107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1549/3658 variables, and 0 constraints, problems are : Problem set: 0 solved, 2107 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1550 constraints, PredecessorRefiner: 0/2107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60677ms problems are : Problem set: 0 solved, 2107 unsolved
Search for dead transitions found 0 dead transitions in 60695ms
Starting structural reductions in LTL mode, iteration 1 : 1550/9140 places, 2108/14577 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64091 ms. Remains : 1550/9140 places, 2108/14577 transitions.
Support contains 38 out of 1550 places after structural reductions.
[2025-06-02 08:59:52] [INFO ] Flatten gal took : 134 ms
[2025-06-02 08:59:52] [INFO ] Flatten gal took : 87 ms
[2025-06-02 08:59:52] [INFO ] Input system was already deterministic with 2108 transitions.
Reduction of identical properties reduced properties to check from 37 to 36
RANDOM walk for 40000 steps (16 resets) in 1345 ms. (29 steps per ms) remains 4/36 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
[2025-06-02 08:59:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 189/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1288/1482 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1482 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2073/3555 variables, 1482/1548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3555 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 103/3658 variables, 68/1616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3658 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3658 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3658/3658 variables, and 1616 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1550/1550 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 189/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1288/1482 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:59:54] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:59:54] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1482 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1482 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2073/3555 variables, 1482/1550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3555 variables, 2/1552 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:59:55] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:59:55] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3555 variables, 2/1554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3555 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 103/3658 variables, 68/1622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3658 variables, 1/1623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3658 variables, 0/1623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3658 variables, 0/1623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3658/3658 variables, and 1623 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2804 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1550/1550 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3852ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 1381 ms.
Support contains 1 out of 1550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Graph (trivial) has 1362 edges and 1550 vertex of which 494 / 1550 are part of one of the 33 SCC in 5 ms
Free SCC test removed 461 places
Drop transitions (Empty/Sink Transition effects.) removed 537 transitions
Reduce isomorphic transitions removed 537 transitions.
Graph (complete) has 2659 edges and 1089 vertex of which 1087 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 258 rules applied. Total rules applied 260 place count 1087 transition count 1313
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 234 rules applied. Total rules applied 494 place count 879 transition count 1287
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 21 rules applied. Total rules applied 515 place count 868 transition count 1277
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 519 place count 864 transition count 1277
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 519 place count 864 transition count 1183
Deduced a syphon composed of 94 places in 3 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 707 place count 770 transition count 1183
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 805 place count 672 transition count 993
Iterating global reduction 4 with 98 rules applied. Total rules applied 903 place count 672 transition count 993
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 975 place count 672 transition count 921
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 226
Deduced a syphon composed of 226 places in 0 ms
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 5 with 452 rules applied. Total rules applied 1427 place count 446 transition count 695
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1474 place count 446 transition count 648
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1480 place count 443 transition count 689
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1481 place count 443 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 1487 place count 443 transition count 682
Free-agglomeration rule applied 206 times.
Iterating global reduction 7 with 206 rules applied. Total rules applied 1693 place count 443 transition count 476
Reduce places removed 206 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 785 edges and 237 vertex of which 230 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 220 rules applied. Total rules applied 1913 place count 230 transition count 463
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1920 place count 230 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 168 transitions
Redundant transition composition rules discarded 168 transitions
Iterating global reduction 9 with 168 rules applied. Total rules applied 2088 place count 230 transition count 288
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 602 edges and 222 vertex of which 200 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 9 rules applied. Total rules applied 2097 place count 200 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 2119 place count 200 transition count 266
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 11 with 25 rules applied. Total rules applied 2144 place count 200 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2145 place count 200 transition count 265
Applied a total of 2145 rules in 288 ms. Remains 200 /1550 variables (removed 1350) and now considering 265/2108 (removed 1843) transitions.
Running 256 sub problems to find dead transitions.
// Phase 1: matrix 265 rows 200 cols
[2025-06-02 08:59:58] [INFO ] Computed 58 invariants in 5 ms
[2025-06-02 08:59:58] [INFO ] State equation strengthened by 194 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Problem TDEAD246 is UNSAT
At refinement iteration 3 (OVERLAPS) 265/465 variables, 200/258 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 194/452 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/452 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/465 variables, 0/452 constraints. Problems are: Problem set: 1 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 452 constraints, problems are : Problem set: 1 solved, 255 unsolved in 12118 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 200/200 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 255 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 265/465 variables, 200/258 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 194/452 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 255/707 constraints. Problems are: Problem set: 1 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/707 constraints. Problems are: Problem set: 1 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 707 constraints, problems are : Problem set: 1 solved, 255 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 200/200 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 255/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32224ms problems are : Problem set: 1 solved, 255 unsolved
Search for dead transitions found 1 dead transitions in 32225ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 200/1550 places, 264/2108 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32521 ms. Remains : 200/1550 places, 264/2108 transitions.
RANDOM walk for 10399 steps (3 resets) in 84 ms. (122 steps per ms) remains 0/1 properties
Computed a total of 201 stabilizing places and 323 stable transitions
Graph (complete) has 3250 edges and 1550 vertex of which 1548 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.45 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))||((p1 U p2) U (p0&&(p1 U p2))))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1526 transition count 2084
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1526 transition count 2084
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 70 place count 1526 transition count 2062
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 83 place count 1513 transition count 2049
Iterating global reduction 1 with 13 rules applied. Total rules applied 96 place count 1513 transition count 2049
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 109 place count 1513 transition count 2036
Applied a total of 109 rules in 129 ms. Remains 1513 /1550 variables (removed 37) and now considering 2036/2108 (removed 72) transitions.
// Phase 1: matrix 2036 rows 1513 cols
[2025-06-02 09:00:31] [INFO ] Computed 66 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:00:32] [INFO ] Implicit Places using invariants in 496 ms returned []
[2025-06-02 09:00:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:00:33] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
Running 2035 sub problems to find dead transitions.
[2025-06-02 09:00:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 2035/2035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2035 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/2035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60449ms problems are : Problem set: 0 solved, 2035 unsolved
Search for dead transitions found 0 dead transitions in 60453ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1550 places, 2036/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62327 ms. Remains : 1513/1550 places, 2036/2108 transitions.
Stuttering acceptance computed with spot in 420 ms :[true, (NOT p2), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 10 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-00 finished in 62832 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(X(X(p1))))))'
Support contains 2 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1525 transition count 2083
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1525 transition count 2083
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 73 place count 1525 transition count 2060
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 86 place count 1512 transition count 2047
Iterating global reduction 1 with 13 rules applied. Total rules applied 99 place count 1512 transition count 2047
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 112 place count 1512 transition count 2034
Applied a total of 112 rules in 120 ms. Remains 1512 /1550 variables (removed 38) and now considering 2034/2108 (removed 74) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2025-06-02 09:01:34] [INFO ] Computed 66 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:01:34] [INFO ] Implicit Places using invariants in 497 ms returned []
[2025-06-02 09:01:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:01:36] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
Running 2033 sub problems to find dead transitions.
[2025-06-02 09:01:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2033/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2033 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60475ms problems are : Problem set: 0 solved, 2033 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1550 places, 2034/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62307 ms. Remains : 1512/1550 places, 2034/2108 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-01
Product exploration explored 100000 steps with 20004 reset in 310 ms.
Product exploration explored 100000 steps with 19936 reset in 273 ms.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3174 edges and 1512 vertex of which 1511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 198 stabilizing places and 316 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 3377 steps (0 resets) in 45 ms. (73 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 2034/2034 transitions.
Applied a total of 0 rules in 45 ms. Remains 1512 /1512 variables (removed 0) and now considering 2034/2034 (removed 0) transitions.
[2025-06-02 09:02:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:02:38] [INFO ] Implicit Places using invariants in 498 ms returned []
[2025-06-02 09:02:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:02:39] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
Running 2033 sub problems to find dead transitions.
[2025-06-02 09:02:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2033/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2033 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 timeout
1)
(s185 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 2033 unsolved
Search for dead transitions found 0 dead transitions in 60463ms
Finished structural reductions in LTL mode , in 1 iterations and 62266 ms. Remains : 1512/1512 places, 2034/2034 transitions.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3174 edges and 1512 vertex of which 1511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 198 stabilizing places and 316 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 2563 steps (0 resets) in 24 ms. (102 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20023 reset in 225 ms.
Product exploration explored 100000 steps with 20044 reset in 272 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1512/1512 places, 2034/2034 transitions.
Graph (trivial) has 1290 edges and 1512 vertex of which 468 / 1512 are part of one of the 33 SCC in 8 ms
Free SCC test removed 435 places
Ensure Unique test removed 460 transitions
Reduce isomorphic transitions removed 460 transitions.
Graph (complete) has 2665 edges and 1077 vertex of which 1076 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 208 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 256 rules applied. Total rules applied 258 place count 1076 transition count 1525
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 59 Pre rules applied. Total rules applied 258 place count 1076 transition count 1604
Deduced a syphon composed of 267 places in 4 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 317 place count 1076 transition count 1604
Discarding 185 places :
Symmetric choice reduction at 1 with 185 rule applications. Total rules 502 place count 891 transition count 1347
Deduced a syphon composed of 166 places in 3 ms
Iterating global reduction 1 with 185 rules applied. Total rules applied 687 place count 891 transition count 1347
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 753 place count 891 transition count 1281
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 753 place count 891 transition count 1298
Deduced a syphon composed of 182 places in 3 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 769 place count 891 transition count 1298
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 787 place count 873 transition count 1243
Deduced a syphon composed of 164 places in 3 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 805 place count 873 transition count 1243
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 805 place count 873 transition count 1250
Deduced a syphon composed of 171 places in 3 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 812 place count 873 transition count 1250
Performed 217 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 388 places in 1 ms
Iterating global reduction 2 with 217 rules applied. Total rules applied 1029 place count 873 transition count 1250
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 1054 place count 873 transition count 1225
Discarding 117 places :
Symmetric choice reduction at 3 with 117 rule applications. Total rules 1171 place count 756 transition count 1074
Deduced a syphon composed of 279 places in 0 ms
Iterating global reduction 3 with 117 rules applied. Total rules applied 1288 place count 756 transition count 1074
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1296 place count 748 transition count 1066
Deduced a syphon composed of 271 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1304 place count 748 transition count 1066
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -216
Deduced a syphon composed of 296 places in 1 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 1329 place count 748 transition count 1282
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1354 place count 748 transition count 1257
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1379 place count 723 transition count 1124
Deduced a syphon composed of 271 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 1404 place count 723 transition count 1124
Deduced a syphon composed of 271 places in 0 ms
Applied a total of 1404 rules in 376 ms. Remains 723 /1512 variables (removed 789) and now considering 1124/2034 (removed 910) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:03:42] [INFO ] Redundant transitions in 62 ms returned []
Running 1123 sub problems to find dead transitions.
[2025-06-02 09:03:42] [INFO ] Flow matrix only has 1092 transitions (discarded 32 similar events)
// Phase 1: matrix 1092 rows 723 cols
[2025-06-02 09:03:42] [INFO ] Computed 66 invariants in 16 ms
[2025-06-02 09:03:42] [INFO ] State equation strengthened by 53 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1123 unsolved
SMT process timed out in 30609ms, After SMT, problems are : Problem set: 0 solved, 1123 unsolved
Search for dead transitions found 0 dead transitions in 30611ms
Starting structural reductions in SI_LTL mode, iteration 1 : 723/1512 places, 1124/2034 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31057 ms. Remains : 723/1512 places, 1124/2034 transitions.
Built C files in :
/tmp/ltsmin4200175978307003646
[2025-06-02 09:04:13] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4200175978307003646
Running compilation step : cd /tmp/ltsmin4200175978307003646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4200175978307003646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4200175978307003646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 2034/2034 transitions.
Applied a total of 0 rules in 35 ms. Remains 1512 /1512 variables (removed 0) and now considering 2034/2034 (removed 0) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2025-06-02 09:04:16] [INFO ] Computed 66 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:04:16] [INFO ] Implicit Places using invariants in 516 ms returned []
[2025-06-02 09:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:04:18] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
Running 2033 sub problems to find dead transitions.
[2025-06-02 09:04:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2033/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2033 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60445ms problems are : Problem set: 0 solved, 2033 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Finished structural reductions in LTL mode , in 1 iterations and 62217 ms. Remains : 1512/1512 places, 2034/2034 transitions.
Built C files in :
/tmp/ltsmin13967143100059178872
[2025-06-02 09:05:18] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13967143100059178872
Running compilation step : cd /tmp/ltsmin13967143100059178872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13967143100059178872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13967143100059178872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 09:05:21] [INFO ] Flatten gal took : 63 ms
[2025-06-02 09:05:21] [INFO ] Flatten gal took : 60 ms
[2025-06-02 09:05:21] [INFO ] Time to serialize gal into /tmp/LTL5514822027851525815.gal : 16 ms
[2025-06-02 09:05:21] [INFO ] Time to serialize properties into /tmp/LTL11152900689506978201.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/LTL5514822027851525815.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6339509996543536174.hoa' '-atoms' '/tmp/LTL11152900689506978201.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/LTL11152900689506978201.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6339509996543536174.hoa
Detected timeout of ITS tools.
[2025-06-02 09:05:36] [INFO ] Flatten gal took : 51 ms
[2025-06-02 09:05:37] [INFO ] Flatten gal took : 51 ms
[2025-06-02 09:05:37] [INFO ] Time to serialize gal into /tmp/LTL9948233516839811264.gal : 10 ms
[2025-06-02 09:05:37] [INFO ] Time to serialize properties into /tmp/LTL7466588189835964049.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9948233516839811264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7466588189835964049.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(("(p3925==1)")||(X(X(X("(p5216==0)")))))))
Formula 0 simplified : F(!"(p3925==1)" & XXX!"(p5216==0)")
Detected timeout of ITS tools.
[2025-06-02 09:05:52] [INFO ] Flatten gal took : 43 ms
[2025-06-02 09:05:52] [INFO ] Applying decomposition
[2025-06-02 09:05:52] [INFO ] Flatten gal took : 44 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/graph11723906311962887100.txt' '-o' '/tmp/graph11723906311962887100.bin' '-w' '/tmp/graph11723906311962887100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11723906311962887100.bin' '-l' '-1' '-v' '-w' '/tmp/graph11723906311962887100.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:05:52] [INFO ] Decomposing Gal with order
[2025-06-02 09:05:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:05:52] [INFO ] Removed a total of 1035 redundant transitions.
[2025-06-02 09:05:52] [INFO ] Flatten gal took : 152 ms
[2025-06-02 09:05:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 43 ms.
[2025-06-02 09:05:52] [INFO ] Time to serialize gal into /tmp/LTL1430206008568631907.gal : 18 ms
[2025-06-02 09:05:52] [INFO ] Time to serialize properties into /tmp/LTL11354139843643695867.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/LTL1430206008568631907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11354139843643695867.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(("(i9.u229.p3925==1)")||(X(X(X("(i13.u307.p5216==0)")))))))
Formula 0 simplified : F(!"(i9.u229.p3925==1)" & XXX!"(i13.u307.p5216==0)")
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-8B-LTLFireability-01 finished in 273516 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((X((G(p0) U p1))&&(F(G(p2)) U p2)))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1527 transition count 2085
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1527 transition count 2085
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 66 place count 1527 transition count 2065
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 77 place count 1516 transition count 2054
Iterating global reduction 1 with 11 rules applied. Total rules applied 88 place count 1516 transition count 2054
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 99 place count 1516 transition count 2043
Applied a total of 99 rules in 113 ms. Remains 1516 /1550 variables (removed 34) and now considering 2043/2108 (removed 65) transitions.
// Phase 1: matrix 2043 rows 1516 cols
[2025-06-02 09:06:07] [INFO ] Computed 66 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:06:08] [INFO ] Implicit Places using invariants in 518 ms returned []
[2025-06-02 09:06:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:06:09] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
Running 2042 sub problems to find dead transitions.
[2025-06-02 09:06:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3559 variables, and 0 constraints, problems are : Problem set: 0 solved, 2042 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 2042/2042 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2042 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1515/3559 variables, and 0 constraints, problems are : Problem set: 0 solved, 2042 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/2042 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60454ms problems are : Problem set: 0 solved, 2042 unsolved
Search for dead transitions found 0 dead transitions in 60457ms
Starting structural reductions in LTL mode, iteration 1 : 1516/1550 places, 2043/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62341 ms. Remains : 1516/1550 places, 2043/2108 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-02
Stuttering criterion allowed to conclude after 2683 steps with 0 reset in 12 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-02 finished in 62715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||((G(p1) U p2) U p3))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Graph (trivial) has 1355 edges and 1550 vertex of which 490 / 1550 are part of one of the 33 SCC in 2 ms
Free SCC test removed 457 places
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 496 transitions.
Graph (complete) has 2698 edges and 1093 vertex of which 1091 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 1090 transition count 1352
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 229 rules applied. Total rules applied 488 place count 883 transition count 1330
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 17 rules applied. Total rules applied 505 place count 874 transition count 1322
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 508 place count 871 transition count 1322
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 508 place count 871 transition count 1226
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 700 place count 775 transition count 1226
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 798 place count 677 transition count 1036
Iterating global reduction 4 with 98 rules applied. Total rules applied 896 place count 677 transition count 1036
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 4 with 69 rules applied. Total rules applied 965 place count 677 transition count 967
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1413 place count 453 transition count 743
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1460 place count 453 transition count 696
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1464 place count 453 transition count 692
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1466 place count 453 transition count 692
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1468 place count 451 transition count 690
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1501 place count 442 transition count 666
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1549 place count 418 transition count 642
Applied a total of 1549 rules in 138 ms. Remains 418 /1550 variables (removed 1132) and now considering 642/2108 (removed 1466) transitions.
[2025-06-02 09:07:10] [INFO ] Flow matrix only has 610 transitions (discarded 32 similar events)
// Phase 1: matrix 610 rows 418 cols
[2025-06-02 09:07:10] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:07:10] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-02 09:07:10] [INFO ] Flow matrix only has 610 transitions (discarded 32 similar events)
[2025-06-02 09:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:07:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 09:07:11] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:07:11] [INFO ] Redundant transitions in 6 ms returned []
Running 598 sub problems to find dead transitions.
[2025-06-02 09:07:11] [INFO ] Flow matrix only has 610 transitions (discarded 32 similar events)
[2025-06-02 09:07:11] [INFO ] Invariant cache hit.
[2025-06-02 09:07:11] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (OVERLAPS) 9/418 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 609/1027 variables, 418/475 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1027/1028 variables, and 503 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 418/418 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 598 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 2 (OVERLAPS) 9/418 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 4 (OVERLAPS) 609/1027 variables, 418/475 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 598 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1027 variables, 598/1101 constraints. Problems are: Problem set: 0 solved, 598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1027/1028 variables, and 1101 constraints, problems are : Problem set: 0 solved, 598 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 418/418 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 598/598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 598 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in SI_LTL mode, iteration 1 : 418/1550 places, 642/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60808 ms. Remains : 418/1550 places, 642/2108 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-03 finished in 60875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((X(X(p1))&&(!p1||G(p2))) U (p0&&X(X(p1))&&(!p1||G(p2))))))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1526 transition count 2084
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1526 transition count 2084
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 70 place count 1526 transition count 2062
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 83 place count 1513 transition count 2049
Iterating global reduction 1 with 13 rules applied. Total rules applied 96 place count 1513 transition count 2049
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 109 place count 1513 transition count 2036
Applied a total of 109 rules in 150 ms. Remains 1513 /1550 variables (removed 37) and now considering 2036/2108 (removed 72) transitions.
// Phase 1: matrix 2036 rows 1513 cols
[2025-06-02 09:08:11] [INFO ] Computed 66 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:08:12] [INFO ] Implicit Places using invariants in 487 ms returned []
[2025-06-02 09:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:08:13] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
Running 2035 sub problems to find dead transitions.
[2025-06-02 09:08:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 2035/2035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2035 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3549 variables, and 0 constraints, problems are : Problem set: 0 solved, 2035 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/2035 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60444ms problems are : Problem set: 0 solved, 2035 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1550 places, 2036/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62373 ms. Remains : 1513/1550 places, 2036/2108 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-04 finished in 62682 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(F((F(p0)&&X(p1))))))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1525 transition count 2083
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1525 transition count 2083
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 73 place count 1525 transition count 2060
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 87 place count 1511 transition count 2046
Iterating global reduction 1 with 14 rules applied. Total rules applied 101 place count 1511 transition count 2046
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 115 place count 1511 transition count 2032
Applied a total of 115 rules in 147 ms. Remains 1511 /1550 variables (removed 39) and now considering 2032/2108 (removed 76) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2025-06-02 09:09:14] [INFO ] Computed 66 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:09:14] [INFO ] Implicit Places using invariants in 521 ms returned []
[2025-06-02 09:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:09:16] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
Running 2031 sub problems to find dead transitions.
[2025-06-02 09:09:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 2031/2031 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2031 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/2031 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 2031 unsolved
Search for dead transitions found 0 dead transitions in 60447ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1550 places, 2032/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62375 ms. Remains : 1511/1550 places, 2032/2108 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-05
Product exploration explored 100000 steps with 16666 reset in 291 ms.
Product exploration explored 100000 steps with 16666 reset in 252 ms.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3172 edges and 1511 vertex of which 1510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 198 stabilizing places and 316 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (15 resets) in 349 ms. (114 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
[2025-06-02 09:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1299/1444 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1444 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1998/3442 variables, 1444/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3442 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 101/3543 variables, 67/1577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3543 variables, 0/1577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3543 variables, 0/1577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3543/3543 variables, and 1577 constraints, problems are : Problem set: 0 solved, 2 unsolved in 821 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1299/1444 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:19] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:19] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1444 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1998/3442 variables, 1444/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3442 variables, 2/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:19] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3442 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 101/3543 variables, 67/1582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3543 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3543 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3543/3543 variables, and 1582 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1951 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2781ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 304 ms.
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1511/1511 places, 2032/2032 transitions.
Graph (trivial) has 1289 edges and 1511 vertex of which 480 / 1511 are part of one of the 33 SCC in 1 ms
Free SCC test removed 447 places
Drop transitions (Empty/Sink Transition effects.) removed 508 transitions
Reduce isomorphic transitions removed 508 transitions.
Graph (complete) has 2609 edges and 1064 vertex of which 1063 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 248 rules applied. Total rules applied 250 place count 1063 transition count 1276
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 450 place count 863 transition count 1276
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 450 place count 863 transition count 1181
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 640 place count 768 transition count 1181
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 736 place count 672 transition count 993
Iterating global reduction 2 with 96 rules applied. Total rules applied 832 place count 672 transition count 993
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 902 place count 672 transition count 923
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 225
Deduced a syphon composed of 225 places in 0 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 1352 place count 447 transition count 698
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1400 place count 447 transition count 650
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1406 place count 444 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1407 place count 444 transition count 690
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1414 place count 444 transition count 683
Free-agglomeration rule applied 205 times.
Iterating global reduction 5 with 205 rules applied. Total rules applied 1619 place count 444 transition count 478
Reduce places removed 205 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 791 edges and 239 vertex of which 232 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 219 rules applied. Total rules applied 1838 place count 232 transition count 465
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1845 place count 232 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 167 transitions
Redundant transition composition rules discarded 167 transitions
Iterating global reduction 7 with 167 rules applied. Total rules applied 2012 place count 232 transition count 291
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 609 edges and 224 vertex of which 201 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 9 rules applied. Total rules applied 2021 place count 201 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 2044 place count 201 transition count 268
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 2069 place count 201 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2070 place count 201 transition count 267
Applied a total of 2070 rules in 108 ms. Remains 201 /1511 variables (removed 1310) and now considering 267/2032 (removed 1765) transitions.
Running 258 sub problems to find dead transitions.
// Phase 1: matrix 267 rows 201 cols
[2025-06-02 09:10:21] [INFO ] Computed 58 invariants in 0 ms
[2025-06-02 09:10:21] [INFO ] State equation strengthened by 190 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Problem TDEAD248 is UNSAT
At refinement iteration 3 (OVERLAPS) 267/468 variables, 201/259 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 190/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/468 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 449 constraints, problems are : Problem set: 1 solved, 257 unsolved in 12039 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 201/201 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 257 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 267/468 variables, 201/259 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 190/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 257/706 constraints. Problems are: Problem set: 1 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:44] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 1/707 constraints. Problems are: Problem set: 1 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 707 constraints, problems are : Problem set: 1 solved, 257 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 201/201 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 257/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32132ms problems are : Problem set: 1 solved, 257 unsolved
Search for dead transitions found 1 dead transitions in 32132ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 201/1511 places, 266/2032 transitions.
Applied a total of 0 rules in 5 ms. Remains 201 /201 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32246 ms. Remains : 201/1511 places, 266/2032 transitions.
RANDOM walk for 14367 steps (3 resets) in 66 ms. (214 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1511/1511 places, 2032/2032 transitions.
Applied a total of 0 rules in 67 ms. Remains 1511 /1511 variables (removed 0) and now considering 2032/2032 (removed 0) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2025-06-02 09:10:54] [INFO ] Computed 66 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:10:54] [INFO ] Implicit Places using invariants in 488 ms returned []
[2025-06-02 09:10:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:10:55] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
Running 2031 sub problems to find dead transitions.
[2025-06-02 09:10:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 2031/2031 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2031 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/2031 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60440ms problems are : Problem set: 0 solved, 2031 unsolved
Search for dead transitions found 0 dead transitions in 60443ms
Finished structural reductions in LTL mode , in 1 iterations and 62265 ms. Remains : 1511/1511 places, 2032/2032 transitions.
Computed a total of 198 stabilizing places and 316 stable transitions
Graph (complete) has 3172 edges and 1511 vertex of which 1510 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 198 stabilizing places and 316 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (15 resets) in 254 ms. (156 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
[2025-06-02 09:11:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1299/1444 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1444 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1998/3442 variables, 1444/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3442 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 101/3543 variables, 67/1577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3543 variables, 0/1577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/3543 variables, 0/1577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3543/3543 variables, and 1577 constraints, problems are : Problem set: 0 solved, 2 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 142/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1299/1444 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:11:57] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:11:58] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1444 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1444 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1998/3442 variables, 1444/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3442 variables, 2/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:11:58] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3442 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3442 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 101/3543 variables, 67/1582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3543 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3543 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3543/3543 variables, and 1582 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1511/1511 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2757ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 293 ms.
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1511/1511 places, 2032/2032 transitions.
Graph (trivial) has 1289 edges and 1511 vertex of which 480 / 1511 are part of one of the 33 SCC in 1 ms
Free SCC test removed 447 places
Drop transitions (Empty/Sink Transition effects.) removed 508 transitions
Reduce isomorphic transitions removed 508 transitions.
Graph (complete) has 2609 edges and 1064 vertex of which 1063 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 248 rules applied. Total rules applied 250 place count 1063 transition count 1276
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 450 place count 863 transition count 1276
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 450 place count 863 transition count 1181
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 640 place count 768 transition count 1181
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 736 place count 672 transition count 993
Iterating global reduction 2 with 96 rules applied. Total rules applied 832 place count 672 transition count 993
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 902 place count 672 transition count 923
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 225
Deduced a syphon composed of 225 places in 0 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 1352 place count 447 transition count 698
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 1400 place count 447 transition count 650
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1406 place count 444 transition count 691
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1407 place count 444 transition count 690
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 1414 place count 444 transition count 683
Free-agglomeration rule applied 205 times.
Iterating global reduction 5 with 205 rules applied. Total rules applied 1619 place count 444 transition count 478
Reduce places removed 205 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 791 edges and 239 vertex of which 232 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 219 rules applied. Total rules applied 1838 place count 232 transition count 465
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1845 place count 232 transition count 458
Drop transitions (Redundant composition of simpler transitions.) removed 167 transitions
Redundant transition composition rules discarded 167 transitions
Iterating global reduction 7 with 167 rules applied. Total rules applied 2012 place count 232 transition count 291
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 609 edges and 224 vertex of which 201 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 9 rules applied. Total rules applied 2021 place count 201 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 2044 place count 201 transition count 268
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 2069 place count 201 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2070 place count 201 transition count 267
Applied a total of 2070 rules in 100 ms. Remains 201 /1511 variables (removed 1310) and now considering 267/2032 (removed 1765) transitions.
Running 258 sub problems to find dead transitions.
// Phase 1: matrix 267 rows 201 cols
[2025-06-02 09:11:59] [INFO ] Computed 58 invariants in 2 ms
[2025-06-02 09:11:59] [INFO ] State equation strengthened by 190 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Problem TDEAD248 is UNSAT
At refinement iteration 3 (OVERLAPS) 267/468 variables, 201/259 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 190/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/468 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 449 constraints, problems are : Problem set: 1 solved, 257 unsolved in 11927 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 201/201 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 257 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 267/468 variables, 201/259 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 190/449 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 257/706 constraints. Problems are: Problem set: 1 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:12:23] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 1/707 constraints. Problems are: Problem set: 1 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 707 constraints, problems are : Problem set: 1 solved, 257 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 201/201 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 257/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32019ms problems are : Problem set: 1 solved, 257 unsolved
Search for dead transitions found 1 dead transitions in 32019ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 201/1511 places, 266/2032 transitions.
Applied a total of 0 rules in 5 ms. Remains 201 /201 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32125 ms. Remains : 201/1511 places, 266/2032 transitions.
RANDOM walk for 7366 steps (1 resets) in 44 ms. (163 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 16666 reset in 288 ms.
Product exploration explored 100000 steps with 16666 reset in 223 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1511/1511 places, 2032/2032 transitions.
Graph (trivial) has 1289 edges and 1511 vertex of which 480 / 1511 are part of one of the 33 SCC in 1 ms
Free SCC test removed 447 places
Ensure Unique test removed 474 transitions
Reduce isomorphic transitions removed 474 transitions.
Graph (complete) has 2642 edges and 1064 vertex of which 1063 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 248 rules applied. Total rules applied 250 place count 1063 transition count 1509
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 58 Pre rules applied. Total rules applied 250 place count 1063 transition count 1588
Deduced a syphon composed of 258 places in 3 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 308 place count 1063 transition count 1588
Discarding 183 places :
Symmetric choice reduction at 1 with 183 rule applications. Total rules 491 place count 880 transition count 1329
Deduced a syphon composed of 163 places in 3 ms
Iterating global reduction 1 with 183 rules applied. Total rules applied 674 place count 880 transition count 1329
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 744 place count 880 transition count 1259
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 744 place count 880 transition count 1276
Deduced a syphon composed of 179 places in 3 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 760 place count 880 transition count 1276
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 778 place count 862 transition count 1221
Deduced a syphon composed of 161 places in 3 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 796 place count 862 transition count 1221
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 796 place count 862 transition count 1228
Deduced a syphon composed of 168 places in 2 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 803 place count 862 transition count 1228
Performed 215 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 383 places in 0 ms
Iterating global reduction 2 with 215 rules applied. Total rules applied 1018 place count 862 transition count 1228
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1042 place count 862 transition count 1204
Discarding 115 places :
Symmetric choice reduction at 3 with 115 rule applications. Total rules 1157 place count 747 transition count 1055
Deduced a syphon composed of 276 places in 1 ms
Iterating global reduction 3 with 115 rules applied. Total rules applied 1272 place count 747 transition count 1055
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1280 place count 739 transition count 1047
Deduced a syphon composed of 268 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1288 place count 739 transition count 1047
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -208
Deduced a syphon composed of 292 places in 1 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 1312 place count 739 transition count 1255
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1336 place count 739 transition count 1231
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1360 place count 715 transition count 1103
Deduced a syphon composed of 268 places in 0 ms
Iterating global reduction 4 with 24 rules applied. Total rules applied 1384 place count 715 transition count 1103
Deduced a syphon composed of 268 places in 1 ms
Applied a total of 1384 rules in 212 ms. Remains 715 /1511 variables (removed 796) and now considering 1103/2032 (removed 929) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:12:34] [INFO ] Redundant transitions in 10 ms returned []
Running 1102 sub problems to find dead transitions.
[2025-06-02 09:12:34] [INFO ] Flow matrix only has 1071 transitions (discarded 32 similar events)
// Phase 1: matrix 1071 rows 715 cols
[2025-06-02 09:12:34] [INFO ] Computed 66 invariants in 11 ms
[2025-06-02 09:12:34] [INFO ] State equation strengthened by 53 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/714 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1102 unsolved
At refinement iteration 1 (OVERLAPS) 1/715 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 715/1786 variables, and 66 constraints, problems are : Problem set: 0 solved, 1102 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 0/715 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 1102/1046 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/714 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1102 unsolved
At refinement iteration 1 (OVERLAPS) 1/715 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:25] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD963 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/715 variables, 20/86 constraints. Problems are: Problem set: 233 solved, 869 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:26] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:27] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:27] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:27] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:27] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:27] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:27] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:27] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:27] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:28] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD145 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:28] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:28] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
Problem TDEAD147 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:28] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD148 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:28] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
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 TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/715 variables, 20/106 constraints. Problems are: Problem set: 317 solved, 785 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:29] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:29] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD200 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:29] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
Problem TDEAD201 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:29] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Problem TDEAD202 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:29] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 2 ms to minimize.
Problem TDEAD204 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:29] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
Problem TDEAD238 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:29] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Problem TDEAD239 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 2 ms to minimize.
Problem TDEAD264 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Problem TDEAD265 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
Problem TDEAD300 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 2 ms to minimize.
Problem TDEAD301 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Problem TDEAD302 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 2 ms to minimize.
Problem TDEAD324 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:30] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD450 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:33] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem TDEAD530 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:33] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD534 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:13:33] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD940 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/715 variables, 20/126 constraints. Problems are: Problem set: 357 solved, 745 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 1)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 1)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 1)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 1)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 1)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 1)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 1)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 1)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 1)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 1)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 1)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 1)
(s501 1)
(s502 0)
(s503 0)
(s504 0)timeout
(s505 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 715/1786 variables, and 126 constraints, problems are : Problem set: 357 solved, 745 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 0/715 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 56/1046 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60626ms problems are : Problem set: 357 solved, 745 unsolved
Search for dead transitions found 357 dead transitions in 60627ms
Found 357 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 357 transitions
Dead transitions reduction (with SMT) removed 357 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 715/1511 places, 746/2032 transitions.
Graph (complete) has 1615 edges and 715 vertex of which 486 are kept as prefixes of interest. Removing 229 places using SCC suffix rule.0 ms
Discarding 229 places :
Also discarding 0 output transitions
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 1 rules in 11 ms. Remains 486 /715 variables (removed 229) and now considering 746/746 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 486/1511 places, 746/2032 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60872 ms. Remains : 486/1511 places, 746/2032 transitions.
Built C files in :
/tmp/ltsmin2294140139502093594
[2025-06-02 09:13:34] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2294140139502093594
Running compilation step : cd /tmp/ltsmin2294140139502093594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2294140139502093594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2294140139502093594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1511/1511 places, 2032/2032 transitions.
Applied a total of 0 rules in 51 ms. Remains 1511 /1511 variables (removed 0) and now considering 2032/2032 (removed 0) transitions.
// Phase 1: matrix 2032 rows 1511 cols
[2025-06-02 09:13:37] [INFO ] Computed 66 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:13:38] [INFO ] Implicit Places using invariants in 505 ms returned []
[2025-06-02 09:13:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:13:39] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
Running 2031 sub problems to find dead transitions.
[2025-06-02 09:13:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 2031/2031 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2031 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3543 variables, and 0 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/2031 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 2031 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Finished structural reductions in LTL mode , in 1 iterations and 62260 ms. Remains : 1511/1511 places, 2032/2032 transitions.
Built C files in :
/tmp/ltsmin5666953289172503737
[2025-06-02 09:14:40] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5666953289172503737
Running compilation step : cd /tmp/ltsmin5666953289172503737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5666953289172503737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5666953289172503737;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 09:14:43] [INFO ] Flatten gal took : 38 ms
[2025-06-02 09:14:43] [INFO ] Flatten gal took : 36 ms
[2025-06-02 09:14:43] [INFO ] Time to serialize gal into /tmp/LTL2293860995450209962.gal : 8 ms
[2025-06-02 09:14:43] [INFO ] Time to serialize properties into /tmp/LTL16443478862755731677.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/LTL2293860995450209962.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8558457943465541814.hoa' '-atoms' '/tmp/LTL16443478862755731677.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/LTL16443478862755731677.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8558457943465541814.hoa
Detected timeout of ITS tools.
[2025-06-02 09:14:58] [INFO ] Flatten gal took : 35 ms
[2025-06-02 09:14:58] [INFO ] Flatten gal took : 34 ms
[2025-06-02 09:14:58] [INFO ] Time to serialize gal into /tmp/LTL10857155673213836208.gal : 6 ms
[2025-06-02 09:14:58] [INFO ] Time to serialize properties into /tmp/LTL15575292948994157662.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/LTL10857155673213836208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15575292948994157662.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F((F("(p7729==0)"))&&(X("((p911==0)||(p1488==0))")))))))))
Formula 0 simplified : XXXXG(G!"(p7729==0)" | X!"((p911==0)||(p1488==0))")
Detected timeout of ITS tools.
[2025-06-02 09:15:13] [INFO ] Flatten gal took : 33 ms
[2025-06-02 09:15:13] [INFO ] Applying decomposition
[2025-06-02 09:15:13] [INFO ] Flatten gal took : 33 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/graph8038897335510656319.txt' '-o' '/tmp/graph8038897335510656319.bin' '-w' '/tmp/graph8038897335510656319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8038897335510656319.bin' '-l' '-1' '-v' '-w' '/tmp/graph8038897335510656319.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:15:13] [INFO ] Decomposing Gal with order
[2025-06-02 09:15:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:15:13] [INFO ] Removed a total of 1040 redundant transitions.
[2025-06-02 09:15:13] [INFO ] Flatten gal took : 74 ms
[2025-06-02 09:15:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 315 labels/synchronizations in 39 ms.
[2025-06-02 09:15:13] [INFO ] Time to serialize gal into /tmp/LTL1966914132335774866.gal : 11 ms
[2025-06-02 09:15:13] [INFO ] Time to serialize properties into /tmp/LTL17821440816397132523.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/LTL1966914132335774866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17821440816397132523.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F((F("(i20.u433.p7729==0)"))&&(X("((i2.i0.i3.u76.p911==0)||(i3.u120.p1488==0))")))))))))
Formula 0 simplified : XXXXG(G!"(i20.u433.p7729==0)" | X!"((i2.i0.i3.u76.p911==0)||(i3.u120.p1488==0))")
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-8B-LTLFireability-05 finished in 374818 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(G(p0))&&F(p1))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Graph (trivial) has 1360 edges and 1550 vertex of which 494 / 1550 are part of one of the 33 SCC in 1 ms
Free SCC test removed 461 places
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Graph (complete) has 2692 edges and 1089 vertex of which 1087 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 258 rules applied. Total rules applied 260 place count 1086 transition count 1345
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 232 rules applied. Total rules applied 492 place count 878 transition count 1321
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 18 rules applied. Total rules applied 510 place count 868 transition count 1313
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 513 place count 865 transition count 1313
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 513 place count 865 transition count 1218
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 703 place count 770 transition count 1218
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 801 place count 672 transition count 1028
Iterating global reduction 4 with 98 rules applied. Total rules applied 899 place count 672 transition count 1028
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 971 place count 672 transition count 956
Performed 223 Post agglomeration using F-continuation condition.Transition count delta: 223
Deduced a syphon composed of 223 places in 0 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 5 with 446 rules applied. Total rules applied 1417 place count 449 transition count 733
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 1463 place count 449 transition count 687
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1465 place count 449 transition count 685
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1470 place count 449 transition count 685
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1472 place count 447 transition count 683
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1505 place count 438 transition count 659
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1553 place count 414 transition count 635
Applied a total of 1553 rules in 99 ms. Remains 414 /1550 variables (removed 1136) and now considering 635/2108 (removed 1473) transitions.
[2025-06-02 09:15:29] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
// Phase 1: matrix 603 rows 414 cols
[2025-06-02 09:15:29] [INFO ] Computed 57 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:15:29] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-02 09:15:29] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
[2025-06-02 09:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:15:29] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 09:15:29] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:15:29] [INFO ] Redundant transitions in 4 ms returned []
Running 593 sub problems to find dead transitions.
[2025-06-02 09:15:29] [INFO ] Flow matrix only has 603 transitions (discarded 32 similar events)
[2025-06-02 09:15:29] [INFO ] Invariant cache hit.
[2025-06-02 09:15:29] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (OVERLAPS) 9/414 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (OVERLAPS) 602/1016 variables, 414/471 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1016 variables, 28/499 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 2.0)
(t2 1.0)
(t3 0.0)
(t4 0.0)
(t5 2.0)
(t6 0.0)
(t8 1.0)
(t9 0.0)
(t10 2.0)
(t11 0.0)
(t12 0.0)
(t13 2.0)
(t14 3.0)
(t15 0.0)
(t16 2.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 1.0)
(t21 2.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 2.0)
(t28 1.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 4.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 3.0)
(t40 0.0)
(t41 0.0)
(t42 2.0)
(t43 0.0)
(t44 0.0)
(t45 1.0)
(t46 0.0)
(t47 0.0)
(t48 2.0)
(t49 2.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 1.0)
(t55 2.0)
(t56 2.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 2.0)
(t61 4.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 2.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 1.0)
(t75 4.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 4.0)
(t80 3.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 1.0)
(t89 4.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 2.0)
(t94 0.0)
(t95 0.0)
(t96 1.0)
(t97 0.0)
(t98 4.0)
(t99 4.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 3.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 1.0)
(t111 4.0)
(t112 4.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 1.0)
(t119 1.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 1.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 1.0)
(t129 1.0)
(t130 1.0)
(t131 1.0)
(t132 1.0)
(t133 0.0)
(t134 1.0)
(t135 0.0)
(t136 1.0)
(t137 1.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 2.0)
(t143 1.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 1.0)
(t149 1.0)
(t150 1.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 1.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 1.0)
(t159 0.0)
(t160 1.0)
(t161 1.0)
(t162 1.0)
(t163 0.0)
(t164 1.0)
(t165 2.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 0.0)
(t178 2.0)
(t179 2.0)
(t180 0.0)
(t181 0.0)
(t182 2.0)
(t183 1.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 0.0)
(t190 2.0)
(t191 2.0)
(t192 1.0)
(t193 1.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 2.0)
(t199 2.0)
(t200 2.0)
(t201 2.0)
(t202 2.0)
(t203 1.0)
(t204 0.0)
(t205 0.0)
(t206 2.0)
(t207 2.0)
(t208 2.0)
(t209 2.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 2.0)
(t235 2.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 1.0)
(t241 1.0)
(t242 0.0)
(t243 0.0)
(t244 1.0)
(t245 1.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 0.0)
(t252 1.0)
(t253 1.0)
(t254 0.0)
(t255 0.0)
(t256 1.0)
(t257 1.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 0.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 0.0)
(t272 1.0)
(t273 1.0)
(t274 1.0)
(t275 1.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 0.0)
(t287 0.0)
(t288 0.0)
(t289 0.0)
(t290 0.0)
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 0.0)
(t300 0.0)
(t301 0.0)
(t302 0.0)
(t303 0.0)
(t304 0.0)
(t305 0.0)
(t306 0.0)
(t307 0.0)
(t308 0.0)
(t309 0.0)
(t310 0.0)
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 0.0)
(t315 0.0)
(t316 0.0)
(t317 0.0)
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 0.0)
(t324 0.0)
(t325 0.0)
(t326 0.0)
(t327 0.0)
(t328 0.0)
(t329 0.0)
(t330 0.0)
(t331 0.0)
(t332 0.0)
(t333 0.0)
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 0.0)
(t338 0.0)
(t339 0.0)
(t340 0.0)
(t341 0.0)
(t342 0.0)
(t343 1.0)
(t344 0.0)
(t345 0.0)
(t346 0.0)
(t347 0.0)
(t348 0.0)
(t349 0.0)
(t350 0.0)
(t351 0.0)
(t352 0.0)
(t353 0.0)
(t354 0.0)
(t355 0.0)
(t356 0.0)
(t357 0.0)
(t358 0.0)
(t359 0.0)
(t360 0.0)
(t361 0.0)
(t362 0.0)
(t363 0.0)
(t364 0.0)
(t365 0.0)
(t366 0.0)
(t367 0.0)
(t368 0.0)
(t369 0.0)
(t370 0.0)
(t371 0.0)
(t372 0.0)
(t373 0.0)
(t374 0.0)
(t375 0.0)
(t376 0.0)
(t377 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1016/1017 variables, and 499 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 414/414 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 593 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 2 (OVERLAPS) 9/414 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 4 (OVERLAPS) 602/1016 variables, 414/471 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1016 variables, 28/499 constraints. Problems are: Problem set: 0 solved, 593 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1016 variables, 593/1092 constraints. Problems are: Problem set: 0 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1016/1017 variables, and 1092 constraints, problems are : Problem set: 0 solved, 593 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 414/414 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 593/593 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 593 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in SI_LTL mode, iteration 1 : 414/1550 places, 635/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60753 ms. Remains : 414/1550 places, 635/2108 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-06 finished in 60888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(X(F(p1)))||(p2&&G(F(p3))))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1526 transition count 2084
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1526 transition count 2084
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 71 place count 1526 transition count 2061
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 85 place count 1512 transition count 2047
Iterating global reduction 1 with 14 rules applied. Total rules applied 99 place count 1512 transition count 2047
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 113 place count 1512 transition count 2033
Applied a total of 113 rules in 149 ms. Remains 1512 /1550 variables (removed 38) and now considering 2033/2108 (removed 75) transitions.
// Phase 1: matrix 2033 rows 1512 cols
[2025-06-02 09:16:29] [INFO ] Computed 66 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:30] [INFO ] Implicit Places using invariants in 496 ms returned []
[2025-06-02 09:16:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:16:31] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
Running 2032 sub problems to find dead transitions.
[2025-06-02 09:16:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3545 variables, and 0 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2032/2032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2032 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3545 variables, and 0 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 2032 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1550 places, 2033/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62296 ms. Remains : 1512/1550 places, 2033/2108 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-07
Product exploration explored 100000 steps with 646 reset in 208 ms.
Product exploration explored 100000 steps with 644 reset in 260 ms.
Computed a total of 199 stabilizing places and 317 stable transitions
Graph (complete) has 3173 edges and 1512 vertex of which 1511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 199 stabilizing places and 317 stable transitions
Detected a total of 199/1512 stabilizing places and 317/2033 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (X p3)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 377 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 424 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (14 resets) in 277 ms. (143 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2025-06-02 09:17:33] [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) 124/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1319/1445 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:34] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1445 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1445 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1999/3444 variables, 1445/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3444 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 101/3545 variables, 67/1579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3545 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3545 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3545/3545 variables, and 1579 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1183 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1319/1445 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1445 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:35] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:35] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1445 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1445 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1999/3444 variables, 1445/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:17:36] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3444 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3444 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 101/3545 variables, 67/1582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3545 variables, 1/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3545 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3545 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3545/3545 variables, and 1583 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2533ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 374 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=124 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (X p3)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p3 p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p3 p1))), (F (NOT (OR p0 (NOT p2)))), (F p1), (F (NOT p3))]
Knowledge based reduction with 14 factoid took 1496 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 434 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 381 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
[2025-06-02 09:17:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 09:17:39] [INFO ] [Real]Absence check using 66 positive place invariants in 143 ms returned sat
[2025-06-02 09:17:51] [INFO ] [Real]Absence check using state equation in 11965 ms returned sat
[2025-06-02 09:17:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 09:17:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 287 ms returned sat
[2025-06-02 09:18:06] [INFO ] [Nat]Absence check using state equation in 14049 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 3 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 2033/2033 transitions.
Applied a total of 0 rules in 44 ms. Remains 1512 /1512 variables (removed 0) and now considering 2033/2033 (removed 0) transitions.
[2025-06-02 09:18:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:18:07] [INFO ] Implicit Places using invariants in 499 ms returned []
[2025-06-02 09:18:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:18:08] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
Running 2032 sub problems to find dead transitions.
[2025-06-02 09:18:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3545 variables, and 0 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2032/2032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2032 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3545 variables, and 0 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 2032 unsolved
Search for dead transitions found 0 dead transitions in 60443ms
Finished structural reductions in LTL mode , in 1 iterations and 62269 ms. Remains : 1512/1512 places, 2033/2033 transitions.
Computed a total of 199 stabilizing places and 317 stable transitions
Graph (complete) has 3173 edges and 1512 vertex of which 1511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 199 stabilizing places and 317 stable transitions
Detected a total of 199/1512 stabilizing places and 317/2033 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (X p3)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 393 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 398 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (15 resets) in 313 ms. (127 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
[2025-06-02 09:19: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) 124/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1319/1445 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:10] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1445 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1445 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1999/3444 variables, 1445/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3444 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 101/3545 variables, 67/1579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3545 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3545 variables, 0/1579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3545/3545 variables, and 1579 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/126 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1319/1445 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1445 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:11] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:11] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1445 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1445 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1999/3444 variables, 1445/1514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:19:12] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3444 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3444 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 101/3545 variables, 67/1582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3545 variables, 1/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3545 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/3545 variables, 0/1583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3545/3545 variables, and 1583 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 1512/1512 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2530ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 622 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=124 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (X p3)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p3 p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p3 p1))), (F (NOT (OR p0 (NOT p2)))), (F p1), (F (NOT p3))]
Knowledge based reduction with 14 factoid took 1543 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 360 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 408 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
[2025-06-02 09:19:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 09:19:15] [INFO ] [Real]Absence check using 66 positive place invariants in 141 ms returned sat
[2025-06-02 09:19:27] [INFO ] [Real]Absence check using state equation in 11989 ms returned sat
[2025-06-02 09:19:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 09:19:28] [INFO ] [Nat]Absence check using 66 positive place invariants in 295 ms returned sat
[2025-06-02 09:19:42] [INFO ] [Nat]Absence check using state equation in 14050 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 385 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 645 reset in 203 ms.
Product exploration explored 100000 steps with 643 reset in 229 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 412 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 3 out of 1512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1512/1512 places, 2033/2033 transitions.
Graph (trivial) has 1290 edges and 1512 vertex of which 480 / 1512 are part of one of the 33 SCC in 1 ms
Free SCC test removed 447 places
Ensure Unique test removed 474 transitions
Reduce isomorphic transitions removed 474 transitions.
Graph (complete) has 2643 edges and 1065 vertex of which 1064 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 248 rules applied. Total rules applied 250 place count 1064 transition count 1510
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 58 Pre rules applied. Total rules applied 250 place count 1064 transition count 1589
Deduced a syphon composed of 258 places in 3 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 308 place count 1064 transition count 1589
Discarding 183 places :
Symmetric choice reduction at 1 with 183 rule applications. Total rules 491 place count 881 transition count 1330
Deduced a syphon composed of 163 places in 3 ms
Iterating global reduction 1 with 183 rules applied. Total rules applied 674 place count 881 transition count 1330
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 744 place count 881 transition count 1260
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 744 place count 881 transition count 1277
Deduced a syphon composed of 179 places in 2 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 760 place count 881 transition count 1277
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 778 place count 863 transition count 1222
Deduced a syphon composed of 161 places in 2 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 796 place count 863 transition count 1222
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 796 place count 863 transition count 1229
Deduced a syphon composed of 168 places in 2 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 803 place count 863 transition count 1229
Performed 213 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 381 places in 1 ms
Iterating global reduction 2 with 213 rules applied. Total rules applied 1016 place count 863 transition count 1229
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1040 place count 863 transition count 1205
Discarding 115 places :
Symmetric choice reduction at 3 with 115 rule applications. Total rules 1155 place count 748 transition count 1056
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 3 with 115 rules applied. Total rules applied 1270 place count 748 transition count 1056
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1278 place count 740 transition count 1048
Deduced a syphon composed of 266 places in 1 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1286 place count 740 transition count 1048
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -208
Deduced a syphon composed of 290 places in 1 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 1310 place count 740 transition count 1256
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1334 place count 740 transition count 1232
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1358 place count 716 transition count 1104
Deduced a syphon composed of 266 places in 0 ms
Iterating global reduction 4 with 24 rules applied. Total rules applied 1382 place count 716 transition count 1104
Deduced a syphon composed of 266 places in 0 ms
Applied a total of 1382 rules in 181 ms. Remains 716 /1512 variables (removed 796) and now considering 1104/2033 (removed 929) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:19:44] [INFO ] Redundant transitions in 13 ms returned []
Running 1103 sub problems to find dead transitions.
[2025-06-02 09:19:44] [INFO ] Flow matrix only has 1072 transitions (discarded 32 similar events)
// Phase 1: matrix 1072 rows 716 cols
[2025-06-02 09:19:44] [INFO ] Computed 66 invariants in 11 ms
[2025-06-02 09:19:44] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/715 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
SMT process timed out in 30260ms, After SMT, problems are : Problem set: 0 solved, 1103 unsolved
Search for dead transitions found 0 dead transitions in 30262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 716/1512 places, 1104/2033 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30464 ms. Remains : 716/1512 places, 1104/2033 transitions.
Built C files in :
/tmp/ltsmin114371243768032
[2025-06-02 09:20:14] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin114371243768032
Running compilation step : cd /tmp/ltsmin114371243768032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin114371243768032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin114371243768032;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1512/1512 places, 2033/2033 transitions.
Applied a total of 0 rules in 44 ms. Remains 1512 /1512 variables (removed 0) and now considering 2033/2033 (removed 0) transitions.
// Phase 1: matrix 2033 rows 1512 cols
[2025-06-02 09:20:17] [INFO ] Computed 66 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:20:18] [INFO ] Implicit Places using invariants in 509 ms returned []
[2025-06-02 09:20:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:20:19] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
Running 2032 sub problems to find dead transitions.
[2025-06-02 09:20:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3545 variables, and 0 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2032/2032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2032 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3545 variables, and 0 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 2032 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Finished structural reductions in LTL mode , in 1 iterations and 62275 ms. Remains : 1512/1512 places, 2033/2033 transitions.
Built C files in :
/tmp/ltsmin4858811842347746176
[2025-06-02 09:21:19] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4858811842347746176
Running compilation step : cd /tmp/ltsmin4858811842347746176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4858811842347746176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4858811842347746176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 09:21:22] [INFO ] Flatten gal took : 33 ms
[2025-06-02 09:21:23] [INFO ] Flatten gal took : 32 ms
[2025-06-02 09:21:23] [INFO ] Time to serialize gal into /tmp/LTL785985558722663721.gal : 8 ms
[2025-06-02 09:21:23] [INFO ] Time to serialize properties into /tmp/LTL16286814949435970112.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/LTL785985558722663721.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17184606631341365747.hoa' '-atoms' '/tmp/LTL16286814949435970112.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/LTL16286814949435970112.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17184606631341365747.hoa
Detected timeout of ITS tools.
[2025-06-02 09:21:38] [INFO ] Flatten gal took : 33 ms
[2025-06-02 09:21:38] [INFO ] Flatten gal took : 34 ms
[2025-06-02 09:21:38] [INFO ] Time to serialize gal into /tmp/LTL2669719688251372849.gal : 6 ms
[2025-06-02 09:21:38] [INFO ] Time to serialize properties into /tmp/LTL2409642016594489032.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/LTL2669719688251372849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2409642016594489032.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("(p1542==1)"))||(X(X(F("(p30==1)")))))||(("(p4543==1)")&&(G(F("(p4543==0)")))))))
Formula 0 simplified : F(F!"(p1542==1)" & XXG!"(p30==1)" & (!"(p4543==1)" | FG!"(p4543==0)"))
Detected timeout of ITS tools.
[2025-06-02 09:21:53] [INFO ] Flatten gal took : 32 ms
[2025-06-02 09:21:53] [INFO ] Applying decomposition
[2025-06-02 09:21:53] [INFO ] Flatten gal took : 33 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/graph3576547656383147284.txt' '-o' '/tmp/graph3576547656383147284.bin' '-w' '/tmp/graph3576547656383147284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3576547656383147284.bin' '-l' '-1' '-v' '-w' '/tmp/graph3576547656383147284.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:21:53] [INFO ] Decomposing Gal with order
[2025-06-02 09:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:21:53] [INFO ] Removed a total of 1055 redundant transitions.
[2025-06-02 09:21:53] [INFO ] Flatten gal took : 63 ms
[2025-06-02 09:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 269 labels/synchronizations in 18 ms.
[2025-06-02 09:21:53] [INFO ] Time to serialize gal into /tmp/LTL10298455030327296769.gal : 12 ms
[2025-06-02 09:21:53] [INFO ] Time to serialize properties into /tmp/LTL12212966619064722885.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/LTL10298455030327296769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12212966619064722885.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(((G("(i4.u119.p1542==1)"))||(X(X(F("(i12.u13.p30==1)")))))||(("(i11.i1.i0.u280.p4543==1)")&&(G(F("(i11.i1.i0.u280.p4543==0)")))))...157
Formula 0 simplified : F(F!"(i4.u119.p1542==1)" & XXG!"(i12.u13.p30==1)" & (!"(i11.i1.i0.u280.p4543==1)" | FG!"(i11.i1.i0.u280.p4543==0)"))
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-8B-LTLFireability-07 finished in 338836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))||X(G(p2))))'
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1526 transition count 2084
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1526 transition count 2084
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 71 place count 1526 transition count 2061
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 84 place count 1513 transition count 2048
Iterating global reduction 1 with 13 rules applied. Total rules applied 97 place count 1513 transition count 2048
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 110 place count 1513 transition count 2035
Applied a total of 110 rules in 147 ms. Remains 1513 /1550 variables (removed 37) and now considering 2035/2108 (removed 73) transitions.
// Phase 1: matrix 2035 rows 1513 cols
[2025-06-02 09:22:08] [INFO ] Computed 66 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:22:09] [INFO ] Implicit Places using invariants in 504 ms returned []
[2025-06-02 09:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:22:10] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
Running 2034 sub problems to find dead transitions.
[2025-06-02 09:22:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3548 variables, and 0 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 2034/2034 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2034 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3548 variables, and 0 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/2034 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 2034 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1550 places, 2035/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62365 ms. Remains : 1513/1550 places, 2035/2108 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-08 finished in 62658 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 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Graph (trivial) has 1361 edges and 1550 vertex of which 494 / 1550 are part of one of the 33 SCC in 1 ms
Free SCC test removed 461 places
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Graph (complete) has 2692 edges and 1089 vertex of which 1087 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 258 rules applied. Total rules applied 260 place count 1086 transition count 1345
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 233 rules applied. Total rules applied 493 place count 878 transition count 1320
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 21 rules applied. Total rules applied 514 place count 867 transition count 1310
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 518 place count 863 transition count 1310
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 518 place count 863 transition count 1216
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 706 place count 769 transition count 1216
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 804 place count 671 transition count 1026
Iterating global reduction 4 with 98 rules applied. Total rules applied 902 place count 671 transition count 1026
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 974 place count 671 transition count 954
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1422 place count 447 transition count 730
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1469 place count 447 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1471 place count 445 transition count 681
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1504 place count 436 transition count 657
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1552 place count 412 transition count 633
Applied a total of 1552 rules in 80 ms. Remains 412 /1550 variables (removed 1138) and now considering 633/2108 (removed 1475) transitions.
[2025-06-02 09:23:11] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
// Phase 1: matrix 601 rows 412 cols
[2025-06-02 09:23:11] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:23:11] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-02 09:23:11] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
[2025-06-02 09:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:23:11] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 09:23:11] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:23:11] [INFO ] Redundant transitions in 4 ms returned []
Running 591 sub problems to find dead transitions.
[2025-06-02 09:23:11] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
[2025-06-02 09:23:11] [INFO ] Invariant cache hit.
[2025-06-02 09:23:11] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (OVERLAPS) 9/412 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/469 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 28/497 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1013 variables, and 497 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 412/412 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (OVERLAPS) 9/412 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/469 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 28/497 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 591/1088 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1013 variables, and 1088 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 412/412 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in SI_LTL mode, iteration 1 : 412/1550 places, 633/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60734 ms. Remains : 412/1550 places, 633/2108 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-10
Stuttering criterion allowed to conclude after 1475 steps with 8 reset in 12 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-10 finished in 60837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Graph (trivial) has 1361 edges and 1550 vertex of which 493 / 1550 are part of one of the 33 SCC in 1 ms
Free SCC test removed 460 places
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Graph (complete) has 2694 edges and 1090 vertex of which 1088 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 259 rules applied. Total rules applied 261 place count 1087 transition count 1346
Reduce places removed 209 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 235 rules applied. Total rules applied 496 place count 878 transition count 1320
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 21 rules applied. Total rules applied 517 place count 867 transition count 1310
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 521 place count 863 transition count 1310
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 521 place count 863 transition count 1216
Deduced a syphon composed of 94 places in 3 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 709 place count 769 transition count 1216
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 807 place count 671 transition count 1026
Iterating global reduction 4 with 98 rules applied. Total rules applied 905 place count 671 transition count 1026
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 977 place count 671 transition count 954
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Deduced a syphon composed of 224 places in 0 ms
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 5 with 448 rules applied. Total rules applied 1425 place count 447 transition count 730
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1472 place count 447 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1474 place count 445 transition count 681
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1507 place count 436 transition count 657
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1555 place count 412 transition count 633
Applied a total of 1555 rules in 79 ms. Remains 412 /1550 variables (removed 1138) and now considering 633/2108 (removed 1475) transitions.
[2025-06-02 09:24:12] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
// Phase 1: matrix 601 rows 412 cols
[2025-06-02 09:24:12] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:24:12] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-02 09:24:12] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
[2025-06-02 09:24:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:24:12] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 09:24:12] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:24:12] [INFO ] Redundant transitions in 3 ms returned []
Running 590 sub problems to find dead transitions.
[2025-06-02 09:24:12] [INFO ] Flow matrix only has 601 transitions (discarded 32 similar events)
[2025-06-02 09:24:12] [INFO ] Invariant cache hit.
[2025-06-02 09:24:12] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (OVERLAPS) 9/412 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/469 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 28/497 constraints. Problems are: Problem set: 0 solved, 590 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1013 variables, and 497 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 412/412 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 590 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 2 (OVERLAPS) 9/412 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/469 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 28/497 constraints. Problems are: Problem set: 0 solved, 590 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 590/1087 constraints. Problems are: Problem set: 0 solved, 590 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 1012/1013 variables, and 1087 constraints, problems are : Problem set: 0 solved, 590 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 412/412 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 590/590 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 590 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in SI_LTL mode, iteration 1 : 412/1550 places, 633/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60731 ms. Remains : 412/1550 places, 633/2108 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-11 finished in 60790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1)||(F(p0)&&(p2 U p3)))))'
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1527 transition count 2085
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1527 transition count 2085
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 67 place count 1527 transition count 2064
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 1515 transition count 2052
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 1515 transition count 2052
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 103 place count 1515 transition count 2040
Applied a total of 103 rules in 157 ms. Remains 1515 /1550 variables (removed 35) and now considering 2040/2108 (removed 68) transitions.
// Phase 1: matrix 2040 rows 1515 cols
[2025-06-02 09:25:13] [INFO ] Computed 66 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:13] [INFO ] Implicit Places using invariants in 508 ms returned []
[2025-06-02 09:25:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:14] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
Running 2039 sub problems to find dead transitions.
[2025-06-02 09:25:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1514/3555 variables, and 0 constraints, problems are : Problem set: 0 solved, 2039 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 2039/2039 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2039 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1514/3555 variables, and 0 constraints, problems are : Problem set: 0 solved, 2039 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1515 constraints, PredecessorRefiner: 0/2039 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60450ms problems are : Problem set: 0 solved, 2039 unsolved
Search for dead transitions found 0 dead transitions in 60454ms
Starting structural reductions in LTL mode, iteration 1 : 1515/1550 places, 2040/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62410 ms. Remains : 1515/1550 places, 2040/2108 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), true, (NOT p0), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-12
Stuttering criterion allowed to conclude after 1502 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-12 finished in 62775 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||X(F((F(p2)&&F(p3)&&p1))))))'
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1526 transition count 2084
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1526 transition count 2084
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 70 place count 1526 transition count 2062
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 84 place count 1512 transition count 2048
Iterating global reduction 1 with 14 rules applied. Total rules applied 98 place count 1512 transition count 2048
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 112 place count 1512 transition count 2034
Applied a total of 112 rules in 148 ms. Remains 1512 /1550 variables (removed 38) and now considering 2034/2108 (removed 74) transitions.
// Phase 1: matrix 2034 rows 1512 cols
[2025-06-02 09:26:15] [INFO ] Computed 66 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:16] [INFO ] Implicit Places using invariants in 513 ms returned []
[2025-06-02 09:26:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:17] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
Running 2033 sub problems to find dead transitions.
[2025-06-02 09:26:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 2033/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2033 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3546 variables, and 0 constraints, problems are : Problem set: 0 solved, 2033 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/2033 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 2033 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1550 places, 2034/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62327 ms. Remains : 1512/1550 places, 2034/2108 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-13
Stuttering criterion allowed to conclude after 1734 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-13 finished in 62531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Graph (trivial) has 1356 edges and 1550 vertex of which 475 / 1550 are part of one of the 33 SCC in 1 ms
Free SCC test removed 442 places
Ensure Unique test removed 474 transitions
Reduce isomorphic transitions removed 474 transitions.
Graph (complete) has 2728 edges and 1108 vertex of which 1106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 268 rules applied. Total rules applied 270 place count 1105 transition count 1363
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 246 rules applied. Total rules applied 516 place count 887 transition count 1335
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 21 rules applied. Total rules applied 537 place count 876 transition count 1325
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 7 rules applied. Total rules applied 544 place count 872 transition count 1322
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 550 place count 869 transition count 1319
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 95 Pre rules applied. Total rules applied 550 place count 869 transition count 1224
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 5 with 190 rules applied. Total rules applied 740 place count 774 transition count 1224
Discarding 94 places :
Symmetric choice reduction at 5 with 94 rule applications. Total rules 834 place count 680 transition count 1042
Iterating global reduction 5 with 94 rules applied. Total rules applied 928 place count 680 transition count 1042
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 5 with 68 rules applied. Total rules applied 996 place count 680 transition count 974
Performed 227 Post agglomeration using F-continuation condition.Transition count delta: 227
Deduced a syphon composed of 227 places in 0 ms
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 6 with 454 rules applied. Total rules applied 1450 place count 453 transition count 747
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 6 with 49 rules applied. Total rules applied 1499 place count 453 transition count 698
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1501 place count 451 transition count 696
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 7 with 33 rules applied. Total rules applied 1534 place count 442 transition count 672
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 1582 place count 418 transition count 648
Applied a total of 1582 rules in 83 ms. Remains 418 /1550 variables (removed 1132) and now considering 648/2108 (removed 1460) transitions.
[2025-06-02 09:27:18] [INFO ] Flow matrix only has 616 transitions (discarded 32 similar events)
// Phase 1: matrix 616 rows 418 cols
[2025-06-02 09:27:18] [INFO ] Computed 57 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:18] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-02 09:27:18] [INFO ] Flow matrix only has 616 transitions (discarded 32 similar events)
[2025-06-02 09:27:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:18] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 09:27:18] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:27:18] [INFO ] Redundant transitions in 5 ms returned []
Running 610 sub problems to find dead transitions.
[2025-06-02 09:27:18] [INFO ] Flow matrix only has 616 transitions (discarded 32 similar events)
[2025-06-02 09:27:18] [INFO ] Invariant cache hit.
[2025-06-02 09:27:18] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 9/418 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (OVERLAPS) 615/1033 variables, 418/475 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1033/1034 variables, and 503 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 418/418 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 610 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (OVERLAPS) 9/418 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 4 (OVERLAPS) 615/1033 variables, 418/475 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 28/503 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1033 variables, 610/1113 constraints. Problems are: Problem set: 0 solved, 610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1033/1034 variables, and 1113 constraints, problems are : Problem set: 0 solved, 610 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 418/418 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 610/610 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in SI_LTL mode, iteration 1 : 418/1550 places, 648/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60761 ms. Remains : 418/1550 places, 648/2108 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-14 finished in 60860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 1550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Graph (trivial) has 1359 edges and 1550 vertex of which 494 / 1550 are part of one of the 33 SCC in 1 ms
Free SCC test removed 461 places
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Graph (complete) has 2692 edges and 1089 vertex of which 1087 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 1086 transition count 1346
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 230 rules applied. Total rules applied 489 place count 879 transition count 1323
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 17 rules applied. Total rules applied 506 place count 869 transition count 1316
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 508 place count 867 transition count 1316
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 508 place count 867 transition count 1220
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 700 place count 771 transition count 1220
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 798 place count 673 transition count 1030
Iterating global reduction 4 with 98 rules applied. Total rules applied 896 place count 673 transition count 1030
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 968 place count 673 transition count 958
Performed 223 Post agglomeration using F-continuation condition.Transition count delta: 223
Deduced a syphon composed of 223 places in 0 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 5 with 446 rules applied. Total rules applied 1414 place count 450 transition count 735
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1461 place count 450 transition count 688
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1462 place count 450 transition count 687
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1464 place count 450 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1466 place count 448 transition count 685
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1499 place count 439 transition count 661
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1547 place count 415 transition count 637
Applied a total of 1547 rules in 90 ms. Remains 415 /1550 variables (removed 1135) and now considering 637/2108 (removed 1471) transitions.
[2025-06-02 09:28:19] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
// Phase 1: matrix 605 rows 415 cols
[2025-06-02 09:28:19] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:19] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-02 09:28:19] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2025-06-02 09:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:19] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 09:28:19] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:28:19] [INFO ] Redundant transitions in 4 ms returned []
Running 595 sub problems to find dead transitions.
[2025-06-02 09:28:19] [INFO ] Flow matrix only has 605 transitions (discarded 32 similar events)
[2025-06-02 09:28:19] [INFO ] Invariant cache hit.
[2025-06-02 09:28:19] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 9/415 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 604/1019 variables, 415/472 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 28/500 constraints. Problems are: Problem set: 0 solved, 595 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 Real declared 1019/1020 variables, and 500 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 415/415 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 9/415 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (OVERLAPS) 604/1019 variables, 415/472 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 28/500 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 595/1095 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1019/1020 variables, and 1095 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 415/415 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 595 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in SI_LTL mode, iteration 1 : 415/1550 places, 637/2108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60748 ms. Remains : 415/1550 places, 637/2108 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8B-LTLFireability-15 finished in 60809 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(X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((F(p0)&&X(p1))))))))'
Found a Shortening insensitive property : NoC3x3-PT-8B-LTLFireability-05
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Graph (trivial) has 1360 edges and 1550 vertex of which 494 / 1550 are part of one of the 33 SCC in 1 ms
Free SCC test removed 461 places
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Graph (complete) has 2692 edges and 1089 vertex of which 1087 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 258 rules applied. Total rules applied 260 place count 1086 transition count 1345
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 232 rules applied. Total rules applied 492 place count 878 transition count 1321
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 20 rules applied. Total rules applied 512 place count 868 transition count 1311
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 516 place count 864 transition count 1311
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 516 place count 864 transition count 1216
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 706 place count 769 transition count 1216
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 804 place count 671 transition count 1026
Iterating global reduction 4 with 98 rules applied. Total rules applied 902 place count 671 transition count 1026
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 974 place count 671 transition count 954
Performed 223 Post agglomeration using F-continuation condition.Transition count delta: 223
Deduced a syphon composed of 223 places in 0 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 5 with 446 rules applied. Total rules applied 1420 place count 448 transition count 731
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1467 place count 448 transition count 684
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1468 place count 448 transition count 684
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1470 place count 446 transition count 682
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 33 rules applied. Total rules applied 1503 place count 437 transition count 658
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 1551 place count 413 transition count 634
Applied a total of 1551 rules in 92 ms. Remains 413 /1550 variables (removed 1137) and now considering 634/2108 (removed 1474) transitions.
[2025-06-02 09:29:20] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
// Phase 1: matrix 602 rows 413 cols
[2025-06-02 09:29:20] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:20] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 09:29:20] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
[2025-06-02 09:29:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:20] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 09:29:21] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2025-06-02 09:29:21] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
[2025-06-02 09:29:21] [INFO ] Invariant cache hit.
[2025-06-02 09:29:21] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1015 variables, and 498 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1014 variables, 592/1090 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1015 variables, and 1090 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LI_LTL mode, iteration 1 : 413/1550 places, 634/2108 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60736 ms. Remains : 413/1550 places, 634/2108 transitions.
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-05
Product exploration explored 100000 steps with 16666 reset in 358 ms.
Product exploration explored 100000 steps with 16666 reset in 400 ms.
Computed a total of 33 stabilizing places and 57 stable transitions
Computed a total of 33 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (263 resets) in 248 ms. (160 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2025-06-02 09:30:22] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
[2025-06-02 09:30:22] [INFO ] Invariant cache hit.
[2025-06-02 09:30:22] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/74 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 142/216 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 35/251 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 35/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 273/524 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 12/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 64/588 variables, 17/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 64/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/588 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 202/790 variables, 70/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/790 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/790 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/790 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/829 variables, 12/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/829 variables, 39/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/829 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 132/961 variables, 43/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/961 variables, 4/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/961 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 35/996 variables, 11/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/996 variables, 35/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/996 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 16/1012 variables, 11/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1012 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1/1013 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1013 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1013 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 1/1014 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1014 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 0/1014 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1014/1015 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/74 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 142/216 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 35/251 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 35/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 273/524 variables, 63/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/588 variables, 17/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/588 variables, 64/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 202/790 variables, 70/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/790 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/790 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/790 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/829 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/829 variables, 39/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/829 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 132/961 variables, 43/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/961 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/961 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 35/996 variables, 11/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/996 variables, 35/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/996 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 16/1012 variables, 11/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1012 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/1013 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1013 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1013 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1/1014 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1014 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/1014 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1014/1015 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 709ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 634/634 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 413 transition count 601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 412 transition count 616
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 412 transition count 615
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 412 transition count 610
Free-agglomeration rule applied 188 times.
Iterating global reduction 2 with 188 rules applied. Total rules applied 229 place count 412 transition count 422
Reduce places removed 197 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 578 edges and 215 vertex of which 206 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 2 with 244 rules applied. Total rules applied 473 place count 206 transition count 376
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 497 place count 182 transition count 376
Drop transitions (Redundant composition of simpler transitions.) removed 144 transitions
Redundant transition composition rules discarded 144 transitions
Iterating global reduction 4 with 144 rules applied. Total rules applied 641 place count 182 transition count 232
Graph (complete) has 410 edges and 182 vertex of which 159 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 642 place count 159 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 665 place count 159 transition count 209
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 687 place count 159 transition count 209
Applied a total of 687 rules in 29 ms. Remains 159 /413 variables (removed 254) and now considering 209/634 (removed 425) transitions.
Running 185 sub problems to find dead transitions.
// Phase 1: matrix 209 rows 159 cols
[2025-06-02 09:30:23] [INFO ] Computed 48 invariants in 0 ms
[2025-06-02 09:30:23] [INFO ] State equation strengthened by 115 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Problem TDEAD192 is UNSAT
At refinement iteration 2 (OVERLAPS) 209/368 variables, 159/207 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 115/322 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/368 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 322 constraints, problems are : Problem set: 1 solved, 184 unsolved in 6305 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 159/159 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 184 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 48/48 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 209/368 variables, 159/207 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 115/322 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 184/506 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/506 constraints. Problems are: Problem set: 1 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/506 constraints. Problems are: Problem set: 1 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 506 constraints, problems are : Problem set: 1 solved, 184 unsolved in 7824 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 159/159 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 184/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14142ms problems are : Problem set: 1 solved, 184 unsolved
Search for dead transitions found 1 dead transitions in 14142ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/413 places, 208/634 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14179 ms. Remains : 159/413 places, 208/634 transitions.
RANDOM walk for 15387 steps (3 resets) in 63 ms. (240 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 634/634 transitions.
Applied a total of 0 rules in 9 ms. Remains 413 /413 variables (removed 0) and now considering 634/634 (removed 0) transitions.
[2025-06-02 09:30:38] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
// Phase 1: matrix 602 rows 413 cols
[2025-06-02 09:30:38] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:38] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-02 09:30:38] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
[2025-06-02 09:30:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:38] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-02 09:30:38] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2025-06-02 09:30:38] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
[2025-06-02 09:30:38] [INFO ] Invariant cache hit.
[2025-06-02 09:30:38] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)timeout
(s379 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1015 variables, and 498 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1014 variables, 592/1090 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1014/1015 variables, and 1090 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Finished structural reductions in LTL mode , in 1 iterations and 60637 ms. Remains : 413/413 places, 634/634 transitions.
Computed a total of 33 stabilizing places and 57 stable transitions
Computed a total of 33 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (255 resets) in 172 ms. (231 steps per ms) remains 1/3 properties
BEST_FIRST walk for 31533 steps (10 resets) in 53 ms. (583 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 16666 reset in 362 ms.
Product exploration explored 100000 steps with 16666 reset in 401 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 634/634 transitions.
Applied a total of 0 rules in 15 ms. Remains 413 /413 variables (removed 0) and now considering 634/634 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:31:41] [INFO ] Redundant transitions in 4 ms returned []
Running 592 sub problems to find dead transitions.
[2025-06-02 09:31:41] [INFO ] Flow matrix only has 602 transitions (discarded 32 similar events)
[2025-06-02 09:31:41] [INFO ] Invariant cache hit.
[2025-06-02 09:31:41] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1014/1015 variables, and 498 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (OVERLAPS) 9/413 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 601/1014 variables, 413/470 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1014 variables, 28/498 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1014 variables, 592/1090 constraints. Problems are: Problem set: 0 solved, 592 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 1014/1015 variables, and 1090 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 413/413 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60119 ms. Remains : 413/413 places, 634/634 transitions.
Built C files in :
/tmp/ltsmin9335175348844231505
[2025-06-02 09:32:41] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9335175348844231505
Running compilation step : cd /tmp/ltsmin9335175348844231505;'/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 915 ms.
Running link step : cd /tmp/ltsmin9335175348844231505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin9335175348844231505;'/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/stateBased2699753837290633000.hoa' '--buchi-type=spotba'
LTSmin run took 6213 ms.
Treatment of property NoC3x3-PT-8B-LTLFireability-05 finished in 208635 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-05 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(X(F(p1)))||(p2&&G(F(p3))))))'
Found a Shortening insensitive property : NoC3x3-PT-8B-LTLFireability-07
Stuttering acceptance computed with spot in 441 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 3 out of 1550 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1550/1550 places, 2108/2108 transitions.
Graph (trivial) has 1360 edges and 1550 vertex of which 494 / 1550 are part of one of the 33 SCC in 1 ms
Free SCC test removed 461 places
Ensure Unique test removed 502 transitions
Reduce isomorphic transitions removed 502 transitions.
Graph (complete) has 2692 edges and 1089 vertex of which 1087 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 1086 transition count 1346
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 231 rules applied. Total rules applied 490 place count 879 transition count 1322
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 20 rules applied. Total rules applied 510 place count 869 transition count 1312
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 514 place count 865 transition count 1312
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 514 place count 865 transition count 1217
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 704 place count 770 transition count 1217
Discarding 98 places :
Symmetric choice reduction at 4 with 98 rule applications. Total rules 802 place count 672 transition count 1027
Iterating global reduction 4 with 98 rules applied. Total rules applied 900 place count 672 transition count 1027
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 972 place count 672 transition count 955
Performed 221 Post agglomeration using F-continuation condition.Transition count delta: 221
Deduced a syphon composed of 221 places in 0 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 5 with 442 rules applied. Total rules applied 1414 place count 451 transition count 734
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 5 with 47 rules applied. Total rules applied 1461 place count 451 transition count 687
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1462 place count 451 transition count 687
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1464 place count 449 transition count 685
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 6 with 14 rules applied. Total rules applied 1478 place count 445 transition count 675
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1498 place count 435 transition count 665
Applied a total of 1498 rules in 91 ms. Remains 435 /1550 variables (removed 1115) and now considering 665/2108 (removed 1443) transitions.
[2025-06-02 09:32:49] [INFO ] Flow matrix only has 633 transitions (discarded 32 similar events)
// Phase 1: matrix 633 rows 435 cols
[2025-06-02 09:32:49] [INFO ] Computed 62 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:49] [INFO ] Implicit Places using invariants in 191 ms returned [11, 51, 102, 144]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 193 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 431/1550 places, 665/2108 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 431 transition count 655
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 30 place count 421 transition count 645
Applied a total of 30 rules in 9 ms. Remains 421 /431 variables (removed 10) and now considering 645/665 (removed 20) transitions.
[2025-06-02 09:32:49] [INFO ] Flow matrix only has 613 transitions (discarded 32 similar events)
// Phase 1: matrix 613 rows 421 cols
[2025-06-02 09:32:49] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:49] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-06-02 09:32:49] [INFO ] Flow matrix only has 613 transitions (discarded 32 similar events)
[2025-06-02 09:32:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-02 09:32:50] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 421/1550 places, 645/2108 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 870 ms. Remains : 421/1550 places, 645/2108 transitions.
Running random walk in product with property : NoC3x3-PT-8B-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property NoC3x3-PT-8B-LTLFireability-07 finished in 1464 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-06-02 09:32:50] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1157605885422825873
[2025-06-02 09:32:50] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2025-06-02 09:32:50] [INFO ] Applying decomposition
[2025-06-02 09:32:50] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1157605885422825873
Running compilation step : cd /tmp/ltsmin1157605885422825873;'/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-02 09:32:50] [INFO ] Flatten gal took : 35 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/graph2771145755069695621.txt' '-o' '/tmp/graph2771145755069695621.bin' '-w' '/tmp/graph2771145755069695621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2771145755069695621.bin' '-l' '-1' '-v' '-w' '/tmp/graph2771145755069695621.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:32:50] [INFO ] Decomposing Gal with order
[2025-06-02 09:32:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:32:50] [INFO ] Removed a total of 1047 redundant transitions.
[2025-06-02 09:32:50] [INFO ] Flatten gal took : 71 ms
[2025-06-02 09:32:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 267 labels/synchronizations in 19 ms.
[2025-06-02 09:32:50] [INFO ] Time to serialize gal into /tmp/LTLFireability15656987521113940878.gal : 11 ms
[2025-06-02 09:32:50] [INFO ] Time to serialize properties into /tmp/LTLFireability12360796155481068287.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/LTLFireability15656987521113940878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12360796155481068287.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 : !((G(("(i6.u240.p3925==1)")||(X(X(X("(i13.u317.p5216==0)")))))))
Formula 0 simplified : F(!"(i6.u240.p3925==1)" & XXX!"(i13.u317.p5216==0)")
Compilation finished in 4023 ms.
Running link step : cd /tmp/ltsmin1157605885422825873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1157605885422825873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin1157605885422825873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1157605885422825873;'/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' '[](([]((LTLAPp4==true))||X(X(<>((LTLAPp5==true))))||((LTLAPp6==true)&&[](<>((LTLAPp7==true))))))' '--buchi-type=spotba'
LTSmin run took 1241 ms.
FORMULA NoC3x3-PT-8B-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin1157605885422825873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8B"
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 NoC3x3-PT-8B, 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 r142-tall-174876812300276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-8B.tgz
mv NoC3x3-PT-8B 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 ;