About the Execution of ITS-Tools for SafeBus-PT-10
| 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 | FTFTTFFFT?TFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264800779.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 SafeBus-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264800779
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.4M
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 390K 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 16K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 316K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 362K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 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 SafeBus-PT-10-LTLCardinality-00
FORMULA_NAME SafeBus-PT-10-LTLCardinality-01
FORMULA_NAME SafeBus-PT-10-LTLCardinality-02
FORMULA_NAME SafeBus-PT-10-LTLCardinality-03
FORMULA_NAME SafeBus-PT-10-LTLCardinality-04
FORMULA_NAME SafeBus-PT-10-LTLCardinality-05
FORMULA_NAME SafeBus-PT-10-LTLCardinality-06
FORMULA_NAME SafeBus-PT-10-LTLCardinality-07
FORMULA_NAME SafeBus-PT-10-LTLCardinality-08
FORMULA_NAME SafeBus-PT-10-LTLCardinality-09
FORMULA_NAME SafeBus-PT-10-LTLCardinality-10
FORMULA_NAME SafeBus-PT-10-LTLCardinality-11
FORMULA_NAME SafeBus-PT-10-LTLCardinality-12
FORMULA_NAME SafeBus-PT-10-LTLCardinality-13
FORMULA_NAME SafeBus-PT-10-LTLCardinality-14
FORMULA_NAME SafeBus-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749184488004
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 04:34:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 04:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 04:34:49] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2025-06-06 04:34:49] [INFO ] Transformed 316 places.
[2025-06-06 04:34:49] [INFO ] Transformed 1631 transitions.
[2025-06-06 04:34:49] [INFO ] Found NUPN structural information;
[2025-06-06 04:34:49] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA SafeBus-PT-10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 270 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 23 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2025-06-06 04:34:49] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-06 04:34:49] [INFO ] Computed 45 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:51] [INFO ] Implicit Places using invariants in 1379 ms returned []
[2025-06-06 04:34:51] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-06 04:34:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:51] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-06 04:34:52] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 2997 ms to find 0 implicit places.
Running 1621 sub problems to find dead transitions.
[2025-06-06 04:34:52] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2025-06-06 04:34:52] [INFO ] Invariant cache hit.
[2025-06-06 04:34:52] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1621 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:13] [INFO ] Deduced a trap composed of 32 places in 305 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:13] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:14] [INFO ] Deduced a trap composed of 32 places in 328 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:14] [INFO ] Deduced a trap composed of 32 places in 300 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:14] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:15] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:15] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:15] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:16] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:16] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:16] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:16] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:17] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:17] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:17] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:18] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:18] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:18] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:18] [INFO ] Deduced a trap composed of 32 places in 351 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:19] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 27 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30054 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1621/1621 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:35] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:36] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:36] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:37] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:37] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:37] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:38] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:38] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:38] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:39] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:39] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:51] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:51] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:51] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:52] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:52] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:52] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:52] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:54] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:55] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 20/391 constraints. Problems are: Problem set: 100 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 391 constraints, problems are : Problem set: 100 solved, 1521 unsolved in 30038 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1621 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62690ms problems are : Problem set: 100 solved, 1521 unsolved
Search for dead transitions found 100 dead transitions in 62715ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 8 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65783 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 270 out of 306 places after structural reductions.
[2025-06-06 04:35:55] [INFO ] Flatten gal took : 266 ms
[2025-06-06 04:35:56] [INFO ] Flatten gal took : 99 ms
[2025-06-06 04:35:56] [INFO ] Input system was already deterministic with 1531 transitions.
Support contains 269 out of 306 places (down from 270) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4367 ms. (9 steps per ms) remains 4/28 properties
BEST_FIRST walk for 40003 steps (8 resets) in 731 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 779 ms. (51 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 3/3 properties
[2025-06-06 04:35:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-06 04:35:58] [INFO ] Computed 45 invariants in 11 ms
[2025-06-06 04:35:58] [INFO ] State equation strengthened by 111 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 151/273 variables, 22/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 151/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 10/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 303/948 variables, and 316 constraints, problems are : Problem set: 3 solved, 0 unsolved in 307 ms.
Refiners :[Domain max(s): 273/306 constraints, Positive P Invariants (semi-flows): 22/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA SafeBus-PT-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SafeBus-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 122 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 201 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:35:59] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:36:05] [INFO ] Implicit Places using invariants in 6358 ms returned []
[2025-06-06 04:36:05] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:36:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:36:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-06 04:36:12] [INFO ] Implicit Places using invariants and state equation in 6517 ms returned []
Implicit Place search using SMT with State Equation took 12892 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:36:12] [INFO ] Redundant transitions in 93 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-06 04:36:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:36:12] [INFO ] Invariant cache hit.
[2025-06-06 04:36:12] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:32] [INFO ] Deduced a trap composed of 32 places in 361 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:33] [INFO ] Deduced a trap composed of 32 places in 515 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:33] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:33] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:33] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:34] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:34] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:34] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:34] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:35] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:35] [INFO ] Deduced a trap composed of 32 places in 243 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:35] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:36] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:36] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:36] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:36] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:37] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:37] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:37] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:37] [INFO ] Deduced a trap composed of 32 places in 232 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30032 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 24/330 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 21/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/948 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30045 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/306 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62262ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62268ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75469 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 683 ms.
Stack based approach found an accepted trace after 400 steps with 0 reset with depth 401 and stack size 401 in 3 ms.
FORMULA SafeBus-PT-10-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-02 finished in 76384 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 X(X(G(p1)))))'
Support contains 21 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 19 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:37:15] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:24] [INFO ] Implicit Places using invariants in 8700 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 8714 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 10 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8752 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-06 finished in 9107 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))'
Support contains 11 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:37:24] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:37:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:31] [INFO ] Implicit Places using invariants in 6821 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 6835 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 12 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6855 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-07 finished in 6953 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) U p1)))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 142 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:37:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:37:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:39] [INFO ] Implicit Places using invariants in 7721 ms returned [266, 267, 269, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 7736 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 297/306 places, 1531/1531 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 297 transition count 1523
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 289 transition count 1523
Applied a total of 16 rules in 211 ms. Remains 289 /297 variables (removed 8) and now considering 1523/1531 (removed 8) transitions.
[2025-06-06 04:37:39] [INFO ] Flow matrix only has 634 transitions (discarded 889 similar events)
// Phase 1: matrix 634 rows 289 cols
[2025-06-06 04:37:39] [INFO ] Computed 36 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:46] [INFO ] Implicit Places using invariants in 6651 ms returned []
[2025-06-06 04:37:46] [INFO ] Flow matrix only has 634 transitions (discarded 889 similar events)
[2025-06-06 04:37:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:46] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-06 04:37:53] [INFO ] Implicit Places using invariants and state equation in 6669 ms returned []
Implicit Place search using SMT with State Equation took 13353 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 289/306 places, 1523/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21443 ms. Remains : 289/306 places, 1523/1531 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-09
Product exploration explored 100000 steps with 521 reset in 583 ms.
Product exploration explored 100000 steps with 539 reset in 590 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 p1 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 196 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 586 ms. (68 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
[2025-06-06 04:37:55] [INFO ] Flow matrix only has 634 transitions (discarded 889 similar events)
[2025-06-06 04:37:55] [INFO ] Invariant cache hit.
[2025-06-06 04:37:55] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 110/118 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/130 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 107/237 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 107/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 46/283 variables, 6/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 46/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/287 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/287 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/287 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 633/920 variables, 287/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/920 variables, 110/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/920 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/923 variables, 2/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/923 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/923 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/923 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/923 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/923 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 923/923 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 423 ms.
Refiners :[Domain max(s): 289/289 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 289/289 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 110/118 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 110/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/130 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 107/237 variables, 18/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 107/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 283/923 variables, and 268 constraints, problems are : Problem set: 1 solved, 0 unsolved in 157 ms.
Refiners :[Domain max(s): 237/289 constraints, Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 18/22 constraints, State Equation: 0/289 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 626ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 289 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 : 289/289 places, 1523/1523 transitions.
Applied a total of 0 rules in 248 ms. Remains 289 /289 variables (removed 0) and now considering 1523/1523 (removed 0) transitions.
[2025-06-06 04:37:56] [INFO ] Flow matrix only has 634 transitions (discarded 889 similar events)
[2025-06-06 04:37:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:02] [INFO ] Implicit Places using invariants in 6335 ms returned []
[2025-06-06 04:38:02] [INFO ] Flow matrix only has 634 transitions (discarded 889 similar events)
[2025-06-06 04:38:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:02] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-06 04:38:09] [INFO ] Implicit Places using invariants and state equation in 6558 ms returned []
Implicit Place search using SMT with State Equation took 12908 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:38:09] [INFO ] Redundant transitions in 42 ms returned []
Running 1513 sub problems to find dead transitions.
[2025-06-06 04:38:09] [INFO ] Flow matrix only has 634 transitions (discarded 889 similar events)
[2025-06-06 04:38:09] [INFO ] Invariant cache hit.
[2025-06-06 04:38:09] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 289/289 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 14/303 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 22/325 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:24] [INFO ] Deduced a trap composed of 32 places in 426 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:24] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:24] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:24] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:24] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:24] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:24] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:25] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:25] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:25] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:25] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:25] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:25] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:25] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:26] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:26] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:26] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:26] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:26] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:26] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/923 variables, and 345 constraints, problems are : Problem set: 0 solved, 1513 unsolved in 30023 ms.
Refiners :[Domain max(s): 289/289 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/289 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1513/1513 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1513 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 289/289 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 14/303 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 22/325 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 20/345 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:50] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:51] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:51] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:51] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:51] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:51] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:51] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:51] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:51] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:52] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:52] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:52] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:52] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:52] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:52] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:52] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:53] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:53] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:53] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:53] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 20/365 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:58] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:58] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:58] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:58] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:58] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:59] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:59] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:59] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:59] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:59] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:59] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:59] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:00] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:00] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:00] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:00] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:00] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:00] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:01] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:01] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 1513 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:05] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:06] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:06] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:06] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/923 variables, and 389 constraints, problems are : Problem set: 0 solved, 1513 unsolved in 30032 ms.
Refiners :[Domain max(s): 289/289 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/289 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1513 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62292ms problems are : Problem set: 0 solved, 1513 unsolved
Search for dead transitions found 0 dead transitions in 62297ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75510 ms. Remains : 289/289 places, 1523/1523 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)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 113 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 53 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 611 steps (0 resets) in 8 ms. (67 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 107 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 64 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 531 reset in 477 ms.
Product exploration explored 100000 steps with 547 reset in 493 ms.
Built C files in :
/tmp/ltsmin11504348005627570425
[2025-06-06 04:39:13] [INFO ] Too many transitions (1523) to apply POR reductions. Disabling POR matrices.
[2025-06-06 04:39:13] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11504348005627570425
Running compilation step : cd /tmp/ltsmin11504348005627570425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2962 ms.
Running link step : cd /tmp/ltsmin11504348005627570425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin11504348005627570425;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5795583526454007255.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 1523/1523 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 289 transition count 1522
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 288 transition count 1522
Applied a total of 2 rules in 102 ms. Remains 288 /289 variables (removed 1) and now considering 1522/1523 (removed 1) transitions.
[2025-06-06 04:39:28] [INFO ] Flow matrix only has 633 transitions (discarded 889 similar events)
// Phase 1: matrix 633 rows 288 cols
[2025-06-06 04:39:28] [INFO ] Computed 36 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:34] [INFO ] Implicit Places using invariants in 6107 ms returned [266]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 287/289 places, 1522/1523 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 287 transition count 1521
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 286 transition count 1521
Applied a total of 2 rules in 130 ms. Remains 286 /287 variables (removed 1) and now considering 1521/1522 (removed 1) transitions.
[2025-06-06 04:39:34] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2025-06-06 04:39:34] [INFO ] Computed 35 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:39] [INFO ] Implicit Places using invariants in 5459 ms returned []
[2025-06-06 04:39:39] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2025-06-06 04:39:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-06 04:39:48] [INFO ] Implicit Places using invariants and state equation in 8156 ms returned []
Implicit Place search using SMT with State Equation took 13619 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/289 places, 1521/1523 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19962 ms. Remains : 286/289 places, 1521/1523 transitions.
Built C files in :
/tmp/ltsmin18293749442985396918
[2025-06-06 04:39:48] [INFO ] Too many transitions (1521) to apply POR reductions. Disabling POR matrices.
[2025-06-06 04:39:48] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18293749442985396918
Running compilation step : cd /tmp/ltsmin18293749442985396918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2897 ms.
Running link step : cd /tmp/ltsmin18293749442985396918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin18293749442985396918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16720043185991644905.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 04:40:03] [INFO ] Flatten gal took : 170 ms
[2025-06-06 04:40:03] [INFO ] Flatten gal took : 116 ms
[2025-06-06 04:40:03] [INFO ] Time to serialize gal into /tmp/LTL1151249156614246811.gal : 26 ms
[2025-06-06 04:40:03] [INFO ] Time to serialize properties into /tmp/LTL4527605616583504913.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/LTL1151249156614246811.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9472633290429307942.hoa' '-atoms' '/tmp/LTL4527605616583504913.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/LTL4527605616583504913.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9472633290429307942.hoa
Detected timeout of ITS tools.
[2025-06-06 04:40:18] [INFO ] Flatten gal took : 61 ms
[2025-06-06 04:40:18] [INFO ] Flatten gal took : 58 ms
[2025-06-06 04:40:18] [INFO ] Time to serialize gal into /tmp/LTL7057815749224629127.gal : 15 ms
[2025-06-06 04:40:18] [INFO ] Time to serialize properties into /tmp/LTL10958561183000240677.ltl : 16 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/LTL7057815749224629127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10958561183000240677.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 : !((G((F("((((RMC_9==0)||(wait_ack_6_1==1))||((!((wait_ack_5_4==0)||(AMC_10_8==1)))||(cable_free==0)))||(wait_cable_3==1))"))U("((cable...185
Formula 0 simplified : F(G!"((((RMC_9==0)||(wait_ack_6_1==1))||((!((wait_ack_5_4==0)||(AMC_10_8==1)))||(cable_free==0)))||(wait_cable_3==1))" R !"((cable_u...180
Detected timeout of ITS tools.
[2025-06-06 04:40:34] [INFO ] Flatten gal took : 54 ms
[2025-06-06 04:40:34] [INFO ] Applying decomposition
[2025-06-06 04:40:34] [INFO ] Flatten gal took : 66 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/graph9493757822962547029.txt' '-o' '/tmp/graph9493757822962547029.bin' '-w' '/tmp/graph9493757822962547029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9493757822962547029.bin' '-l' '-1' '-v' '-w' '/tmp/graph9493757822962547029.weights' '-q' '0' '-e' '0.001'
[2025-06-06 04:40:34] [INFO ] Decomposing Gal with order
[2025-06-06 04:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:40:35] [INFO ] Removed a total of 3055 redundant transitions.
[2025-06-06 04:40:35] [INFO ] Flatten gal took : 675 ms
[2025-06-06 04:40:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 584 labels/synchronizations in 65 ms.
[2025-06-06 04:40:35] [INFO ] Time to serialize gal into /tmp/LTL16620105984652760533.gal : 16 ms
[2025-06-06 04:40:35] [INFO ] Time to serialize properties into /tmp/LTL17289459956065981773.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/LTL16620105984652760533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17289459956065981773.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("((((i1.u8.RMC_9==0)||(i4.u9.wait_ack_6_1==1))||((!((i4.u2.wait_ack_5_4==0)||(u7.AMC_10_8==1)))||(i4.u9.cable_free==0)))||(i0....232
Formula 0 simplified : F(G!"((((i1.u8.RMC_9==0)||(i4.u9.wait_ack_6_1==1))||((!((i4.u2.wait_ack_5_4==0)||(u7.AMC_10_8==1)))||(i4.u9.cable_free==0)))||(i0.u1...227
Detected timeout of ITS tools.
Treatment of property SafeBus-PT-10-LTLCardinality-09 finished in 198812 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)||F(p1)))||G(p2)))'
Support contains 3 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:40:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-06 04:40:50] [INFO ] Computed 45 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:40:57] [INFO ] Implicit Places using invariants in 6847 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 6868 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6877 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Product exploration explored 100000 steps with 50000 reset in 284 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 p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 12 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLCardinality-10 finished in 7712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1&&X(!p0)))))'
Support contains 3 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:40:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:40:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:05] [INFO ] Implicit Places using invariants in 7594 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 7613 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7623 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 204 ms :[p0, false, (AND (NOT p0) (NOT p1)), true, (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-11 finished in 7843 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((X(X(X((p1 U (p2||G(p1))))))||p0)))'
Support contains 3 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:41:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:41:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:13] [INFO ] Implicit Places using invariants in 7194 ms returned [266, 267, 268, 270, 271, 272, 273, 274, 275]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 7199 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 297/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 11 ms. Remains 297 /297 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7215 ms. Remains : 297/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-12 finished in 7381 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)))'
Support contains 1 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:41:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:41:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:21] [INFO ] Implicit Places using invariants in 7722 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 7728 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 9 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7743 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-10-LTLCardinality-13 finished in 7838 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) U X((!p1&&F(!p2)))))'
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:41:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:41:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:28] [INFO ] Implicit Places using invariants in 7657 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 7670 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7678 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR p1 p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR p2 p1), (NOT p0), (AND (NOT p0) p2), p2]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 10379 reset in 333 ms.
Product exploration explored 100000 steps with 10333 reset in 356 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 p2), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 495 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR p2 p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), p2]
RANDOM walk for 36 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 5 factoid took 626 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR p2 p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 231 ms :[(OR p2 p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), p2]
[2025-06-06 04:41:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2025-06-06 04:41:31] [INFO ] Computed 35 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:41:32] [INFO ] [Real]Absence check using 14 positive place invariants in 163 ms returned sat
[2025-06-06 04:41:34] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 2535 ms returned sat
[2025-06-06 04:41:46] [INFO ] [Real]Absence check using state equation in 11769 ms returned unknown
Could not prove EG p2
[2025-06-06 04:41:46] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:41:47] [INFO ] [Real]Absence check using 14 positive place invariants in 290 ms returned sat
[2025-06-06 04:41:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 04:41:52] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 4729 ms returned unknown
Could not prove EG p1
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 4 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:41:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:41:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:58] [INFO ] Implicit Places using invariants in 6100 ms returned []
[2025-06-06 04:41:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:41:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:41:58] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-06 04:42:05] [INFO ] Implicit Places using invariants and state equation in 7186 ms returned []
Implicit Place search using SMT with State Equation took 13310 ms to find 0 implicit places.
Running 1521 sub problems to find dead transitions.
[2025-06-06 04:42:05] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:42:05] [INFO ] Invariant cache hit.
[2025-06-06 04:42:05] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:22] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:22] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:22] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:22] [INFO ] Deduced a trap composed of 32 places in 281 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:23] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:23] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:23] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:24] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:24] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:24] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:24] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:25] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:25] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:25] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:26] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:26] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:26] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:26] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:27] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:42:27] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30036 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
SMT process timed out in 62401ms, After SMT, problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62405ms
Finished structural reductions in LTL mode , in 1 iterations and 75724 ms. Remains : 296/296 places, 1531/1531 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 p1 (NOT p0) p2), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 501 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR p2 p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), p2]
RANDOM walk for 187 steps (0 resets) in 5 ms. (31 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT p1)), (F p0), (F (NOT p2)), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 5 factoid took 693 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR p2 p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 229 ms :[(OR p2 p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), p2]
[2025-06-06 04:43:09] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:43:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:43:10] [INFO ] [Real]Absence check using 14 positive place invariants in 372 ms returned sat
[2025-06-06 04:43:12] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 1616 ms returned sat
[2025-06-06 04:43:24] [INFO ] [Real]Absence check using state equation in 12457 ms returned unknown
Could not prove EG p2
[2025-06-06 04:43:24] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2025-06-06 04:43:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 04:43:25] [INFO ] [Real]Absence check using 14 positive place invariants in 277 ms returned sat
[2025-06-06 04:43:29] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 04:43:30] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 4728 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 216 ms :[(OR p2 p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), p2]
Product exploration explored 100000 steps with 10464 reset in 340 ms.
Product exploration explored 100000 steps with 10407 reset in 346 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 214 ms :[(OR p2 p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p1 p2), (NOT p0), (AND (NOT p0) p2), p2]
Support contains 5 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 296 transition count 1531
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 296 transition count 1531
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 9 rules in 136 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:43:31] [INFO ] Redundant transitions in 18 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-06-06 04:43:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2025-06-06 04:43:32] [INFO ] Computed 35 invariants in 6 ms
[2025-06-06 04:43:32] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:47] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:47] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:47] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:47] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:47] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:47] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:48] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:48] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:48] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:48] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:48] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:48] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:48] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:49] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:49] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:49] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:49] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:49] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:49] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:43:50] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/938 variables, and 351 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30034 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 296/296 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 14/310 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 21/331 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:15] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:15] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:15] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:16] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:16] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:16] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:16] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:16] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:17] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:17] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:17] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:27] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:28] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:28] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:29] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:29] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:29] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:44:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/938 variables, and 371 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30025 ms.
Refiners :[Domain max(s): 296/296 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/296 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62075ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 62078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 296/296 places, 1531/1531 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62270 ms. Remains : 296/296 places, 1531/1531 transitions.
Built C files in :
/tmp/ltsmin17205032078765552385
[2025-06-06 04:44:34] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17205032078765552385
Running compilation step : cd /tmp/ltsmin17205032078765552385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2925 ms.
Running link step : cd /tmp/ltsmin17205032078765552385;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17205032078765552385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8476761304061361994.hoa' '--buchi-type=spotba'
LTSmin run took 11717 ms.
FORMULA SafeBus-PT-10-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-PT-10-LTLCardinality-14 finished in 207493 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)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 10 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2025-06-06 04:44:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-06 04:44:48] [INFO ] Computed 45 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:44:57] [INFO ] Implicit Places using invariants in 8301 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 8306 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8324 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : SafeBus-PT-10-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 283 ms.
Product exploration explored 100000 steps with 33333 reset in 302 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-10-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-10-LTLCardinality-15 finished in 9079 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) U p1)))'
[2025-06-06 04:44:58] [INFO ] Flatten gal took : 63 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15516455557260397871
[2025-06-06 04:44:58] [INFO ] Too many transitions (1531) to apply POR reductions. Disabling POR matrices.
[2025-06-06 04:44:58] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15516455557260397871
Running compilation step : cd /tmp/ltsmin15516455557260397871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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-06 04:44:58] [INFO ] Applying decomposition
[2025-06-06 04:44:58] [INFO ] Flatten gal took : 53 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/graph2265366884191172524.txt' '-o' '/tmp/graph2265366884191172524.bin' '-w' '/tmp/graph2265366884191172524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2265366884191172524.bin' '-l' '-1' '-v' '-w' '/tmp/graph2265366884191172524.weights' '-q' '0' '-e' '0.001'
[2025-06-06 04:44:58] [INFO ] Decomposing Gal with order
[2025-06-06 04:44:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:44:58] [INFO ] Removed a total of 3714 redundant transitions.
[2025-06-06 04:44:58] [INFO ] Flatten gal took : 168 ms
[2025-06-06 04:44:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 655 labels/synchronizations in 49 ms.
[2025-06-06 04:44:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality15535599547322857081.gal : 7 ms
[2025-06-06 04:44:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality18278186986810601404.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/LTLCardinality15535599547322857081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18278186986810601404.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G((F("((((i0.u11.RMC_9==0)||(i2.i0.u2.wait_ack_6_1==1))||((!((i2.i0.u2.wait_ack_5_4==0)||(i0.u6.AMC_10_8==1)))||(i2.i0.u2.cable_fre...251
Formula 0 simplified : F(G!"((((i0.u11.RMC_9==0)||(i2.i0.u2.wait_ack_6_1==1))||((!((i2.i0.u2.wait_ack_5_4==0)||(i0.u6.AMC_10_8==1)))||(i2.i0.u2.cable_free=...246
Compilation finished in 3086 ms.
Running link step : cd /tmp/ltsmin15516455557260397871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15516455557260397871;'/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' '[]((<>((LTLAPp0==true)) U (LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-06 05:08:23] [INFO ] Applying decomposition
[2025-06-06 05:08:24] [INFO ] Flatten gal took : 1230 ms
[2025-06-06 05:08:24] [INFO ] Decomposing Gal with order
[2025-06-06 05:08:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:08:27] [INFO ] Removed a total of 4785 redundant transitions.
[2025-06-06 05:08:28] [INFO ] Flatten gal took : 2522 ms
[2025-06-06 05:08:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 362 ms.
[2025-06-06 05:08:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality14672312733155442545.gal : 83 ms
[2025-06-06 05:08:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality65885037308397493.ltl : 5 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/LTLCardinality14672312733155442545.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality65885037308397493.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...275
Read 1 LTL properties
Checking formula 0 : !((G((F("((((u10.RMC_9==0)||(u1.wait_ack_6_1==1))||((!((u1.wait_ack_5_4==0)||(u11.AMC_10_8==1)))||(u1.cable_free==0)))||(u30.wait_cabl...214
Formula 0 simplified : F(G!"((((u10.RMC_9==0)||(u1.wait_ack_6_1==1))||((!((u1.wait_ack_5_4==0)||(u11.AMC_10_8==1)))||(u1.cable_free==0)))||(u30.wait_cable_...209
Detected timeout of ITS tools.
[2025-06-06 05:31:53] [INFO ] Flatten gal took : 824 ms
[2025-06-06 05:31:57] [INFO ] Input system was already deterministic with 1531 transitions.
[2025-06-06 05:31:57] [INFO ] Transformed 306 places.
[2025-06-06 05:31:57] [INFO ] Transformed 1531 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-06 05:32:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality11946625969932203210.gal : 45 ms
[2025-06-06 05:32:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality13834191985289712161.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/LTLCardinality11946625969932203210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13834191985289712161.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((((RMC_9==0)||(wait_ack_6_1==1))||((!((wait_ack_5_4==0)||(AMC_10_8==1)))||(cable_free==0)))||(wait_cable_3==1))"))U("((cable...185
Formula 0 simplified : F(G!"((((RMC_9==0)||(wait_ack_6_1==1))||((!((wait_ack_5_4==0)||(AMC_10_8==1)))||(cable_free==0)))||(wait_cable_3==1))" R !"((cable_u...180
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is SafeBus-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889264800779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-10.tgz
mv SafeBus-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;