About the Execution of ITS-Tools for Raft-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1902753.00 | 0.00 | 0.00 | TTFTFFTTTFTTFTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r170-smll-174889233200042.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 Raft-PT-07, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-174889233200042
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 247K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 120K 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 Raft-PT-07-CTLFireability-2023-12
FORMULA_NAME Raft-PT-07-CTLFireability-2023-13
FORMULA_NAME Raft-PT-07-CTLFireability-2023-14
FORMULA_NAME Raft-PT-07-CTLFireability-2023-15
FORMULA_NAME Raft-PT-07-CTLFireability-2025-00
FORMULA_NAME Raft-PT-07-CTLFireability-2025-01
FORMULA_NAME Raft-PT-07-CTLFireability-2025-02
FORMULA_NAME Raft-PT-07-CTLFireability-2025-03
FORMULA_NAME Raft-PT-07-CTLFireability-2025-04
FORMULA_NAME Raft-PT-07-CTLFireability-2025-05
FORMULA_NAME Raft-PT-07-CTLFireability-2025-06
FORMULA_NAME Raft-PT-07-CTLFireability-2025-07
FORMULA_NAME Raft-PT-07-CTLFireability-2025-08
FORMULA_NAME Raft-PT-07-CTLFireability-2025-09
FORMULA_NAME Raft-PT-07-CTLFireability-2025-10
FORMULA_NAME Raft-PT-07-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748948917266
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Raft-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 11:08:40] [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-06-03 11:08:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 11:08:40] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2025-06-03 11:08:40] [INFO ] Transformed 253 places.
[2025-06-03 11:08:40] [INFO ] Transformed 442 transitions.
[2025-06-03 11:08:40] [INFO ] Found NUPN structural information;
[2025-06-03 11:08:40] [INFO ] Parsed PT model containing 253 places and 442 transitions and 1664 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
Support contains 101 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 412/412 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 251 transition count 408
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 408
Applied a total of 4 rules in 87 ms. Remains 251 /253 variables (removed 2) and now considering 408/412 (removed 4) transitions.
[2025-06-03 11:08:40] [INFO ] Flow matrix only has 379 transitions (discarded 29 similar events)
// Phase 1: matrix 379 rows 251 cols
[2025-06-03 11:08:40] [INFO ] Computed 49 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:08:41] [INFO ] Implicit Places using invariants in 805 ms returned []
[2025-06-03 11:08:41] [INFO ] Flow matrix only has 379 transitions (discarded 29 similar events)
[2025-06-03 11:08:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:08:42] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:08:42] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1954 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2025-06-03 11:08:42] [INFO ] Flow matrix only has 379 transitions (discarded 29 similar events)
[2025-06-03 11:08:42] [INFO ] Invariant cache hit.
[2025-06-03 11:08:42] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 378/629 variables, 251/300 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 213/513 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/630 variables, and 513 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 251/251 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 378/629 variables, 251/300 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 213/513 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 407/920 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/630 variables, and 920 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 251/251 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60612ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60646ms
Starting structural reductions in LTL mode, iteration 1 : 251/253 places, 408/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62733 ms. Remains : 251/253 places, 408/412 transitions.
Support contains 101 out of 251 places after structural reductions.
[2025-06-03 11:09:43] [INFO ] Flatten gal took : 85 ms
[2025-06-03 11:09:43] [INFO ] Flatten gal took : 47 ms
[2025-06-03 11:09:44] [INFO ] Input system was already deterministic with 408 transitions.
Reduction of identical properties reduced properties to check from 80 to 79
RANDOM walk for 36708 steps (8 resets) in 2154 ms. (17 steps per ms) remains 0/79 properties
[2025-06-03 11:09:44] [INFO ] Flatten gal took : 31 ms
[2025-06-03 11:09:44] [INFO ] Flatten gal took : 34 ms
[2025-06-03 11:09:45] [INFO ] Input system was already deterministic with 408 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 247 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 247 transition count 400
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 246 transition count 399
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 16 place count 240 transition count 393
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 240 transition count 393
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 240 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 240 transition count 381
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 46 place count 234 transition count 375
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 79 place count 201 transition count 342
Iterating global reduction 1 with 33 rules applied. Total rules applied 112 place count 201 transition count 342
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 145 place count 201 transition count 309
Applied a total of 145 rules in 142 ms. Remains 201 /251 variables (removed 50) and now considering 309/408 (removed 99) transitions.
[2025-06-03 11:09:45] [INFO ] Flow matrix only has 284 transitions (discarded 25 similar events)
// Phase 1: matrix 284 rows 201 cols
[2025-06-03 11:09:45] [INFO ] Computed 49 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:09:45] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-03 11:09:45] [INFO ] Flow matrix only has 284 transitions (discarded 25 similar events)
[2025-06-03 11:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:09:45] [INFO ] State equation strengthened by 175 read => feed constraints.
[2025-06-03 11:09:45] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:09:45] [INFO ] Redundant transitions in 39 ms returned []
Running 308 sub problems to find dead transitions.
[2025-06-03 11:09:45] [INFO ] Flow matrix only has 284 transitions (discarded 25 similar events)
[2025-06-03 11:09:45] [INFO ] Invariant cache hit.
[2025-06-03 11:09:45] [INFO ] State equation strengthened by 175 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 283/484 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 174/424 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 1/485 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:05] [INFO ] Deduced a trap along path composed of 49 places in 136 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/485 variables, and 426 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 201/201 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 283/484 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 174/424 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 308/732 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (OVERLAPS) 1/485 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 734 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 201/201 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in SI_CTL mode, iteration 1 : 201/251 places, 309/408 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61087 ms. Remains : 201/251 places, 309/408 transitions.
[2025-06-03 11:10:46] [INFO ] Flatten gal took : 22 ms
[2025-06-03 11:10:46] [INFO ] Flatten gal took : 21 ms
[2025-06-03 11:10:46] [INFO ] Input system was already deterministic with 309 transitions.
[2025-06-03 11:10:46] [INFO ] Flatten gal took : 25 ms
[2025-06-03 11:10:46] [INFO ] Flatten gal took : 19 ms
[2025-06-03 11:10:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12294731921728328290.gal : 32 ms
[2025-06-03 11:10:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6470597443959794505.ctl : 19 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/CTLFireability12294731921728328290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6470597443959794505.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.24656e+30,5.70108,122980,2,5901,5,616467,6,0,1107,488486,0
Converting to forward existential form...Done !
original formula: EG(!(E(!((AG(((p111==1)&&(p240==1))) * !(((p213==1)||((p165==1)&&(p240==1)))))) U (((EG(((p211==1)||((p10==1)&&(p215==1)))) * !((((p13==1...300
=> equivalent forward existential formula: [FwdG(Init,!(E(!((!(E(TRUE U !(((p111==1)&&(p240==1))))) * !(((p213==1)||((p165==1)&&(p240==1)))))) U (((EG(((p2...355
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t264, t266, Intersection...242
Detected timeout of ITS tools.
[2025-06-03 11:11:16] [INFO ] Flatten gal took : 18 ms
[2025-06-03 11:11:16] [INFO ] Applying decomposition
[2025-06-03 11:11:16] [INFO ] Flatten gal took : 19 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/graph2191462435443757742.txt' '-o' '/tmp/graph2191462435443757742.bin' '-w' '/tmp/graph2191462435443757742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2191462435443757742.bin' '-l' '-1' '-v' '-w' '/tmp/graph2191462435443757742.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:11:16] [INFO ] Decomposing Gal with order
[2025-06-03 11:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:11:16] [INFO ] Removed a total of 263 redundant transitions.
[2025-06-03 11:11:16] [INFO ] Flatten gal took : 101 ms
[2025-06-03 11:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 243 labels/synchronizations in 29 ms.
[2025-06-03 11:11:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7851352289922369776.gal : 9 ms
[2025-06-03 11:11:16] [INFO ] Time to serialize properties into /tmp/CTLFireability9501540409891907739.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/CTLFireability7851352289922369776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9501540409891907739.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,1.24656e+30,0.467755,17584,197,87,26467,494,484,73323,100,2170,0
Converting to forward existential form...Done !
original formula: EG(!(E(!((AG(((i5.u43.p111==1)&&(i5.u43.p240==1))) * !(((i0.u37.p213==1)||((i2.u27.p165==1)&&(i5.u43.p240==1)))))) U (((EG(((i0.u37.p211=...437
=> equivalent forward existential formula: [FwdG(Init,!(E(!((!(E(TRUE U !(((i5.u43.p111==1)&&(i5.u43.p240==1))))) * !(((i0.u37.p213==1)||((i2.u27.p165==1)&...492
Reverse transition relation is NOT exact ! Due to transitions i0.u37.t14, i0.u37.t15, i0.u37.t16, i0.u37.t18, i1.u39.t13, i2.u40.t11, i2.u40.t12, i3.u41.t9...357
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,2.07896,64304,1,0,126027,1801,2920,324605,508,5886,132564
FORMULA Raft-PT-07-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 17 place count 246 transition count 391
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 31 place count 239 transition count 384
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 70 place count 200 transition count 345
Iterating global reduction 0 with 39 rules applied. Total rules applied 109 place count 200 transition count 345
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 148 place count 200 transition count 306
Applied a total of 148 rules in 64 ms. Remains 200 /251 variables (removed 51) and now considering 306/408 (removed 102) transitions.
[2025-06-03 11:11:19] [INFO ] Flow matrix only has 282 transitions (discarded 24 similar events)
// Phase 1: matrix 282 rows 200 cols
[2025-06-03 11:11:19] [INFO ] Computed 49 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:11:19] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-03 11:11:19] [INFO ] Flow matrix only has 282 transitions (discarded 24 similar events)
[2025-06-03 11:11:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:11:19] [INFO ] State equation strengthened by 175 read => feed constraints.
[2025-06-03 11:11:20] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:11:20] [INFO ] Redundant transitions in 8 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-03 11:11:20] [INFO ] Flow matrix only has 282 transitions (discarded 24 similar events)
[2025-06-03 11:11:20] [INFO ] Invariant cache hit.
[2025-06-03 11:11:20] [INFO ] State equation strengthened by 175 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:24] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 281/481 variables, 200/250 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 174/424 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/482 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 425 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 200/200 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 281/481 variables, 200/250 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 174/424 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 305/729 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/482 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 730 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 200/200 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in SI_CTL mode, iteration 1 : 200/251 places, 306/408 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61218 ms. Remains : 200/251 places, 306/408 transitions.
[2025-06-03 11:12:20] [INFO ] Flatten gal took : 24 ms
[2025-06-03 11:12:20] [INFO ] Flatten gal took : 30 ms
[2025-06-03 11:12:20] [INFO ] Input system was already deterministic with 306 transitions.
[2025-06-03 11:12:20] [INFO ] Flatten gal took : 24 ms
[2025-06-03 11:12:20] [INFO ] Flatten gal took : 24 ms
[2025-06-03 11:12:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16795242856707670339.gal : 6 ms
[2025-06-03 11:12:20] [INFO ] Time to serialize properties into /tmp/CTLFireability1228875093741955261.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/CTLFireability16795242856707670339.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1228875093741955261.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.65245e+30,7.74867,169432,2,5749,5,698346,6,0,1100,770188,0
Converting to forward existential form...Done !
original formula: EG(AG(A(((!(((p45==1)&&(p220==1))) * !(E(((p209==1)&&(p240==1)) U ((p190==1)&&(p245==1))))) * (((p42==1)&&(p230==1))||((p151==1)&&(p215==...231
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!((E(!((E(((p85==1)&&(p225==1)) U (p230==1)) + !(((p16==1)&&(p235==1))))) U (!(((!(((p45...445
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t261, t263, Intersection with...237
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,19.671,362904,1,0,585,2.36123e+06,652,260,7992,1.55347e+06,686
FORMULA Raft-PT-07-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Applied a total of 10 rules in 8 ms. Remains 246 /251 variables (removed 5) and now considering 398/408 (removed 10) transitions.
[2025-06-03 11:12:40] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
// Phase 1: matrix 374 rows 246 cols
[2025-06-03 11:12:40] [INFO ] Computed 49 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:12:40] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-03 11:12:40] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:12:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:12:40] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:12:40] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-06-03 11:12:40] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:12:40] [INFO ] Invariant cache hit.
[2025-06-03 11:12:40] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/620 variables, and 508 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 397/905 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/620 variables, and 905 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 246/251 places, 398/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60956 ms. Remains : 246/251 places, 398/408 transitions.
[2025-06-03 11:13:41] [INFO ] Flatten gal took : 32 ms
[2025-06-03 11:13:41] [INFO ] Flatten gal took : 27 ms
[2025-06-03 11:13:41] [INFO ] Input system was already deterministic with 398 transitions.
[2025-06-03 11:13:41] [INFO ] Flatten gal took : 24 ms
[2025-06-03 11:13:41] [INFO ] Flatten gal took : 23 ms
[2025-06-03 11:13:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12413250053274694015.gal : 6 ms
[2025-06-03 11:13:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5344394513305238935.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/CTLFireability12413250053274694015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5344394513305238935.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,7.4505e+34,12.0474,246780,2,7122,5,920631,6,0,1376,1.12523e+06,0
Converting to forward existential form...Done !
original formula: AX(EF(!(E(EX(((p110==1)&&(p230==1))) U ((((p206==1)&&(p240==1))||((p177==1)&&(p245==1)))||(p225==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(EX(((p110==1)&&(p230==1))) U ((((p206==1)&&(p240==1))||((p177==1)&&(p245==1)))||(p22...175
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t8, t10, t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t26, t27, t28...274
Detected timeout of ITS tools.
[2025-06-03 11:14:11] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:14:11] [INFO ] Applying decomposition
[2025-06-03 11:14:11] [INFO ] Flatten gal took : 14 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/graph4272680341222598125.txt' '-o' '/tmp/graph4272680341222598125.bin' '-w' '/tmp/graph4272680341222598125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4272680341222598125.bin' '-l' '-1' '-v' '-w' '/tmp/graph4272680341222598125.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:14:11] [INFO ] Decomposing Gal with order
[2025-06-03 11:14:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:14:11] [INFO ] Removed a total of 297 redundant transitions.
[2025-06-03 11:14:11] [INFO ] Flatten gal took : 40 ms
[2025-06-03 11:14:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 17 ms.
[2025-06-03 11:14:11] [INFO ] Time to serialize gal into /tmp/CTLFireability13217823164500397434.gal : 6 ms
[2025-06-03 11:14:11] [INFO ] Time to serialize properties into /tmp/CTLFireability7896887339846489251.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/CTLFireability13217823164500397434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7896887339846489251.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,7.4505e+34,0.548185,12576,105,105,14943,1170,516,36580,133,6955,0
Converting to forward existential form...Done !
original formula: AX(EF(!(E(EX(((i4.u35.p110==1)&&(i0.u34.p230==1))) U ((((i6.u29.p206==1)&&(i5.u36.p240==1))||((i5.u24.p177==1)&&(i6.u37.p245==1)))||(i3.u...171
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(EX(((i4.u35.p110==1)&&(i0.u34.p230==1))) U ((((i6.u29.p206==1)&&(i5.u36.p240==1))||(...224
Reverse transition relation is NOT exact ! Due to transitions i0.u34.t15, i0.u34.t16, i0.u34.t18, i1.u30.t27, i1.u30.t28, i1.u30.t30, i2.u32.t23, i2.u32.t2...431
(forward)formula 0,1,0.791168,15776,1,0,25481,3773,3038,48567,955,13134,30484
FORMULA Raft-PT-07-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 247 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 247 transition count 400
Applied a total of 8 rules in 7 ms. Remains 247 /251 variables (removed 4) and now considering 400/408 (removed 8) transitions.
[2025-06-03 11:14:12] [INFO ] Flow matrix only has 375 transitions (discarded 25 similar events)
// Phase 1: matrix 375 rows 247 cols
[2025-06-03 11:14:12] [INFO ] Computed 49 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:14:12] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-06-03 11:14:12] [INFO ] Flow matrix only has 375 transitions (discarded 25 similar events)
[2025-06-03 11:14:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:14:12] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:14:13] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2025-06-03 11:14:13] [INFO ] Flow matrix only has 375 transitions (discarded 25 similar events)
[2025-06-03 11:14:13] [INFO ] Invariant cache hit.
[2025-06-03 11:14:13] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 374/621 variables, 247/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 213/509 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/622 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/622 variables, and 510 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 247/247 constraints, ReadFeed: 214/214 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 374/621 variables, 247/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 213/509 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 399/908 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (OVERLAPS) 1/622 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/622 variables, and 909 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 247/247 constraints, ReadFeed: 214/214 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 247/251 places, 400/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61373 ms. Remains : 247/251 places, 400/408 transitions.
[2025-06-03 11:15:13] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:15:13] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:15:13] [INFO ] Input system was already deterministic with 400 transitions.
[2025-06-03 11:15:13] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:15:13] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:15:13] [INFO ] Time to serialize gal into /tmp/CTLFireability17437097876696737769.gal : 5 ms
[2025-06-03 11:15:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2853407314647395182.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/CTLFireability17437097876696737769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2853407314647395182.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,9.31311e+34,25.5876,495624,2,10800,5,1.81016e+06,6,0,1382,2.23677e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 11:15:43] [INFO ] Flatten gal took : 18 ms
[2025-06-03 11:15:43] [INFO ] Applying decomposition
[2025-06-03 11:15:43] [INFO ] Flatten gal took : 14 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/graph7352166159028857870.txt' '-o' '/tmp/graph7352166159028857870.bin' '-w' '/tmp/graph7352166159028857870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7352166159028857870.bin' '-l' '-1' '-v' '-w' '/tmp/graph7352166159028857870.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:15:44] [INFO ] Decomposing Gal with order
[2025-06-03 11:15:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:15:44] [INFO ] Removed a total of 298 redundant transitions.
[2025-06-03 11:15:44] [INFO ] Flatten gal took : 29 ms
[2025-06-03 11:15:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 306 labels/synchronizations in 14 ms.
[2025-06-03 11:15:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17647529184747223195.gal : 5 ms
[2025-06-03 11:15:44] [INFO ] Time to serialize properties into /tmp/CTLFireability16167474036896756019.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/CTLFireability17647529184747223195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16167474036896756019.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,9.31311e+34,0.608135,15632,114,225,17322,5145,514,43542,197,30844,0
Converting to forward existential form...Done !
original formula: EG(AG(((EX((i1.u29.p216==0)) + EX(((i2.u13.p90==0)||(i2.u30.p225==0)))) + (AG(((i1.u10.p67==0)||(i1.u29.p220==0))) * !(E(((i3.u11.p74==1)...219
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((EX((i1.u29.p216==0)) + EX(((i2.u13.p90==0)||(i2.u30.p225==0)))) + (!(E(TRUE U !(((i1.u...286
Reverse transition relation is NOT exact ! Due to transitions i0.u28.t28, i0.u28.t29, i0.u28.t31, i1.u29.t23, i1.u29.t24, i1.u29.t25, i1.u29.t27, i2.u30.t1...443
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,1.32525,32144,1,0,51488,13248,3774,113736,1495,60569,68755
FORMULA Raft-PT-07-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Applied a total of 10 rules in 7 ms. Remains 246 /251 variables (removed 5) and now considering 398/408 (removed 10) transitions.
[2025-06-03 11:15:45] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
// Phase 1: matrix 374 rows 246 cols
[2025-06-03 11:15:45] [INFO ] Computed 49 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:15:45] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-03 11:15:45] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:15:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:15:45] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:15:46] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-06-03 11:15:46] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:15:46] [INFO ] Invariant cache hit.
[2025-06-03 11:15:46] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/620 variables, and 508 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 397/905 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/620 variables, and 905 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 246/251 places, 398/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61255 ms. Remains : 246/251 places, 398/408 transitions.
[2025-06-03 11:16:46] [INFO ] Flatten gal took : 18 ms
[2025-06-03 11:16:46] [INFO ] Flatten gal took : 24 ms
[2025-06-03 11:16:46] [INFO ] Input system was already deterministic with 398 transitions.
[2025-06-03 11:16:46] [INFO ] Flatten gal took : 19 ms
[2025-06-03 11:16:46] [INFO ] Flatten gal took : 19 ms
[2025-06-03 11:16:46] [INFO ] Time to serialize gal into /tmp/CTLFireability18330880715047075302.gal : 4 ms
[2025-06-03 11:16:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1722358376634691198.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/CTLFireability18330880715047075302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1722358376634691198.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,7.4505e+34,12.4197,246476,2,7122,5,920631,6,0,1376,1.12523e+06,0
Converting to forward existential form...Done !
original formula: AG(((AG(EX((((p51==0)||(p240==0))||(p251==0)))) + EG(((((((p170==1)&&(p240==1))&&((p17==1)&&(p235==1)))||(((p90==1)&&(p225==1))&&(p239==1...288
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((((p100==1)&&(p230==1))&&((p155==1)&&(p240==1)))&&(((p59==1)&&(p245==1))&&((p150==...355
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t8, t10, t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t26, t27, t28...274
(forward)formula 0,1,19.0843,258076,1,0,681,1.62811e+06,805,275,9430,1.12523e+06,796
FORMULA Raft-PT-07-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 242 transition count 394
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 42 place count 218 transition count 370
Iterating global reduction 0 with 24 rules applied. Total rules applied 66 place count 218 transition count 370
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 90 place count 218 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 218 transition count 339
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 111 place count 211 transition count 332
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 153 place count 169 transition count 290
Iterating global reduction 1 with 42 rules applied. Total rules applied 195 place count 169 transition count 290
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 237 place count 169 transition count 248
Applied a total of 237 rules in 65 ms. Remains 169 /251 variables (removed 82) and now considering 248/408 (removed 160) transitions.
[2025-06-03 11:17:06] [INFO ] Flow matrix only has 224 transitions (discarded 24 similar events)
// Phase 1: matrix 224 rows 169 cols
[2025-06-03 11:17:06] [INFO ] Computed 49 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:17:06] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-06-03 11:17:06] [INFO ] Flow matrix only has 224 transitions (discarded 24 similar events)
[2025-06-03 11:17:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:17:06] [INFO ] State equation strengthened by 148 read => feed constraints.
[2025-06-03 11:17:06] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:17:06] [INFO ] Redundant transitions in 3 ms returned []
Running 247 sub problems to find dead transitions.
[2025-06-03 11:17:06] [INFO ] Flow matrix only has 224 transitions (discarded 24 similar events)
[2025-06-03 11:17:06] [INFO ] Invariant cache hit.
[2025-06-03 11:17:06] [INFO ] State equation strengthened by 148 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:17:11] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 223/392 variables, 169/219 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 147/366 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 367 constraints, problems are : Problem set: 0 solved, 247 unsolved in 29684 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 169/169 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 223/392 variables, 169/219 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 147/366 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 247/613 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 1/393 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/393 variables, and 614 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 169/169 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59745ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 59746ms
Starting structural reductions in SI_CTL mode, iteration 1 : 169/251 places, 248/408 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60599 ms. Remains : 169/251 places, 248/408 transitions.
[2025-06-03 11:18:06] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:18:06] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:18:06] [INFO ] Input system was already deterministic with 248 transitions.
[2025-06-03 11:18:06] [INFO ] Flatten gal took : 12 ms
[2025-06-03 11:18:06] [INFO ] Flatten gal took : 13 ms
[2025-06-03 11:18:06] [INFO ] Time to serialize gal into /tmp/CTLFireability12014374890365367880.gal : 3 ms
[2025-06-03 11:18:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15043312058588493861.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/CTLFireability12014374890365367880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15043312058588493861.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,1.67689e+26,3.84052,80752,2,4765,5,370929,6,0,918,363151,0
Converting to forward existential form...Done !
original formula: AG((((AG(((p165==1)&&(p240==1))) + AF(AG((((p44==1)&&(p230==1))||((p105==1)&&(p230==1)))))) + ((p175==0)||(p240==0))) + ((p65==1)&&(p225=...161
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !(((p65==1)&&(p225==1)))) * !(((p175==0)||(p240==0)))) * !(!(E(TRUE U !(((p165==1)&&(...246
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t179, t181, Intersection with reachable at each s...217
(forward)formula 0,0,7.81293,125600,1,0,448,762494,521,196,6539,473770,510
FORMULA Raft-PT-07-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 246 transition count 399
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 246 transition count 399
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 22 place count 239 transition count 392
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 64 place count 197 transition count 350
Iterating global reduction 0 with 42 rules applied. Total rules applied 106 place count 197 transition count 350
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 148 place count 197 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 155 place count 197 transition count 301
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 169 place count 190 transition count 294
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 205 place count 154 transition count 258
Iterating global reduction 1 with 36 rules applied. Total rules applied 241 place count 154 transition count 258
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 277 place count 154 transition count 222
Applied a total of 277 rules in 42 ms. Remains 154 /251 variables (removed 97) and now considering 222/408 (removed 186) transitions.
[2025-06-03 11:18:14] [INFO ] Flow matrix only has 197 transitions (discarded 25 similar events)
// Phase 1: matrix 197 rows 154 cols
[2025-06-03 11:18:14] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:18:14] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-03 11:18:14] [INFO ] Flow matrix only has 197 transitions (discarded 25 similar events)
[2025-06-03 11:18:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:18:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 11:18:15] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:18:15] [INFO ] Redundant transitions in 2 ms returned []
Running 118 sub problems to find dead transitions.
[2025-06-03 11:18:15] [INFO ] Flow matrix only has 197 transitions (discarded 25 similar events)
[2025-06-03 11:18:15] [INFO ] Invariant cache hit.
[2025-06-03 11:18:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 42/153 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:18:16] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 196/349 variables, 153/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/350 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/351 variables, and 205 constraints, problems are : Problem set: 0 solved, 118 unsolved in 14313 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 42/153 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 196/349 variables, 153/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 118/322 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 1/350 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/350 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/351 variables, and 323 constraints, problems are : Problem set: 0 solved, 118 unsolved in 11267 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25597ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 25597ms
Starting structural reductions in SI_CTL mode, iteration 1 : 154/251 places, 222/408 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26040 ms. Remains : 154/251 places, 222/408 transitions.
[2025-06-03 11:18:40] [INFO ] Flatten gal took : 7 ms
[2025-06-03 11:18:40] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:18:40] [INFO ] Input system was already deterministic with 222 transitions.
[2025-06-03 11:18:40] [INFO ] Flatten gal took : 8 ms
[2025-06-03 11:18:40] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:18:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17493380910628258707.gal : 2 ms
[2025-06-03 11:18:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4633711817521334623.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/CTLFireability17493380910628258707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4633711817521334623.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,2.36078e+24,1.34261,30032,2,1703,5,145240,6,0,832,115657,0
Converting to forward existential form...Done !
original formula: EF(EG((p223==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p223==1))] != FALSE
Hit Full ! (commute/partial/dont) 214/0/8
(forward)formula 0,1,2.00252,30928,1,0,7,150202,19,1,4260,115657,8
FORMULA Raft-PT-07-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Applied a total of 10 rules in 7 ms. Remains 246 /251 variables (removed 5) and now considering 398/408 (removed 10) transitions.
[2025-06-03 11:18:42] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
// Phase 1: matrix 374 rows 246 cols
[2025-06-03 11:18:42] [INFO ] Computed 49 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:18:42] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-06-03 11:18:42] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:18:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:18:43] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:18:43] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-06-03 11:18:43] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:18:43] [INFO ] Invariant cache hit.
[2025-06-03 11:18:43] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/620 variables, and 508 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 397/905 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/620 variables, and 905 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 246/251 places, 398/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61160 ms. Remains : 246/251 places, 398/408 transitions.
[2025-06-03 11:19:43] [INFO ] Flatten gal took : 15 ms
[2025-06-03 11:19:43] [INFO ] Flatten gal took : 19 ms
[2025-06-03 11:19:43] [INFO ] Input system was already deterministic with 398 transitions.
[2025-06-03 11:19:43] [INFO ] Flatten gal took : 17 ms
[2025-06-03 11:19:43] [INFO ] Flatten gal took : 18 ms
[2025-06-03 11:19:43] [INFO ] Time to serialize gal into /tmp/CTLFireability18273707423648505124.gal : 4 ms
[2025-06-03 11:19:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13519632702979138750.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/CTLFireability18273707423648505124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13519632702979138750.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,7.4505e+34,13.1454,246532,2,7122,5,920631,6,0,1376,1.12523e+06,0
Converting to forward existential form...Done !
original formula: AG(EX(AG(EX(((p31==0)||(p215==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U !(EX(((p31==0)||(p215==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t8, t10, t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t26, t27, t28...274
(forward)formula 0,1,21.7683,281204,1,0,683,1.77235e+06,808,277,9460,1.12523e+06,800
FORMULA Raft-PT-07-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Applied a total of 10 rules in 8 ms. Remains 246 /251 variables (removed 5) and now considering 398/408 (removed 10) transitions.
[2025-06-03 11:20:05] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:20:06] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-03 11:20:06] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:20:06] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:20:06] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-06-03 11:20:06] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:20:06] [INFO ] Invariant cache hit.
[2025-06-03 11:20:06] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/620 variables, and 508 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 397/905 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/620 variables, and 905 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in LTL mode, iteration 1 : 246/251 places, 398/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61088 ms. Remains : 246/251 places, 398/408 transitions.
[2025-06-03 11:21:06] [INFO ] Flatten gal took : 15 ms
[2025-06-03 11:21:06] [INFO ] Flatten gal took : 17 ms
[2025-06-03 11:21:07] [INFO ] Input system was already deterministic with 398 transitions.
[2025-06-03 11:21:07] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:21:07] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:21:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15638727894502382314.gal : 3 ms
[2025-06-03 11:21:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10983305716982159386.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/CTLFireability15638727894502382314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10983305716982159386.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,7.4505e+34,13.0846,246964,2,7122,5,920631,6,0,1376,1.12523e+06,0
Converting to forward existential form...Done !
original formula: AG(A(A(!(((p125==1)&&(p235==1))) U (AG(((p175==1)&&(p240==1))) + AG(((p55==1)&&(p220==1))))) U ((A(((p118==1)&&(p245==1)) U !(((p186==1)&...244
=> equivalent forward existential formula: ([(EY(((FwdU(FwdU(Init,TRUE),!(((!((E(!(!(((p186==1)&&(p220==1)))) U (!(((p118==1)&&(p245==1))) * !(!(((p186==1)...1085
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t8, t10, t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t26, t27, t28...274
(forward)formula 0,0,23.3185,335188,1,0,700,2.09552e+06,822,289,9594,1.42966e+06,824
FORMULA Raft-PT-07-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Applied a total of 10 rules in 8 ms. Remains 246 /251 variables (removed 5) and now considering 398/408 (removed 10) transitions.
[2025-06-03 11:21:30] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:21:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:21:30] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-03 11:21:30] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:21:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:21:30] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:21:31] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-06-03 11:21:31] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:21:31] [INFO ] Invariant cache hit.
[2025-06-03 11:21:31] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/620 variables, and 508 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 397/905 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/620 variables, and 905 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 246/251 places, 398/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61020 ms. Remains : 246/251 places, 398/408 transitions.
[2025-06-03 11:22:31] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:22:31] [INFO ] Flatten gal took : 17 ms
[2025-06-03 11:22:31] [INFO ] Input system was already deterministic with 398 transitions.
[2025-06-03 11:22:31] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:22:31] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:22:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10206398730553677674.gal : 3 ms
[2025-06-03 11:22:31] [INFO ] Time to serialize properties into /tmp/CTLFireability16131633510956647611.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/CTLFireability10206398730553677674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16131633510956647611.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,7.4505e+34,15.6867,246940,2,7122,5,920631,6,0,1376,1.12523e+06,0
Converting to forward existential form...Done !
original formula: AG(((E(((p135==1)&&(p235==1)) U (((p161==1)&&(p225==1)) * AX((p215==1)))) + AG((EG(((p115==0)||(p230==0))) + EF((p251==0))))) + ((!(A((((...312
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !((E(((p135==1)&&(p235==1)) U (((p161==1)&&(p225==1)) * !(EX(!((p215==1)))))) + !(E(TRUE...883
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t8, t10, t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t26, t27, t28...274
Detected timeout of ITS tools.
[2025-06-03 11:23:01] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:23:01] [INFO ] Applying decomposition
[2025-06-03 11:23:01] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15991380802011417468.txt' '-o' '/tmp/graph15991380802011417468.bin' '-w' '/tmp/graph15991380802011417468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15991380802011417468.bin' '-l' '-1' '-v' '-w' '/tmp/graph15991380802011417468.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:23:01] [INFO ] Decomposing Gal with order
[2025-06-03 11:23:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:23:01] [INFO ] Removed a total of 305 redundant transitions.
[2025-06-03 11:23:01] [INFO ] Flatten gal took : 42 ms
[2025-06-03 11:23:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 319 labels/synchronizations in 23 ms.
[2025-06-03 11:23:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16773172256655484688.gal : 4 ms
[2025-06-03 11:23:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3289436317234999288.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/CTLFireability16773172256655484688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3289436317234999288.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,7.4505e+34,0.583289,14092,109,118,17804,1173,488,45689,139,7339,0
Converting to forward existential form...Done !
original formula: AG(((E(((i1.u18.p135==1)&&(i1.u34.p235==1)) U (((i5.u22.p161==1)&&(i0.u31.p225==1)) * AX((i2.u28.p215==1)))) + AG((EG(((i5.u15.p115==0)||...451
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !((E(((i1.u18.p135==1)&&(i1.u34.p235==1)) U (((i5.u22.p161==1)&&(i0.u31.p225==1)) * !(EX...1188
Reverse transition relation is NOT exact ! Due to transitions i0.u31.t19, i0.u31.t20, i0.u31.t22, i1.u34.t11, i1.u34.t12, i1.u34.t14, i2.u28.t27, i2.u28.t2...431
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,1.19108,29068,1,0,59267,6085,3256,105188,964,26291,38521
FORMULA Raft-PT-07-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Applied a total of 10 rules in 7 ms. Remains 246 /251 variables (removed 5) and now considering 398/408 (removed 10) transitions.
[2025-06-03 11:23:03] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:23:03] [INFO ] Implicit Places using invariants in 411 ms returned []
[2025-06-03 11:23:03] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:23:03] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:23:04] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-06-03 11:23:04] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:23:04] [INFO ] Invariant cache hit.
[2025-06-03 11:23:04] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/620 variables, and 508 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 397/905 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/620 variables, and 905 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 246/251 places, 398/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61502 ms. Remains : 246/251 places, 398/408 transitions.
[2025-06-03 11:24:04] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:24:04] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:24:04] [INFO ] Input system was already deterministic with 398 transitions.
[2025-06-03 11:24:04] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:24:04] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:24:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11564591746791631087.gal : 3 ms
[2025-06-03 11:24:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13240029203724270323.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/CTLFireability11564591746791631087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13240029203724270323.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,7.4505e+34,13.6273,246384,2,7122,5,920631,6,0,1376,1.12523e+06,0
Converting to forward existential form...Done !
original formula: EF(AX(AG(((EF(((p26==1)&&(p245==1))) + (p69==0)) + (p220==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(((E(TRUE U ((p26==1)&&(p245==1))) + (p69==0)) + (p220==0)))))))))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t8, t10, t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t26, t27, t28...274
(forward)formula 0,1,24.488,315528,1,0,689,2.01144e+06,812,282,9565,1.12523e+06,814
FORMULA Raft-PT-07-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 249 transition count 404
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 249 transition count 404
Applied a total of 4 rules in 8 ms. Remains 249 /251 variables (removed 2) and now considering 404/408 (removed 4) transitions.
[2025-06-03 11:24:29] [INFO ] Flow matrix only has 377 transitions (discarded 27 similar events)
// Phase 1: matrix 377 rows 249 cols
[2025-06-03 11:24:29] [INFO ] Computed 49 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:24:29] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-03 11:24:29] [INFO ] Flow matrix only has 377 transitions (discarded 27 similar events)
[2025-06-03 11:24:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:24:29] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:24:30] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Running 403 sub problems to find dead transitions.
[2025-06-03 11:24:30] [INFO ] Flow matrix only has 377 transitions (discarded 27 similar events)
[2025-06-03 11:24:30] [INFO ] Invariant cache hit.
[2025-06-03 11:24:30] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (OVERLAPS) 1/249 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 376/625 variables, 249/298 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/625 variables, 213/511 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/626 variables, and 511 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 249/249 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (OVERLAPS) 1/249 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 376/625 variables, 249/298 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/625 variables, 213/511 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/625 variables, 403/914 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/626 variables, and 914 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 249/249 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 249/251 places, 404/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61340 ms. Remains : 249/251 places, 404/408 transitions.
[2025-06-03 11:25:30] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:25:30] [INFO ] Flatten gal took : 11 ms
[2025-06-03 11:25:30] [INFO ] Input system was already deterministic with 404 transitions.
[2025-06-03 11:25:30] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:25:30] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:25:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4417873876719786062.gal : 2 ms
[2025-06-03 11:25:30] [INFO ] Time to serialize properties into /tmp/CTLFireability1593555261489286054.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/CTLFireability4417873876719786062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1593555261489286054.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.
Detected timeout of ITS tools.
[2025-06-03 11:26:00] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:26:00] [INFO ] Applying decomposition
[2025-06-03 11:26:00] [INFO ] Flatten gal took : 11 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/graph174818661785275036.txt' '-o' '/tmp/graph174818661785275036.bin' '-w' '/tmp/graph174818661785275036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph174818661785275036.bin' '-l' '-1' '-v' '-w' '/tmp/graph174818661785275036.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:26:00] [INFO ] Decomposing Gal with order
[2025-06-03 11:26:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:26:00] [INFO ] Removed a total of 300 redundant transitions.
[2025-06-03 11:26:00] [INFO ] Flatten gal took : 26 ms
[2025-06-03 11:26:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 297 labels/synchronizations in 11 ms.
[2025-06-03 11:26:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4380101924815215544.gal : 4 ms
[2025-06-03 11:26:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9498728776298270767.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/CTLFireability4380101924815215544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9498728776298270767.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,1.45517e+35,0.777966,16800,96,163,21764,2359,518,54908,169,15611,0
Converting to forward existential form...Done !
original formula: A(((E(((E(((i2.u28.p220==1)&&(i7.u36.p246==1)) U ((i4.u30.p15==1)&&(i1.u27.p215==1))) + !(((i2.u16.p129==1)&&(i2.u28.p220==1)))) * A(((i2...992
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(E(((i1.u11.p95==1)&&(i4.u30.p230==1)) U (EX((i0.u34.p244==1)) * (i3.u29.p225!=1))))))))) *...1439
Reverse transition relation is NOT exact ! Due to transitions i0.u34.t3, i0.u34.t4, i0.u34.t6, i1.u27.t30, i1.u27.t31, i1.u27.t33, i2.u28.t25, i2.u28.t26, ...467
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 248 transition count 402
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 248 transition count 402
Applied a total of 6 rules in 12 ms. Remains 248 /251 variables (removed 3) and now considering 402/408 (removed 6) transitions.
[2025-06-03 11:26:31] [INFO ] Flow matrix only has 376 transitions (discarded 26 similar events)
// Phase 1: matrix 376 rows 248 cols
[2025-06-03 11:26:31] [INFO ] Computed 49 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:26:31] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-06-03 11:26:31] [INFO ] Flow matrix only has 376 transitions (discarded 26 similar events)
[2025-06-03 11:26:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:26:31] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:26:32] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2025-06-03 11:26:32] [INFO ] Flow matrix only has 376 transitions (discarded 26 similar events)
[2025-06-03 11:26:32] [INFO ] Invariant cache hit.
[2025-06-03 11:26:32] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (OVERLAPS) 375/623 variables, 248/297 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 213/510 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/624 variables, and 510 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 248/248 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (OVERLAPS) 375/623 variables, 248/297 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/623 variables, 213/510 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 401/911 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/624 variables, and 911 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 248/248 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 248/251 places, 402/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61401 ms. Remains : 248/251 places, 402/408 transitions.
[2025-06-03 11:27:32] [INFO ] Flatten gal took : 14 ms
[2025-06-03 11:27:32] [INFO ] Flatten gal took : 17 ms
[2025-06-03 11:27:32] [INFO ] Input system was already deterministic with 402 transitions.
[2025-06-03 11:27:32] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:27:32] [INFO ] Flatten gal took : 24 ms
[2025-06-03 11:27:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4075162253485850061.gal : 3 ms
[2025-06-03 11:27:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11129331306094970353.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/CTLFireability4075162253485850061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11129331306094970353.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-06-03 11:28:02] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:28:02] [INFO ] Applying decomposition
[2025-06-03 11:28:02] [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/graph5028892898339210190.txt' '-o' '/tmp/graph5028892898339210190.bin' '-w' '/tmp/graph5028892898339210190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5028892898339210190.bin' '-l' '-1' '-v' '-w' '/tmp/graph5028892898339210190.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:28:02] [INFO ] Decomposing Gal with order
[2025-06-03 11:28:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:28:02] [INFO ] Removed a total of 287 redundant transitions.
[2025-06-03 11:28:02] [INFO ] Flatten gal took : 24 ms
[2025-06-03 11:28:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 301 labels/synchronizations in 5 ms.
[2025-06-03 11:28:02] [INFO ] Time to serialize gal into /tmp/CTLFireability15744984499024100650.gal : 3 ms
[2025-06-03 11:28:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5384093915279534193.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/CTLFireability15744984499024100650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5384093915279534193.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,1.16414e+35,0.604964,21160,106,184,27442,3936,499,80217,190,25081,0
Converting to forward existential form...Done !
original formula: EF(EX(((((i5.u20.p165==1)&&(i5.u32.p240==1))&&(((i0.u18.p155==0)||(i5.u32.p240==0))&&(((i3.u28.p228==1)&&(i7.u36.p252==1))||((i3.u28.p137...330
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * (((i5.u20.p165==1)&&(i5.u32.p240==1))&&(((i0.u18.p155==0)||(i5.u32.p240==0))&&(((i3.u28...518
(forward)formula 0,1,0.636226,21160,1,0,27442,3936,783,80217,306,25081,2093
FORMULA Raft-PT-07-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Applied a total of 10 rules in 6 ms. Remains 246 /251 variables (removed 5) and now considering 398/408 (removed 10) transitions.
[2025-06-03 11:28:03] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
// Phase 1: matrix 374 rows 246 cols
[2025-06-03 11:28:03] [INFO ] Computed 49 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:03] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-03 11:28:03] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:28:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:28:03] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:28:04] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-06-03 11:28:04] [INFO ] Flow matrix only has 374 transitions (discarded 24 similar events)
[2025-06-03 11:28:04] [INFO ] Invariant cache hit.
[2025-06-03 11:28:04] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 0.0)
(t2 1.0)
(t3 6.0)
(t4 6.0)
(t5 0.0)
(t6 6.0)
(t7 6.0)
(t8 1.0)
(t9 0.0)
(t10 6.0)
(t11 6.0)
(t12 6.0)
(t13 0.0)
(t14 6.0)
(t15 6.0)
(t16 0.0)
(t17 0.0)
(t18 6.0)
(t19 6.0)
(t20 6.0)
(t21 0.0)
(t22 6.0)
(t23 6.0)
(t24 2.0)
(t25 0.0)
(t26 4.0)
(t27 6.0)
(t28 5.0)
(t29 0.0)
(t30 6.0)
(t31 1.0)
(t32 1.0)
(t33 0.0)
(t35 1.0)
(t36 1.0)
(t37 0.0)
(t38 1.0)
(t39 1.0)
(t40 1.0)
(t41 1.0)
(t42 1.0)
(t43 1.0)
(t44 1.0)
(t45 1.0)
(t46 1.0)
(t47 1.0)
(t48 1.0)
(t49 1.0)
(t50 1.0)
(t51 1.0)
(t52 1.0)
(t53 0.0)
(t54 1.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 1.0)
(t60 0.0)
(t61 0.0)
(t62 1.0)
(t63 1.0)
(t64 1.0)
(t65 1.0)
(t66 1.0)
(t67 1.0)
(t68 1.0)
(t69 1.0)
(t70 1.0)
(t71 1.0)
(t72 1.0)
(t73 1.0)
(t74 1.0)
(t75 1.0)
(t76 1.0)
(t77 1.0)
(t78 1.0)
(t79 1.0)
(t80 1.0)
(t81 1.0)
(t82 1.0)
(t83 1.0)
(t84 1.0)
(t85 1.0)
(t86 0.0)
(t87 1.0)
(t88 1.0)
(t89 1.0)
(t90 1.0)
(t91 1.0)
(t92 1.0)
(t93 1.0)
(t94 1.0)
(t95 1.0)
(t96 1.0)
(t97 1.0)
(t98 1.0)
(t99 1.0)
(t100 1.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 1.0)
(t108 1.0)
(t109 0.0)
(t110 1.0)
(t111 0.0)
(t112 0.0)
(t113 1.0)
(t114 1.0)
(t115 1.0)
(t116 1.0)
(t117 1.0)
(t118 1.0)
(t119 1.0)
(t120 1.0)
(t121 1.0)
(t122 1.0)
(t123 1.0)
(t124 1.0)
(t125 1.0)
(t126 1.0)
(t127 1.0)
(t128 1.0)
(t129 1.0)
(t130 1.0)
(t131 1.0)
(t132 1.0)
(t133 1.0)
(t134 0.0)
(t135 1.0)
(t136 1.0)
(t137 1.0)
(t138 1.0)
(t139 1.0)
(t140 1.0)
(t141 1.0)
(t142 1.0)
(t143 1.0)
(t144 1.0)
(t145 1.0)
(t146 1.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 1.0)
(t154 1.0)
(t155 1.0)
(t156 1.0)
(t157 1.0)
(t158 1.0)
(t159 1.0)
(t160 2.0)
(t161 1.0)
(t162 1.0)
(t163 1.0)
(t164 1.0)
(t165 1.0)
(t166 1.0)
(t167 1.0)
(t168 1.0)
(t169 1.0)
(t170 1.0)
(t171 1.0)
(t172 1.0)
(t173 1.0)
(t174 1.0)
(t175 1.0)
(t176 1.0)
(t177 1.0)
(t178 1.0)
(t179 1.0)
(t180 0.0)
(t181 1.0)
(t182 0.0)
(t183 1.0)
(t184 1.0)
(t185 1.0)
(t186 1.0)
(t187 1.0)
(t188 1.0)
(t189 1.0)
(t190 1.0)
(t191 1.0)
(t192 1.0)
(t193 1.0)
(t194 1.0)
(t195 1.0)
(t196 1.0)
(t197 1.0)
(t198 1.0)
(t199 1.0)
(t200 1.0)
(t201 1.0)
(t202 0.0)
(t203 1.0)
(t204 1.0)
(t205 1.0)
(t206 2.0)
(t207 2.0)
(t208 2.0)
(t209 1.0)
(t210 1.0)
(t211 1.0)
(t212 1.0)
(t213 1.0)
(t214 1.0)
(t215 1.0)
(t216 1.0)
(t217 1.0)
(t218 1.0)
(t219 1.0)
(t220 1.0)
(t221 1.0)
(t222 1.0)
(t223 1.0)
(t224 1.0)
(t225 1.0)
(t226 1.0)
(t227 1.0)
(t228 1.0)
(t229 1.0)
(t230 1.0)
(t231 1.0)
(t232 1.0)
(t233 1.0)
(t234 1.0)
(t235 1.0)
(t236 1.0)
(t237 1.0)
(t238 1.0)
(t239 1.0)
(t240 1.0)
(t241 1.0)
(t242 1.0)
(t243 1.0)
(t244 1.0)
(t245 0.0)
(t246 1.0)
(t247 1.0)
(t248 1.0)
(t249 2.0)
(t250 1.0)
(t251 1.0)
(t252 1.0)
(t253 1.0)
(t254 1.0)
(t255 1.0)
(t256 1.0)
(t257 1.0)
(t258 1.0)
(t259 1.0)
(t260 1.0)
(t261 1.0)
(t262 1.0)
(t263 1.0)
(t264 1.0)
(t265 1.0)
(t266 1.0)
(t267 1.0)
(t268 1.0)
(t269 1.0)
(t270 0.0)
(t271 1.0)
(t272 1.0)
(t273 1.0)
(t274 0.0)
(t275 1.0)
(t276 1.0)
(t277 1.0)
(t278 1.0)
(t279 1.0)
(t280 1.0)
(t281 1.0)
(t282 1.0)
(t283 1.0)
(t284 1.0)
(t285 1.0)
(t286 1.0)
(t287 1.0)
(t288 1.0)
(t289 1.0)
(t290 1.0)
(t291 1.0)
(t292 1.0)
(t293 1.0)
(t294 1.0)
(t295 1.0)
(t296 0.0)
(t297 0.0)
(t298 1.0)
(t299 1.0)
(t300 1.0)
(t301 1.0)
(t302 1.0)
(t303 1.0)
(t304 1.0)
(t305 1.0)
(t306 1.0)
(t307 1.0)
(t308 1.0)
(t309 1.0)
(t310 1.0)
(t311 1.0)
(t312 1.0)
(t313 1.0)
(t314 1.0)
(t315 1.0)
(t316 1.0)
(t317 1.0)
(t318 1.0)
(t319 1.0)
(t320 0.0)
(t321 1.0)
(t322 0.0)
(t323 1.0)
(t324 1.0)
(t325 1.0)
(t326 1.0)
(t327 1.0)
(t328 1.0)
(t329 1.0)
(t330 1.0)
(t331 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/620 variables, and 508 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 373/619 variables, 246/295 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/619 variables, 213/508 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/619 variables, 397/905 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/620 variables, and 905 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 246/246 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 246/251 places, 398/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61100 ms. Remains : 246/251 places, 398/408 transitions.
[2025-06-03 11:29:04] [INFO ] Flatten gal took : 15 ms
[2025-06-03 11:29:04] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:29:04] [INFO ] Input system was already deterministic with 398 transitions.
[2025-06-03 11:29:04] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:29:04] [INFO ] Flatten gal took : 17 ms
[2025-06-03 11:29:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15480230493772343206.gal : 3 ms
[2025-06-03 11:29:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16080618269973764487.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/CTLFireability15480230493772343206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16080618269973764487.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,7.4505e+34,12.4432,246604,2,7122,5,920631,6,0,1376,1.12523e+06,0
Converting to forward existential form...Done !
original formula: (EF(EX((((p146==1)&&(p245==1)) * EX(((p145==0)||(p235==0)))))) * EF((((AF((((p50==1)&&(p220==1))||((p190==1)&&(p245==1)))) + AX(AX(((p65=...354
=> equivalent forward existential formula: ((([(FwdU((Init * E(TRUE U EX((((p146==1)&&(p245==1)) * EX(((p145==0)||(p235==0))))))),TRUE) * !(EG(!((((p50==1)...1063
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t8, t10, t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t26, t27, t28...274
Detected timeout of ITS tools.
[2025-06-03 11:29:34] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:29:34] [INFO ] Applying decomposition
[2025-06-03 11:29:34] [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/graph5065798869024057579.txt' '-o' '/tmp/graph5065798869024057579.bin' '-w' '/tmp/graph5065798869024057579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5065798869024057579.bin' '-l' '-1' '-v' '-w' '/tmp/graph5065798869024057579.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:29:34] [INFO ] Decomposing Gal with order
[2025-06-03 11:29:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:29:34] [INFO ] Removed a total of 285 redundant transitions.
[2025-06-03 11:29:34] [INFO ] Flatten gal took : 33 ms
[2025-06-03 11:29:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 286 labels/synchronizations in 7 ms.
[2025-06-03 11:29:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16639709169699272510.gal : 5 ms
[2025-06-03 11:29:34] [INFO ] Time to serialize properties into /tmp/CTLFireability3228592237360352055.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/CTLFireability16639709169699272510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3228592237360352055.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,7.4505e+34,0.634371,16404,99,155,19656,2688,464,54501,169,15928,0
Converting to forward existential form...Done !
original formula: (EF(EX((((i6.u20.p146==1)&&(i6.u34.p245==1)) * EX(((i1.u19.p145==0)||(i1.u32.p235==0)))))) * EF((((AF((((i1.u6.p50==1)&&(i3.u29.p220==1))...513
=> equivalent forward existential formula: ((([(FwdU((Init * E(TRUE U EX((((i6.u20.p146==1)&&(i6.u34.p245==1)) * EX(((i1.u19.p145==0)||(i1.u32.p235==0)))))...1404
Reverse transition relation is NOT exact ! Due to transitions i0.u31.t15, i0.u31.t16, i0.u31.t18, i1.u32.t11, i1.u32.t12, i1.u32.t14, i2.u28.t27, i2.u28.t2...431
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,1.2885,27156,1,0,39907,6854,3456,100584,1305,33022,67125
FORMULA Raft-PT-07-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 246 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 246 transition count 398
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 242 transition count 394
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 42 place count 218 transition count 370
Iterating global reduction 0 with 24 rules applied. Total rules applied 66 place count 218 transition count 370
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 90 place count 218 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 218 transition count 340
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 212 transition count 334
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 142 place count 178 transition count 300
Iterating global reduction 1 with 34 rules applied. Total rules applied 176 place count 178 transition count 300
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 210 place count 178 transition count 266
Applied a total of 210 rules in 49 ms. Remains 178 /251 variables (removed 73) and now considering 266/408 (removed 142) transitions.
[2025-06-03 11:29:36] [INFO ] Flow matrix only has 242 transitions (discarded 24 similar events)
// Phase 1: matrix 242 rows 178 cols
[2025-06-03 11:29:36] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:29:36] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-03 11:29:36] [INFO ] Flow matrix only has 242 transitions (discarded 24 similar events)
[2025-06-03 11:29:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:29:36] [INFO ] State equation strengthened by 156 read => feed constraints.
[2025-06-03 11:29:36] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:29:36] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2025-06-03 11:29:36] [INFO ] Flow matrix only has 242 transitions (discarded 24 similar events)
[2025-06-03 11:29:36] [INFO ] Invariant cache hit.
[2025-06-03 11:29:36] [INFO ] State equation strengthened by 156 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:29:42] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 241/419 variables, 178/228 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 155/383 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/420 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 384 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 178/178 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 241/419 variables, 178/228 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 155/383 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 265/648 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 1/420 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 649 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 178/178 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in SI_CTL mode, iteration 1 : 178/251 places, 266/408 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60808 ms. Remains : 178/251 places, 266/408 transitions.
[2025-06-03 11:30:36] [INFO ] Flatten gal took : 9 ms
[2025-06-03 11:30:36] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:30:36] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-03 11:30:36] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:30:36] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:30:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5601428047735781243.gal : 3 ms
[2025-06-03 11:30:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8590745326069991897.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/CTLFireability5601428047735781243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8590745326069991897.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,1.33267e+27,3.35209,74060,2,5090,5,367380,6,0,972,303788,0
Converting to forward existential form...Done !
original formula: (AG(AF((((p242==1)||(p205==0))||((p245==0)||(((p48==0)||(p235==0))&&((p51==0)||(p240==0))))))) * AF(((p81==0)||(p240==0))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!((((p242==1)||(p205==0))||((p245==0)||(((p48==0)||(p235==0))&&((p51==0)||(p240==0)))))))...213
Hit Full ! (commute/partial/dont) 140/283/126
(forward)formula 0,0,5.61056,84300,1,0,9,456535,27,2,5315,303788,10
FORMULA Raft-PT-07-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 408/408 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 247 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 247 transition count 400
Applied a total of 8 rules in 6 ms. Remains 247 /251 variables (removed 4) and now considering 400/408 (removed 8) transitions.
[2025-06-03 11:30:42] [INFO ] Flow matrix only has 375 transitions (discarded 25 similar events)
// Phase 1: matrix 375 rows 247 cols
[2025-06-03 11:30:42] [INFO ] Computed 49 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:30:42] [INFO ] Implicit Places using invariants in 314 ms returned []
[2025-06-03 11:30:42] [INFO ] Flow matrix only has 375 transitions (discarded 25 similar events)
[2025-06-03 11:30:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:30:43] [INFO ] State equation strengthened by 214 read => feed constraints.
[2025-06-03 11:30:43] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2025-06-03 11:30:43] [INFO ] Flow matrix only has 375 transitions (discarded 25 similar events)
[2025-06-03 11:30:43] [INFO ] Invariant cache hit.
[2025-06-03 11:30:43] [INFO ] State equation strengthened by 214 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 374/621 variables, 247/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 213/509 constraints. Problems are: Problem set: 0 solved, 399 unsolved
(s163 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/622 variables, and 509 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 247/247 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (OVERLAPS) 374/621 variables, 247/296 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 213/509 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 399/908 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/622 variables, and 908 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 247/247 constraints, ReadFeed: 213/214 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 247/251 places, 400/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61418 ms. Remains : 247/251 places, 400/408 transitions.
[2025-06-03 11:31:43] [INFO ] Flatten gal took : 15 ms
[2025-06-03 11:31:44] [INFO ] Flatten gal took : 15 ms
[2025-06-03 11:31:44] [INFO ] Input system was already deterministic with 400 transitions.
[2025-06-03 11:31:44] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:31:44] [INFO ] Flatten gal took : 16 ms
[2025-06-03 11:31:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8110616560943792588.gal : 3 ms
[2025-06-03 11:31:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6314188359243013760.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/CTLFireability8110616560943792588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6314188359243013760.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,9.31311e+34,14.7472,287820,2,8321,5,1.07817e+06,6,0,1382,1.29029e+06,0
Converting to forward existential form...Done !
original formula: AG(EX((((p233==0)||(p54==0))||(p240==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((p233==0)||(p54==0))||(p240==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t8, t10, t11, t12, t13, t15, t16, t17, t19, t20, t21, t23, t24, t25, t27, t28...279
(forward)formula 0,1,25.2466,343476,1,0,685,2.12736e+06,809,277,9474,1.29029e+06,800
FORMULA Raft-PT-07-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-03 11:32:09] [INFO ] Flatten gal took : 19 ms
[2025-06-03 11:32:09] [INFO ] Flatten gal took : 10 ms
[2025-06-03 11:32:09] [INFO ] Applying decomposition
[2025-06-03 11:32:09] [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/graph11330031751003245274.txt' '-o' '/tmp/graph11330031751003245274.bin' '-w' '/tmp/graph11330031751003245274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11330031751003245274.bin' '-l' '-1' '-v' '-w' '/tmp/graph11330031751003245274.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:32:09] [INFO ] Decomposing Gal with order
[2025-06-03 11:32:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:32:09] [INFO ] Removed a total of 318 redundant transitions.
[2025-06-03 11:32:09] [INFO ] Flatten gal took : 24 ms
[2025-06-03 11:32:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 295 labels/synchronizations in 7 ms.
[2025-06-03 11:32:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6851101941341325970.gal : 7 ms
[2025-06-03 11:32:09] [INFO ] Time to serialize properties into /tmp/CTLFireability8329776169093978210.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/CTLFireability6851101941341325970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8329776169093978210.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.2737e+35,1.20741,30928,118,115,48158,1780,522,144595,140,11388,0
Converting to forward existential form...Done !
original formula: A(((E(((E(((i2.u36.p220==1)&&(i7.u43.p246==1)) U ((i1.u38.p15==1)&&(i0.u35.p215==1))) + !(((i2.u20.p129==1)&&(i2.u36.p220==1)))) * A(((i2...992
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(E(((i0.u14.p95==1)&&(i1.u38.p230==1)) U (EX((i6.u41.p244==1)) * (i3.u37.p225!=1))))))))) *...1439
Reverse transition relation is NOT exact ! Due to transitions i0.u35.t31, i0.u35.t32, i0.u35.t33, i0.u35.t35, i1.u38.t16, i1.u38.t17, i1.u38.t18, i1.u38.t2...491
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,489.135,4049900,1,0,5.35654e+06,7342,1698,2.59417e+07,428,68509,101362
FORMULA Raft-PT-07-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Total runtime 1899948 ms.
BK_STOP 1748950820019
--------------------
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="Raft-PT-07"
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 Raft-PT-07, 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 r170-smll-174889233200042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-07.tgz
mv Raft-PT-07 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 ;