About the Execution of ITS-Tools for DBSingleClientW-PT-d1m07
| 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 | TTFFFT?F??FTFF?T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063500082.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 DBSingleClientW-PT-d1m07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063500082
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 908K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m07-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d1m07-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748574090571
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 03:01:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 03:01:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 03:01:32] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2025-05-30 03:01:32] [INFO ] Transformed 1440 places.
[2025-05-30 03:01:32] [INFO ] Transformed 672 transitions.
[2025-05-30 03:01:32] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 83 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 160 place count 267 transition count 495
Iterating global reduction 1 with 59 rules applied. Total rules applied 219 place count 267 transition count 495
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 264 place count 222 transition count 450
Iterating global reduction 1 with 45 rules applied. Total rules applied 309 place count 222 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 310 place count 222 transition count 449
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 322 place count 210 transition count 433
Iterating global reduction 2 with 12 rules applied. Total rules applied 334 place count 210 transition count 433
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 347 place count 210 transition count 420
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 348 place count 209 transition count 419
Iterating global reduction 3 with 1 rules applied. Total rules applied 349 place count 209 transition count 419
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 350 place count 208 transition count 418
Iterating global reduction 3 with 1 rules applied. Total rules applied 351 place count 208 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 352 place count 207 transition count 417
Iterating global reduction 3 with 1 rules applied. Total rules applied 353 place count 207 transition count 417
Applied a total of 353 rules in 166 ms. Remains 207 /347 variables (removed 140) and now considering 417/672 (removed 255) transitions.
// Phase 1: matrix 417 rows 207 cols
[2025-05-30 03:01:33] [INFO ] Computed 2 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:33] [INFO ] Implicit Places using invariants in 600 ms returned []
[2025-05-30 03:01:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:34] [INFO ] State equation strengthened by 233 read => feed constraints.
[2025-05-30 03:01:36] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 2834 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-05-30 03:01:36] [INFO ] Invariant cache hit.
[2025-05-30 03:01:36] [INFO ] State equation strengthened by 233 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (OVERLAPS) 417/624 variables, 207/209 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 233/442 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/624 variables, and 442 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 207/207 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (OVERLAPS) 417/624 variables, 207/209 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/624 variables, 233/442 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/624 variables, and 858 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 207/207 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61677ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 61704ms
Starting structural reductions in LTL mode, iteration 1 : 207/347 places, 417/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64758 ms. Remains : 207/347 places, 417/672 transitions.
Support contains 83 out of 207 places after structural reductions.
[2025-05-30 03:02:38] [INFO ] Flatten gal took : 80 ms
[2025-05-30 03:02:38] [INFO ] Flatten gal took : 45 ms
[2025-05-30 03:02:38] [INFO ] Input system was already deterministic with 417 transitions.
Support contains 81 out of 207 places (down from 83) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 64 to 63
RANDOM walk for 40000 steps (9289 resets) in 4118 ms. (9 steps per ms) remains 52/63 properties
BEST_FIRST walk for 4004 steps (201 resets) in 55 ms. (71 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (183 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (371 resets) in 74 ms. (53 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (196 resets) in 101 ms. (39 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (191 resets) in 89 ms. (44 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (181 resets) in 54 ms. (72 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (181 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (182 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (193 resets) in 28 ms. (137 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (185 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (390 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (198 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (181 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (171 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (175 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (200 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (172 resets) in 25 ms. (154 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4004 steps (184 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (197 resets) in 22 ms. (174 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (187 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (192 resets) in 60 ms. (65 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (207 resets) in 36 ms. (108 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (188 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (182 resets) in 34 ms. (114 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (371 resets) in 54 ms. (72 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (362 resets) in 42 ms. (93 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (204 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (190 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (390 resets) in 43 ms. (90 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (413 resets) in 53 ms. (74 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (98 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (603 resets) in 55 ms. (71 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (179 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (159 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (185 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (200 resets) in 32 ms. (121 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (402 resets) in 55 ms. (71 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (194 resets) in 59 ms. (66 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (379 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (800 resets) in 50 ms. (78 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (187 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (190 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (186 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (189 resets) in 33 ms. (117 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (180 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (198 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (166 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (187 resets) in 28 ms. (138 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (190 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (173 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
[2025-05-30 03:02:40] [INFO ] Invariant cache hit.
[2025-05-30 03:02:40] [INFO ] State equation strengthened by 233 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 1 (OVERLAPS) 61/127 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 39/166 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 384/550 variables, 166/168 constraints. Problems are: Problem set: 3 solved, 47 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 200/368 constraints. Problems are: Problem set: 3 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/368 constraints. Problems are: Problem set: 3 solved, 47 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 8 (OVERLAPS) 74/624 variables, 41/409 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 33/442 constraints. Problems are: Problem set: 5 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/624 variables, and 442 constraints, problems are : Problem set: 5 solved, 45 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 207/207 constraints, ReadFeed: 233/233 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 45 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 64/121 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:46] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 40/161 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 376/537 variables, 161/164 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 192/356 constraints. Problems are: Problem set: 5 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:49] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:49] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:49] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:49] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:49] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:49] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:49] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:49] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:50] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:50] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:50] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:50] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:50] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/624 variables, and 369 constraints, problems are : Problem set: 5 solved, 45 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/207 constraints, ReadFeed: 192/233 constraints, PredecessorRefiner: 0/50 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10241ms problems are : Problem set: 5 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 197 transition count 394
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 197 transition count 394
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 28 place count 197 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 192 transition count 381
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 192 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 192 transition count 380
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 188 transition count 375
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 188 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 188 transition count 373
Applied a total of 49 rules in 120 ms. Remains 188 /207 variables (removed 19) and now considering 373/417 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 188/207 places, 373/417 transitions.
RANDOM walk for 40000 steps (9193 resets) in 1329 ms. (30 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (208 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (390 resets) in 65 ms. (60 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (166 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (192 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (198 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (174 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (182 resets) in 36 ms. (108 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (190 resets) in 40 ms. (97 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (184 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (367 resets) in 63 ms. (62 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (177 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (199 resets) in 53 ms. (74 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (196 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (195 resets) in 43 ms. (90 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (178 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (199 resets) in 43 ms. (90 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (190 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (155 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (189 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (190 resets) in 40 ms. (97 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (204 resets) in 43 ms. (90 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (208 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (203 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (394 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (184 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (183 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (365 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (379 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (193 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (187 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (165 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (192 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (394 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (201 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (396 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (800 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (197 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (190 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (180 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (173 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (187 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (180 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (191 resets) in 21 ms. (182 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (191 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (181 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
Interrupted probabilistic random walk after 860283 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :44 out of 45
Probabilistic random walk after 860283 steps, saw 322578 distinct states, run finished after 3009 ms. (steps per millisecond=285 ) properties seen :44
// Phase 1: matrix 373 rows 188 cols
[2025-05-30 03:02:54] [INFO ] Computed 2 invariants in 4 ms
[2025-05-30 03:02:54] [INFO ] State equation strengthened by 200 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 49/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/324 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 31/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 215/539 variables, 57/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 158/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/561 variables, 11/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 11/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/561 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 390 constraints, problems are : Problem set: 0 solved, 1 unsolved in 650 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/324 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 31/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 215/539 variables, 57/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 158/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/561 variables, 11/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 11/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/561 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 391 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1871 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2541ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 572 ms.
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 373/373 transitions.
Graph (complete) has 678 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 187 transition count 366
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 42 place count 153 transition count 236
Iterating global reduction 1 with 34 rules applied. Total rules applied 76 place count 153 transition count 236
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 153 transition count 230
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 107 place count 128 transition count 197
Iterating global reduction 2 with 25 rules applied. Total rules applied 132 place count 128 transition count 197
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 137 place count 128 transition count 192
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 155 place count 110 transition count 165
Iterating global reduction 3 with 18 rules applied. Total rules applied 173 place count 110 transition count 165
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 181 place count 110 transition count 157
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 189 place count 102 transition count 144
Iterating global reduction 4 with 8 rules applied. Total rules applied 197 place count 102 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 201 place count 102 transition count 140
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 205 place count 98 transition count 136
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 98 transition count 136
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 213 place count 94 transition count 132
Iterating global reduction 5 with 4 rules applied. Total rules applied 217 place count 94 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 218 place count 94 transition count 131
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 219 place count 93 transition count 129
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 93 transition count 129
Applied a total of 220 rules in 67 ms. Remains 93 /188 variables (removed 95) and now considering 129/373 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 93/188 places, 129/373 transitions.
RANDOM walk for 40000 steps (9147 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1833 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 29304 steps, run visited all 1 properties in 46 ms. (steps per millisecond=637 )
Probabilistic random walk after 29304 steps, saw 13273 distinct states, run finished after 52 ms. (steps per millisecond=563 ) properties seen :1
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 03:02:58] [INFO ] Flatten gal took : 30 ms
[2025-05-30 03:02:58] [INFO ] Flatten gal took : 33 ms
[2025-05-30 03:02:58] [INFO ] Input system was already deterministic with 417 transitions.
Computed a total of 5 stabilizing places and 35 stable transitions
Graph (complete) has 824 edges and 207 vertex of which 206 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 162 transition count 257
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 162 transition count 257
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 100 place count 162 transition count 247
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 131 place count 131 transition count 205
Iterating global reduction 1 with 31 rules applied. Total rules applied 162 place count 131 transition count 205
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 171 place count 131 transition count 196
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 193 place count 109 transition count 164
Iterating global reduction 2 with 22 rules applied. Total rules applied 215 place count 109 transition count 164
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 225 place count 109 transition count 154
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 235 place count 99 transition count 136
Iterating global reduction 3 with 10 rules applied. Total rules applied 245 place count 99 transition count 136
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 252 place count 99 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 257 place count 94 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 262 place count 94 transition count 124
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 267 place count 89 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 272 place count 89 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 274 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 275 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 88 transition count 110
Applied a total of 276 rules in 48 ms. Remains 88 /207 variables (removed 119) and now considering 110/417 (removed 307) transitions.
// Phase 1: matrix 110 rows 88 cols
[2025-05-30 03:02:58] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:02:58] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-30 03:02:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:02:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 03:02:58] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:02:58] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 03:02:58] [INFO ] Invariant cache hit.
[2025-05-30 03:02:58] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 16385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21963ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 21964ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/207 places, 110/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22396 ms. Remains : 88/207 places, 110/417 transitions.
[2025-05-30 03:03:20] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:03:20] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:03:20] [INFO ] Input system was already deterministic with 110 transitions.
[2025-05-30 03:03:20] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:03:20] [INFO ] Flatten gal took : 7 ms
[2025-05-30 03:03:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1568681753634152025.gal : 5 ms
[2025-05-30 03:03:20] [INFO ] Time to serialize properties into /tmp/CTLFireability17665491838160861128.ctl : 9 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1568681753634152025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17665491838160861128.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.76399e+06,6.56872,145796,2,19759,5,422724,6,0,462,525863,0
Converting to forward existential form...Done !
original formula: EG(EF(((s1<1)||(l1218<1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((s1<1)||(l1218<1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t52, t53, t55, t70, t77, t78, t79, t80, t81, t82, t...398
(forward)formula 0,1,20.3341,366928,1,0,222,1.30256e+06,245,88,3339,1.36297e+06,243
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 169 transition count 285
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 169 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 83 place count 169 transition count 278
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 112 place count 140 transition count 238
Iterating global reduction 1 with 29 rules applied. Total rules applied 141 place count 140 transition count 238
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 151 place count 140 transition count 228
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 170 place count 121 transition count 200
Iterating global reduction 2 with 19 rules applied. Total rules applied 189 place count 121 transition count 200
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 199 place count 121 transition count 190
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 207 place count 113 transition count 176
Iterating global reduction 3 with 8 rules applied. Total rules applied 215 place count 113 transition count 176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 218 place count 113 transition count 173
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 223 place count 108 transition count 168
Iterating global reduction 4 with 5 rules applied. Total rules applied 228 place count 108 transition count 168
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 232 place count 104 transition count 164
Iterating global reduction 4 with 4 rules applied. Total rules applied 236 place count 104 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 238 place count 104 transition count 162
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 239 place count 103 transition count 160
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 103 transition count 160
Applied a total of 240 rules in 29 ms. Remains 103 /207 variables (removed 104) and now considering 160/417 (removed 257) transitions.
// Phase 1: matrix 160 rows 103 cols
[2025-05-30 03:03:41] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:41] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-05-30 03:03:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:03:41] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-30 03:03:42] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2025-05-30 03:03:42] [INFO ] Invariant cache hit.
[2025-05-30 03:03:42] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/263 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 76/181 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:48] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:52] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:52] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:52] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:52] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:53] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:58] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:58] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 20 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/263 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:04:02] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:04:02] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:04:06] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:04:08] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/263 variables, and 193 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 160/263 variables, 103/117 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 76/193 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 159/352 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 352 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 103/207 places, 160/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60953 ms. Remains : 103/207 places, 160/417 transitions.
[2025-05-30 03:04:42] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:04:42] [INFO ] Flatten gal took : 25 ms
[2025-05-30 03:04:42] [INFO ] Input system was already deterministic with 160 transitions.
[2025-05-30 03:04:42] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:04:42] [INFO ] Flatten gal took : 31 ms
[2025-05-30 03:04:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17302263967086439301.gal : 6 ms
[2025-05-30 03:04:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15895308195625872872.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17302263967086439301.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15895308195625872872.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:05:12] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:05:12] [INFO ] Applying decomposition
[2025-05-30 03:05:12] [INFO ] Flatten gal took : 8 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/graph6238533596401437463.txt' '-o' '/tmp/graph6238533596401437463.bin' '-w' '/tmp/graph6238533596401437463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6238533596401437463.bin' '-l' '-1' '-v' '-w' '/tmp/graph6238533596401437463.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:05:12] [INFO ] Decomposing Gal with order
[2025-05-30 03:05:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:05:12] [INFO ] Removed a total of 136 redundant transitions.
[2025-05-30 03:05:12] [INFO ] Flatten gal took : 85 ms
[2025-05-30 03:05:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 19 ms.
[2025-05-30 03:05:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4490306860042955919.gal : 6 ms
[2025-05-30 03:05:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8526891141974666818.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4490306860042955919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8526891141974666818.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.76522e+06,7.72313,118024,2951,1662,125185,17975,410,646148,192,117661,0
Converting to forward existential form...Done !
original formula: !(E(((!(((i3.i0.u0.s1>=1)&&(i6.u14.l1023>=1))) + EF(((((i3.i0.u0.s1>=1)&&(i6.u13.l1258>=1))&&((i3.i0.u0.s1>=1)&&(i2.u10.l946>=1))) + EX((...580
=> equivalent forward existential formula: ([(FwdU(FwdU(((FwdU(Init,((!(((i3.i0.u0.s1>=1)&&(i6.u14.l1023>=1))) + E(TRUE U ((((i3.i0.u0.s1>=1)&&(i6.u13.l125...1281
Reverse transition relation is NOT exact ! Due to transitions t0, t6, t19, t48, t59, t60, t77, t93, t112, t123, t124, t126, t127, t130, t132, t133, t134, t...507
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 165 transition count 277
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 165 transition count 277
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 91 place count 165 transition count 270
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 119 place count 137 transition count 233
Iterating global reduction 1 with 28 rules applied. Total rules applied 147 place count 137 transition count 233
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 155 place count 137 transition count 225
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 174 place count 118 transition count 196
Iterating global reduction 2 with 19 rules applied. Total rules applied 193 place count 118 transition count 196
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 208 place count 118 transition count 181
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 214 place count 112 transition count 170
Iterating global reduction 3 with 6 rules applied. Total rules applied 220 place count 112 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 223 place count 112 transition count 167
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 227 place count 108 transition count 163
Iterating global reduction 4 with 4 rules applied. Total rules applied 231 place count 108 transition count 163
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 235 place count 104 transition count 159
Iterating global reduction 4 with 4 rules applied. Total rules applied 239 place count 104 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 104 transition count 158
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 241 place count 103 transition count 156
Iterating global reduction 5 with 1 rules applied. Total rules applied 242 place count 103 transition count 156
Applied a total of 242 rules in 36 ms. Remains 103 /207 variables (removed 104) and now considering 156/417 (removed 261) transitions.
// Phase 1: matrix 156 rows 103 cols
[2025-05-30 03:05:43] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-30 03:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:05:43] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-05-30 03:05:43] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:05:43] [INFO ] Redundant transitions in 6 ms returned []
Running 155 sub problems to find dead transitions.
[2025-05-30 03:05:43] [INFO ] Invariant cache hit.
[2025-05-30 03:05:43] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 156/259 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 67/172 constraints. Problems are: Problem set: 0 solved, 155 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 172 constraints, problems are : Problem set: 0 solved, 155 unsolved in 9534 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 156/259 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 67/172 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 155/327 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 327 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39619ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 39620ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/207 places, 156/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40278 ms. Remains : 103/207 places, 156/417 transitions.
[2025-05-30 03:06:23] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:06:23] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:06:23] [INFO ] Input system was already deterministic with 156 transitions.
[2025-05-30 03:06:23] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:06:23] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:06:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13546278241859866795.gal : 2 ms
[2025-05-30 03:06:23] [INFO ] Time to serialize properties into /tmp/CTLFireability7114865028111688817.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13546278241859866795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7114865028111688817.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14851e+07,24.3321,474528,2,26099,5,1.67614e+06,6,0,568,1.35309e+06,0
Converting to forward existential form...Done !
original formula: ((AG(E(!(((s1>=1)&&(l1291>=1))) U ((s1>=1)&&(l1024>=1)))) * EF((AG(((s1<1)||(l1021<1))) + EF(((s1<1)||(l455<1)))))) * AG(((s1<1)||(l612<1...159
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(!(((s1>=1)&&(l1291>=1))) U ((s1>=1)&&(l1024>=1)))))] = FALSE * [(Init * !(E(TRUE U (!(...288
(forward)formula 0,0,24.3471,474528,1,0,8,1.67614e+06,9,2,577,1.35309e+06,1
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 170 transition count 301
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 170 transition count 301
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 100 place count 170 transition count 275
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 124 place count 146 transition count 241
Iterating global reduction 1 with 24 rules applied. Total rules applied 148 place count 146 transition count 241
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 154 place count 146 transition count 235
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 170 place count 130 transition count 214
Iterating global reduction 2 with 16 rules applied. Total rules applied 186 place count 130 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 191 place count 130 transition count 209
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 197 place count 124 transition count 199
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 124 transition count 199
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 212 place count 124 transition count 190
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 215 place count 121 transition count 187
Iterating global reduction 4 with 3 rules applied. Total rules applied 218 place count 121 transition count 187
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 220 place count 119 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 119 transition count 185
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 223 place count 118 transition count 183
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 118 transition count 183
Applied a total of 224 rules in 16 ms. Remains 118 /207 variables (removed 89) and now considering 183/417 (removed 234) transitions.
// Phase 1: matrix 183 rows 118 cols
[2025-05-30 03:06:47] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:06:47] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-05-30 03:06:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:06:48] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-30 03:06:48] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2025-05-30 03:06:48] [INFO ] Invariant cache hit.
[2025-05-30 03:06:48] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/301 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 76/196 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 196 constraints, problems are : Problem set: 0 solved, 182 unsolved in 18721 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/301 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 76/196 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 182/378 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 378 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48914ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 48915ms
Starting structural reductions in LTL mode, iteration 1 : 118/207 places, 183/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49669 ms. Remains : 118/207 places, 183/417 transitions.
[2025-05-30 03:07:37] [INFO ] Flatten gal took : 11 ms
[2025-05-30 03:07:37] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:07:37] [INFO ] Input system was already deterministic with 183 transitions.
[2025-05-30 03:07:37] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:07:37] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:07:37] [INFO ] Time to serialize gal into /tmp/CTLFireability12786061935794428816.gal : 2 ms
[2025-05-30 03:07:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3772833791323758850.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12786061935794428816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3772833791323758850.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:08:07] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:08:07] [INFO ] Applying decomposition
[2025-05-30 03:08:07] [INFO ] Flatten gal took : 9 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/graph16084494277937393914.txt' '-o' '/tmp/graph16084494277937393914.bin' '-w' '/tmp/graph16084494277937393914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16084494277937393914.bin' '-l' '-1' '-v' '-w' '/tmp/graph16084494277937393914.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:08:07] [INFO ] Decomposing Gal with order
[2025-05-30 03:08:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:08:07] [INFO ] Removed a total of 193 redundant transitions.
[2025-05-30 03:08:07] [INFO ] Flatten gal took : 26 ms
[2025-05-30 03:08:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 181 labels/synchronizations in 10 ms.
[2025-05-30 03:08:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14578435571488123426.gal : 6 ms
[2025-05-30 03:08:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2873272897988744982.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14578435571488123426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2873272897988744982.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.07803e+07,8.33005,148904,3079,1462,151624,44996,460,858454,174,344732,0
Converting to forward existential form...Done !
original formula: E((AF(!(AF(AG(((i0.u0.s1>=1)&&(i1.u13.l962>=1)))))) + EF(((((!((i0.u0.s1>=1)&&(i5.u17.l1222>=1)))&&(i0.u0.s1>=1))&&(i0.u11.l944>=1)) + !(...484
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,(!(EG(!(!(!(EG(!(!(E(TRUE U !(((i0.u0.s1>=1)&&(i1.u13.l962>=1)))))))))))) + E(TRUE U ((((!((i0...885
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t11, t13, t17, t19, t45, t46, t47, t48, t49, t50, t53, t55, t56, t126, t130, t140, t1...588
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 164 transition count 264
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 164 transition count 264
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 93 place count 164 transition count 257
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 123 place count 134 transition count 217
Iterating global reduction 1 with 30 rules applied. Total rules applied 153 place count 134 transition count 217
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 162 place count 134 transition count 208
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 184 place count 112 transition count 175
Iterating global reduction 2 with 22 rules applied. Total rules applied 206 place count 112 transition count 175
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 218 place count 112 transition count 163
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 227 place count 103 transition count 149
Iterating global reduction 3 with 9 rules applied. Total rules applied 236 place count 103 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 241 place count 103 transition count 144
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 246 place count 98 transition count 139
Iterating global reduction 4 with 5 rules applied. Total rules applied 251 place count 98 transition count 139
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 255 place count 94 transition count 135
Iterating global reduction 4 with 4 rules applied. Total rules applied 259 place count 94 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 262 place count 94 transition count 132
Applied a total of 262 rules in 11 ms. Remains 94 /207 variables (removed 113) and now considering 132/417 (removed 285) transitions.
// Phase 1: matrix 132 rows 94 cols
[2025-05-30 03:08:37] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:08:37] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-30 03:08:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:08:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-30 03:08:38] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-05-30 03:08:38] [INFO ] Invariant cache hit.
[2025-05-30 03:08:38] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 132/226 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 53/149 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:43] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:43] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:43] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:43] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 11 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:47] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 20 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/226 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:49] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:53] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:54] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 15 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/226 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:56] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 18 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:57] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 12 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:08:59] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 16 (OVERLAPS) 0/226 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 160 constraints, problems are : Problem set: 0 solved, 131 unsolved in 27329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/226 variables, 94/107 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 53/160 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 131/291 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/226 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 291 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57390ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 57392ms
Starting structural reductions in LTL mode, iteration 1 : 94/207 places, 132/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57878 ms. Remains : 94/207 places, 132/417 transitions.
[2025-05-30 03:09:35] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:09:35] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:09:35] [INFO ] Input system was already deterministic with 132 transitions.
[2025-05-30 03:09:35] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:09:35] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:09:35] [INFO ] Time to serialize gal into /tmp/CTLFireability18312913733573099981.gal : 3 ms
[2025-05-30 03:09:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16840102218991702506.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18312913733573099981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16840102218991702506.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07734e+06,17.1227,340180,2,31522,5,965036,6,0,508,1.20262e+06,0
Converting to forward existential form...Done !
original formula: (E(A(AF(((s1>=1)&&(l610>=1))) U EX(((p36>=1)&&(l0>=1)))) U ((s1>=1)&&(l1226>=1))) + AG(((s1<1)||(l609<1))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(!((E(!(EX(((p36>=1)&&(l0>=1)))) U (!(!(EG(!(((s1>=1)&&(l610>=1)))))) * !(EX(((p36>=1)&&(l0>=1...263
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t19, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t...565
Detected timeout of ITS tools.
[2025-05-30 03:10:05] [INFO ] Flatten gal took : 5 ms
[2025-05-30 03:10:05] [INFO ] Applying decomposition
[2025-05-30 03:10:05] [INFO ] Flatten gal took : 6 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/graph14758432038931721324.txt' '-o' '/tmp/graph14758432038931721324.bin' '-w' '/tmp/graph14758432038931721324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14758432038931721324.bin' '-l' '-1' '-v' '-w' '/tmp/graph14758432038931721324.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:10:05] [INFO ] Decomposing Gal with order
[2025-05-30 03:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:10:05] [INFO ] Removed a total of 130 redundant transitions.
[2025-05-30 03:10:05] [INFO ] Flatten gal took : 28 ms
[2025-05-30 03:10:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 11 ms.
[2025-05-30 03:10:05] [INFO ] Time to serialize gal into /tmp/CTLFireability5534795779334622780.gal : 4 ms
[2025-05-30 03:10:05] [INFO ] Time to serialize properties into /tmp/CTLFireability17155567627839237843.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5534795779334622780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17155567627839237843.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07734e+06,29.7706,544584,3612,1635,422736,211925,419,3.38506e+06,135,2.33839e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 161 transition count 249
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 161 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 98 place count 161 transition count 243
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 130 place count 129 transition count 200
Iterating global reduction 1 with 32 rules applied. Total rules applied 162 place count 129 transition count 200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 171 place count 129 transition count 191
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 194 place count 106 transition count 157
Iterating global reduction 2 with 23 rules applied. Total rules applied 217 place count 106 transition count 157
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 228 place count 106 transition count 146
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 238 place count 96 transition count 128
Iterating global reduction 3 with 10 rules applied. Total rules applied 248 place count 96 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 253 place count 96 transition count 123
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 259 place count 90 transition count 117
Iterating global reduction 4 with 6 rules applied. Total rules applied 265 place count 90 transition count 117
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 271 place count 84 transition count 106
Iterating global reduction 4 with 6 rules applied. Total rules applied 277 place count 84 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 280 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 281 place count 83 transition count 101
Iterating global reduction 5 with 1 rules applied. Total rules applied 282 place count 83 transition count 101
Applied a total of 282 rules in 55 ms. Remains 83 /207 variables (removed 124) and now considering 101/417 (removed 316) transitions.
// Phase 1: matrix 101 rows 83 cols
[2025-05-30 03:10:36] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:10:36] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 03:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:10:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 03:10:36] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:10:36] [INFO ] Redundant transitions in 3 ms returned []
Running 100 sub problems to find dead transitions.
[2025-05-30 03:10:36] [INFO ] Invariant cache hit.
[2025-05-30 03:10:36] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4925 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 18996 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23953ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 23955ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/207 places, 101/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24344 ms. Remains : 83/207 places, 101/417 transitions.
[2025-05-30 03:11:00] [INFO ] Flatten gal took : 11 ms
[2025-05-30 03:11:00] [INFO ] Flatten gal took : 6 ms
[2025-05-30 03:11:00] [INFO ] Input system was already deterministic with 101 transitions.
[2025-05-30 03:11:00] [INFO ] Flatten gal took : 6 ms
[2025-05-30 03:11:00] [INFO ] Flatten gal took : 7 ms
[2025-05-30 03:11:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16087841432521594609.gal : 2 ms
[2025-05-30 03:11:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13377021783272184370.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16087841432521594609.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13377021783272184370.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13377021783272184370.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
RANDOM walk for 40000 steps (9145 resets) in 403 ms. (99 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 72
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :72 after 124
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :124 after 224
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :224 after 416
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :416 after 1826
BEST_FIRST walk for 40000 steps (1892 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4553 steps, run visited all 1 properties in 14 ms. (steps per millisecond=325 )
Probabilistic random walk after 4553 steps, saw 2123 distinct states, run finished after 14 ms. (steps per millisecond=325 ) properties seen :1
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 164 transition count 260
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 164 transition count 260
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 93 place count 164 transition count 253
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 123 place count 134 transition count 216
Iterating global reduction 1 with 30 rules applied. Total rules applied 153 place count 134 transition count 216
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 161 place count 134 transition count 208
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 182 place count 113 transition count 177
Iterating global reduction 2 with 21 rules applied. Total rules applied 203 place count 113 transition count 177
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 214 place count 113 transition count 166
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 223 place count 104 transition count 149
Iterating global reduction 3 with 9 rules applied. Total rules applied 232 place count 104 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 236 place count 104 transition count 145
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 241 place count 99 transition count 140
Iterating global reduction 4 with 5 rules applied. Total rules applied 246 place count 99 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 250 place count 95 transition count 136
Iterating global reduction 4 with 4 rules applied. Total rules applied 254 place count 95 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 95 transition count 135
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 256 place count 94 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 94 transition count 133
Applied a total of 257 rules in 36 ms. Remains 94 /207 variables (removed 113) and now considering 133/417 (removed 284) transitions.
// Phase 1: matrix 133 rows 94 cols
[2025-05-30 03:11:00] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:11:01] [INFO ] Implicit Places using invariants in 399 ms returned []
[2025-05-30 03:11:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:11:01] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-30 03:11:01] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:11:01] [INFO ] Redundant transitions in 7 ms returned []
Running 132 sub problems to find dead transitions.
[2025-05-30 03:11:01] [INFO ] Invariant cache hit.
[2025-05-30 03:11:01] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/227 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 132 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 144 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6399 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/227 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 132/276 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 276 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36518ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 36519ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/207 places, 133/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37480 ms. Remains : 94/207 places, 133/417 transitions.
[2025-05-30 03:11:38] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:11:38] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:11:38] [INFO ] Input system was already deterministic with 133 transitions.
[2025-05-30 03:11:38] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:11:38] [INFO ] Flatten gal took : 11 ms
[2025-05-30 03:11:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12275022464501502559.gal : 3 ms
[2025-05-30 03:11:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13150586019964766062.ctl : 10 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12275022464501502559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13150586019964766062.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.72666e+06,17.7139,334700,2,31691,5,961687,6,0,509,1.28968e+06,0
Converting to forward existential form...Done !
original formula: AF((EF(((s1>=1)&&(l951>=1))) * AF(!(A(!(((s1>=1)&&(l610>=1))) U (((p16>=1)&&(l0>=1))||((p120>=1)&&(l532>=1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((s1>=1)&&(l951>=1))) * !(EG(!(!(!((E(!((((p16>=1)&&(l0>=1))||((p120>=1)&&(l532>=1)))) U ...308
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t19, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t...561
Detected timeout of ITS tools.
[2025-05-30 03:12:08] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:12:08] [INFO ] Applying decomposition
[2025-05-30 03:12:08] [INFO ] Flatten gal took : 5 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/graph7755397356679179808.txt' '-o' '/tmp/graph7755397356679179808.bin' '-w' '/tmp/graph7755397356679179808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7755397356679179808.bin' '-l' '-1' '-v' '-w' '/tmp/graph7755397356679179808.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:12:08] [INFO ] Decomposing Gal with order
[2025-05-30 03:12:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:12:08] [INFO ] Removed a total of 115 redundant transitions.
[2025-05-30 03:12:08] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 9 ms.
[2025-05-30 03:12:08] [INFO ] Time to serialize gal into /tmp/CTLFireability479940632584172423.gal : 2 ms
[2025-05-30 03:12:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15767897507259483332.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability479940632584172423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15767897507259483332.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.72666e+06,3.6153,69776,1769,806,87290,6023,414,297240,158,48695,0
Converting to forward existential form...Done !
original formula: AF((EF(((i4.u1.s1>=1)&&(i3.u12.l951>=1))) * AF(!(A(!(((i4.u1.s1>=1)&&(i6.u8.l610>=1))) U (((i5.i0.u5.p16>=1)&&(i4.u1.l0>=1))||((i4.u13.p1...185
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((i4.u1.s1>=1)&&(i3.u12.l951>=1))) * !(EG(!(!(!((E(!((((i5.i0.u5.p16>=1)&&(i4.u1.l0>=1))|...417
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t19, t41, t55, t56, t62, t69, t70, t71, t72, t78, t87, t99, t100, t101, t103, t104, ...447
(forward)formula 0,1,29.446,524140,1,0,589071,42850,1794,3.20015e+06,914,335773,1042207
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 162 transition count 254
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 162 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 96 place count 162 transition count 248
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 127 place count 131 transition count 206
Iterating global reduction 1 with 31 rules applied. Total rules applied 158 place count 131 transition count 206
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 167 place count 131 transition count 197
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 188 place count 110 transition count 165
Iterating global reduction 2 with 21 rules applied. Total rules applied 209 place count 110 transition count 165
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 220 place count 110 transition count 154
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 228 place count 102 transition count 140
Iterating global reduction 3 with 8 rules applied. Total rules applied 236 place count 102 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 241 place count 102 transition count 135
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 245 place count 98 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 249 place count 98 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 253 place count 94 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 257 place count 94 transition count 122
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 258 place count 93 transition count 120
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 93 transition count 120
Applied a total of 259 rules in 8 ms. Remains 93 /207 variables (removed 114) and now considering 120/417 (removed 297) transitions.
// Phase 1: matrix 120 rows 93 cols
[2025-05-30 03:12:37] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:12:38] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-30 03:12:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:12:38] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 03:12:38] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2025-05-30 03:12:38] [INFO ] Invariant cache hit.
[2025-05-30 03:12:38] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/213 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 119 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 134 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5817 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/213 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 119/253 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 253 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35883ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 35887ms
Starting structural reductions in LTL mode, iteration 1 : 93/207 places, 120/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36336 ms. Remains : 93/207 places, 120/417 transitions.
[2025-05-30 03:13:14] [INFO ] Flatten gal took : 6 ms
[2025-05-30 03:13:14] [INFO ] Flatten gal took : 6 ms
[2025-05-30 03:13:14] [INFO ] Input system was already deterministic with 120 transitions.
[2025-05-30 03:13:14] [INFO ] Flatten gal took : 7 ms
[2025-05-30 03:13:14] [INFO ] Flatten gal took : 6 ms
[2025-05-30 03:13:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7849736270255937764.gal : 2 ms
[2025-05-30 03:13:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8864983726592063025.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7849736270255937764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8864983726592063025.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.89465e+06,17.2992,358944,2,28979,5,1.21905e+06,6,0,492,1.23002e+06,0
Converting to forward existential form...Done !
original formula: EG(AG((EX(((p81>=1)&&(l405>=1))) * AF(((s1>=1)&&(l1284>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((EX(((p81>=1)&&(l405>=1))) * !(EG(!(((s1>=1)&&(l1284>=1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t53, t54, t58, t60, t62, t72, t76, t77, t78, t79, t...453
Detected timeout of ITS tools.
[2025-05-30 03:13:44] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:13:44] [INFO ] Applying decomposition
[2025-05-30 03:13:44] [INFO ] Flatten gal took : 4 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/graph16862122792562888417.txt' '-o' '/tmp/graph16862122792562888417.bin' '-w' '/tmp/graph16862122792562888417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16862122792562888417.bin' '-l' '-1' '-v' '-w' '/tmp/graph16862122792562888417.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:13:44] [INFO ] Decomposing Gal with order
[2025-05-30 03:13:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:13:44] [INFO ] Removed a total of 139 redundant transitions.
[2025-05-30 03:13:44] [INFO ] Flatten gal took : 11 ms
[2025-05-30 03:13:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 7 ms.
[2025-05-30 03:13:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14170982438187970585.gal : 2 ms
[2025-05-30 03:13:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10459325985255042223.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14170982438187970585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10459325985255042223.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.89465e+06,1.41696,39416,1802,471,50221,5862,385,157334,86,35169,0
Converting to forward existential form...Done !
original formula: EG(AG((EX(((i0.u15.p81>=1)&&(i4.u9.l405>=1))) * AF(((i0.u0.s1>=1)&&(i1.u20.l1284>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((EX(((i0.u15.p81>=1)&&(i4.u9.l405>=1))) * !(EG(!(((i0.u0.s1>=1)&&(i1.u20.l1284>=1)))))))...168
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t11, t13, t39, t45, t54, t72, t76, t77, t78, t80, t86, t87, t89, t90, t91, t92, t93, ...441
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,9.66151,227644,1,0,259705,24889,1662,1.54297e+06,515,147031,481642
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 162 transition count 251
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 162 transition count 251
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 95 place count 162 transition count 246
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 127 place count 130 transition count 203
Iterating global reduction 1 with 32 rules applied. Total rules applied 159 place count 130 transition count 203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 168 place count 130 transition count 194
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 191 place count 107 transition count 160
Iterating global reduction 2 with 23 rules applied. Total rules applied 214 place count 107 transition count 160
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 225 place count 107 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 235 place count 97 transition count 131
Iterating global reduction 3 with 10 rules applied. Total rules applied 245 place count 97 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 250 place count 97 transition count 126
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 256 place count 91 transition count 120
Iterating global reduction 4 with 6 rules applied. Total rules applied 262 place count 91 transition count 120
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 268 place count 85 transition count 109
Iterating global reduction 4 with 6 rules applied. Total rules applied 274 place count 85 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 277 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 278 place count 84 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 84 transition count 104
Applied a total of 279 rules in 9 ms. Remains 84 /207 variables (removed 123) and now considering 104/417 (removed 313) transitions.
// Phase 1: matrix 104 rows 84 cols
[2025-05-30 03:13:54] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:13:54] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-05-30 03:13:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:13:54] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 03:13:54] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-05-30 03:13:54] [INFO ] Invariant cache hit.
[2025-05-30 03:13:54] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/188 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:58] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:58] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:58] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:13:58] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 124 constraints, problems are : Problem set: 0 solved, 103 unsolved in 9174 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/188 variables, 84/90 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 34/124 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 103/227 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 227 constraints, problems are : Problem set: 0 solved, 103 unsolved in 16342 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25569ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 25570ms
Starting structural reductions in LTL mode, iteration 1 : 84/207 places, 104/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26188 ms. Remains : 84/207 places, 104/417 transitions.
[2025-05-30 03:14:20] [INFO ] Flatten gal took : 3 ms
[2025-05-30 03:14:20] [INFO ] Flatten gal took : 3 ms
[2025-05-30 03:14:20] [INFO ] Input system was already deterministic with 104 transitions.
[2025-05-30 03:14:20] [INFO ] Flatten gal took : 3 ms
[2025-05-30 03:14:20] [INFO ] Flatten gal took : 3 ms
[2025-05-30 03:14:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4608765903108447945.gal : 1 ms
[2025-05-30 03:14:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6522559470075618010.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4608765903108447945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6522559470075618010.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26939e+06,4.22542,99780,2,15855,5,312438,6,0,440,325259,0
Converting to forward existential form...Done !
original formula: AG(AX((!(E(((s1>=1)&&(l1259>=1)) U ((s1>=1)&&(l954>=1)))) * EF(((s1<1)||(l488<1))))))
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,TRUE)),((s1>=1)&&(l1259>=1))) * ((s1>=1)&&(l954>=1)))] = FALSE * [(EY(FwdU(Init,TRUE)) * !(...195
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t64, t72, t73, t74, t75, t76, t77, t78, t79, t80, t...372
Hit Full ! (commute/partial/dont) 2/100/102
(forward)formula 0,0,9.87848,183868,1,0,196,761513,237,79,3315,564811,223
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 168 transition count 283
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 168 transition count 283
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 89 place count 168 transition count 272
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 115 place count 142 transition count 238
Iterating global reduction 1 with 26 rules applied. Total rules applied 141 place count 142 transition count 238
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 148 place count 142 transition count 231
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 164 place count 126 transition count 207
Iterating global reduction 2 with 16 rules applied. Total rules applied 180 place count 126 transition count 207
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 190 place count 126 transition count 197
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 196 place count 120 transition count 188
Iterating global reduction 3 with 6 rules applied. Total rules applied 202 place count 120 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 206 place count 120 transition count 184
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 209 place count 117 transition count 181
Iterating global reduction 4 with 3 rules applied. Total rules applied 212 place count 117 transition count 181
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 214 place count 115 transition count 179
Iterating global reduction 4 with 2 rules applied. Total rules applied 216 place count 115 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 218 place count 115 transition count 177
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 219 place count 114 transition count 175
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 114 transition count 175
Applied a total of 220 rules in 25 ms. Remains 114 /207 variables (removed 93) and now considering 175/417 (removed 242) transitions.
// Phase 1: matrix 175 rows 114 cols
[2025-05-30 03:14:30] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:14:30] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-30 03:14:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:14:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-05-30 03:14:31] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:14:31] [INFO ] Redundant transitions in 3 ms returned []
Running 174 sub problems to find dead transitions.
[2025-05-30 03:14:31] [INFO ] Invariant cache hit.
[2025-05-30 03:14:31] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/289 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 75/191 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:14:38] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:14:39] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:14:45] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 14 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/289 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:14:50] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:14:50] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:14:50] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:14:50] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:14:50] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:14:58] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 13 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/289 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/289 variables, and 200 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/289 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 75/200 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 174/374 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 374 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in SI_CTL mode, iteration 1 : 114/207 places, 175/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60852 ms. Remains : 114/207 places, 175/417 transitions.
[2025-05-30 03:15:31] [INFO ] Flatten gal took : 7 ms
[2025-05-30 03:15:31] [INFO ] Flatten gal took : 6 ms
[2025-05-30 03:15:31] [INFO ] Input system was already deterministic with 175 transitions.
[2025-05-30 03:15:31] [INFO ] Flatten gal took : 7 ms
[2025-05-30 03:15:31] [INFO ] Flatten gal took : 7 ms
[2025-05-30 03:15:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15512249756424566127.gal : 2 ms
[2025-05-30 03:15:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9601865404873949095.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15512249756424566127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9601865404873949095.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:16:01] [INFO ] Flatten gal took : 5 ms
[2025-05-30 03:16:01] [INFO ] Applying decomposition
[2025-05-30 03:16:01] [INFO ] Flatten gal took : 8 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/graph13863226716400078563.txt' '-o' '/tmp/graph13863226716400078563.bin' '-w' '/tmp/graph13863226716400078563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13863226716400078563.bin' '-l' '-1' '-v' '-w' '/tmp/graph13863226716400078563.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:16:01] [INFO ] Decomposing Gal with order
[2025-05-30 03:16:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:16:01] [INFO ] Removed a total of 177 redundant transitions.
[2025-05-30 03:16:01] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:16:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 5 ms.
[2025-05-30 03:16:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8788099681340448660.gal : 2 ms
[2025-05-30 03:16:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8822873419760780646.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8788099681340448660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8822873419760780646.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 161 transition count 249
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 161 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 98 place count 161 transition count 243
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 130 place count 129 transition count 200
Iterating global reduction 1 with 32 rules applied. Total rules applied 162 place count 129 transition count 200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 171 place count 129 transition count 191
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 193 place count 107 transition count 159
Iterating global reduction 2 with 22 rules applied. Total rules applied 215 place count 107 transition count 159
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 225 place count 107 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 235 place count 97 transition count 131
Iterating global reduction 3 with 10 rules applied. Total rules applied 245 place count 97 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 250 place count 97 transition count 126
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 256 place count 91 transition count 120
Iterating global reduction 4 with 6 rules applied. Total rules applied 262 place count 91 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 267 place count 86 transition count 115
Iterating global reduction 4 with 5 rules applied. Total rules applied 272 place count 86 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 275 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 276 place count 85 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 277 place count 85 transition count 110
Applied a total of 277 rules in 17 ms. Remains 85 /207 variables (removed 122) and now considering 110/417 (removed 307) transitions.
// Phase 1: matrix 110 rows 85 cols
[2025-05-30 03:16:31] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:16:31] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-30 03:16:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:16:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 03:16:31] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:16:31] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 03:16:31] [INFO ] Invariant cache hit.
[2025-05-30 03:16:31] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/195 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5204 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/195 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35251ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 35253ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/207 places, 110/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35681 ms. Remains : 85/207 places, 110/417 transitions.
[2025-05-30 03:17:07] [INFO ] Flatten gal took : 3 ms
[2025-05-30 03:17:07] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:17:07] [INFO ] Input system was already deterministic with 110 transitions.
[2025-05-30 03:17:07] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:17:07] [INFO ] Flatten gal took : 8 ms
[2025-05-30 03:17:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality692699750856767931.gal : 1 ms
[2025-05-30 03:17:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14788253173735961036.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality692699750856767931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14788253173735961036.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (9220 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality14788253173735961036.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 46
BEST_FIRST walk for 40002 steps (1889 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 72
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :72 after 124
Finished probabilistic random walk after 4988 steps, run visited all 1 properties in 11 ms. (steps per millisecond=453 )
Probabilistic random walk after 4988 steps, saw 2356 distinct states, run finished after 11 ms. (steps per millisecond=453 ) properties seen :1
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :124 after 224
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 164 transition count 264
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 164 transition count 264
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 94 place count 164 transition count 256
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 124 place count 134 transition count 215
Iterating global reduction 1 with 30 rules applied. Total rules applied 154 place count 134 transition count 215
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 161 place count 134 transition count 208
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 182 place count 113 transition count 178
Iterating global reduction 2 with 21 rules applied. Total rules applied 203 place count 113 transition count 178
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 213 place count 113 transition count 168
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 222 place count 104 transition count 152
Iterating global reduction 3 with 9 rules applied. Total rules applied 231 place count 104 transition count 152
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 236 place count 104 transition count 147
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 241 place count 99 transition count 142
Iterating global reduction 4 with 5 rules applied. Total rules applied 246 place count 99 transition count 142
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 251 place count 94 transition count 132
Iterating global reduction 4 with 5 rules applied. Total rules applied 256 place count 94 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 258 place count 94 transition count 130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 259 place count 93 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 93 transition count 128
Applied a total of 260 rules in 11 ms. Remains 93 /207 variables (removed 114) and now considering 128/417 (removed 289) transitions.
// Phase 1: matrix 128 rows 93 cols
[2025-05-30 03:17:07] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:17:07] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-30 03:17:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:17:07] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-30 03:17:07] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2025-05-30 03:17:07] [INFO ] Invariant cache hit.
[2025-05-30 03:17:07] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/221 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 48/143 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 143 constraints, problems are : Problem set: 0 solved, 127 unsolved in 7268 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/221 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 48/143 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 127/270 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 270 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37345ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 37346ms
Starting structural reductions in LTL mode, iteration 1 : 93/207 places, 128/417 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37847 ms. Remains : 93/207 places, 128/417 transitions.
[2025-05-30 03:17:45] [INFO ] Flatten gal took : 7 ms
[2025-05-30 03:17:45] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:17:45] [INFO ] Input system was already deterministic with 128 transitions.
[2025-05-30 03:17:45] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:17:45] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:17:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2213791335038789193.gal : 2 ms
[2025-05-30 03:17:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13589501240167968665.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2213791335038789193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13589501240167968665.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90754e+06,11.6918,248028,2,18507,5,871388,6,0,500,658786,0
Converting to forward existential form...Done !
original formula: AX(E(!(E(EF(((p66>=1)&&(l616>=1))) U E(((s1>=1)&&(l1028>=1)) U ((s2>=1)&&(l1254>=1))))) U EF(EX(((s1>=1)&&(l1219>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(E(E(TRUE U ((p66>=1)&&(l616>=1))) U E(((s1>=1)&&(l1028>=1)) U ((s2>=1)&&(l1254>=1))))) U E(TR...198
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t51, t53, t55, t66, t67, t68, t69, t70, t83, t92, t...456
Detected timeout of ITS tools.
[2025-05-30 03:18:15] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:18:15] [INFO ] Applying decomposition
[2025-05-30 03:18:15] [INFO ] Flatten gal took : 4 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/graph13327510952457324333.txt' '-o' '/tmp/graph13327510952457324333.bin' '-w' '/tmp/graph13327510952457324333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13327510952457324333.bin' '-l' '-1' '-v' '-w' '/tmp/graph13327510952457324333.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:18:15] [INFO ] Decomposing Gal with order
[2025-05-30 03:18:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:18:15] [INFO ] Removed a total of 121 redundant transitions.
[2025-05-30 03:18:15] [INFO ] Flatten gal took : 18 ms
[2025-05-30 03:18:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 6 ms.
[2025-05-30 03:18:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15363786624976202202.gal : 4 ms
[2025-05-30 03:18:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9106289805421926854.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15363786624976202202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9106289805421926854.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90754e+06,2.88089,55704,2526,772,77942,4982,393,188871,153,44404,0
Converting to forward existential form...Done !
original formula: AX(E(!(E(EF(((i6.u0.p66>=1)&&(i4.u13.l616>=1))) U E(((i6.u0.s1>=1)&&(i4.u13.l1028>=1)) U ((i6.u0.s2>=1)&&(i1.u14.l1254>=1))))) U EF(EX(((...191
=> equivalent forward existential formula: [(EY(Init) * !(E(!(E(E(TRUE U ((i6.u0.p66>=1)&&(i4.u13.l616>=1))) U E(((i6.u0.s1>=1)&&(i4.u13.l1028>=1)) U ((i6....250
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t43, t45, t51, t53, t55, t66, t67, t68, t70, t83, t92, t94, t95, t96, t97, t99, t100...449
(forward)formula 0,1,14.5907,237096,1,0,363870,36504,1718,847693,883,257278,728458
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 162 transition count 250
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 162 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 96 place count 162 transition count 244
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 127 place count 131 transition count 202
Iterating global reduction 1 with 31 rules applied. Total rules applied 158 place count 131 transition count 202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 167 place count 131 transition count 193
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 189 place count 109 transition count 161
Iterating global reduction 2 with 22 rules applied. Total rules applied 211 place count 109 transition count 161
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 221 place count 109 transition count 151
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 231 place count 99 transition count 133
Iterating global reduction 3 with 10 rules applied. Total rules applied 241 place count 99 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 246 place count 99 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 252 place count 93 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 258 place count 93 transition count 122
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 263 place count 88 transition count 117
Iterating global reduction 4 with 5 rules applied. Total rules applied 268 place count 88 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 271 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 272 place count 87 transition count 112
Iterating global reduction 5 with 1 rules applied. Total rules applied 273 place count 87 transition count 112
Applied a total of 273 rules in 18 ms. Remains 87 /207 variables (removed 120) and now considering 112/417 (removed 305) transitions.
// Phase 1: matrix 112 rows 87 cols
[2025-05-30 03:18:30] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:18:30] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-30 03:18:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:18:30] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 03:18:30] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:18:30] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2025-05-30 03:18:30] [INFO ] Invariant cache hit.
[2025-05-30 03:18:30] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:34] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:34] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:36] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 15 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/199 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:18:37] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 132 constraints, problems are : Problem set: 0 solved, 111 unsolved in 10677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 112/199 variables, 87/93 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 39/132 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 111/243 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 243 constraints, problems are : Problem set: 0 solved, 111 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40737ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 40738ms
Starting structural reductions in SI_CTL mode, iteration 1 : 87/207 places, 112/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41187 ms. Remains : 87/207 places, 112/417 transitions.
[2025-05-30 03:19:11] [INFO ] Flatten gal took : 5 ms
[2025-05-30 03:19:11] [INFO ] Flatten gal took : 5 ms
[2025-05-30 03:19:11] [INFO ] Input system was already deterministic with 112 transitions.
[2025-05-30 03:19:11] [INFO ] Flatten gal took : 5 ms
[2025-05-30 03:19:11] [INFO ] Flatten gal took : 5 ms
[2025-05-30 03:19:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7976145932732069131.gal : 2 ms
[2025-05-30 03:19:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2569490998743843952.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7976145932732069131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2569490998743843952.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.55499e+06,10.3015,185360,2,20291,5,557421,6,0,460,686806,0
Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l526<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l526<1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/110
Detected timeout of ITS tools.
[2025-05-30 03:19:41] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:19:41] [INFO ] Applying decomposition
[2025-05-30 03:19:41] [INFO ] Flatten gal took : 3 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/graph4249077618134413537.txt' '-o' '/tmp/graph4249077618134413537.bin' '-w' '/tmp/graph4249077618134413537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4249077618134413537.bin' '-l' '-1' '-v' '-w' '/tmp/graph4249077618134413537.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:19:41] [INFO ] Decomposing Gal with order
[2025-05-30 03:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:19:41] [INFO ] Removed a total of 126 redundant transitions.
[2025-05-30 03:19:41] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:19:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 2 ms.
[2025-05-30 03:19:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2603744458363192358.gal : 2 ms
[2025-05-30 03:19:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5267968997404515522.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2603744458363192358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5267968997404515522.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.55499e+06,1.83399,46172,2042,960,60742,8093,368,199513,121,54901,0
Converting to forward existential form...Done !
original formula: EG(((i0.u0.s1<1)||(i1.u3.l526<1)))
=> equivalent forward existential formula: [FwdG(Init,((i0.u0.s1<1)||(i1.u3.l526<1)))] != FALSE
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,6.23245,130524,1,0,229679,21832,1202,477204,544,138279,554236
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 163 transition count 262
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 163 transition count 262
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 98 place count 163 transition count 252
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 129 place count 132 transition count 210
Iterating global reduction 1 with 31 rules applied. Total rules applied 160 place count 132 transition count 210
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 169 place count 132 transition count 201
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 190 place count 111 transition count 170
Iterating global reduction 2 with 21 rules applied. Total rules applied 211 place count 111 transition count 170
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 221 place count 111 transition count 160
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 230 place count 102 transition count 144
Iterating global reduction 3 with 9 rules applied. Total rules applied 239 place count 102 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 244 place count 102 transition count 139
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 249 place count 97 transition count 134
Iterating global reduction 4 with 5 rules applied. Total rules applied 254 place count 97 transition count 134
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 259 place count 92 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 264 place count 92 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 265 place count 92 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 266 place count 91 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 91 transition count 121
Applied a total of 267 rules in 20 ms. Remains 91 /207 variables (removed 116) and now considering 121/417 (removed 296) transitions.
// Phase 1: matrix 121 rows 91 cols
[2025-05-30 03:19:47] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:47] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-30 03:19:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:19:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-30 03:19:48] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:19:48] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2025-05-30 03:19:48] [INFO ] Invariant cache hit.
[2025-05-30 03:19:48] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/212 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 44/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:52] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:54] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:54] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:55] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:19:58] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 8 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/212 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:01] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 10 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/212 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:20:04] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 9 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/212 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 0/212 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 144 constraints, problems are : Problem set: 0 solved, 120 unsolved in 23091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/212 variables, 91/100 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 44/144 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 120/264 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 264 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53169ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 53170ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/207 places, 121/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53916 ms. Remains : 91/207 places, 121/417 transitions.
[2025-05-30 03:20:41] [INFO ] Flatten gal took : 3 ms
[2025-05-30 03:20:41] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:20:41] [INFO ] Input system was already deterministic with 121 transitions.
[2025-05-30 03:20:41] [INFO ] Flatten gal took : 3 ms
[2025-05-30 03:20:41] [INFO ] Flatten gal took : 3 ms
[2025-05-30 03:20:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15807466413180972424.gal : 1 ms
[2025-05-30 03:20:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11118005025249345530.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15807466413180972424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11118005025249345530.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.03419e+06,12.5718,227812,2,21066,5,762778,6,0,485,812158,0
Converting to forward existential form...Done !
original formula: EF(AG(((AF(((s1>=1)&&(l36>=1))) * E(((s1>=1)&&(l1222>=1)) U ((s1>=1)&&(l1026>=1)))) * ((s1<1)||(l1222<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EG(!(((s1>=1)&&(l36>=1))))) * E(((s1>=1)&&(l1222>=1)) U ((s1>=1)&&(l1026>=1...196
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t39, t45, t46, t47, t53, t54, t56, t58, t64, t65, t66,...461
Detected timeout of ITS tools.
[2025-05-30 03:21:11] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:21:11] [INFO ] Applying decomposition
[2025-05-30 03:21:11] [INFO ] Flatten gal took : 5 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/graph1299826835377744312.txt' '-o' '/tmp/graph1299826835377744312.bin' '-w' '/tmp/graph1299826835377744312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1299826835377744312.bin' '-l' '-1' '-v' '-w' '/tmp/graph1299826835377744312.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:21:11] [INFO ] Decomposing Gal with order
[2025-05-30 03:21:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:21:11] [INFO ] Removed a total of 117 redundant transitions.
[2025-05-30 03:21:11] [INFO ] Flatten gal took : 14 ms
[2025-05-30 03:21:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 3 ms.
[2025-05-30 03:21:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2445109186574642039.gal : 2 ms
[2025-05-30 03:21:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3331215981988743768.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2445109186574642039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3331215981988743768.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.03419e+06,2.37635,51620,2436,1020,64929,7947,374,148693,149,113710,0
Converting to forward existential form...Done !
original formula: EF(AG(((AF(((i3.u0.s1>=1)&&(i1.u4.l36>=1))) * E(((i3.u0.s1>=1)&&(i6.u16.l1222>=1)) U ((i3.u0.s1>=1)&&(i6.u17.l1026>=1)))) * ((i3.u0.s1<1)...177
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EG(!(((i3.u0.s1>=1)&&(i1.u4.l36>=1))))) * E(((i3.u0.s1>=1)&&(i6.u16.l1222>=...247
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t8, t9, t10, t11, t42, t45, t53, t54, t57, t65, t66, t67, t68, t79, t87, t88, t89, t9...442
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,10.5879,196132,1,0,265018,50448,1731,668346,880,478219,563391
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 207/207 places, 417/417 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 163 transition count 252
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 163 transition count 252
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 94 place count 163 transition count 246
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 124 place count 133 transition count 205
Iterating global reduction 1 with 30 rules applied. Total rules applied 154 place count 133 transition count 205
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 162 place count 133 transition count 197
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 184 place count 111 transition count 166
Iterating global reduction 2 with 22 rules applied. Total rules applied 206 place count 111 transition count 166
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 217 place count 111 transition count 155
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 226 place count 102 transition count 138
Iterating global reduction 3 with 9 rules applied. Total rules applied 235 place count 102 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 240 place count 102 transition count 133
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 245 place count 97 transition count 128
Iterating global reduction 4 with 5 rules applied. Total rules applied 250 place count 97 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 254 place count 93 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 258 place count 93 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 261 place count 93 transition count 121
Applied a total of 261 rules in 24 ms. Remains 93 /207 variables (removed 114) and now considering 121/417 (removed 296) transitions.
// Phase 1: matrix 121 rows 93 cols
[2025-05-30 03:21:22] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:21:22] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-30 03:21:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:21:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-30 03:21:22] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:21:22] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2025-05-30 03:21:22] [INFO ] Invariant cache hit.
[2025-05-30 03:21:22] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/214 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 42/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:21:26] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:21:26] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 18 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:21:30] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:21:30] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 12 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/214 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:21:33] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 15 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/214 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/214 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 142 constraints, problems are : Problem set: 0 solved, 120 unsolved in 16141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/214 variables, 93/100 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 42/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 120/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/214 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 262 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46205ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 46206ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/207 places, 121/417 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46776 ms. Remains : 93/207 places, 121/417 transitions.
[2025-05-30 03:22:09] [INFO ] Flatten gal took : 10 ms
[2025-05-30 03:22:09] [INFO ] Flatten gal took : 6 ms
[2025-05-30 03:22:09] [INFO ] Input system was already deterministic with 121 transitions.
[2025-05-30 03:22:09] [INFO ] Flatten gal took : 6 ms
[2025-05-30 03:22:09] [INFO ] Flatten gal took : 6 ms
[2025-05-30 03:22:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9819285653282199298.gal : 2 ms
[2025-05-30 03:22:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2240124740154625954.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9819285653282199298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2240124740154625954.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.73701e+06,11.6933,200844,2,25160,5,640376,6,0,493,721862,0
Converting to forward existential form...Done !
original formula: AF(((AF(((s1>=1)&&(l465>=1))) * (s1>=1)) * (l320>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(((s1>=1)&&(l465>=1))))) * (s1>=1)) * (l320>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t35, t39, t47, t53, t60, t61, t62, t64, t80, t87, t88, t89, t90, t91, t...419
Detected timeout of ITS tools.
[2025-05-30 03:22:39] [INFO ] Flatten gal took : 4 ms
[2025-05-30 03:22:39] [INFO ] Applying decomposition
[2025-05-30 03:22:39] [INFO ] Flatten gal took : 3 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/graph4416100355963659143.txt' '-o' '/tmp/graph4416100355963659143.bin' '-w' '/tmp/graph4416100355963659143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4416100355963659143.bin' '-l' '-1' '-v' '-w' '/tmp/graph4416100355963659143.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:22:39] [INFO ] Decomposing Gal with order
[2025-05-30 03:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:22:39] [INFO ] Removed a total of 113 redundant transitions.
[2025-05-30 03:22:39] [INFO ] Flatten gal took : 9 ms
[2025-05-30 03:22:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 2 ms.
[2025-05-30 03:22:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9907457412253408567.gal : 2 ms
[2025-05-30 03:22:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13499624566332641077.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9907457412253408567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13499624566332641077.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.73701e+06,1.08004,32576,2007,841,40390,6392,370,114435,134,71165,0
Converting to forward existential form...Done !
original formula: AF(((AF(((i3.u0.s1>=1)&&(i3.u9.l465>=1))) * (i3.u0.s1>=1)) * (i3.u0.l320>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(((i3.u0.s1>=1)&&(i3.u9.l465>=1))))) * (i3.u0.s1>=1)) * (i3.u0.l320>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t48, t60, t61, t62, t63, t80, t87, t88, t89, t90, t91, t93, t94, t95, t96, t97, t98,...440
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,8.79028,223312,1,0,289019,42567,1635,986743,733,480454,738746
FORMULA DBSingleClientW-PT-d1m07-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 03:22:48] [INFO ] Flatten gal took : 12 ms
[2025-05-30 03:22:48] [INFO ] Flatten gal took : 16 ms
[2025-05-30 03:22:48] [INFO ] Applying decomposition
[2025-05-30 03:22:48] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11630303991684921324.txt' '-o' '/tmp/graph11630303991684921324.bin' '-w' '/tmp/graph11630303991684921324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11630303991684921324.bin' '-l' '-1' '-v' '-w' '/tmp/graph11630303991684921324.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:22:48] [INFO ] Decomposing Gal with order
[2025-05-30 03:22:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:22:48] [INFO ] Removed a total of 393 redundant transitions.
[2025-05-30 03:22:48] [INFO ] Flatten gal took : 37 ms
[2025-05-30 03:22:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 398 labels/synchronizations in 11 ms.
[2025-05-30 03:22:48] [INFO ] Time to serialize gal into /tmp/CTLFireability16906961779120324779.gal : 3 ms
[2025-05-30 03:22:48] [INFO ] Time to serialize properties into /tmp/CTLFireability16591020159271706738.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16906961779120324779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16591020159271706738.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 03:49:57] [INFO ] Flatten gal took : 400 ms
[2025-05-30 03:49:57] [INFO ] Time to serialize gal into /tmp/CTLFireability3103721780173441153.gal : 93 ms
[2025-05-30 03:49:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5472096793420733214.ctl : 27 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3103721780173441153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5472096793420733214.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="DBSingleClientW-PT-d1m07"
export BK_EXAMINATION="CTLFireability"
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 DBSingleClientW-PT-d1m07, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854063500082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m07.tgz
mv DBSingleClientW-PT-d1m07 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;