About the Execution of ITS-Tools for FlexibleBarrier-PT-18b
| 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 | FFFFFFFFFTFFF?FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102700524.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 FlexibleBarrier-PT-18b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102700524
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 FlexibleBarrier-PT-18b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748974027911
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 18:07:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 18:07:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 18:07:11] [INFO ] Load time of PNML (sax parser for PT used): 611 ms
[2025-06-03 18:07:11] [INFO ] Transformed 4370 places.
[2025-06-03 18:07:11] [INFO ] Transformed 5037 transitions.
[2025-06-03 18:07:11] [INFO ] Found NUPN structural information;
[2025-06-03 18:07:12] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 927 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 4370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Discarding 1821 places :
Symmetric choice reduction at 0 with 1821 rule applications. Total rules 1821 place count 2549 transition count 3216
Iterating global reduction 0 with 1821 rules applied. Total rules applied 3642 place count 2549 transition count 3216
Discarding 858 places :
Symmetric choice reduction at 0 with 858 rule applications. Total rules 4500 place count 1691 transition count 2358
Iterating global reduction 0 with 858 rules applied. Total rules applied 5358 place count 1691 transition count 2358
Discarding 555 places :
Symmetric choice reduction at 0 with 555 rule applications. Total rules 5913 place count 1136 transition count 1803
Iterating global reduction 0 with 555 rules applied. Total rules applied 6468 place count 1136 transition count 1803
Ensure Unique test removed 269 transitions
Reduce isomorphic transitions removed 269 transitions.
Iterating post reduction 0 with 269 rules applied. Total rules applied 6737 place count 1136 transition count 1534
Applied a total of 6737 rules in 1559 ms. Remains 1136 /4370 variables (removed 3234) and now considering 1534/5037 (removed 3503) transitions.
// Phase 1: matrix 1534 rows 1136 cols
[2025-06-03 18:07:14] [INFO ] Computed 20 invariants in 93 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:07:16] [INFO ] Implicit Places using invariants in 2137 ms returned []
[2025-06-03 18:07:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:07:19] [INFO ] Implicit Places using invariants and state equation in 3123 ms returned []
Implicit Place search using SMT with State Equation took 5336 ms to find 0 implicit places.
Running 1533 sub problems to find dead transitions.
[2025-06-03 18:07:20] [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 1135/2670 variables, and 0 constraints, problems are : Problem set: 0 solved, 1533 unsolved in 30140 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1136 constraints, PredecessorRefiner: 1533/1533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s455 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
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 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1135/2670 variables, and 0 constraints, problems are : Problem set: 0 solved, 1533 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1136 constraints, PredecessorRefiner: 0/1533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62081ms problems are : Problem set: 0 solved, 1533 unsolved
Search for dead transitions found 0 dead transitions in 62147ms
Starting structural reductions in LTL mode, iteration 1 : 1136/4370 places, 1534/5037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69105 ms. Remains : 1136/4370 places, 1534/5037 transitions.
Support contains 46 out of 1136 places after structural reductions.
[2025-06-03 18:08:22] [INFO ] Flatten gal took : 247 ms
[2025-06-03 18:08:22] [INFO ] Flatten gal took : 110 ms
[2025-06-03 18:08:23] [INFO ] Input system was already deterministic with 1534 transitions.
Support contains 44 out of 1136 places (down from 46) after GAL structural reductions.
RANDOM walk for 40000 steps (320 resets) in 2616 ms. (15 steps per ms) remains 28/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
[2025-06-03 18:08:24] [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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 833/869 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 267/1136 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1534/2670 variables, 1136/1156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2670 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2670/2670 variables, and 1156 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1136/1136 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 833/869 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:30] [INFO ] Deduced a trap composed of 338 places in 992 ms of which 285 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:31] [INFO ] Deduced a trap composed of 340 places in 766 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:32] [INFO ] Deduced a trap composed of 337 places in 912 ms of which 250 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:33] [INFO ] Deduced a trap composed of 342 places in 834 ms of which 279 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2670 variables, and 17 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 13/20 constraints, State Equation: 0/1136 constraints, PredecessorRefiner: 0/27 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10061ms problems are : Problem set: 0 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 1136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Graph (trivial) has 752 edges and 1136 vertex of which 109 / 1136 are part of one of the 18 SCC in 8 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 1045 transition count 1346
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 967 transition count 1345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 966 transition count 1345
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 159 place count 966 transition count 1307
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 235 place count 928 transition count 1307
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 271 place count 892 transition count 1271
Iterating global reduction 3 with 36 rules applied. Total rules applied 307 place count 892 transition count 1271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 308 place count 892 transition count 1270
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 315 place count 885 transition count 1263
Iterating global reduction 4 with 7 rules applied. Total rules applied 322 place count 885 transition count 1263
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 548 place count 772 transition count 1150
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 565 place count 772 transition count 1133
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 582 place count 755 transition count 1116
Iterating global reduction 5 with 17 rules applied. Total rules applied 599 place count 755 transition count 1116
Free-agglomeration rule applied 335 times.
Iterating global reduction 5 with 335 rules applied. Total rules applied 934 place count 755 transition count 781
Reduce places removed 335 places and 0 transitions.
Iterating post reduction 5 with 335 rules applied. Total rules applied 1269 place count 420 transition count 781
Discarding 70 places :
Symmetric choice reduction at 6 with 70 rule applications. Total rules 1339 place count 350 transition count 711
Iterating global reduction 6 with 70 rules applied. Total rules applied 1409 place count 350 transition count 711
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 6 with 70 rules applied. Total rules applied 1479 place count 350 transition count 641
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1488 place count 350 transition count 632
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1489 place count 349 transition count 631
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 87 edges and 348 vertex of which 32 / 348 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 1492 place count 332 transition count 630
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 8 with 33 rules applied. Total rules applied 1525 place count 331 transition count 598
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 17 Pre rules applied. Total rules applied 1525 place count 331 transition count 581
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 1559 place count 314 transition count 581
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1597 place count 295 transition count 562
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 1615 place count 295 transition count 544
Free-agglomeration rule applied 18 times.
Iterating global reduction 9 with 18 rules applied. Total rules applied 1633 place count 295 transition count 526
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 9 with 59 rules applied. Total rules applied 1692 place count 271 transition count 491
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 30 rules applied. Total rules applied 1722 place count 256 transition count 476
Discarding 72 places :
Symmetric choice reduction at 11 with 72 rule applications. Total rules 1794 place count 184 transition count 404
Iterating global reduction 11 with 72 rules applied. Total rules applied 1866 place count 184 transition count 404
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 11 with 72 rules applied. Total rules applied 1938 place count 184 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 1951 place count 184 transition count 319
Applied a total of 1951 rules in 1834 ms. Remains 184 /1136 variables (removed 952) and now considering 319/1534 (removed 1215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1834 ms. Remains : 184/1136 places, 319/1534 transitions.
RANDOM walk for 40000 steps (8 resets) in 817 ms. (48 steps per ms) remains 24/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
// Phase 1: matrix 319 rows 184 cols
[2025-06-03 18:08:36] [INFO ] Computed 13 invariants in 5 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 158/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 310/481 variables, 171/179 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 17/498 variables, 10/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/498 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/499 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/499 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/503 variables, and 194 constraints, problems are : Problem set: 0 solved, 12 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, State Equation: 182/184 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 158/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:37] [INFO ] Deduced a trap composed of 139 places in 122 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:08:37] [INFO ] Deduced a trap composed of 140 places in 196 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 310/481 variables, 171/181 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 17/498 variables, 10/200 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1/499 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/499 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/499 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/503 variables, and 208 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2352 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, State Equation: 182/184 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2954ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 559 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 20 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1113 transition count 1511
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1113 transition count 1511
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 1113 transition count 1506
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 1095 transition count 1488
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 1095 transition count 1488
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 97 place count 1095 transition count 1478
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 1089 transition count 1472
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 1089 transition count 1472
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 1089 transition count 1467
Applied a total of 114 rules in 358 ms. Remains 1089 /1136 variables (removed 47) and now considering 1467/1534 (removed 67) transitions.
// Phase 1: matrix 1467 rows 1089 cols
[2025-06-03 18:08:41] [INFO ] Computed 20 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:08:44] [INFO ] Implicit Places using invariants in 3616 ms returned []
[2025-06-03 18:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:08:48] [INFO ] Implicit Places using invariants and state equation in 4218 ms returned []
Implicit Place search using SMT with State Equation took 7846 ms to find 0 implicit places.
Running 1466 sub problems to find dead transitions.
[2025-06-03 18:08:48] [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)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/2556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1466 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1089 constraints, PredecessorRefiner: 1466/1466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1466 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 1088/2556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1466 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1089 constraints, PredecessorRefiner: 0/1466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61038ms problems are : Problem set: 0 solved, 1466 unsolved
Search for dead transitions found 0 dead transitions in 61045ms
Starting structural reductions in LTL mode, iteration 1 : 1089/1136 places, 1467/1534 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69257 ms. Remains : 1089/1136 places, 1467/1534 transitions.
Stuttering acceptance computed with spot in 435 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-01 finished in 69822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0))) U (p1&&X(X(X(p0)))))))'
Support contains 2 out of 1136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1115 transition count 1513
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1115 transition count 1513
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 1115 transition count 1508
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 63 place count 1099 transition count 1492
Iterating global reduction 1 with 16 rules applied. Total rules applied 79 place count 1099 transition count 1492
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 88 place count 1099 transition count 1483
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 1093 transition count 1477
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 1093 transition count 1477
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 105 place count 1093 transition count 1472
Applied a total of 105 rules in 202 ms. Remains 1093 /1136 variables (removed 43) and now considering 1472/1534 (removed 62) transitions.
// Phase 1: matrix 1472 rows 1093 cols
[2025-06-03 18:09:50] [INFO ] Computed 20 invariants in 79 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:09:53] [INFO ] Implicit Places using invariants in 2804 ms returned []
[2025-06-03 18:09:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:09:56] [INFO ] Implicit Places using invariants and state equation in 3155 ms returned []
Implicit Place search using SMT with State Equation took 5980 ms to find 0 implicit places.
Running 1471 sub problems to find dead transitions.
[2025-06-03 18:09:56] [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 1092/2565 variables, and 0 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 1471/1471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1471 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/2565 variables, and 0 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 0/1471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61226ms problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 61231ms
Starting structural reductions in LTL mode, iteration 1 : 1093/1136 places, 1472/1534 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67419 ms. Remains : 1093/1136 places, 1472/1534 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-02
Product exploration explored 100000 steps with 16596 reset in 724 ms.
Product exploration explored 100000 steps with 16634 reset in 468 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (321 resets) in 590 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (27 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 220752 steps, run timeout after 3010 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 220752 steps, saw 94657 distinct states, run finished after 3017 ms. (steps per millisecond=73 ) properties seen :0
[2025-06-03 18:11:03] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/298 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 795/1093 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:11:04] [INFO ] Deduced a trap composed of 331 places in 968 ms of which 216 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1093 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1093 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1472/2565 variables, 1093/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2565 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2565 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2565/2565 variables, and 1114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3074 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1093/1093 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/298 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 795/1093 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1093 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1093 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1472/2565 variables, 1093/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2565 variables, 2/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2565 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2565 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2565/2565 variables, and 1116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1093/1093 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5159ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 116 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
Parikh walk visited 2 properties in 123 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
[2025-06-03 18:11:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:11:11] [INFO ] [Real]Absence check using 20 positive place invariants in 652 ms returned sat
[2025-06-03 18:11:24] [INFO ] [Real]Absence check using state equation in 13076 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1472/1472 transitions.
Applied a total of 0 rules in 42 ms. Remains 1093 /1093 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
[2025-06-03 18:11:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:11:27] [INFO ] Implicit Places using invariants in 2941 ms returned []
[2025-06-03 18:11:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:11:31] [INFO ] Implicit Places using invariants and state equation in 3628 ms returned []
Implicit Place search using SMT with State Equation took 6586 ms to find 0 implicit places.
Running 1471 sub problems to find dead transitions.
[2025-06-03 18:11: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 1092/2565 variables, and 0 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 1471/1471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1471 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 1092/2565 variables, and 0 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 0/1471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61128ms problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 61134ms
Finished structural reductions in LTL mode , in 1 iterations and 67767 ms. Remains : 1093/1093 places, 1472/1472 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (319 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (29 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 255383 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 255383 steps, saw 108450 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2025-06-03 18:12:35] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/298 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 795/1093 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:12:36] [INFO ] Deduced a trap composed of 331 places in 790 ms of which 168 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1093 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1093 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1472/2565 variables, 1093/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2565 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2565 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2565/2565 variables, and 1114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2293 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1093/1093 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 296/298 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 795/1093 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1093 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1093 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1472/2565 variables, 1093/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2565 variables, 2/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2565 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2565 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2565/2565 variables, and 1116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1531 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1093/1093 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3838ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 116 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=116 )
Parikh walk visited 2 properties in 58 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
[2025-06-03 18:12:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:12:42] [INFO ] [Real]Absence check using 20 positive place invariants in 633 ms returned sat
[2025-06-03 18:12:55] [INFO ] [Real]Absence check using state equation in 13125 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 16635 reset in 352 ms.
Product exploration explored 100000 steps with 16655 reset in 280 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 1093 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1093/1093 places, 1472/1472 transitions.
Graph (trivial) has 1034 edges and 1093 vertex of which 109 / 1093 are part of one of the 18 SCC in 4 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 1002 transition count 1380
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 53 Pre rules applied. Total rules applied 72 place count 1002 transition count 1380
Deduced a syphon composed of 124 places in 2 ms
Iterating global reduction 1 with 53 rules applied. Total rules applied 125 place count 1002 transition count 1380
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 212 place count 915 transition count 1293
Deduced a syphon composed of 72 places in 2 ms
Iterating global reduction 1 with 87 rules applied. Total rules applied 299 place count 915 transition count 1293
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 395 place count 915 transition count 1329
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 435 place count 875 transition count 1289
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 475 place count 875 transition count 1289
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 146 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 493 place count 875 transition count 1325
Deduced a syphon composed of 146 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 1 with 36 rules applied. Total rules applied 529 place count 875 transition count 1289
Deduced a syphon composed of 146 places in 0 ms
Applied a total of 529 rules in 896 ms. Remains 875 /1093 variables (removed 218) and now considering 1289/1472 (removed 183) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:12:57] [INFO ] Redundant transitions in 103 ms returned []
Running 1288 sub problems to find dead transitions.
[2025-06-03 18:12:57] [INFO ] Flow matrix only has 1254 transitions (discarded 35 similar events)
// Phase 1: matrix 1254 rows 875 cols
[2025-06-03 18:12:57] [INFO ] Computed 20 invariants in 38 ms
[2025-06-03 18:12:57] [INFO ] State equation strengthened by 145 read => feed constraints.
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 874/2129 variables, and 0 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/875 constraints, ReadFeed: 0/145 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/2129 variables, and 0 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/875 constraints, ReadFeed: 0/145 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62614ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 62633ms
Starting structural reductions in SI_LTL mode, iteration 1 : 875/1093 places, 1289/1472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63646 ms. Remains : 875/1093 places, 1289/1472 transitions.
Built C files in :
/tmp/ltsmin15484841850557855836
[2025-06-03 18:14:00] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15484841850557855836
Running compilation step : cd /tmp/ltsmin15484841850557855836;'/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/ltsmin15484841850557855836;'/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/ltsmin15484841850557855836;'/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 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1472/1472 transitions.
Applied a total of 0 rules in 52 ms. Remains 1093 /1093 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
// Phase 1: matrix 1472 rows 1093 cols
[2025-06-03 18:14:03] [INFO ] Computed 20 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:14:06] [INFO ] Implicit Places using invariants in 2445 ms returned []
[2025-06-03 18:14:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:14:09] [INFO ] Implicit Places using invariants and state equation in 3277 ms returned []
Implicit Place search using SMT with State Equation took 5725 ms to find 0 implicit places.
Running 1471 sub problems to find dead transitions.
[2025-06-03 18:14: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 1092/2565 variables, and 0 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 1471/1471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1471 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 1092/2565 variables, and 0 constraints, problems are : Problem set: 0 solved, 1471 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 0/1471 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61275ms problems are : Problem set: 0 solved, 1471 unsolved
Search for dead transitions found 0 dead transitions in 61284ms
Finished structural reductions in LTL mode , in 1 iterations and 67066 ms. Remains : 1093/1093 places, 1472/1472 transitions.
Built C files in :
/tmp/ltsmin3053599898884930685
[2025-06-03 18:15:10] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3053599898884930685
Running compilation step : cd /tmp/ltsmin3053599898884930685;'/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/ltsmin3053599898884930685;'/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/ltsmin3053599898884930685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:15:13] [INFO ] Flatten gal took : 128 ms
[2025-06-03 18:15:14] [INFO ] Flatten gal took : 103 ms
[2025-06-03 18:15:14] [INFO ] Time to serialize gal into /tmp/LTL3554363139255510303.gal : 32 ms
[2025-06-03 18:15:14] [INFO ] Time to serialize properties into /tmp/LTL4151624087270078573.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3554363139255510303.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11033700003639221663.hoa' '-atoms' '/tmp/LTL4151624087270078573.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/LTL4151624087270078573.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11033700003639221663.hoa
Detected timeout of ITS tools.
[2025-06-03 18:15:29] [INFO ] Flatten gal took : 84 ms
[2025-06-03 18:15:29] [INFO ] Flatten gal took : 77 ms
[2025-06-03 18:15:29] [INFO ] Time to serialize gal into /tmp/LTL10392667352741193351.gal : 18 ms
[2025-06-03 18:15:29] [INFO ] Time to serialize properties into /tmp/LTL11342243274840088490.ltl : 14 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/LTL10392667352741193351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11342243274840088490.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("(p3064!=1)"))))U(("(p2977==1)")&&(X(X(X("(p3064!=1)"))))))))
Formula 0 simplified : X(!"(p2977==1)" W XXX!"(p3064!=1)")
Detected timeout of ITS tools.
[2025-06-03 18:15:44] [INFO ] Flatten gal took : 40 ms
[2025-06-03 18:15:44] [INFO ] Applying decomposition
[2025-06-03 18:15:44] [INFO ] Flatten gal took : 41 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/graph3577147180967437886.txt' '-o' '/tmp/graph3577147180967437886.bin' '-w' '/tmp/graph3577147180967437886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3577147180967437886.bin' '-l' '-1' '-v' '-w' '/tmp/graph3577147180967437886.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:15:44] [INFO ] Decomposing Gal with order
[2025-06-03 18:15:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:15:45] [INFO ] Removed a total of 430 redundant transitions.
[2025-06-03 18:15:45] [INFO ] Flatten gal took : 584 ms
[2025-06-03 18:15:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 47 ms.
[2025-06-03 18:15:45] [INFO ] Time to serialize gal into /tmp/LTL7775129765335841811.gal : 32 ms
[2025-06-03 18:15:45] [INFO ] Time to serialize properties into /tmp/LTL18124434681306219207.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/LTL7775129765335841811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18124434681306219207.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("(i18.u195.p3064!=1)"))))U(("(i18.u196.p2977==1)")&&(X(X(X("(i18.u195.p3064!=1)"))))))))
Formula 0 simplified : X(!"(i18.u196.p2977==1)" W XXX!"(i18.u195.p3064!=1)")
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-02 finished in 370571 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 1136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Graph (trivial) has 1079 edges and 1136 vertex of which 109 / 1136 are part of one of the 18 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 1044 transition count 1354
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 175 place count 957 transition count 1354
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 175 place count 957 transition count 1308
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 267 place count 911 transition count 1308
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 324 place count 854 transition count 1251
Iterating global reduction 2 with 57 rules applied. Total rules applied 381 place count 854 transition count 1251
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 386 place count 854 transition count 1246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 386 place count 854 transition count 1245
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 388 place count 853 transition count 1245
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 400 place count 841 transition count 1233
Iterating global reduction 3 with 12 rules applied. Total rules applied 412 place count 841 transition count 1233
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 423 place count 841 transition count 1222
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 643 place count 731 transition count 1112
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 646 place count 728 transition count 1109
Iterating global reduction 4 with 3 rules applied. Total rules applied 649 place count 728 transition count 1109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 652 place count 728 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 670 place count 728 transition count 1088
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 672 place count 726 transition count 1086
Applied a total of 672 rules in 521 ms. Remains 726 /1136 variables (removed 410) and now considering 1086/1534 (removed 448) transitions.
[2025-06-03 18:16:01] [INFO ] Flow matrix only has 1051 transitions (discarded 35 similar events)
// Phase 1: matrix 1051 rows 726 cols
[2025-06-03 18:16:01] [INFO ] Computed 20 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:16:03] [INFO ] Implicit Places using invariants in 2323 ms returned []
[2025-06-03 18:16:03] [INFO ] Flow matrix only has 1051 transitions (discarded 35 similar events)
[2025-06-03 18:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:16:06] [INFO ] Implicit Places using invariants and state equation in 2697 ms returned []
Implicit Place search using SMT with State Equation took 5024 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:16:06] [INFO ] Redundant transitions in 19 ms returned []
Running 453 sub problems to find dead transitions.
[2025-06-03 18:16:06] [INFO ] Flow matrix only has 1051 transitions (discarded 35 similar events)
[2025-06-03 18:16:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/1777 variables, and 20 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 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 1)
(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 1)
(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 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/1777 variables, and 20 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60438ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Starting structural reductions in SI_LTL mode, iteration 1 : 726/1136 places, 1086/1534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66014 ms. Remains : 726/1136 places, 1086/1534 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-03 finished in 66133 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(((G(p0) U p1)&&(p0 U (X(p2) U p3)))))'
Support contains 6 out of 1136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1115 transition count 1513
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1115 transition count 1513
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 1115 transition count 1509
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 1098 transition count 1492
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 1098 transition count 1492
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 1098 transition count 1482
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 1093 transition count 1477
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 1093 transition count 1477
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 1093 transition count 1473
Applied a total of 104 rules in 228 ms. Remains 1093 /1136 variables (removed 43) and now considering 1473/1534 (removed 61) transitions.
// Phase 1: matrix 1473 rows 1093 cols
[2025-06-03 18:17:07] [INFO ] Computed 20 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:17:09] [INFO ] Implicit Places using invariants in 2518 ms returned []
[2025-06-03 18:17:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:17:12] [INFO ] Implicit Places using invariants and state equation in 3019 ms returned []
Implicit Place search using SMT with State Equation took 5541 ms to find 0 implicit places.
Running 1472 sub problems to find dead transitions.
[2025-06-03 18:17:12] [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 1092/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 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 1092/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61012ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 61015ms
Starting structural reductions in LTL mode, iteration 1 : 1093/1136 places, 1473/1534 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66788 ms. Remains : 1093/1136 places, 1473/1534 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), true, (NOT p0), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-04 finished in 67157 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(((p1 U p2)&&X(F(p3))&&p0)))'
Support contains 6 out of 1136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1116 transition count 1514
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1116 transition count 1514
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 1116 transition count 1510
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 1100 transition count 1494
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 1100 transition count 1494
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 84 place count 1100 transition count 1486
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 90 place count 1094 transition count 1480
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 1094 transition count 1480
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 1094 transition count 1475
Applied a total of 101 rules in 220 ms. Remains 1094 /1136 variables (removed 42) and now considering 1475/1534 (removed 59) transitions.
// Phase 1: matrix 1475 rows 1094 cols
[2025-06-03 18:18:14] [INFO ] Computed 20 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:18:16] [INFO ] Implicit Places using invariants in 2427 ms returned []
[2025-06-03 18:18:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:18:20] [INFO ] Implicit Places using invariants and state equation in 3364 ms returned []
Implicit Place search using SMT with State Equation took 5795 ms to find 0 implicit places.
Running 1474 sub problems to find dead transitions.
[2025-06-03 18:18:20] [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 1093/2569 variables, and 0 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1094 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 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 1093/2569 variables, and 0 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1094 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60898ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 60901ms
Starting structural reductions in LTL mode, iteration 1 : 1094/1136 places, 1475/1534 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66921 ms. Remains : 1094/1136 places, 1475/1534 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-05 finished in 67236 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(p0) U (X(G(p0))||(X(p0)&&(p1 U (p2||G(p1))))))))'
Support contains 5 out of 1136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1115 transition count 1513
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1115 transition count 1513
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 1115 transition count 1509
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 1098 transition count 1492
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 1098 transition count 1492
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 90 place count 1098 transition count 1482
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 1093 transition count 1477
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 1093 transition count 1477
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 1093 transition count 1473
Applied a total of 104 rules in 352 ms. Remains 1093 /1136 variables (removed 43) and now considering 1473/1534 (removed 61) transitions.
// Phase 1: matrix 1473 rows 1093 cols
[2025-06-03 18:19:21] [INFO ] Computed 20 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:19:24] [INFO ] Implicit Places using invariants in 2427 ms returned []
[2025-06-03 18:19:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:19:27] [INFO ] Implicit Places using invariants and state equation in 3378 ms returned []
Implicit Place search using SMT with State Equation took 5824 ms to find 0 implicit places.
Running 1472 sub problems to find dead transitions.
[2025-06-03 18:19:27] [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 1092/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/2566 variables, and 0 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61103ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 61106ms
Starting structural reductions in LTL mode, iteration 1 : 1093/1136 places, 1473/1534 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67286 ms. Remains : 1093/1136 places, 1473/1534 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-06 finished in 67622 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))))'
Support contains 2 out of 1136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Graph (trivial) has 1077 edges and 1136 vertex of which 109 / 1136 are part of one of the 18 SCC in 2 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 1044 transition count 1356
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 959 transition count 1356
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 171 place count 959 transition count 1309
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 265 place count 912 transition count 1309
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 321 place count 856 transition count 1253
Iterating global reduction 2 with 56 rules applied. Total rules applied 377 place count 856 transition count 1253
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 382 place count 856 transition count 1248
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 393 place count 845 transition count 1237
Iterating global reduction 3 with 11 rules applied. Total rules applied 404 place count 845 transition count 1237
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 414 place count 845 transition count 1227
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 4 with 222 rules applied. Total rules applied 636 place count 734 transition count 1116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 640 place count 730 transition count 1112
Iterating global reduction 4 with 4 rules applied. Total rules applied 644 place count 730 transition count 1112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 648 place count 730 transition count 1108
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 666 place count 730 transition count 1090
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 668 place count 728 transition count 1088
Applied a total of 668 rules in 639 ms. Remains 728 /1136 variables (removed 408) and now considering 1088/1534 (removed 446) transitions.
[2025-06-03 18:20:29] [INFO ] Flow matrix only has 1053 transitions (discarded 35 similar events)
// Phase 1: matrix 1053 rows 728 cols
[2025-06-03 18:20:29] [INFO ] Computed 20 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:31] [INFO ] Implicit Places using invariants in 2148 ms returned []
[2025-06-03 18:20:31] [INFO ] Flow matrix only has 1053 transitions (discarded 35 similar events)
[2025-06-03 18:20:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:34] [INFO ] Implicit Places using invariants and state equation in 2774 ms returned []
Implicit Place search using SMT with State Equation took 4924 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:20:34] [INFO ] Redundant transitions in 12 ms returned []
Running 455 sub problems to find dead transitions.
[2025-06-03 18:20:34] [INFO ] Flow matrix only has 1053 transitions (discarded 35 similar events)
[2025-06-03 18:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 18/728 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:21:04] [INFO ] Deduced a trap composed of 312 places in 732 ms of which 137 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/1781 variables, and 21 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/728 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 18/728 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/728 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/728 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (OVERLAPS) 1052/1780 variables, 728/749 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1780 variables, 455/1204 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1780/1781 variables, and 1204 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 728/728 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60309ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 728/1136 places, 1088/1534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65893 ms. Remains : 728/1136 places, 1088/1534 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-07 finished in 65993 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 U p1))))'
Support contains 2 out of 1136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Graph (trivial) has 1078 edges and 1136 vertex of which 109 / 1136 are part of one of the 18 SCC in 2 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 1044 transition count 1354
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 175 place count 957 transition count 1354
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 175 place count 957 transition count 1308
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 267 place count 911 transition count 1308
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 323 place count 855 transition count 1252
Iterating global reduction 2 with 56 rules applied. Total rules applied 379 place count 855 transition count 1252
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 384 place count 855 transition count 1247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 384 place count 855 transition count 1246
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 386 place count 854 transition count 1246
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 397 place count 843 transition count 1235
Iterating global reduction 3 with 11 rules applied. Total rules applied 408 place count 843 transition count 1235
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 418 place count 843 transition count 1225
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 638 place count 733 transition count 1115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 641 place count 730 transition count 1112
Iterating global reduction 4 with 3 rules applied. Total rules applied 644 place count 730 transition count 1112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 647 place count 730 transition count 1109
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 665 place count 730 transition count 1091
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 667 place count 728 transition count 1089
Applied a total of 667 rules in 703 ms. Remains 728 /1136 variables (removed 408) and now considering 1089/1534 (removed 445) transitions.
[2025-06-03 18:21:35] [INFO ] Flow matrix only has 1054 transitions (discarded 35 similar events)
// Phase 1: matrix 1054 rows 728 cols
[2025-06-03 18:21:35] [INFO ] Computed 20 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:21:38] [INFO ] Implicit Places using invariants in 2353 ms returned []
[2025-06-03 18:21:38] [INFO ] Flow matrix only has 1054 transitions (discarded 35 similar events)
[2025-06-03 18:21:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:21:40] [INFO ] Implicit Places using invariants and state equation in 2722 ms returned []
Implicit Place search using SMT with State Equation took 5080 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:21:40] [INFO ] Redundant transitions in 20 ms returned []
Running 455 sub problems to find dead transitions.
[2025-06-03 18:21:40] [INFO ] Flow matrix only has 1054 transitions (discarded 35 similar events)
[2025-06-03 18:21:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 18/728 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/1782 variables, and 20 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/728 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 18/728 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/1782 variables, and 20 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/728 constraints, PredecessorRefiner: 0/455 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 60477ms
Starting structural reductions in SI_LTL mode, iteration 1 : 728/1136 places, 1089/1534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66291 ms. Remains : 728/1136 places, 1089/1534 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-08 finished in 66410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&((X(!p1)&&F(p2))||X(G(!p1))))))))'
Support contains 5 out of 1136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1116 transition count 1514
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1116 transition count 1514
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 1116 transition count 1510
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 1100 transition count 1494
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 1100 transition count 1494
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 85 place count 1100 transition count 1485
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 1095 transition count 1480
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 1095 transition count 1480
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 99 place count 1095 transition count 1476
Applied a total of 99 rules in 377 ms. Remains 1095 /1136 variables (removed 41) and now considering 1476/1534 (removed 58) transitions.
// Phase 1: matrix 1476 rows 1095 cols
[2025-06-03 18:22:41] [INFO ] Computed 20 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:22:44] [INFO ] Implicit Places using invariants in 2427 ms returned []
[2025-06-03 18:22:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:22:47] [INFO ] Implicit Places using invariants and state equation in 3324 ms returned []
Implicit Place search using SMT with State Equation took 5754 ms to find 0 implicit places.
Running 1475 sub problems to find dead transitions.
[2025-06-03 18:22:47] [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 1094/2571 variables, and 0 constraints, problems are : Problem set: 0 solved, 1475 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1095 constraints, PredecessorRefiner: 1475/1475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1475 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 1094/2571 variables, and 0 constraints, problems are : Problem set: 0 solved, 1475 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1095 constraints, PredecessorRefiner: 0/1475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61151ms problems are : Problem set: 0 solved, 1475 unsolved
Search for dead transitions found 0 dead transitions in 61157ms
Starting structural reductions in LTL mode, iteration 1 : 1095/1136 places, 1476/1534 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67294 ms. Remains : 1095/1136 places, 1476/1534 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 417 ms.
Product exploration explored 100000 steps with 25000 reset in 720 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (320 resets) in 1105 ms. (36 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (28 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (27 resets) in 323 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (26 resets) in 256 ms. (155 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (29 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (27 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (29 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (26 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (25 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (24 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
[2025-06-03 18:23:51] [INFO ] Invariant cache hit.
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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 480/485 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 610/1095 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:23:52] [INFO ] Deduced a trap composed of 36 places in 397 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:23:53] [INFO ] Deduced a trap composed of 42 places in 517 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:23:53] [INFO ] Deduced a trap composed of 52 places in 392 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:23:54] [INFO ] Deduced a trap composed of 53 places in 319 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1095 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1476/2571 variables, 1095/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2571 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/2571 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2571/2571 variables, and 1119 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1095/1095 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 480/485 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 610/1095 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:23:58] [INFO ] Deduced a trap composed of 41 places in 1380 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:24:00] [INFO ] Deduced a trap composed of 46 places in 1268 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:24:01] [INFO ] Deduced a trap composed of 47 places in 1140 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:24:02] [INFO ] Deduced a trap composed of 81 places in 1091 ms of which 91 ms to minimize.
SMT process timed out in 10608ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 1095 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1095/1095 places, 1476/1476 transitions.
Graph (trivial) has 1033 edges and 1095 vertex of which 109 / 1095 are part of one of the 18 SCC in 1 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1004 transition count 1280
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 918 transition count 1280
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 173 place count 918 transition count 1242
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 249 place count 880 transition count 1242
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 284 place count 845 transition count 1207
Iterating global reduction 2 with 35 rules applied. Total rules applied 319 place count 845 transition count 1207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 321 place count 843 transition count 1205
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 843 transition count 1205
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 547 place count 731 transition count 1093
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 583 place count 731 transition count 1057
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 601 place count 713 transition count 1039
Iterating global reduction 3 with 18 rules applied. Total rules applied 619 place count 713 transition count 1039
Free-agglomeration rule applied 614 times.
Iterating global reduction 3 with 614 rules applied. Total rules applied 1233 place count 713 transition count 425
Reduce places removed 614 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Reduce isomorphic transitions removed 272 transitions.
Iterating post reduction 3 with 886 rules applied. Total rules applied 2119 place count 99 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2120 place count 98 transition count 152
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 90 edges and 97 vertex of which 36 / 97 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 2122 place count 79 transition count 152
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 2158 place count 79 transition count 116
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 2158 place count 79 transition count 98
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 2194 place count 61 transition count 98
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 2212 place count 61 transition count 80
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 2248 place count 43 transition count 62
Free-agglomeration rule applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2266 place count 43 transition count 44
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 63 rules applied. Total rules applied 2329 place count 11 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2331 place count 11 transition count 11
Applied a total of 2331 rules in 326 ms. Remains 11 /1095 variables (removed 1084) and now considering 11/1476 (removed 1465) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 11/1095 places, 11/1476 transitions.
RANDOM walk for 239 steps (0 resets) in 5 ms. (39 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 4 factoid took 550 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 1095 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1095/1095 places, 1476/1476 transitions.
Applied a total of 0 rules in 84 ms. Remains 1095 /1095 variables (removed 0) and now considering 1476/1476 (removed 0) transitions.
[2025-06-03 18:24:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:24:06] [INFO ] Implicit Places using invariants in 2346 ms returned []
[2025-06-03 18:24:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:24:10] [INFO ] Implicit Places using invariants and state equation in 3812 ms returned []
Implicit Place search using SMT with State Equation took 6164 ms to find 0 implicit places.
Running 1475 sub problems to find dead transitions.
[2025-06-03 18:24:10] [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 1094/2571 variables, and 0 constraints, problems are : Problem set: 0 solved, 1475 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1095 constraints, PredecessorRefiner: 1475/1475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1475 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 1094/2571 variables, and 0 constraints, problems are : Problem set: 0 solved, 1475 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1095 constraints, PredecessorRefiner: 0/1475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61370ms problems are : Problem set: 0 solved, 1475 unsolved
Search for dead transitions found 0 dead transitions in 61376ms
Finished structural reductions in LTL mode , in 1 iterations and 67633 ms. Remains : 1095/1095 places, 1476/1476 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (319 resets) in 442 ms. (90 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (27 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (28 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (26 resets) in 141 ms. (281 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (29 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (29 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (27 resets) in 124 ms. (320 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (22 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (23 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (25 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
[2025-06-03 18:25:12] [INFO ] Invariant cache hit.
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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 480/485 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 610/1095 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:13] [INFO ] Deduced a trap composed of 36 places in 532 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:14] [INFO ] Deduced a trap composed of 42 places in 510 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:14] [INFO ] Deduced a trap composed of 52 places in 426 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:15] [INFO ] Deduced a trap composed of 53 places in 306 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1095 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1476/2571 variables, 1095/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2571 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/2571 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2571/2571 variables, and 1119 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4825 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1095/1095 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 480/485 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 610/1095 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1095 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:19] [INFO ] Deduced a trap composed of 41 places in 1208 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:20] [INFO ] Deduced a trap composed of 46 places in 979 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:21] [INFO ] Deduced a trap composed of 47 places in 1025 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:22] [INFO ] Deduced a trap composed of 81 places in 994 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:25:23] [INFO ] Deduced a trap composed of 332 places in 1046 ms of which 239 ms to minimize.
SMT process timed out in 10756ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1095 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1095/1095 places, 1476/1476 transitions.
Graph (trivial) has 1033 edges and 1095 vertex of which 109 / 1095 are part of one of the 18 SCC in 3 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1004 transition count 1280
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 918 transition count 1280
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 173 place count 918 transition count 1242
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 249 place count 880 transition count 1242
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 284 place count 845 transition count 1207
Iterating global reduction 2 with 35 rules applied. Total rules applied 319 place count 845 transition count 1207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 321 place count 843 transition count 1205
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 843 transition count 1205
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 547 place count 731 transition count 1093
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 583 place count 731 transition count 1057
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 601 place count 713 transition count 1039
Iterating global reduction 3 with 18 rules applied. Total rules applied 619 place count 713 transition count 1039
Free-agglomeration rule applied 614 times.
Iterating global reduction 3 with 614 rules applied. Total rules applied 1233 place count 713 transition count 425
Reduce places removed 614 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Reduce isomorphic transitions removed 272 transitions.
Iterating post reduction 3 with 886 rules applied. Total rules applied 2119 place count 99 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2120 place count 98 transition count 152
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 90 edges and 97 vertex of which 36 / 97 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 2122 place count 79 transition count 152
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 2158 place count 79 transition count 116
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 2158 place count 79 transition count 98
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 2194 place count 61 transition count 98
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 2212 place count 61 transition count 80
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 2248 place count 43 transition count 62
Free-agglomeration rule applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2266 place count 43 transition count 44
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 63 rules applied. Total rules applied 2329 place count 11 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2331 place count 11 transition count 11
Applied a total of 2331 rules in 275 ms. Remains 11 /1095 variables (removed 1084) and now considering 11/1476 (removed 1465) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 11/1095 places, 11/1476 transitions.
RANDOM walk for 374 steps (0 resets) in 6 ms. (53 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 4 factoid took 539 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 25000 reset in 461 ms.
Product exploration explored 100000 steps with 25000 reset in 457 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 456 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 1095 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1095/1095 places, 1476/1476 transitions.
Graph (trivial) has 1033 edges and 1095 vertex of which 109 / 1095 are part of one of the 18 SCC in 0 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 1004 transition count 1384
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 72 place count 1004 transition count 1384
Deduced a syphon composed of 122 places in 2 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 123 place count 1004 transition count 1384
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 207 place count 920 transition count 1300
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 291 place count 920 transition count 1300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 293 place count 918 transition count 1298
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 295 place count 918 transition count 1298
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 169 places in 0 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 391 place count 918 transition count 1334
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 432 place count 877 transition count 1293
Deduced a syphon composed of 128 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 473 place count 877 transition count 1293
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 146 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 491 place count 877 transition count 1329
Deduced a syphon composed of 146 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 1 with 36 rules applied. Total rules applied 527 place count 877 transition count 1293
Deduced a syphon composed of 146 places in 0 ms
Applied a total of 527 rules in 679 ms. Remains 877 /1095 variables (removed 218) and now considering 1293/1476 (removed 183) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:25:27] [INFO ] Redundant transitions in 31 ms returned []
Running 1292 sub problems to find dead transitions.
[2025-06-03 18:25:27] [INFO ] Flow matrix only has 1258 transitions (discarded 35 similar events)
// Phase 1: matrix 1258 rows 877 cols
[2025-06-03 18:25:27] [INFO ] Computed 20 invariants in 38 ms
[2025-06-03 18:25:27] [INFO ] State equation strengthened by 145 read => feed constraints.
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 876/2135 variables, and 0 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/877 constraints, ReadFeed: 0/145 constraints, PredecessorRefiner: 1292/1292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1292 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 876/2135 variables, and 0 constraints, problems are : Problem set: 0 solved, 1292 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/877 constraints, ReadFeed: 0/145 constraints, PredecessorRefiner: 0/1292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62224ms problems are : Problem set: 0 solved, 1292 unsolved
Search for dead transitions found 0 dead transitions in 62229ms
Starting structural reductions in SI_LTL mode, iteration 1 : 877/1095 places, 1293/1476 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62954 ms. Remains : 877/1095 places, 1293/1476 transitions.
Built C files in :
/tmp/ltsmin14072540194642587943
[2025-06-03 18:26:29] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14072540194642587943
Running compilation step : cd /tmp/ltsmin14072540194642587943;'/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/ltsmin14072540194642587943;'/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/ltsmin14072540194642587943;'/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 5 out of 1095 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1095/1095 places, 1476/1476 transitions.
Applied a total of 0 rules in 79 ms. Remains 1095 /1095 variables (removed 0) and now considering 1476/1476 (removed 0) transitions.
// Phase 1: matrix 1476 rows 1095 cols
[2025-06-03 18:26:33] [INFO ] Computed 20 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:26:35] [INFO ] Implicit Places using invariants in 2634 ms returned []
[2025-06-03 18:26:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:26:38] [INFO ] Implicit Places using invariants and state equation in 3176 ms returned []
Implicit Place search using SMT with State Equation took 5813 ms to find 0 implicit places.
Running 1475 sub problems to find dead transitions.
[2025-06-03 18:26:38] [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 1094/2571 variables, and 0 constraints, problems are : Problem set: 0 solved, 1475 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1095 constraints, PredecessorRefiner: 1475/1475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1475 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 1094/2571 variables, and 0 constraints, problems are : Problem set: 0 solved, 1475 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1095 constraints, PredecessorRefiner: 0/1475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61009ms problems are : Problem set: 0 solved, 1475 unsolved
Search for dead transitions found 0 dead transitions in 61011ms
Finished structural reductions in LTL mode , in 1 iterations and 66907 ms. Remains : 1095/1095 places, 1476/1476 transitions.
Built C files in :
/tmp/ltsmin996348589449539624
[2025-06-03 18:27:39] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin996348589449539624
Running compilation step : cd /tmp/ltsmin996348589449539624;'/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/ltsmin996348589449539624;'/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/ltsmin996348589449539624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:27:43] [INFO ] Flatten gal took : 54 ms
[2025-06-03 18:27:43] [INFO ] Flatten gal took : 52 ms
[2025-06-03 18:27:43] [INFO ] Time to serialize gal into /tmp/LTL15056956688357120006.gal : 13 ms
[2025-06-03 18:27:43] [INFO ] Time to serialize properties into /tmp/LTL14430360347719423428.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/LTL15056956688357120006.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15177947038397728387.hoa' '-atoms' '/tmp/LTL14430360347719423428.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14430360347719423428.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15177947038397728387.hoa
Detected timeout of ITS tools.
[2025-06-03 18:27:58] [INFO ] Flatten gal took : 53 ms
[2025-06-03 18:27:58] [INFO ] Flatten gal took : 57 ms
[2025-06-03 18:27:58] [INFO ] Time to serialize gal into /tmp/LTL15915482471051792470.gal : 11 ms
[2025-06-03 18:27:58] [INFO ] Time to serialize properties into /tmp/LTL4104579813069737434.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15915482471051792470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4104579813069737434.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(p1882==0)")&&((X(G("(((p834!=1)||(p2729!=1))||(p4211!=1))")))||((X("(((p834!=1)||(p2729!=1))||(p4211!=1))"))&&(F("(p1027!=...167
Formula 0 simplified : XXG(!"(p1882==0)" | (XF!"(((p834!=1)||(p2729!=1))||(p4211!=1))" & (X!"(((p834!=1)||(p2729!=1))||(p4211!=1))" | G!"(p1027!=1)")))
Detected timeout of ITS tools.
[2025-06-03 18:28:13] [INFO ] Flatten gal took : 31 ms
[2025-06-03 18:28:13] [INFO ] Applying decomposition
[2025-06-03 18:28: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/graph8668138114643267425.txt' '-o' '/tmp/graph8668138114643267425.bin' '-w' '/tmp/graph8668138114643267425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8668138114643267425.bin' '-l' '-1' '-v' '-w' '/tmp/graph8668138114643267425.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:28:13] [INFO ] Decomposing Gal with order
[2025-06-03 18:28:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:28:13] [INFO ] Removed a total of 433 redundant transitions.
[2025-06-03 18:28:14] [INFO ] Flatten gal took : 282 ms
[2025-06-03 18:28:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 35 ms.
[2025-06-03 18:28:14] [INFO ] Time to serialize gal into /tmp/LTL577098399817257849.gal : 24 ms
[2025-06-03 18:28:14] [INFO ] Time to serialize properties into /tmp/LTL1693445975549439147.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/LTL577098399817257849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1693445975549439147.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i13.u122.p1882==0)")&&((X(G("(((i8.u58.p834!=1)||(i18.u185.p2729!=1))||(u194.p4211!=1))")))||((X("(((i8.u58.p834!=1)||(i18...226
Formula 0 simplified : XXG(!"(i13.u122.p1882==0)" | (XF!"(((i8.u58.p834!=1)||(i18.u185.p2729!=1))||(u194.p4211!=1))" & (X!"(((i8.u58.p834!=1)||(i18.u185.p2...210
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-09 finished in 347719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U p1) U X(X(X(!F(p2)))))) U p3))'
Support contains 4 out of 1136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1114 transition count 1512
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1114 transition count 1512
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 1114 transition count 1507
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 1097 transition count 1490
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 1097 transition count 1490
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 93 place count 1097 transition count 1480
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 98 place count 1092 transition count 1475
Iterating global reduction 2 with 5 rules applied. Total rules applied 103 place count 1092 transition count 1475
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 1092 transition count 1471
Applied a total of 107 rules in 211 ms. Remains 1092 /1136 variables (removed 44) and now considering 1471/1534 (removed 63) transitions.
// Phase 1: matrix 1471 rows 1092 cols
[2025-06-03 18:28:29] [INFO ] Computed 20 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:31] [INFO ] Implicit Places using invariants in 2444 ms returned []
[2025-06-03 18:28:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:28:35] [INFO ] Implicit Places using invariants and state equation in 3214 ms returned []
Implicit Place search using SMT with State Equation took 5685 ms to find 0 implicit places.
Running 1470 sub problems to find dead transitions.
[2025-06-03 18:28:35] [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 1091/2563 variables, and 0 constraints, problems are : Problem set: 0 solved, 1470 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1092 constraints, PredecessorRefiner: 1470/1470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1470 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 1091/2563 variables, and 0 constraints, problems are : Problem set: 0 solved, 1470 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1092 constraints, PredecessorRefiner: 0/1470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61280ms problems are : Problem set: 0 solved, 1470 unsolved
Search for dead transitions found 0 dead transitions in 61283ms
Starting structural reductions in LTL mode, iteration 1 : 1092/1136 places, 1471/1534 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67186 ms. Remains : 1092/1136 places, 1471/1534 transitions.
Stuttering acceptance computed with spot in 626 ms :[(NOT p3), (OR (NOT p3) p2), p2, (AND (NOT p1) p2), p2, p2, true, (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-10
Product exploration explored 100000 steps with 802 reset in 603 ms.
Product exploration explored 100000 steps with 804 reset in 447 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p3)), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 193 ms. Reduced automaton from 11 states, 22 edges and 4 AP (stutter sensitive) to 11 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 555 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), p2, (AND (NOT p1) p2), p2, p2, true, (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (NOT p1)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (317 resets) in 425 ms. (93 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (28 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (29 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (28 resets) in 555 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (27 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (28 resets) in 57 ms. (689 steps per ms) remains 6/10 properties
[2025-06-03 18:29:39] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 433/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 655/1092 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1471/2563 variables, 1092/1112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 18:29:41] [INFO ] Deduced a trap composed of 154 places in 263 ms of which 49 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2563 variables, 1/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2563 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/2563 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2563/2563 variables, and 1113 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3896 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1092/1092 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 433/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 655/1092 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1471/2563 variables, 1092/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2563 variables, 5/1118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2563 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2563/2563 variables, and 1118 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1092/1092 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8960ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 1471/1471 transitions.
Graph (trivial) has 743 edges and 1092 vertex of which 109 / 1092 are part of one of the 18 SCC in 0 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1001 transition count 1275
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 915 transition count 1274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 914 transition count 1274
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 175 place count 914 transition count 1237
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 249 place count 877 transition count 1237
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 283 place count 843 transition count 1203
Iterating global reduction 3 with 34 rules applied. Total rules applied 317 place count 843 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 318 place count 842 transition count 1202
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 842 transition count 1202
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 543 place count 730 transition count 1090
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 561 place count 730 transition count 1072
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 579 place count 712 transition count 1054
Iterating global reduction 4 with 18 rules applied. Total rules applied 597 place count 712 transition count 1054
Free-agglomeration rule applied 326 times.
Iterating global reduction 4 with 326 rules applied. Total rules applied 923 place count 712 transition count 728
Reduce places removed 326 places and 0 transitions.
Iterating post reduction 4 with 326 rules applied. Total rules applied 1249 place count 386 transition count 728
Discarding 135 places :
Symmetric choice reduction at 5 with 135 rule applications. Total rules 1384 place count 251 transition count 593
Iterating global reduction 5 with 135 rules applied. Total rules applied 1519 place count 251 transition count 593
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Iterating post reduction 5 with 135 rules applied. Total rules applied 1654 place count 251 transition count 458
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1655 place count 250 transition count 457
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 89 edges and 249 vertex of which 36 / 249 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 1657 place count 231 transition count 457
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 1693 place count 231 transition count 421
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 17 Pre rules applied. Total rules applied 1693 place count 231 transition count 404
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1727 place count 214 transition count 404
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1763 place count 196 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 1781 place count 196 transition count 368
Free-agglomeration rule applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1799 place count 196 transition count 350
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Iterating post reduction 8 with 168 rules applied. Total rules applied 1967 place count 163 transition count 215
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 9 with 210 rules applied. Total rules applied 2177 place count 58 transition count 110
Discarding 42 places :
Symmetric choice reduction at 10 with 42 rule applications. Total rules 2219 place count 16 transition count 68
Iterating global reduction 10 with 42 rules applied. Total rules applied 2261 place count 16 transition count 68
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 10 with 42 rules applied. Total rules applied 2303 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 2306 place count 16 transition count 23
Applied a total of 2306 rules in 268 ms. Remains 16 /1092 variables (removed 1076) and now considering 23/1471 (removed 1448) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 16/1092 places, 23/1471 transitions.
RANDOM walk for 3924 steps (317 resets) in 9 ms. (392 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p3)), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p3), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 16 factoid took 568 ms. Reduced automaton from 11 states, 22 edges and 4 AP (stutter sensitive) to 11 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 513 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), p2, (AND (NOT p1) p2), p2, p2, true, (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 589 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), p2, (AND (NOT p1) p2), p2, p2, true, (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (NOT p1)]
[2025-06-03 18:29:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p3)), (X (NOT (OR p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p3), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 16 factoid took 614 ms. Reduced automaton from 11 states, 22 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-18b-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-10 finished in 83013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||(F(p0)&&F(p1)))))'
Support contains 3 out of 1136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1113 transition count 1511
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1113 transition count 1511
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 1113 transition count 1506
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 1095 transition count 1488
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 1095 transition count 1488
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 97 place count 1095 transition count 1478
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 1089 transition count 1472
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 1089 transition count 1472
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 1089 transition count 1467
Applied a total of 114 rules in 392 ms. Remains 1089 /1136 variables (removed 47) and now considering 1467/1534 (removed 67) transitions.
// Phase 1: matrix 1467 rows 1089 cols
[2025-06-03 18:29:52] [INFO ] Computed 20 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:29:55] [INFO ] Implicit Places using invariants in 3160 ms returned []
[2025-06-03 18:29:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:29:59] [INFO ] Implicit Places using invariants and state equation in 3930 ms returned []
Implicit Place search using SMT with State Equation took 7097 ms to find 0 implicit places.
Running 1466 sub problems to find dead transitions.
[2025-06-03 18:29:59] [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 1088/2556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1466 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1089 constraints, PredecessorRefiner: 1466/1466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1466 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 1088/2556 variables, and 0 constraints, problems are : Problem set: 0 solved, 1466 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1089 constraints, PredecessorRefiner: 0/1466 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61830ms problems are : Problem set: 0 solved, 1466 unsolved
Search for dead transitions found 0 dead transitions in 61835ms
Starting structural reductions in LTL mode, iteration 1 : 1089/1136 places, 1467/1534 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69330 ms. Remains : 1089/1136 places, 1467/1534 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-12
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-12 finished in 69688 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(F(p1)))))'
Support contains 6 out of 1136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Graph (trivial) has 1074 edges and 1136 vertex of which 109 / 1136 are part of one of the 18 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 1044 transition count 1354
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 175 place count 957 transition count 1354
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 175 place count 957 transition count 1307
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 269 place count 910 transition count 1307
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 326 place count 853 transition count 1250
Iterating global reduction 2 with 57 rules applied. Total rules applied 383 place count 853 transition count 1250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 387 place count 853 transition count 1246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 387 place count 853 transition count 1245
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 389 place count 852 transition count 1245
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 400 place count 841 transition count 1234
Iterating global reduction 3 with 11 rules applied. Total rules applied 411 place count 841 transition count 1234
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 422 place count 841 transition count 1223
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 642 place count 731 transition count 1113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 645 place count 728 transition count 1110
Iterating global reduction 4 with 3 rules applied. Total rules applied 648 place count 728 transition count 1110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 651 place count 728 transition count 1107
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 669 place count 728 transition count 1089
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 671 place count 726 transition count 1087
Applied a total of 671 rules in 690 ms. Remains 726 /1136 variables (removed 410) and now considering 1087/1534 (removed 447) transitions.
[2025-06-03 18:31:02] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
// Phase 1: matrix 1052 rows 726 cols
[2025-06-03 18:31:02] [INFO ] Computed 20 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:31:05] [INFO ] Implicit Places using invariants in 2520 ms returned []
[2025-06-03 18:31:05] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2025-06-03 18:31:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:31:08] [INFO ] Implicit Places using invariants and state equation in 3156 ms returned []
Implicit Place search using SMT with State Equation took 5684 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:31:08] [INFO ] Redundant transitions in 21 ms returned []
Running 453 sub problems to find dead transitions.
[2025-06-03 18:31:08] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2025-06-03 18:31:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 708/1778 variables, and 2 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/1778 variables, and 20 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60476ms
Starting structural reductions in SI_LTL mode, iteration 1 : 726/1136 places, 1087/1534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66879 ms. Remains : 726/1136 places, 1087/1534 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-13
Product exploration explored 100000 steps with 4091 reset in 2157 ms.
Product exploration explored 100000 steps with 4073 reset in 1629 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 136 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1670 resets) in 1874 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/2 properties
[2025-06-03 18:32:14] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2025-06-03 18:32:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 364/1778 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 4/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 10 factoid took 318 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 726 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 : 726/726 places, 1087/1087 transitions.
Applied a total of 0 rules in 133 ms. Remains 726 /726 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2025-06-03 18:32:14] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2025-06-03 18:32:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:32:17] [INFO ] Implicit Places using invariants in 2688 ms returned []
[2025-06-03 18:32:17] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2025-06-03 18:32:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:32:20] [INFO ] Implicit Places using invariants and state equation in 2810 ms returned []
Implicit Place search using SMT with State Equation took 5502 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:32:20] [INFO ] Redundant transitions in 21 ms returned []
Running 453 sub problems to find dead transitions.
[2025-06-03 18:32:20] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2025-06-03 18:32:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 708/1778 variables, and 2 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/1778 variables, and 20 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60537ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60540ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 66204 ms. Remains : 726/726 places, 1087/1087 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (1666 resets) in 676 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 5286 steps (0 resets) in 9 ms. (528 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4074 reset in 1193 ms.
Product exploration explored 100000 steps with 4099 reset in 1240 ms.
Built C files in :
/tmp/ltsmin9901872106702091860
[2025-06-03 18:33:24] [INFO ] Computing symmetric may disable matrix : 1087 transitions.
[2025-06-03 18:33:24] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:33:24] [INFO ] Computing symmetric may enable matrix : 1087 transitions.
[2025-06-03 18:33:24] [INFO ] Computation of Complete enable matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:33:25] [INFO ] Computing Do-Not-Accords matrix : 1087 transitions.
[2025-06-03 18:33:25] [INFO ] Computation of Completed DNA matrix. took 87 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:33:25] [INFO ] Built C files in 658ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9901872106702091860
Running compilation step : cd /tmp/ltsmin9901872106702091860;'/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/ltsmin9901872106702091860;'/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/ltsmin9901872106702091860;'/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 726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 1087/1087 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 725 transition count 1086
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 725 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 725 transition count 1085
Applied a total of 3 rules in 122 ms. Remains 725 /726 variables (removed 1) and now considering 1085/1087 (removed 2) transitions.
[2025-06-03 18:33:28] [INFO ] Flow matrix only has 1050 transitions (discarded 35 similar events)
// Phase 1: matrix 1050 rows 725 cols
[2025-06-03 18:33:28] [INFO ] Computed 20 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:33:30] [INFO ] Implicit Places using invariants in 2104 ms returned []
[2025-06-03 18:33:30] [INFO ] Flow matrix only has 1050 transitions (discarded 35 similar events)
[2025-06-03 18:33:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:33:32] [INFO ] Implicit Places using invariants and state equation in 2538 ms returned []
Implicit Place search using SMT with State Equation took 4645 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:33:32] [INFO ] Redundant transitions in 21 ms returned []
Running 452 sub problems to find dead transitions.
[2025-06-03 18:33:32] [INFO ] Flow matrix only has 1050 transitions (discarded 35 similar events)
[2025-06-03 18:33:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/707 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/707 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (OVERLAPS) 18/725 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 725/1775 variables, and 20 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/725 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/707 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/707 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (OVERLAPS) 18/725 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/1775 variables, and 20 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/725 constraints, PredecessorRefiner: 0/452 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 725/726 places, 1085/1087 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65175 ms. Remains : 725/726 places, 1085/1087 transitions.
Built C files in :
/tmp/ltsmin1401401232775114069
[2025-06-03 18:34:33] [INFO ] Computing symmetric may disable matrix : 1085 transitions.
[2025-06-03 18:34:33] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:34:33] [INFO ] Computing symmetric may enable matrix : 1085 transitions.
[2025-06-03 18:34:33] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:34:33] [INFO ] Computing Do-Not-Accords matrix : 1085 transitions.
[2025-06-03 18:34:33] [INFO ] Computation of Completed DNA matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:34:33] [INFO ] Built C files in 474ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1401401232775114069
Running compilation step : cd /tmp/ltsmin1401401232775114069;'/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/ltsmin1401401232775114069;'/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/ltsmin1401401232775114069;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:34:36] [INFO ] Flatten gal took : 38 ms
[2025-06-03 18:34:36] [INFO ] Flatten gal took : 37 ms
[2025-06-03 18:34:36] [INFO ] Time to serialize gal into /tmp/LTL538430868007380080.gal : 6 ms
[2025-06-03 18:34:36] [INFO ] Time to serialize properties into /tmp/LTL649732215788162200.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL538430868007380080.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1644651352394139543.hoa' '-atoms' '/tmp/LTL649732215788162200.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...315
Loading property file /tmp/LTL649732215788162200.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1644651352394139543.hoa
Detected timeout of ITS tools.
[2025-06-03 18:34:52] [INFO ] Flatten gal took : 28 ms
[2025-06-03 18:34:52] [INFO ] Flatten gal took : 26 ms
[2025-06-03 18:34:52] [INFO ] Time to serialize gal into /tmp/LTL10557004358057971018.gal : 5 ms
[2025-06-03 18:34:52] [INFO ] Time to serialize properties into /tmp/LTL7110181384579947274.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/LTL10557004358057971018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7110181384579947274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p1326==1)&&(p2577==1))&&(p4146==1))"))||(G(F("(((p2111==0)||(p2638==0))||(p3941==0))"))))))
Formula 0 simplified : G(F!"(((p1326==1)&&(p2577==1))&&(p4146==1))" & FG!"(((p2111==0)||(p2638==0))||(p3941==0))")
Detected timeout of ITS tools.
[2025-06-03 18:35:07] [INFO ] Flatten gal took : 23 ms
[2025-06-03 18:35:07] [INFO ] Applying decomposition
[2025-06-03 18:35:07] [INFO ] Flatten gal took : 25 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/graph13014238318694772179.txt' '-o' '/tmp/graph13014238318694772179.bin' '-w' '/tmp/graph13014238318694772179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13014238318694772179.bin' '-l' '-1' '-v' '-w' '/tmp/graph13014238318694772179.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:35:07] [INFO ] Decomposing Gal with order
[2025-06-03 18:35:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:35:07] [INFO ] Removed a total of 435 redundant transitions.
[2025-06-03 18:35:07] [INFO ] Flatten gal took : 239 ms
[2025-06-03 18:35:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 21 ms.
[2025-06-03 18:35:07] [INFO ] Time to serialize gal into /tmp/LTL7920581302315754889.gal : 17 ms
[2025-06-03 18:35:07] [INFO ] Time to serialize properties into /tmp/LTL12425936321471033578.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/LTL7920581302315754889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12425936321471033578.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 : !((F((G("(((i7.u23.p1326==1)&&(i15.u47.p2577==1))&&(u54.p4146==1))"))||(G(F("(((u38.p2111==0)||(i15.u47.p2638==0))||(u54.p3941==0))"))...159
Formula 0 simplified : G(F!"(((i7.u23.p1326==1)&&(i15.u47.p2577==1))&&(u54.p4146==1))" & FG!"(((u38.p2111==0)||(i15.u47.p2638==0))||(u54.p3941==0))")
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-13 finished in 260765 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 1136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Graph (trivial) has 1079 edges and 1136 vertex of which 109 / 1136 are part of one of the 18 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 1044 transition count 1354
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 175 place count 957 transition count 1354
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 175 place count 957 transition count 1307
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 269 place count 910 transition count 1307
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 326 place count 853 transition count 1250
Iterating global reduction 2 with 57 rules applied. Total rules applied 383 place count 853 transition count 1250
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 388 place count 853 transition count 1245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 388 place count 853 transition count 1244
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 390 place count 852 transition count 1244
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 402 place count 840 transition count 1232
Iterating global reduction 3 with 12 rules applied. Total rules applied 414 place count 840 transition count 1232
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 426 place count 840 transition count 1220
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 646 place count 730 transition count 1110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 648 place count 728 transition count 1108
Iterating global reduction 4 with 2 rules applied. Total rules applied 650 place count 728 transition count 1108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 652 place count 728 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 670 place count 728 transition count 1088
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 672 place count 726 transition count 1086
Applied a total of 672 rules in 532 ms. Remains 726 /1136 variables (removed 410) and now considering 1086/1534 (removed 448) transitions.
[2025-06-03 18:35:23] [INFO ] Flow matrix only has 1051 transitions (discarded 35 similar events)
// Phase 1: matrix 1051 rows 726 cols
[2025-06-03 18:35:23] [INFO ] Computed 20 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:35:25] [INFO ] Implicit Places using invariants in 2052 ms returned []
[2025-06-03 18:35:25] [INFO ] Flow matrix only has 1051 transitions (discarded 35 similar events)
[2025-06-03 18:35:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:35:28] [INFO ] Implicit Places using invariants and state equation in 2675 ms returned []
Implicit Place search using SMT with State Equation took 4730 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:35:28] [INFO ] Redundant transitions in 12 ms returned []
Running 453 sub problems to find dead transitions.
[2025-06-03 18:35:28] [INFO ] Flow matrix only has 1051 transitions (discarded 35 similar events)
[2025-06-03 18:35:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/1777 variables, and 20 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/1777 variables, and 20 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 726/1136 places, 1086/1534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65706 ms. Remains : 726/1136 places, 1086/1534 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-14 finished in 65774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||X(F(p0)))))'
Support contains 2 out of 1136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Graph (trivial) has 1061 edges and 1136 vertex of which 103 / 1136 are part of one of the 17 SCC in 1 ms
Free SCC test removed 86 places
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 1049 transition count 1359
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 175 place count 962 transition count 1359
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 175 place count 962 transition count 1312
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 269 place count 915 transition count 1312
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 324 place count 860 transition count 1257
Iterating global reduction 2 with 55 rules applied. Total rules applied 379 place count 860 transition count 1257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 384 place count 860 transition count 1252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 384 place count 860 transition count 1251
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 386 place count 859 transition count 1251
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 397 place count 848 transition count 1240
Iterating global reduction 3 with 11 rules applied. Total rules applied 408 place count 848 transition count 1240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 418 place count 848 transition count 1230
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 644 place count 735 transition count 1117
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 648 place count 731 transition count 1113
Iterating global reduction 4 with 4 rules applied. Total rules applied 652 place count 731 transition count 1113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 656 place count 731 transition count 1109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 658 place count 730 transition count 1109
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 677 place count 730 transition count 1090
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 679 place count 728 transition count 1088
Applied a total of 679 rules in 697 ms. Remains 728 /1136 variables (removed 408) and now considering 1088/1534 (removed 446) transitions.
[2025-06-03 18:36:29] [INFO ] Flow matrix only has 1054 transitions (discarded 34 similar events)
// Phase 1: matrix 1054 rows 728 cols
[2025-06-03 18:36:29] [INFO ] Computed 20 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:36:31] [INFO ] Implicit Places using invariants in 2170 ms returned []
[2025-06-03 18:36:31] [INFO ] Flow matrix only has 1054 transitions (discarded 34 similar events)
[2025-06-03 18:36:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:36:34] [INFO ] Implicit Places using invariants and state equation in 2958 ms returned []
Implicit Place search using SMT with State Equation took 5137 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:36:34] [INFO ] Redundant transitions in 12 ms returned []
Running 472 sub problems to find dead transitions.
[2025-06-03 18:36:34] [INFO ] Flow matrix only has 1054 transitions (discarded 34 similar events)
[2025-06-03 18:36:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 18/728 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/1782 variables, and 20 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/728 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 18/728 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 472 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 1)
(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 1)
(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 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(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 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 1)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 1)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 1)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/1782 variables, and 20 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/728 constraints, PredecessorRefiner: 0/472 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Starting structural reductions in SI_LTL mode, iteration 1 : 728/1136 places, 1088/1534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66194 ms. Remains : 728/1136 places, 1088/1534 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-15 finished in 66312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0))) U (p1&&X(X(X(p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&((X(!p1)&&F(p2))||X(G(!p1))))))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-18b-LTLFireability-09
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 1136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1136/1136 places, 1534/1534 transitions.
Graph (trivial) has 1074 edges and 1136 vertex of which 109 / 1136 are part of one of the 18 SCC in 1 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 1044 transition count 1355
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 958 transition count 1355
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 173 place count 958 transition count 1310
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 263 place count 913 transition count 1310
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 318 place count 858 transition count 1255
Iterating global reduction 2 with 55 rules applied. Total rules applied 373 place count 858 transition count 1255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 377 place count 858 transition count 1251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 377 place count 858 transition count 1250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 379 place count 857 transition count 1250
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 390 place count 846 transition count 1239
Iterating global reduction 3 with 11 rules applied. Total rules applied 401 place count 846 transition count 1239
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 410 place count 846 transition count 1230
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 630 place count 736 transition count 1120
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 634 place count 732 transition count 1116
Iterating global reduction 4 with 4 rules applied. Total rules applied 638 place count 732 transition count 1116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 642 place count 732 transition count 1112
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 660 place count 732 transition count 1094
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 662 place count 730 transition count 1092
Applied a total of 662 rules in 290 ms. Remains 730 /1136 variables (removed 406) and now considering 1092/1534 (removed 442) transitions.
[2025-06-03 18:37:35] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
// Phase 1: matrix 1057 rows 730 cols
[2025-06-03 18:37:35] [INFO ] Computed 20 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:37:38] [INFO ] Implicit Places using invariants in 2267 ms returned []
[2025-06-03 18:37:38] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:37:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:37:41] [INFO ] Implicit Places using invariants and state equation in 2890 ms returned []
Implicit Place search using SMT with State Equation took 5161 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-03 18:37:41] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:37:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 712/1787 variables, and 2 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/20 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/712 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 18/730 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 730/1787 variables, and 20 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60502ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60504ms
Starting structural reductions in LI_LTL mode, iteration 1 : 730/1136 places, 1092/1534 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 65959 ms. Remains : 730/1136 places, 1092/1534 transitions.
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 3175 ms.
Product exploration explored 100000 steps with 25000 reset in 2722 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (1667 resets) in 819 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
[2025-06-03 18:38:48] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:38:48] [INFO ] Invariant cache hit.
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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 385/390 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 689/1079 variables, 390/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1079 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 567/1646 variables, 256/651 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1646 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1646 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 84/1730 variables, 14/666 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1730 variables, 28/694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1730 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 56/1786 variables, 56/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1786 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1786 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1786/1787 variables, and 750 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2111 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 730/730 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 385/390 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 689/1079 variables, 390/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1079 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 567/1646 variables, 256/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1646 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1646 variables, 7/660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1646 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 84/1730 variables, 14/674 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1730 variables, 28/702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1730 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 56/1786 variables, 56/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1786 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1786 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1786/1787 variables, and 758 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3445 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 730/730 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5575ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 2594 steps, including 81 resets, run visited all 3 properties in 39 ms. (steps per millisecond=66 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 192 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 4 factoid took 463 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1092/1092 transitions.
Applied a total of 0 rules in 22 ms. Remains 730 /730 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
[2025-06-03 18:38:55] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:38:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:38:57] [INFO ] Implicit Places using invariants in 2001 ms returned []
[2025-06-03 18:38:57] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:38:59] [INFO ] Implicit Places using invariants and state equation in 2551 ms returned []
Implicit Place search using SMT with State Equation took 4555 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-03 18:38:59] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:38:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/712 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 18/730 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 730/1787 variables, and 20 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/712 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 18/730 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 730/1787 variables, and 20 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60492ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Finished structural reductions in LTL mode , in 1 iterations and 65072 ms. Remains : 730/730 places, 1092/1092 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
RANDOM walk for 40000 steps (1666 resets) in 850 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
[2025-06-03 18:40:01] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:40:01] [INFO ] Invariant cache hit.
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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 385/390 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 689/1079 variables, 390/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1079 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 567/1646 variables, 256/651 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1646 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1646 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 84/1730 variables, 14/666 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1730 variables, 28/694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1730 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 56/1786 variables, 56/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1786 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1786 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1786/1787 variables, and 750 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 730/730 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 385/390 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 689/1079 variables, 390/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1079 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1079 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 567/1646 variables, 256/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1646 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1646 variables, 7/660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1646 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 84/1730 variables, 14/674 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1730 variables, 28/702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1730 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 56/1786 variables, 56/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1786 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1786 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1786/1787 variables, and 758 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3796 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 730/730 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5953ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 3260 steps, including 102 resets, run visited all 3 properties in 28 ms. (steps per millisecond=116 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 218 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) p0))), (F p1)]
Knowledge based reduction with 4 factoid took 440 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 25000 reset in 2740 ms.
Product exploration explored 100000 steps with 25000 reset in 2763 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Support contains 5 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 1092/1092 transitions.
Applied a total of 0 rules in 120 ms. Remains 730 /730 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:40:15] [INFO ] Redundant transitions in 21 ms returned []
Running 457 sub problems to find dead transitions.
[2025-06-03 18:40:15] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:40:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/712 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 18/730 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 730/1787 variables, and 20 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/712 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 18/730 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 730/1787 variables, and 20 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60490ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60641 ms. Remains : 730/730 places, 1092/1092 transitions.
Built C files in :
/tmp/ltsmin16285649719651783541
[2025-06-03 18:41:15] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16285649719651783541
Running compilation step : cd /tmp/ltsmin16285649719651783541;'/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/ltsmin16285649719651783541;'/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/ltsmin16285649719651783541;'/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 5 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1092/1092 transitions.
Applied a total of 0 rules in 23 ms. Remains 730 /730 variables (removed 0) and now considering 1092/1092 (removed 0) transitions.
[2025-06-03 18:41:18] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:41:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:41:21] [INFO ] Implicit Places using invariants in 2733 ms returned []
[2025-06-03 18:41:21] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:41:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:41:24] [INFO ] Implicit Places using invariants and state equation in 3077 ms returned []
Implicit Place search using SMT with State Equation took 5813 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2025-06-03 18:41:24] [INFO ] Flow matrix only has 1057 transitions (discarded 35 similar events)
[2025-06-03 18:41:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 712/1787 variables, and 2 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/20 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/712 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/712 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 18/730 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 730/1787 variables, and 20 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/730 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Finished structural reductions in LTL mode , in 1 iterations and 66174 ms. Remains : 730/730 places, 1092/1092 transitions.
Built C files in :
/tmp/ltsmin14214326710893027540
[2025-06-03 18:42:25] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14214326710893027540
Running compilation step : cd /tmp/ltsmin14214326710893027540;'/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/ltsmin14214326710893027540;'/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/ltsmin14214326710893027540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 18:42:28] [INFO ] Flatten gal took : 24 ms
[2025-06-03 18:42:28] [INFO ] Flatten gal took : 23 ms
[2025-06-03 18:42:28] [INFO ] Time to serialize gal into /tmp/LTL633206504927369333.gal : 6 ms
[2025-06-03 18:42:28] [INFO ] Time to serialize properties into /tmp/LTL4009589722911488414.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/LTL633206504927369333.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16112897799803074026.hoa' '-atoms' '/tmp/LTL4009589722911488414.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4009589722911488414.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16112897799803074026.hoa
Detected timeout of ITS tools.
[2025-06-03 18:42:43] [INFO ] Flatten gal took : 23 ms
[2025-06-03 18:42:43] [INFO ] Flatten gal took : 23 ms
[2025-06-03 18:42:43] [INFO ] Time to serialize gal into /tmp/LTL11860476802803180325.gal : 4 ms
[2025-06-03 18:42:43] [INFO ] Time to serialize properties into /tmp/LTL7932041115340759604.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/LTL11860476802803180325.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7932041115340759604.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(p1882==0)")&&((X(G("(((p834!=1)||(p2729!=1))||(p4211!=1))")))||((X("(((p834!=1)||(p2729!=1))||(p4211!=1))"))&&(F("(p1027!=...167
Formula 0 simplified : XXG(!"(p1882==0)" | (XF!"(((p834!=1)||(p2729!=1))||(p4211!=1))" & (X!"(((p834!=1)||(p2729!=1))||(p4211!=1))" | G!"(p1027!=1)")))
Detected timeout of ITS tools.
[2025-06-03 18:42:58] [INFO ] Flatten gal took : 61 ms
[2025-06-03 18:42:58] [INFO ] Applying decomposition
[2025-06-03 18:42:58] [INFO ] Flatten gal took : 45 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/graph16989069552548619636.txt' '-o' '/tmp/graph16989069552548619636.bin' '-w' '/tmp/graph16989069552548619636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16989069552548619636.bin' '-l' '-1' '-v' '-w' '/tmp/graph16989069552548619636.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:42:58] [INFO ] Decomposing Gal with order
[2025-06-03 18:42:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:42:58] [INFO ] Removed a total of 436 redundant transitions.
[2025-06-03 18:42:58] [INFO ] Flatten gal took : 182 ms
[2025-06-03 18:42:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 27 ms.
[2025-06-03 18:42:58] [INFO ] Time to serialize gal into /tmp/LTL9357216873324474711.gal : 15 ms
[2025-06-03 18:42:58] [INFO ] Time to serialize properties into /tmp/LTL1571060875192718431.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/LTL9357216873324474711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1571060875192718431.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(i11.u33.p1882==0)")&&((X(G("(((i4.u14.p834!=1)||(i16.u51.p2729!=1))||(u55.p4211!=1))")))||((X("(((i4.u14.p834!=1)||(i16.u5...220
Formula 0 simplified : XXG(!"(i11.u33.p1882==0)" | (XF!"(((i4.u14.p834!=1)||(i16.u51.p2729!=1))||(u55.p4211!=1))" & (X!"(((i4.u14.p834!=1)||(i16.u51.p2729!...204
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-09 finished in 338994 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(F(p1)))))'
[2025-06-03 18:43:14] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13964826625642240579
[2025-06-03 18:43:14] [INFO ] Too many transitions (1534) to apply POR reductions. Disabling POR matrices.
[2025-06-03 18:43:14] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13964826625642240579
Running compilation step : cd /tmp/ltsmin13964826625642240579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 18:43:14] [INFO ] Applying decomposition
[2025-06-03 18:43:14] [INFO ] Flatten gal took : 36 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/graph2431887775896650574.txt' '-o' '/tmp/graph2431887775896650574.bin' '-w' '/tmp/graph2431887775896650574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2431887775896650574.bin' '-l' '-1' '-v' '-w' '/tmp/graph2431887775896650574.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:43:14] [INFO ] Decomposing Gal with order
[2025-06-03 18:43:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:43:14] [INFO ] Removed a total of 465 redundant transitions.
[2025-06-03 18:43:14] [INFO ] Flatten gal took : 214 ms
[2025-06-03 18:43:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 36 ms.
[2025-06-03 18:43:14] [INFO ] Time to serialize gal into /tmp/LTLFireability11253238312415534986.gal : 26 ms
[2025-06-03 18:43:14] [INFO ] Time to serialize properties into /tmp/LTLFireability268096779221001509.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/LTLFireability11253238312415534986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability268096779221001509.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((X((X(X(X("(i18.u199.p3064!=1)"))))U(("(i18.u202.p2977==1)")&&(X(X(X("(i18.u199.p3064!=1)"))))))))
Formula 0 simplified : X(!"(i18.u202.p2977==1)" W XXX!"(i18.u199.p3064!=1)")
Compilation finished in 5107 ms.
Running link step : cd /tmp/ltsmin13964826625642240579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 96 ms.
Running LTSmin : cd /tmp/ltsmin13964826625642240579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X(X((LTLAPp0==true)))) U ((LTLAPp1==true)&&X(X(X((LTLAPp0==true)))))))' '--buchi-type=spotba'
LTSmin run took 1202 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13964826625642240579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp2==true)&&((X(!(LTLAPp3==true))&&<>((LTLAPp4==true)))||X([](!(LTLAPp3==true))))))))' '--buchi-type=spotba'
LTSmin run took 807 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13964826625642240579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp5==true))||[](<>((LTLAPp6==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin13964826625642240579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp5==true))||[](<>((LTLAPp6==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin13964826625642240579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp5==true))||[](<>((LTLAPp6==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="FlexibleBarrier-PT-18b"
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 FlexibleBarrier-PT-18b, 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 r086-smll-174860102700524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-18b.tgz
mv FlexibleBarrier-PT-18b 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 ;